| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6179336 | 2023-12-16 | Paper |
| Repeated Averages on Graphs | 2022-05-09 | Paper |
| Budgeted Steiner Networks: Three Terminals with Equal Path Weights | 2022-01-27 | Paper |
| On Rearrangement of Items Stored in Stacks | 2021-09-20 | Paper |
| Query Complexity | 2020-03-04 | Paper |
| What do QAOA energies reveal about graphs? | 2019-12-27 | Paper |
| The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry) | 2019-09-12 | Paper |
| Long monotone paths in line arrangements | 2017-09-29 | Paper |
| Streaming algorithms for independent sets in sparse hypergraphs | 2016-10-21 | Paper |
| A new line of attack on the dichotomy conjecture | 2015-12-11 | Paper |
| Impossibility Theorems and the Universal Algebraic Toolkit | 2015-06-01 | Paper |
| The Garden Hose Complexity for the Equality Function | 2015-05-20 | Paper |
| Locality based graph coloring | 2015-05-07 | Paper |
| A new line of attack on the dichotomy conjecture | 2015-02-04 | Paper |
| The DLT priority sampling is essentially optimal | 2014-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921783 | 2014-10-13 | Paper |
| Quantum Query Complexity of State Conversion | 2014-07-30 | Paper |
| A simplified proof of a Lee-Yang type theorem | 2014-07-22 | Paper |
| Moser and tardos meet Lovász | 2014-06-05 | Paper |
| Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions | 2013-09-02 | Paper |
| Streaming and Communication Complexity of Clique Approximation | 2013-08-12 | Paper |
| The Lovász Local Lemma – A Survey | 2013-06-14 | Paper |
| A Sharper Local Lemma with Improved Applications | 2012-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002763 | 2011-05-24 | Paper |
| Streaming Algorithms for Independent Sets | 2010-09-07 | Paper |
| Quantum and classical query complexities of local search are polynomially related | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579465 | 2010-08-06 | Paper |
| Quantum and classical query complexities of local search are polynomially related | 2009-08-31 | Paper |
| Geometric representation of cubic graphs with four directions | 2009-08-14 | Paper |
| Amortized Communication Complexity of Distributions | 2009-07-14 | Paper |
| Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles | 2009-03-04 | Paper |
| On the Variance of Subset Sum Estimation | 2008-09-25 | Paper |
| Quantum Algorithms for the Triangle Problem | 2008-04-22 | Paper |
| Parallel Repetition of the Odd Cycle Game | 2008-04-15 | Paper |
| Product Rules in Semidefinite Programming | 2008-02-26 | Paper |
| The quantum adversary method and classical formula size power bounds | 2007-11-05 | Paper |
| Languages with Bounded Multiparty Communication Complexity | 2007-09-03 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Probabilistic Verification and Non-Approximability | 2005-09-28 | Paper |
| Long monotone paths in line arrangements | 2005-02-11 | Paper |
| Proof verification and the hardness of approximation problems | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044354 | 2004-08-11 | Paper |
| Computing Boolean functions from multiple faulty copies of input bits | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464731 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252418 | 2003-05-04 | Paper |
| Tracking join and self-join sizes in limited storage | 2002-09-12 | Paper |
| Parent-identifying codes | 2002-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230322 | 2002-01-17 | Paper |
| Efficient testing of large graphs | 2001-06-13 | Paper |
| Regular Languages are Testable with a Constant Number of Queries | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252327 | 2000-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938652 | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228511 | 2000-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228450 | 1999-10-04 | Paper |
| The space complexity of approximating the frequency moments | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252436 | 1999-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252414 | 1999-06-17 | Paper |
| Large sets of nearly orthogonal vectors | 1999-05-11 | Paper |
| On Conway's thrackle conjecture | 1998-03-11 | Paper |
| Interactive proofs and the hardness of approximating cliques | 1998-01-21 | Paper |
| Applications of the crossing number | 1996-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763409 | 1995-04-11 | Paper |
| On the degree of Boolean functions as real polynomials | 1995-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287364 | 1994-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314041 | 1994-11-30 | Paper |
| Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC | 1994-09-11 | Paper |
| Lower bounds for on-line graph coloring | 1994-08-29 | Paper |
| Local Expansion of Symmetrical Graphs | 1994-07-14 | Paper |
| Threshold circuits of bounded depth | 1993-06-29 | Paper |
| On the power of two-local random reductions | 1993-05-16 | Paper |
| On packing bipartite graphs | 1993-01-17 | Paper |
| Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010319 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730211 | 1988-01-01 | Paper |
| a(mod p) ≤b(mod p) for all Primes p Implies a = b | 1987-01-01 | Paper |
| The solution of Graham's greatest common divisor problem | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3682729 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686395 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686727 | 1984-01-01 | Paper |
