| Publication | Date of Publication | Type |
|---|
| Probabilism versus Alternation for Automata | 2023-06-30 | Paper |
| Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations | 2022-11-09 | Paper |
| A comparison of two lower bound methods for communication complexity | 2022-08-18 | Paper |
| On the complexity of approximating the independent set problem | 2022-08-16 | Paper |
| Rounds versus time for the two person pebble game | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365070 | 2017-09-29 | Paper |
| Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds | 2017-06-28 | Paper |
| On the optimality of Bellman-Ford-Moore shortest path algorithm | 2016-04-13 | Paper |
| Cutting planes cannot approximate some integer programs | 2012-09-18 | Paper |
| Fast equality test for straight-line compressed strings | 2012-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5390007 | 2012-04-24 | Paper |
| Min-rank conjecture for log-depth circuits | 2012-01-11 | Paper |
| Yet harder knapsack problems | 2012-01-09 | Paper |
| Ambiguity and communication | 2011-05-23 | Paper |
| On probabilistic pushdown automata | 2010-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5192988 | 2009-08-10 | Paper |
| On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's | 2009-08-07 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes | 2008-10-30 | Paper |
| Regular Expressions and NFAs Without ε-Transitions | 2008-03-19 | Paper |
| Minimizing nfa's and regular expressions | 2007-08-23 | Paper |
| Comparing the size of NFAs with and without \(\epsilon\)-transitions | 2007-07-16 | Paper |
| On the Greedy Superstring Conjecture | 2007-05-22 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| On the power of randomized multicounter machines | 2005-02-22 | Paper |
| On multi-partition communication complexity | 2004-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737913 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449165 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449194 | 2004-02-08 | Paper |
| Nondeterministic Communication with a Limited Number of Advice Bits | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4792910 | 2003-06-26 | Paper |
| On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata | 2003-01-14 | Paper |
| Communication complexity method for measuring nondeterminism in finite automata | 2003-01-14 | Paper |
| On the power of Las Vegas II: Two-way finite automata | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762506 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754144 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938639 | 2000-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699286 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228510 | 1999-10-04 | Paper |
| A comparison of two lower-bound methods for communication complexity | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718233 | 1996-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4839054 | 1996-04-16 | Paper |
| Communication complexity of matrix computation over finite fields | 1995-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4312661 | 1994-11-08 | Paper |
| Two tapes versus one for off-line Turing machines | 1994-05-08 | Paper |
| The Probabilistic Communication Complexity of Set Intersection | 1993-04-01 | Paper |
| On the complexity of approximating the independent set problem | 1992-06-28 | Paper |
| The communication complexity of several problems in matrix computation | 1992-06-28 | Paper |
| On the power of white pebbles | 1992-06-27 | Paper |
| The complexity of matrix transposition on one-tape off-line Turing machines | 1991-01-01 | Paper |
| Rounds versus time for the two person pebble game | 1990-01-01 | Paper |
| On the Performance of the Minimum Degree Ordering for Gaussian Elimination | 1990-01-01 | Paper |
| Checking local optimality in constrained quadratic programming is NP- hard | 1988-01-01 | Paper |
| Parallel computation with threshold functions | 1988-01-01 | Paper |
| Lower bounds on communication complexity | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751009 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751010 | 1986-01-01 | Paper |
| A family of graphs with expensive depth-reduction | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4746797 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907090 | 1981-01-01 | Paper |
