Dmitry Itsykson

	2012
18		Edward A. Hirsch, Dmitry Itsykson: On an optimal randomized acceptor for graph nonisomorphism. Inf. Process. Lett. 112(5): 166-171 (2012)
17		Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal: On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography. Theory Comput. Syst. 51(2): 179-195 (2012)
	2011
16		Dmitry Itsykson, Dmitry Sokolov: The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms. CSR 2011: 134-147
15		Dmitry Itsykson, Dmitry Sokolov: Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic. ISAAC 2011: 464-473
14		Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolaenko, Alexander Smal: Optimal heuristic algorithms for the image of an injective function. Electronic Colloquium on Computational Complexity (ECCC) 18: 91 (2011)
	2010
13		Dmitry Itsykson: Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms. CSR 2010: 204-215
12		Edward A. Hirsch, Dmitry Itsykson: On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity. STACS 2010: 453-464
11		Dmitry Itsykson: Structural complexity of AvgBPP. Ann. Pure Appl. Logic 162(3): 213-223 (2010)
10		Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal: On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography. Electronic Colloquium on Computational Complexity (ECCC) 17: 193 (2010)
	2009
9		Dmitry Itsykson: Structural Complexity of AvgBPP. CSR 2009: 155-166
8		Edward A. Hirsch, Dmitry Itsykson: On optimal heuristic randomized semidecision procedures, with application to proof complexity CoRR abs/0908.2707: (2009)
	2008
7		Edward A. Hirsch, Dmitry Itsykson: An Infinitely-Often One-Way Function Based on an Average-Case Assumption. WoLLIC 2008: 208-217
6		Dmitry Itsykson: Structural complexity of AvgBPP. Electronic Colloquium on Computational Complexity (ECCC) 15(073): (2008)
	2007
5		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		Arist Kojevnikov, Dmitry Itsykson: Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. ICALP (1) 2006: 323-334
	2005
3		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		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		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)

Coauthor Index

1	Michael Alekhnovich	[1] [2] [3]
2	Edward A. Hirsch	[1] [2] [3] [5] [7] [8] [10] [12] [14] [17] [18]
3	Arist Kojevnikov	[4]
4	Ivan Monakhov	[10] [17]
5	Valeria Nikolaenko	[14]
6	Alexander Smal	[10] [14] [17]
7	Dmitry Sokolov	[15] [16]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page