| Publication | Date of Publication | Type |
|---|
Brief Announcement: Linearizability: A Typo
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
The ERA Theorem for Safe Memory Reclamation
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7774286 (Why is no real title available?)
| 2023-12-08 | Paper |
Passing messages while sharing memory
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
CBPQ: high performance lock-free priority queue
| 2018-01-11 | Paper |
Computational complexity and knowledge complexity (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Automated verification of practical garbage collectors
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-07-03 | Paper |
The hardness of cache conscious data placement
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Concurrent and resettable zero-knowledge in poly-logarithmic rounds
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Black-box constructions for secure computation
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Space overhead bounds for dynamic memory management with partial compaction
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
Black-box constructions of protocols for secure computation
SIAM Journal on Computing | 2011-07-29 | Paper |
On achieving the ``best of both worlds in secure multiparty computation
SIAM Journal on Computing | 2011-05-17 | Paper |
Automated verification of practical garbage collectors
Logical Methods in Computer Science | 2010-09-21 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Lower and upper bounds on obtaining history independence
Information and Computation | 2006-04-28 | Paper |
The hardness of cache conscious data placement
| 2006-02-06 | Paper |
Lower bounds for concurrent zero knowledge
Combinatorica | 2006-01-26 | Paper |
Linear hash functions
Journal of the ACM | 2005-01-25 | Paper |
scientific article; zbMATH DE number 2081079 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2009953 (Why is no real title available?)
| 2003-11-26 | Paper |
An efficient noninteractive zero-knowledge proof system for NP with general assumptions
Journal of Cryptology | 2003-09-14 | Paper |
scientific article; zbMATH DE number 1956465 (Why is no real title available?)
| 2003-07-30 | Paper |
Uniform generation of NP-witnesses using an NP-oracle
Information and Computation | 2003-01-14 | Paper |
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
SIAM Journal on Computing | 2003-01-05 | Paper |
On the knowledge complexity of \(\mathcal N\mathcal P\)
Combinatorica | 2002-10-30 | Paper |
scientific article; zbMATH DE number 1559562 (Why is no real title available?)
| 2001-02-28 | Paper |
scientific article; zbMATH DE number 1559565 (Why is no real title available?)
| 2001-02-28 | Paper |
CBC MAC for real-time data sources
Journal of Cryptology | 2000-08-08 | Paper |
Quantifying knowledge complexity
Computational Complexity | 1999-09-01 | Paper |
scientific article; zbMATH DE number 1302845 (Why is no real title available?)
| 1999-06-17 | Paper |
Computational Complexity and Knowledge Complexity
SIAM Journal on Computing | 1998-09-20 | Paper |
Is code equivalence easy to decide?
IEEE Transactions on Information Theory | 1998-04-13 | Paper |
The hardness of approximation: Gap location
Computational Complexity | 1994-09-01 | Paper |
The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
Information Processing Letters | 1990-01-01 | Paper |
