| |
| 2008 | ||
|---|---|---|
| 7 | EE | Edward A. Hirsch, Dmitry Itsykson: An Infinitely-Often One-Way Function Based on an Average-Case Assumption. WoLLIC 2008: 208-217 |
| 6 | EE | Dmitry Itsykson: Structural complexity of AvgBPP. Electronic Colloquium on Computational Complexity (ECCC) 15(073): (2008) |
| 2007 | ||
| 5 | 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 | ||
| 4 | EE | Arist Kojevnikov, Dmitry Itsykson: Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. ICALP (1) 2006: 323-334 |
| 2005 | ||
| 3 | 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 | ||
| 2 | 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 |
| 1 | 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) |
| 1 | Michael Alekhnovich | [1] [2] [3] |
| 2 | Edward A. Hirsch | [1] [2] [3] [5] [7] |
| 3 | Arist Kojevnikov | [4] |