dblp.uni-trier.dewww.uni-trier.de

Edward A. Hirsch Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
45EEEdward A. Hirsch, Sergey I. Nikolenko: A Feebly Secure Trapdoor Function. CSR 2009: 129-142
44EEEvgeny Dantsin, Edward A. Hirsch: Worst-Case Upper Bounds. Handbook of Satisfiability 2009: 403-424
43EEEdward A. Hirsch, Dmitry Itsykson: On optimal heuristic randomized semidecision procedures, with application to proof complexity CoRR abs/0908.2707: (2009)
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
41EEEdward A. Hirsch, Dmitry Itsykson: An Infinitely-Often One-Way Function Based on an Average-Case Assumption. WoLLIC 2008: 208-217
40EEEdward A. Hirsch: Exact Algorithms for General CNF SAT. Encyclopedia of Algorithms 2008
2007
39EEEdward 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
37EEEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert: Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. CIAC 2006: 60-68
36EEEdward A. Hirsch, Arist Kojevnikov: Several notes on the power of Gomory-Chvátal cuts. Ann. Pure Appl. Logic 141(3): 429-436 (2006)
35EEDima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev: A Complete Public-Key Cryptosystem. Electronic Colloquium on Computational Complexity (ECCC) 13: (2006)
2005
34EEEdward A. Hirsch, Sergey I. Nikolenko: Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. SAT 2005: 135-142
33EELaurent Simon, Daniel Le Berre, Edward A. Hirsch: The SAT2002 competition. Ann. Math. Artif. Intell. 43(1): 307-342 (2005)
32EEEdward 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)
31EEEdward A. Hirsch, Sergey I. Nikolenko: Simulating Cutting Plane proofs with restricted degree of falsity by Resolution Electronic Colloquium on Computational Complexity (ECCC)(006): (2005)
30EEDima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev: Time hierarchies for cryptographic function inversion with advice Electronic Colloquium on Computational Complexity (ECCC)(076): (2005)
29EEEvgeny 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)
28EEMichael 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
27EEMichael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson: Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. ICALP 2004: 84-96
26EEEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert: Algorithms for SAT Based on Search in Hamming Balls. STACS 2004: 141-151
25EEMichael 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
24EEJens 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)
23EEEdward A. Hirsch: Worst-case study of local search for MAX-k-SAT. Discrete Applied Mathematics 130(2): 173-184 (2003)
22EEEdward A. Hirsch, Arist Kojevnikov: Several notes on the power of Gomory-Chvatal cuts Electronic Colloquium on Computational Complexity (ECCC) 10(012): (2003)
21EEEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert: Algorithms for SAT based on search in Hamming balls Electronic Colloquium on Computational Complexity (ECCC)(072): (2003)
20EEDima Grigoriev, Edward A. Hirsch: Algebraic proof systems over formulas. Theor. Comput. Sci. 1(303): 83-102 (2003)
2002
19EEDima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik: Exponential Lower Bound for Static Semi-algebraic Proofs. ICALP 2002: 257-268
18EEDima 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
16EEEdward 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)
14EEDima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik: Complexity of semi-algebraic proofs Electronic Colloquium on Computational Complexity (ECCC)(103): (2001)
13EEDima Grigoriev, Edward A. Hirsch: Algebraic proof systems over formulas Electronic Colloquium on Computational Complexity (ECCC) 8(11): (2001)
12EEEvgeny 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
11EEEvgeny 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
9EEEdward A. Hirsch: A New Algorithm for MAX-2-SAT. STACS 2000: 65-73
8EEEdward 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)
7EEJens 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
4EEEdward 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
2EEEdward A. Hirsch: Local Search Algorithms for SAT: Worst-Case Analysis. SWAT 1998: 246-254
1EEEdward 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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)