Dmitry Itsykson - Citegraph

Author Info

Name	Affiliation	Papers
DMITRY ITSYKSON	Steklov Institute of Mathematics at St. Petersburg, 27, Fontanka, 191023, St. Petersburg, Russia	27
Collaborators	Citations	PageRank
24	33	10.09
Referers	Referees	References
32	124	161

Search Limit

100124

Publications (27 rows)

Collaborators (24 rows)

Referers (32 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
NEAR-OPTIMAL LOWER BOUNDS ON REGULAR RESOLUTION REFUTATIONS OF TSEITIN FORMULAS FOR ALL CONSTANT-DEGREE GRAPHS (vol 30, 13, 2021)	0	0.34	2021
Lower Bounds on OBDD Proofs with Several Orders	0	0.34	2021
On Tseitin Formulas, Read-Once Branching Programs and Treewidth	0	0.34	2021
On Obdd-Based Algorithms And Proof Systems That Dynamically Change The Order Of Variables	0	0.34	2020
Resolution over linear equations modulo two	0	0.34	2020
Bounded-depth Frege complexity of Tseitin formulas for all graphs.	0	0.34	2019
Reordering Rule Makes OBDD Proof Systems Stronger.	0	0.34	2018
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.	0	0.34	2017
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables.	0	0.34	2017
Hard satisfiable formulas for splittings by linear combinations.	0	0.34	2017
Complexity of distributions and average-case hardness.	0	0.34	2016
Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles.	1	0.35	2016
Computational and Proof Complexity of Partial String Avoidability	0	0.34	2016
Heuristic time hierarchies via hierarchies for sampling distributions.	0	0.34	2015
Lower Bounds for Splittings by Linear Combinations.	3	0.44	2014
Tree-like resolution complexity of two planar problems.	0	0.34	2014
Resolution Complexity of Perfect Matching Principles for Sparse Graphs.	1	0.40	2014
Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms	8	0.58	2014
On Fast Heuristic Non-deterministic Algorithms and Short Heuristic Proofs	0	0.34	2014
Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP.	0	0.34	2013
Lower bounds for myopic DPLL algorithms with a cut heuristic	4	0.49	2012
On an optimal randomized acceptor for graph nonisomorphism	0	0.34	2012
Optimal heuristic algorithms for the image of an injective function.	2	0.39	2011
The complexity of inverting explicit Goldreich’s function by DPLL algorithms	3	0.43	2011
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography	3	0.39	2010
On optimal heuristic randomized semidecision procedures, with application to proof complexity	5	0.45	2009
Structural complexity of AvgBPP	3	0.43	2008