| Publication | Date of Publication | Type |
|---|
| Complexity results for POMSET languages | 2024-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633941 | 2019-05-06 | Paper |
| The approximation of maximum subgraph problems | 2019-03-29 | Paper |
| On the Tradeoff between Stability and Fit | 2018-11-05 | Paper |
| Efficient probabilistic checkable proofs and applications to approximation | 2016-09-01 | Paper |
| A better lower bound on the competitive ratio of the randomized 2-server problem | 2016-05-26 | Paper |
| On the hardness of approximating minimization problems | 2015-05-07 | Paper |
| Efficient probabilistically checkable proofs and applications to approximations | 2015-05-07 | Paper |
| Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions | 2015-05-07 | Paper |
| Algorithms and estimators for summarization of unaggregated data streams | 2014-06-10 | Paper |
| Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums | 2012-02-11 | Paper |
| Priority sampling for estimation of arbitrary subset sums | 2008-12-21 | Paper |
| Learn More, Sample Less: Control of Volume and Variance in Network Measurement | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549243 | 2008-12-21 | Paper |
| Proof verification and the hardness of approximation problems | 2005-01-25 | Paper |
| Alternation in interaction | 2002-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230322 | 2002-01-17 | Paper |
| On the hardness of computing the permanent of random matrices | 2001-03-15 | Paper |
| Paging against a distribution and IP networking | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259979 | 1999-09-07 | Paper |
| Competitive On-Line Algorithms for Distributed Data Management | 1999-02-22 | Paper |
| On Bounded Queries and Approximation | 1997-08-03 | Paper |
| Random Debaters and the Hardness of Approximating Stochastic Functions | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128899 | 1997-04-23 | Paper |
| On the hardness of approximating minimization problems | 1995-02-20 | Paper |
| The power of adaptiveness and additional queries in random-self- reductions | 1994-09-01 | Paper |
| Algebraic methods for interactive proof systems | 1994-08-21 | Paper |
| Interactive proof systems and alternating time-space complexity | 1993-12-15 | Paper |
| Complexity Results for POMSET Languages | 1993-10-14 | Paper |
| Non-deterministic exponential time has two-prover interactive protocols | 1993-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3135849 | 1993-09-13 | Paper |
| On the communication complexity of zero-knowledge proofs | 1993-08-29 | Paper |
| Addendum to: Non-deterministic exponential time has two-prower interactive protocols | 1993-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035675 | 1993-05-18 | Paper |
| Practic zero-knowledge proofs: Giving hints and using deficiencies | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3358224 | 1990-01-01 | Paper |
