Edward A. Hirsch

2008
42		Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, Anatol Slissenko: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings Springer 2008
41	EE	Edward A. Hirsch, Dmitry Itsykson: An Infinitely-Often One-Way Function Based on an Average-Case Assumption. WoLLIC 2008: 208-217
40	EE	Edward A. Hirsch: Exact Algorithms for General CNF SAT. Encyclopedia of Algorithms 2008
2007
39	EE	Edward A. Hirsch, Dmitry Itsykson: An infinitely-often one-way function based on an average-case assumption. Electronic Colloquium on Computational Complexity (ECCC) 14(117): (2007)
2006
38		Dima Grigoriev, John Harrison, Edward A. Hirsch: Computer Science - Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings Springer 2006
37	EE	Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert: Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. CIAC 2006: 60-68
36	EE	Edward A. Hirsch, Arist Kojevnikov: Several notes on the power of Gomory-Chvátal cuts. Ann. Pure Appl. Logic 141(3): 429-436 (2006)
35	EE	Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev: A Complete Public-Key Cryptosystem. Electronic Colloquium on Computational Complexity (ECCC) 13: (2006)
2005
34	EE	Edward A. Hirsch, Sergey I. Nikolenko: Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. SAT 2005: 135-142
33	EE	Laurent Simon, Daniel Le Berre, Edward A. Hirsch: The SAT2002 competition. Ann. Math. Artif. Intell. 43(1): 307-342 (2005)
32	EE	Edward A. Hirsch, Arist Kojevnikov: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. Ann. Math. Artif. Intell. 43(1): 91-111 (2005)
31	EE	Edward A. Hirsch, Sergey I. Nikolenko: Simulating Cutting Plane proofs with restricted degree of falsity by Resolution Electronic Colloquium on Computational Complexity (ECCC)(006): (2005)
30	EE	Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev: Time hierarchies for cryptographic function inversion with advice Electronic Colloquium on Computational Complexity (ECCC)(076): (2005)
29	EE	Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert: Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms Electronic Colloquium on Computational Complexity (ECCC)(102): (2005)
28	EE	Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson: Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. J. Autom. Reasoning 35(1-3): 51-72 (2005)
2004
27	EE	Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson: Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. ICALP 2004: 84-96
26	EE	Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert: Algorithms for SAT Based on Search in Hamming Balls. STACS 2004: 141-151
25	EE	Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas Electronic Colloquium on Computational Complexity (ECCC)(041): (2004)
2003
24	EE	Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics 130(2): 139-155 (2003)
23	EE	Edward A. Hirsch: Worst-case study of local search for MAX-k-SAT. Discrete Applied Mathematics 130(2): 173-184 (2003)
22	EE	Edward A. Hirsch, Arist Kojevnikov: Several notes on the power of Gomory-Chvatal cuts Electronic Colloquium on Computational Complexity (ECCC) 10(012): (2003)
21	EE	Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert: Algorithms for SAT based on search in Hamming balls Electronic Colloquium on Computational Complexity (ECCC)(072): (2003)
20	EE	Dima Grigoriev, Edward A. Hirsch: Algebraic proof systems over formulas. Theor. Comput. Sci. 1(303): 83-102 (2003)
2002
19	EE	Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik: Exponential Lower Bound for Static Semi-algebraic Proofs. ICALP 2002: 257-268
18	EE	Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik: Complexity of Semi-algebraic Proofs. STACS 2002: 419-430
17		Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning: A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289(1): 69-83 (2002)
2001
16	EE	Edward A. Hirsch, Arist Kojevnikov: Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. CP 2001: 605-609
15		Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev: MAX SAT approximation beyond the limits of polynomial-time approximation. Ann. Pure Appl. Logic 113(1-3): 81-94 (2001)
14	EE	Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik: Complexity of semi-algebraic proofs Electronic Colloquium on Computational Complexity (ECCC)(103): (2001)
13	EE	Dima Grigoriev, Edward A. Hirsch: Algebraic proof systems over formulas Electronic Colloquium on Computational Complexity (ECCC) 8(11): (2001)
12	EE	Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov: Algorithms for SAT and Upper Bounds on Their Complexity Electronic Colloquium on Computational Complexity (ECCC) 8(12): (2001)
2000
11	EE	Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning: Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. ICALP 2000: 236-247
10		Edward A. Hirsch: Worst-case Time Bounds for MAX-k-SAT with respect to the Number of Variables Using Local Search. ICALP Satellite Workshops 2000: 69-76
9	EE	Edward A. Hirsch: A New Algorithm for MAX-2-SAT. STACS 2000: 65-73
8	EE	Edward A. Hirsch: Worst-case time bounds for MAX-k-SAT w.r.t. the number of variables using local search Electronic Colloquium on Computational Complexity (ECCC) 7(19): (2000)
7	EE	Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith: New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT Electronic Colloquium on Computational Complexity (ECCC) 7(37): (2000)
6		Edward A. Hirsch: SAT Local Search Algorithms: Worst-Case Study. J. Autom. Reasoning 24(1/2): 127-143 (2000)
5		Edward A. Hirsch: New Worst-Case Upper Bounds for SAT. J. Autom. Reasoning 24(4): 397-420 (2000)
1999
4	EE	Edward A. Hirsch: A New Algorithm for MAX-2-SAT Electronic Colloquium on Computational Complexity (ECCC) 6(36): (1999)
1998
3		Edward A. Hirsch: Two New Upper Bounds for SAT. SODA 1998: 521-530
2	EE	Edward A. Hirsch: Local Search Algorithms for SAT: Worst-Case Analysis. SWAT 1998: 246-254
1	EE	Edward A. Hirsch: A Fast Deterministic Algorithm for Formulas That Have Many Satisfying Assignments. Logic Journal of the IGPL 6(1): 59-71 (1998)

Coauthor Index

1	Michael Alekhnovich	[25] [27] [28]
2	Daniel Le Berre	[33]
3	Evgeny Dantsin	[11] [12] [15] [17] [21] [26] [29] [37]
4	Michael Gavrilovich	[15]
5	Andreas Goerdt	[11] [17]
6	Jens Gramm	[7] [24]
7	Dima Grigoriev	[13] [14] [18] [19] [20] [30] [35] [38]
8	John Harrison	[38]
9	Dmitry Itsykson	[25] [27] [28] [39] [41]
10	Sergei Ivanov	[12]
11	Ravi Kannan (Ravindran Kannan)	[17]
12	Jon M. Kleinberg	[17]
13	Arist Kojevnikov	[16] [22] [32] [36]
14	Boris Konev	[15]
15	Rolf Niedermeier	[7] [24]
16	Sergey I. Nikolenko	[31] [34]
17	Christos H. Papadimitriou	[17]
18	Dmitrii V. Pasechnik	[14] [18] [19]
19	Konstantin Pervyshev	[30] [35]
20	Prabhakar Raghavan	[17]
21	Alexander A. Razborov	[42]
22	Peter Rossmanith	[7] [24]
23	Uwe Schöning	[11] [17]
24	Alexei L. Semenov	[42]
25	Laurent Simon	[33]
26	Anatol Slissenko	[42]
27	Maxim Vsemirnov	[12]
28	Alexander Wolpert	[21] [26] [29] [37]

Colors in the list of coauthors