Dmitry Itsykson
Ben-Gurion University of the Negev(IL)St. Petersburg Department of Steklov Institute of Mathematics(RU)
Publications by Year
Research Areas
Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Formal Methods in Verification, semigroups and automata theory, Logic, Reasoning, and Knowledge
Most-Cited Works
- → Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas(2006)62 cited
- → Lower Bounds for Splittings by Linear Combinations(2014)38 cited
- → Lower bounds on static Lovász-Schrijver calculus proofs for Tseitin tautologies(2007)33 cited
- → Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies(2006)21 cited
- → Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms(2010)14 cited
- → Resolution over linear equations modulo two(2019)10 cited
- → On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity