The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Edward A. Hirsch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
    Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:60-68 [Conf]
  2. Edward A. Hirsch, Arist Kojevnikov
    Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:605-609 [Conf]
  3. Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
    Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:84-96 [Conf]
  4. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
    Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:236-247 [Conf]
  5. Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
    Exponential Lower Bound for Static Semi-algebraic Proofs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:257-268 [Conf]
  6. Edward A. Hirsch
    Worst-case Time Bounds for MAX-k-SAT with respect to the Number of Variables Using Local Search. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:69-76 [Conf]
  7. Edward A. Hirsch, Sergey I. Nikolenko
    Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:135-142 [Conf]
  8. Edward A. Hirsch
    Two New Upper Bounds for SAT. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:521-530 [Conf]
  9. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
    Algorithms for SAT Based on Search in Hamming Balls. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:141-151 [Conf]
  10. Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
    Complexity of Semi-algebraic Proofs. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:419-430 [Conf]
  11. Edward A. Hirsch
    A New Algorithm for MAX-2-SAT. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:65-73 [Conf]
  12. Edward A. Hirsch
    Local Search Algorithms for SAT: Worst-Case Analysis. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:246-254 [Conf]
  13. Edward A. Hirsch, Arist Kojevnikov
    UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:91-111 [Journal]
  14. Laurent Simon, Daniel Le Berre, Edward A. Hirsch
    The SAT2002 competition. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:307-342 [Journal]
  15. Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev
    MAX SAT approximation beyond the limits of polynomial-time approximation. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:81-94 [Journal]
  16. Edward A. Hirsch, Arist Kojevnikov
    Several notes on the power of Gomory-Chvátal cuts. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:429-436 [Journal]
  17. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
    Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:139-155 [Journal]
  18. Edward A. Hirsch
    Worst-case study of local search for MAX-k-SAT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:173-184 [Journal]
  19. Edward A. Hirsch
    Worst-case time bounds for MAX-k-SAT w.r.t. the number of variables using local search [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:19, pp:- [Journal]
  20. Dima Grigoriev, Edward A. Hirsch
    Algebraic proof systems over formulas [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:11, pp:- [Journal]
  21. Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov
    Algorithms for SAT and Upper Bounds on Their Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:12, pp:- [Journal]
  22. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
    New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:37, pp:- [Journal]
  23. Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
    Complexity of semi-algebraic proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:103, pp:- [Journal]
  24. Edward A. Hirsch, Arist Kojevnikov
    Several notes on the power of Gomory-Chvatal cuts [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:012, pp:- [Journal]
  25. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
    Algorithms for SAT based on search in Hamming balls [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:072, pp:- [Journal]
  26. Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
    Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:041, pp:- [Journal]
  27. Edward A. Hirsch, Sergey I. Nikolenko
    Simulating Cutting Plane proofs with restricted degree of falsity by Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:006, pp:- [Journal]
  28. Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev
    Time hierarchies for cryptographic function inversion with advice [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:076, pp:- [Journal]
  29. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
    Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:102, pp:- [Journal]
  30. Edward A. Hirsch
    A New Algorithm for MAX-2-SAT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:36, pp:- [Journal]
  31. Edward A. Hirsch
    A Fast Deterministic Algorithm for Formulas That Have Many Satisfying Assignments. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1998, v:6, n:1, pp:59-71 [Journal]
  32. Edward A. Hirsch
    SAT Local Search Algorithms: Worst-Case Study. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2000, v:24, n:1/2, pp:127-143 [Journal]
  33. Edward A. Hirsch
    New Worst-Case Upper Bounds for SAT. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2000, v:24, n:4, pp:397-420 [Journal]
  34. Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
    Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:35, n:1-3, pp:51-72 [Journal]
  35. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:69-83 [Journal]
  36. Dima Grigoriev, Edward A. Hirsch
    Algebraic proof systems over formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:83-102 [Journal]

  37. A Feebly Secure Trapdoor Function. [Citation Graph (, )][DBLP]


  38. On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity. [Citation Graph (, )][DBLP]


  39. Optimal Acceptors and Optimal Proof Systems. [Citation Graph (, )][DBLP]


  40. An Infinitely-Often One-Way Function Based on an Average-Case Assumption. [Citation Graph (, )][DBLP]


  41. On optimal heuristic randomized semidecision procedures, with application to proof complexity [Citation Graph (, )][DBLP]


  42. An infinitely-often one-way function based on an average-case assumption. [Citation Graph (, )][DBLP]


  43. A Complete Public-Key Cryptosystem. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002