| Publication | Date of Publication | Type |
|---|
| Dynamic complexity of reachability: how many changes can we handle? | 2026-03-18 | Paper |
| Evaluating monotone circuits on surfaces | 2025-04-15 | Paper |
Planar graph isomorphism is in log-space
ACM Transactions on Computation Theory | 2025-02-21 | Paper |
| Dynamic planar embedding is in DynFO | 2024-12-03 | Paper |
| Dynamic meta-theorems for distance and matching | 2024-06-24 | Paper |
| USSR is in P/poly | 2024-05-29 | Paper |
scientific article; zbMATH DE number 7799594 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
Computability | 2023-09-13 | Paper |
| Depth-First Search in Directed Planar Graphs, Revisited | 2023-08-08 | Paper |
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles
(available as arXiv preprint) | 2023-08-08 | Paper |
Randomized and Symmetric Catalytic Computation
Computer Science – Theory and Applications | 2022-10-19 | Paper |
Depth-first search in directed planar graphs, revisited
Acta Informatica | 2022-08-30 | Paper |
| Planar Maximum Matching: Towards a Parallel Algorithm | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561324 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Dynamic complexity of expansion
(available as arXiv preprint) | 2022-03-21 | Paper |
Reachability and distances under multiple changes
(available as arXiv preprint) | 2021-07-28 | Paper |
| A strategy for dynamic programs: start over and muddle through | 2020-05-27 | Paper |
A strategy for dynamic programs: start over and muddle through
(available as arXiv preprint) | 2019-05-17 | Paper |
Reachability is in DynFO
Journal of the ACM | 2019-02-25 | Paper |
| Space complexity: what makes planar graphs special? | 2018-09-04 | Paper |
| Space-efficient approximation scheme for maximum matching in sparse graphs | 2018-03-21 | Paper |
Graph properties in node-query setting: effect of breaking symmetry
(available as arXiv preprint) | 2018-03-21 | Paper |
Counting Euler tours in undirected bounded treewidth graphs
(available as arXiv preprint) | 2017-07-13 | Paper |
Reachability is in DynFO
Automata, Languages, and Programming | 2015-11-04 | Paper |
Bounded treewidth and space-efficient linear algebra
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Planarity, determinants, permanents, and (unique) matchings
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Low-depth uniform threshold circuits and the bit-complexity of straight line programs
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Dynamic complexity of directed reachability and other problems
Automata, Languages, and Programming | 2014-07-01 | Paper |
Space complexity of optimization problems in planar graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Collapsing exact arithmetic hierarchies
Algorithms and Computation | 2014-02-18 | Paper |
| Tree-width and Logspace: Determinants and Counting Euler Tours | 2013-12-28 | Paper |
Log-space algorithms for paths and matchings in k-trees
Theory of Computing Systems | 2013-12-02 | Paper |
| Deterministically isolating a perfect matching in bipartite planar graphs | 2013-03-19 | Paper |
| Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space | 2012-10-24 | Paper |
| 3-connected Planar Graph Isomorphism is in Log-space | 2012-10-19 | Paper |
| Improved bounds for bipartite matching on surfaces | 2012-08-23 | Paper |
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Computing bits of algebraic numbers
Lecture Notes in Computer Science | 2012-07-16 | Paper |
| Log-space algorithms for paths and matchings in \(k\)-trees | 2012-01-23 | Paper |
| Space complexity of perfect matching in bounded genus bipartite graphs | 2012-01-23 | Paper |
Planarity testing revisited
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Some tractable win-lose games
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Deterministically isolating a perfect matching in bipartite planar graphs
Theory of Computing Systems | 2010-10-06 | Paper |
Planar and grid graph reachability problems
Theory of Computing Systems | 2009-10-19 | Paper |
Planarity, Determinants, Permanents, and (Unique) Matchings
Computer Science – Theory and Applications | 2008-06-03 | Paper |
One-Input-Face MPCVP Is Hard for L, But in LogDCFL
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Characterizing small depth and small space classes by operators of higher types
Chicago Journal of Theoretical Computer Science | 2001-05-15 | Paper |
On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
Journal of Computer and System Sciences | 2001-03-12 | Paper |
| scientific article; zbMATH DE number 1405642 (Why is no real title available?) | 2000-04-25 | Paper |
