| Publication | Date of Publication | Type |
|---|
| Complexity results for POMSET languages | 2024-04-29 | Paper |
| scientific article; zbMATH DE number 7051297 (Why is no real title available?) | 2019-05-06 | Paper |
The approximation of maximum subgraph problems
Automata, Languages and Programming | 2019-03-29 | Paper |
On the tradeoff between stability and fit
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On the tradeoff between stability and fit
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
A better lower bound on the competitive ratio of the randomized 2-server problem
Information Processing Letters | 2016-05-26 | Paper |
On the hardness of approximating minimization problems
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Efficient probabilistically checkable proofs and applications to approximations
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Algorithms and estimators for summarization of unaggregated data streams
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Efficient stream sampling for variance-optimal estimation of subset sums
SIAM Journal on Computing | 2012-02-11 | Paper |
Priority sampling for estimation of arbitrary subset sums
Journal of the ACM | 2008-12-21 | Paper |
| Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach. | 2008-12-21 | Paper |
Learn More, Sample Less: Control of Volume and Variance in Network Measurement
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Proof verification and the hardness of approximation problems
Journal of the ACM | 2005-01-25 | Paper |
Alternation in interaction
Computational Complexity | 2002-06-02 | Paper |
| scientific article; zbMATH DE number 1256636 (Why is no real title available?) | 2002-01-17 | Paper |
On the hardness of computing the permanent of random matrices
Computational Complexity | 2001-03-15 | Paper |
Paging against a distribution and IP networking
Journal of Computer and System Sciences | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1332658 (Why is no real title available?) | 1999-09-07 | Paper |
Competitive On-Line Algorithms for Distributed Data Management
SIAM Journal on Computing | 1999-02-22 | Paper |
On Bounded Queries and Approximation
SIAM Journal on Computing | 1997-08-03 | Paper |
Random Debaters and the Hardness of Approximating Stochastic Functions
SIAM Journal on Computing | 1997-05-26 | Paper |
| scientific article; zbMATH DE number 1003270 (Why is no real title available?) | 1997-04-23 | Paper |
On the hardness of approximating minimization problems
Journal of the ACM | 1995-02-20 | Paper |
The power of adaptiveness and additional queries in random-self- reductions
Computational Complexity | 1994-09-01 | Paper |
Algebraic methods for interactive proof systems
Journal of the ACM | 1994-08-21 | Paper |
Interactive proof systems and alternating time-space complexity
Theoretical Computer Science | 1993-12-15 | Paper |
Complexity Results for POMSET Languages
SIAM Journal on Discrete Mathematics | 1993-10-14 | Paper |
Non-deterministic exponential time has two-prover interactive protocols
Computational Complexity | 1993-10-10 | Paper |
| scientific article; zbMATH DE number 412256 (Why is no real title available?) | 1993-09-13 | Paper |
On the communication complexity of zero-knowledge proofs
Journal of Cryptology | 1993-08-29 | Paper |
Addendum to: Non-deterministic exponential time has two-prower interactive protocols
Computational Complexity | 1993-08-15 | Paper |
| scientific article; zbMATH DE number 176510 (Why is no real title available?) | 1993-05-18 | Paper |
Practic zero-knowledge proofs: Giving hints and using deficiencies
Journal of Cryptology | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4211485 (Why is no real title available?) | 1990-01-01 | Paper |
