Edward A. Hirsch

Cited by

	All	Since 2020
Citations	1856	262
h-index	22	8
i10-index	29	8

140

105

199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202513 11 44 33 49 115 131 116 118 93 91 108 81 82 70 85 56 53 52 43 73 27 55 59 46 60 36 6

Public access

View all

3 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Evgeny DantsinProfessor of Computer Science, Roosevelt UniversityVerified email at roosevelt.edu
Dmitry ItsyksonSteklov Institute of Mathematics at St. PetersburgVerified email at pdmi.ras.ru
Dima GrigorievDirecteur de recherche, CNRS, LilleVerified email at math.univ-lille1.fr
Arist KojevnikovSenior Development Engineer, OneSpin Solutions GmbHVerified email at logic.pdmi.ras.ru
Uwe SchöningProfessor of Computer Science, Ulm University, retiredVerified email at uni-ulm.de
Jon KleinbergProfessor of Computer Science, Cornell UniversityVerified email at cs.cornell.edu
Christos H PAPADIMITRIOUColumbia UniversityVerified email at columbia.edu
Prabhakar RaghavanGoogleVerified email at google.com
Dmitrii (Dima) PasechnikComputer Science, Northwestern UniversityVerified email at northwestern.edu
Alexander S. KulikovJetBrainsVerified email at logic.pdmi.ras.ru
Sergey NikolenkoSteklov Institute of Mathematics at St. Petersburg, RussiaVerified email at logic.pdmi.ras.ru
Alexander SmalSt. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences; TechnionVerified email at pdmi.ras.ru
Laurent SimonProfessor of Computer Science, Bordeaux University, France (since 2013)Verified email at labri.fr
Daniel Le BerreCRIL-CNRS Université d'ArtoisVerified email at cril.fr
Alexander WolpertProfessor of Computer Science, Roosevelt UniversityVerified email at roosevelt.edu
Peter RossmanithProfessor of Computer Science, RWTH Aachen UniversityVerified email at cs.rwth-aachen.de
Rolf NiedermeierTU BerlinVerified email at tu-berlin.de
Boris KonevProfessor of Computer Science, Liverpool UniversityVerified email at liverpool.ac.uk
Alexander GolovnevGeorgetown UniversityVerified email at cims.nyu.edu
Sergei IvanovResearcher, St. Petersburg Department of Steklov Mathematical InstituteVerified email at pdmi.ras.ru

Edward A. Hirsch

Full Professor, Department of Computer Science, Ariel University

Verified email at ariel.ac.il - Homepage

Proof Complexity SAT Algorithms Computational Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
A deterministic (2-2/(k+1))^n algorithm for k-SAT based on local search E Dantsin, A Goerdt, EA Hirsch, R Kannan, J Kleinberg, C Papadimitriou, ... Theoretical Computer Science 289 (1), 69-83, 2002	277	2002
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination EA Hirsch, A Kojevnikov Annals of Mathematics and Artificial Intelligence 43, 91-111, 2005	170	2005
New worst-case upper bounds for SAT EA Hirsch Journal of Automated Reasoning 24 (4), 397-420, 2000	152	2000
Complexity of Semialgebraic Proofs D Grigoriev, EA Hirsch, D Pasechnik Moscow Mathematical Journal 2 (4), 647-679, 2002	136*	2002
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT J Gramm, EA Hirsch, R Niedermeier, P Rossmanith Discrete Applied Mathematics 130 (2), 139-155, 2003	123	2003
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas M Alekhnovich, EA Hirsch, D Itsykson Journal of Automated Reasoning 35 (1), 51-72, 2005	112	2005
The SAT2002 competition L Simon, D Le Berre, EA Hirsch Annals of Mathematics and Artificial Intelligence 43 (1), 307-342, 2005	91	2005
Worst-case upper bounds E Dantsin, EA Hirsch Handbook of Satisfiability, 669-692, 2021	76*	2021
Two New Upper Bounds for SAT. EA Hirsch SODA, 521-530, 1998	59	1998
SAT local search algorithms: worst-case study EA Hirsch Journal of Automated Reasoning 24 (1), 127-143, 2000	55	2000
A 2 K/4-time algorithm for MAX-2-SAT: Corrected version EA Hirsch	53*	1999
Deterministic algorithms for k-SAT based on covering codes and local search ∗ E Dantsin, A Goerdt, EA Hirsch, U Schöning ICALP-2000, 2000	52	2000
Algorithms for SAT and upper bounds on their complexity MA Vsemirnov, EA Hirsch, EY Dantsin, SV Ivanov Journal of Mathematical Sciences 118 (2), 4948-4962, 2003	51*	2003
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search EA Hirsch, E Dantsin, A Goerdt, U Schoning ICALP-2000, 236, 2000	51*	2000
MAX SAT approximation beyond the limits of polynomial-time approximation E Dantsin, M Gavrilovich, EA Hirsch, B Konev Annals of Pure and Applied Logic 113 (1-3), 81-94, 2001	48*	2001
Algebraic proof systems over formulas D Grigoriev, EA Hirsch Theoretical Computer Science 303 (1), 83-102, 2003	45	2003
Algorithms for SAT Based on Search in Hamming Balls E Dantsin, EA Hirsch, A Wolpert STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science …, 2004	39	2004
Worst-case study of local search for MAX-k-SAT EA Hirsch Discrete Applied Mathematics 130 (2), 173-184, 2003	35*	2003
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography EA Hirsch, D Itsykson, I Monakhov, A Smal Theory of Computing Systems 51 (2), 179-195, 2012	32*	2012
A complete public-key cryptosystem D Grigoriev, EA Hirsch, K Pervyshev Walter de Gruyter GmbH & Co. KG 1 (1), 1-12, 2009	28	2009

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors