| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky |
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky |
Untangling planar graphs from a specified vertex position - Hard cases. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky |
Interval Graphs: Canonical Representations in Logspace. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Ravsky, Oleg Verbitsky |
On Collinear Sets in Straight-Line Drawings. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky |
Interval Graphs: Canonical Representation in Logspace. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oleg Pikhurko, Oleg Verbitsky |
Logical complexity of graphs: a survey |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky |
Interval Graphs: Canonical Representation in Logspace. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Verbitsky |
On the obfuscation complexity of planar graphs. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Verbitsky |
Zero-Knowledge Proofs of the Conjugacy for Permutation Groups |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky |
Obfuscated Drawings of Planar Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Oleg Verbitsky |
On the Double Coset Membership Problem for Permutation Groups |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Alexander Ravsky, Oleg Verbitsky |
On collinear sets in straight line drawings |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Oleg Verbitsky |
From Invariants to Canonization in Parallel. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Joel Spencer, Oleg Verbitsky |
Decomposable graphs and definitions with no quantifier alternation. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky |
First-Order Definability of Trees and Sparse Random Graphs. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Verbitsky |
On the Obfuscation Complexity of Planar Graphs |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Frank Harary, Wolfgang Slany, Oleg Verbitsky |
On the Computational Complexity of the Forcing Chromatic Number. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Verbitsky |
Planar Graphs: Logical Complexity and Parallel Isomorphism Tests. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Joel Spencer, Oleg Verbitsky |
Succinct definitions in the first order theory of graphs. |
Ann. Pure Appl. Logic |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Oleg Verbitsky |
Testing Graph Isomorphism in Parallel by Playing a Game |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Oleg Verbitsky |
From Invariants to Canonization in Parallel |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Oleg Verbitsky |
Planar Graphs: Logical Complexity and Parallel Isomorphism Tests |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Oleg Pikhurko, Helmut Veith, Oleg Verbitsky |
The first order definability of graphs: Upper bounds for quantifier depth. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Oleg Verbitsky |
Testing Graph Isomorphism in Parallel by Playing a Game. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Verbitsky |
The first order definability of graphs with separators via the Ehrenfeucht game. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Oleg Verbitsky |
Descriptive complexity of finite structures: Saving the quantifier rank. |
J. Symb. Log. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky |
How complex are random graphs in first order logic? |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Harary, Wolfgang Slany, Oleg Verbitsky |
On the Computational Complexity of the Forcing Chromatic Number. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Harary, Wolfgang Slany, Oleg Verbitsky |
On the lengths of symmetry breaking-preserving games on graphs. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Harary, Wolfgang Slany, Oleg Verbitsky |
On Computational Complexity of the Forcing Chromatic Number |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Uriel Feige, Oleg Verbitsky |
Error Reduction by Parallel Repetition - A Negative Result. |
Combinatorica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Verbitsky |
Remarks on a Query-Based Variant of the Parallel Repetition Theorem. |
Int. J. Found. Comput. Sci. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Frank Harary, Wolfgang Slany, Oleg Verbitsky |
A Symmetric Strategy in Graph Avoidance Games |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin |
Arthur-Merlin Games in Boolean Decision Trees. |
J. Comput. Syst. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin |
Arthur-Merlin Games in Boolean Decision Trees. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin |
Arthur-Merlin Games in Boolean Decision Trees |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Oleg Verbitsky |
Towards the Parallel Repetition Conjecture. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Oleg Verbitsky |
Error Reduction by Parallel Repetition - a Negative Result. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
error reduction, Interactive proofs, parallel repetition, forbidden subgraph |
| 1 | Oleg Verbitsky |
The Parallel Repetition Conjecture for Trees is True |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Oleg Verbitsky |
On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE. |
Combinatorics, Probability & Computing |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Verbitsky |
Towards the Parallel Repetition Conjecture. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")