| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6187044 | 2024-02-05 | Paper |
| The randomized complexity of maintaining the minimum | 2022-12-09 | Paper |
| Improved approximations of independent sets in bounded-degree graphs | 2022-12-09 | Paper |
| Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes | 2022-07-18 | Paper |
| Bounds on the Zero-Error List-Decoding Capacity of the q/(q – 1) Channel | 2022-02-17 | Paper |
| Distance-Preserving Subgraphs of Interval Graphs | 2020-05-27 | Paper |
| An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel | 2020-01-28 | Paper |
| Minimizing branching vertices in distance-preserving subgraphs | 2019-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633849 | 2019-05-06 | Paper |
| Separation Between Deterministic and Randomized Query Complexity | 2018-09-18 | Paper |
| The Zero-Error Randomized Query Complexity of the Pointer Function | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636637 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598278 | 2017-12-19 | Paper |
| Tight bounds for communication-assisted agreement distillation | 2017-10-10 | Paper |
| Set membership with a few bit probes | 2017-10-05 | Paper |
| The Communication Complexity of Correlation | 2017-07-27 | Paper |
| Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes | 2017-07-27 | Paper |
| The communication complexity of pointer chasing: applications of entropy and sampling | 2016-09-29 | Paper |
| Greed is good: approximating independent sets in sparse and bounded-degree graphs | 2016-09-01 | Paper |
| A property of quantum relative entropy with an application to privacy in quantum communication | 2015-11-11 | Paper |
| Online set packing and competitive scheduling of multi-part tasks | 2015-03-02 | Paper |
| Complete partitions of graphs | 2014-10-13 | Paper |
| Expansion properties of (secure) wireless networks | 2014-09-09 | Paper |
| More on a problem of Zarankiewicz | 2013-03-21 | Paper |
| Online set packing | 2012-11-29 | Paper |
| Streaming algorithms for 2-coloring uniform hypergraphs | 2011-08-12 | Paper |
| Data structures for storing small sets in the bitprobe model | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579504 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579444 | 2010-08-06 | Paper |
| Random measurement bases, quantum state distinction and applications to the hidden subgroup problem | 2009-08-31 | Paper |
| Gap Amplification in PCPs Using Lazy Random Walks | 2009-03-12 | Paper |
| Complete partitions of graphs | 2008-10-21 | Paper |
| Zero Error List-Decoding Capacity of the q/(q–1) Channel | 2008-04-17 | Paper |
| Tradeoffs in Depth-Two Superconcentrators | 2008-03-19 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| On Dinur’s proof of the PCP theorem | 2007-03-21 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| On converting CNF to DNF | 2005-12-29 | Paper |
| Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons | 2005-12-07 | Paper |
| Lower bounds for adaptive locally decodable codes | 2005-11-15 | Paper |
| Essential covers of the cube by hyperplanes | 2005-04-06 | Paper |
| Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471362 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449184 | 2004-02-08 | Paper |
| A note on scrambling permutations | 2003-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415257 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796182 | 2003-03-02 | Paper |
| A tradeoff between search and update in dictionaries | 2002-07-25 | Paper |
| The communication complexity of pointer chasing | 2002-07-10 | Paper |
| Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268459 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228438 | 1999-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228451 | 1999-05-18 | Paper |
| The complexity of parallel prefix problems on small domains | 1998-06-02 | Paper |
| Greed is good: Approximating independent sets in sparse and bounded-degree graphs | 1997-07-20 | Paper |
| Better lower bounds for monotone threshold formulas | 1997-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129921 | 1997-04-22 | Paper |
| Pi-sigma-pi threshold formulas | 1996-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4698692 | 1995-08-06 | Paper |
| \(\Sigma\Pi\Sigma\) threshold formulas | 1994-12-11 | Paper |
| Directed monotone contact networks for threshold functions | 1994-06-15 | Paper |
| Improved bounds for covering complete uniform hypergraphs | 1992-09-26 | Paper |
