Edward Hirsch

1.5k total citations
62 papers, 518 citations indexed

About

Edward Hirsch is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Edward Hirsch has authored 62 papers receiving a total of 518 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 16 papers in Computer Networks and Communications and 16 papers in Artificial Intelligence. Recurrent topics in Edward Hirsch's work include Constraint Satisfaction and Optimization (15 papers), Complexity and Algorithms in Graphs (12 papers) and Formal Methods in Verification (11 papers). Edward Hirsch is often cited by papers focused on Constraint Satisfaction and Optimization (15 papers), Complexity and Algorithms in Graphs (12 papers) and Formal Methods in Verification (11 papers). Edward Hirsch collaborates with scholars based in Russia, United States and France. Edward Hirsch's co-authors include Arist Kojevnikov, Evgeny Dantsin, Rolf Niedermeier, Jens Gramm, Peter Rossmanith, Laurent Simon, Daniel Le Berre, Uwe Schöning, Christos H. Papadimitriou and Ravi Kannan and has published in prestigious journals such as Annals of Emergency Medicine, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Edward Hirsch

48 papers receiving 421 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Edward Hirsch Russia	14	361	244	205	31	29	62	518
Yaacov Choueka Israel	13	168 0.5×	76 0.3×	390 1.9×	10 0.3×	28 1.0×	28	518
Fabio Gadducci Italy	12	230 0.6×	109 0.4×	335 1.6×	2 0.1×	82 2.8×	65	453
Vincent Quint France	11	38 0.1×	107 0.4×	129 0.6×	32 1.0×	31 1.1×	31	299
Aarne Ranta Sweden	13	299 0.8×	36 0.1×	930 4.5×	5 0.2×	46 1.6×	75	1.0k
Phillip J. Windley United States	8	70 0.2×	53 0.2×	111 0.5×	2 0.1×	26 0.9×	24	239
Jonathan Robie United States	7	22 0.1×	223 0.9×	193 0.9×	17 0.5×	11 0.4×	18	307
A. P. Ershov Russia	10	165 0.5×	64 0.3×	269 1.3×	2 0.1×	64 2.2×	38	404
Francesca Levi Italy	9	102 0.3×	121 0.5×	132 0.6×		20 0.7×	26	302
M. N. Ellingham United States	13	359 1.0×	77 0.3×	23 0.1×	4 0.1×		57	501
William D. Young United States	12	134 0.4×	175 0.7×	347 1.7×		42 1.4×	39	444

Countries citing papers authored by Edward Hirsch

Since Specialization

Citations

This map shows the geographic impact of Edward Hirsch's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Edward Hirsch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Edward Hirsch more than expected).

Fields of papers citing papers by Edward Hirsch

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Edward Hirsch. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Edward Hirsch. The network helps show where Edward Hirsch may publish in the future.

Co-authorship network of co-authors of Edward Hirsch

This figure shows the co-authorship network connecting the top 25 collaborators of Edward Hirsch. A scholar is included among the top collaborators of Edward Hirsch based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Edward Hirsch. Edward Hirsch is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Grigoriev, Dima, et al.. (2024). Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative?. SIAM Journal on Computing. 53(3). 648–700.

Filmus, Yuval, et al.. (2023). Irreducible Subcube Partitions. The Electronic Journal of Combinatorics. 30(3). 4 indexed citations

Golovnev, Alexander, Edward Hirsch, & Alexander S. Kulikov. (2015). A better-than-3n lower bound for the circuit complexity of an explicit function.. Electronic colloquium on computational complexity. 22. 166. 4 indexed citations

Hirsch, Edward, et al.. (2011). Optimal heuristic algorithms for the image of an injective function.. Electronic colloquium on computational complexity. 18. 91.

Hirsch, Edward, et al.. (2008). The making of a sonnet : a Norton anthology.

Hirsch, Edward & Sergey Nikolenko. (2008). A FEEBLY TRAPDOOR FUNCTION. American Journal of Nephrology. 39(6). 484–90. 1 indexed citations

Grigoriev, Dima, John Harrison, & Edward Hirsch. (2006). Computer science -- theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings. Springer eBooks. 2 indexed citations

Hirsch, Edward & Arist Kojevnikov. (2006). Several notes on the power of Gomory–Chvátal cuts. Annals of Pure and Applied Logic. 141(3). 429–436. 2 indexed citations

Dantsin, Evgeny, et al.. (2005). Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. Electronic colloquium on computational complexity. 1 indexed citations

10.

Hirsch, Edward & Arist Kojevnikov. (2003). Several notes on the power of Gomory-Chvatal cuts. Electronic colloquium on computational complexity. 10. 4 indexed citations

11.

Gramm, Jens, Edward Hirsch, Rolf Niedermeier, & Peter Rossmanith. (2003). Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics. 130(2). 139–155. 41 indexed citations

12.

Dantsin, Evgeny, Andreas Goerdt, Edward Hirsch, et al.. (2002). A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search. Theoretical Computer Science. 289(1). 69–83. 78 indexed citations

13.

Dantsin, Evgeny, et al.. (2001). Algorithms for SAT and Upper Bounds on Their Complexity. Electronic colloquium on computational complexity. 8. 11 indexed citations

14.

Dantsin, Evgeny, et al.. (2001). MAX SAT approximation beyond the limits of polynomial-time approximation. Annals of Pure and Applied Logic. 113(1-3). 81–94. 16 indexed citations

15.

Hirsch, Edward. (2000). Worst-case time bounds for MAX-k-SAT w.r.t. the number of variables using local search. Electronic colloquium on computational complexity. 7. 2 indexed citations

16.

Gramm, Jens, Edward Hirsch, Rolf Niedermeier, & Peter Rossmanith. (2000). New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT. Electronic colloquium on computational complexity. 7(2). 358–64. 12 indexed citations

17.

Hirsch, Edward. (1999). Responsive Reading. University of Michigan Press eBooks. 1 indexed citations

18.

Hirsch, Edward. (1998). Two new upper bounds for SAT. Symposium on Discrete Algorithms. 521–530. 20 indexed citations

19.

Dantsin, Evgeny, et al.. (1998). APPROXIMATION ALGORITHMS FOR MAX SAT: A BETTER PERFORMANCE RATIO AT THE COST OF A LONGER RUNNING TIME. 276(5318). 1482–4. 7 indexed citations

20.

Hirsch, Edward. (1983). A War between the Orders: Yeats's Fiction and the Transcendental Moment. NOVEL A Forum on Fiction. 17(1). 52–52.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact