| Publication | Date of Publication | Type |
|---|
The complexity of mean payoff games
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Haystack hunting hints and locker room communication
Random Structures \& Algorithms | 2023-10-23 | Paper |
Progress in selection
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Longest common subsequences
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Bounded Hanoi
The American Mathematical Monthly | 2022-04-22 | Paper |
More about Exact Slow $k$-Nim
| 2022-03-24 | Paper |
Globe-hopping
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-10-29 | Paper |
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Looking for MUM and DAD: text-text comparisons do help
Lecture Notes in Computer Science | 2017-01-19 | Paper |
Compact grid layouts of multi-level networks
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
scientific article; zbMATH DE number 6472637 (Why is no real title available?)
| 2015-08-14 | Paper |
Maximum overhang
American Mathematical Monthly | 2012-01-01 | Paper |
False-name manipulations in weighted voting games
Journal of Artificial Intelligence Research | 2011-01-21 | Paper |
A deterministic subexponential algorithm for solving parity games
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Overhang
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Maximum overhang
| 2010-08-06 | Paper |
The complexity of choosing an H -colouring (nearly) uniformly at random
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
A Deterministic Subexponential Algorithm for Solving Parity Games
SIAM Journal on Computing | 2009-08-20 | Paper |
Power Indices in Spanning Connectivity Games
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
The Multi-Commodity Source Location Problems and the Price of Greed
Journal of Graph Algorithms and Applications | 2009-05-19 | Paper |
On Counting Homomorphisms to Directed Acyclic Graphs
Automata, Languages and Programming | 2009-03-12 | Paper |
Overhang
| 2009-02-26 | Paper |
On counting homomorphisms to directed acyclic graphs
Journal of the ACM | 2008-12-21 | Paper |
Polynomial-Time Construction of Linear Network Coding
Automata, Languages and Programming | 2008-08-28 | Paper |
Multi-commodity Source Location Problems and Price of Greed
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2
LMS Journal of Computation and Mathematics | 2007-04-04 | Paper |
Contention resolution with constant expected delay
Journal of the ACM | 2006-09-12 | Paper |
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
SIAM Journal on Computing | 2006-06-01 | Paper |
A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
SIAM Journal on Computing | 2005-02-21 | Paper |
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2102786 (Why is no real title available?)
| 2004-09-24 | Paper |
Random sampling of 3‐colorings in ℤ2
Random Structures \& Algorithms | 2004-08-06 | Paper |
The computational complexity of two‐state spin systems
Random Structures \& Algorithms | 2003-11-10 | Paper |
A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
Theoretical Computer Science | 2003-07-30 | Paper |
The complexity of gene placement
Journal of Algorithms | 2002-07-08 | Paper |
scientific article; zbMATH DE number 1759430 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1256659 (Why is no real title available?)
| 2002-01-17 | Paper |
scientific article; zbMATH DE number 1670868 (Why is no real title available?)
| 2001-12-09 | Paper |
scientific article; zbMATH DE number 1670864 (Why is no real title available?)
| 2001-11-11 | Paper |
Better approximation guarantees for job-shop scheduling
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1445304 (Why is no real title available?)
| 2000-05-10 | Paper |
scientific article; zbMATH DE number 1261812 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1414290 (Why is no real title available?)
| 2000-03-16 | Paper |
scientific article; zbMATH DE number 1305428 (Why is no real title available?)
| 1999-09-15 | Paper |
Consistency of Natural Relations on Sets
Combinatorics, Probability and Computing | 1999-09-05 | Paper |
scientific article; zbMATH DE number 1306900 (Why is no real title available?)
| 1999-08-31 | Paper |
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
SIAM Journal on Computing | 1999-02-22 | Paper |
The asymptotic complexity of merging networks
Journal of the ACM | 1998-01-19 | Paper |
Lower bounds for monotone span programs
Computational Complexity | 1997-09-07 | Paper |
The complexity of mean payoff games on graphs
Theoretical Computer Science | 1997-02-27 | Paper |
On the complexity of string folding
Discrete Applied Mathematics | 1997-02-25 | Paper |
scientific article; zbMATH DE number 871934 (Why is no real title available?)
| 1997-01-05 | Paper |
Upper bounds for the expected length of a longest common subsequence of two binary sequences
Random Structures \& Algorithms | 1996-05-28 | Paper |
\(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice
Computational Complexity | 1996-05-27 | Paper |
Tighter Lower Bounds on the Exact Complexity of String Matching
SIAM Journal on Computing | 1995-03-27 | Paper |
