| Publication | Date of Publication | Type |
|---|
| An approximate L^1-difference algorithm for massive data streams | 2026-05-06 | Paper |
| Complexity results for POMSET languages | 2024-04-29 | Paper |
An information-theoretic treatment of random-self-reducibility (extended abstract)
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Approximate privacy: foundations and quantification
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Secure multiparty computation of approximations
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Mechanism design for policy routing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | 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 |
Brief announcement
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Systematizing secure computation for research and decision support
Lecture Notes in Computer Science | 2014-10-14 | Paper |
| Graph distances in the streaming model: the value of space | 2014-10-13 | Paper |
Sharing the cost of muliticast transmissions (preliminary version)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
Mechanism design for policy routing
Distributed Computing | 2013-06-13 | Paper |
A BGP-based mechanism for lowest-cost routing
Distributed Computing | 2013-06-07 | Paper |
Incentive-compatible interdomain routing
Distributed Computing | 2012-02-06 | Paper |
Graph Distances in the Data-Stream Model
SIAM Journal on Computing | 2009-11-06 | Paper |
| scientific article; zbMATH DE number 5604076 (Why is no real title available?) | 2009-09-15 | Paper |
| Distributed algorithmic mechanism design | 2008-09-12 | Paper |
A Model of Onion Routing with Provable Anonymity
Financial Cryptography and Data Security | 2008-03-07 | Paper |
Towards a theory of data entanglement
Theoretical Computer Science | 2008-01-07 | Paper |
Subjective-cost policy routing
Theoretical Computer Science | 2007-06-13 | Paper |
On graph problems in a semi-streaming model
Theoretical Computer Science | 2006-01-09 | Paper |
Computation in a distributed information market
Theoretical Computer Science | 2005-10-26 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2156280 (Why is no real title available?) | 2005-04-15 | Paper |
Computing diameter in the streaming and sliding-window models
Algorithmica | 2005-02-21 | Paper |
Approximation and collusion in multicast cost sharing
Games and Economic Behavior | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2102681 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2102784 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2088322 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2087912 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087921 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1305493 (Why is no real title available?) | 2004-03-09 | Paper |
Hardness results for multicast cost sharing.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1954379 (Why is no real title available?) | 2003-07-28 | Paper |
An Approximate <i>L</i><sup>1</sup> -Difference Algorithm for Massive Data Streams
SIAM Journal on Computing | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1754645 (Why is no real title available?) | 2002-06-12 | Paper |
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences | 2002-02-27 | Paper |
| scientific article; zbMATH DE number 1408381 (Why is no real title available?) | 2000-06-01 | Paper |
| scientific article; zbMATH DE number 1303127 (Why is no real title available?) | 2000-05-18 | Paper |
scientific article; zbMATH DE number 1351076 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-10-20 | Paper |
| scientific article; zbMATH DE number 1332658 (Why is no real title available?) | 1999-09-07 | Paper |
On coherence, random-self-reducibility, and self-correction
Computational Complexity | 1999-01-03 | Paper |
A formal framework for evaluating heuristic programs
Annals of Mathematics and Artificial Intelligence | 1998-10-13 | Paper |
Games, complexity classes, and approximation algorithms.
Documenta Mathematica | 1998-08-05 | Paper |
Games, complexity classes, and approximation algorithms.
Documenta Mathematica | 1998-08-05 | Paper |
Locally random reductions: Improvements and applications
Journal of Cryptology | 1997-05-28 | Paper |
Random Debaters and the Hardness of Approximating Stochastic Functions
SIAM Journal on Computing | 1997-05-26 | Paper |
| scientific article; zbMATH DE number 837790 (Why is no real title available?) | 1996-09-15 | Paper |
| scientific article; zbMATH DE number 867710 (Why is no real title available?) | 1996-04-22 | Paper |
| scientific article; zbMATH DE number 697825 (Why is no real title available?) | 1995-01-26 | Paper |
The power of adaptiveness and additional queries in random-self- reductions
Computational Complexity | 1994-09-01 | Paper |
Universal Traversal Sequences
The American Mathematical Monthly | 1994-07-10 | Paper |
| scientific article; zbMATH DE number 549854 (Why is no real title available?) | 1994-04-12 | Paper |
| scientific article; zbMATH DE number 503260 (Why is no real title available?) | 1994-03-07 | Paper |
| scientific article; zbMATH DE number 503242 (Why is no real title available?) | 1994-03-07 | Paper |
Random-Self-Reducibility of Complete Sets
SIAM Journal on Computing | 1993-12-20 | Paper |
Finding the prime factors of strong direct product graphs in polynomial time
Discrete Mathematics | 1993-10-14 | Paper |
Complexity Results for POMSET Languages
SIAM Journal on Discrete Mathematics | 1993-10-14 | Paper |
| scientific article; zbMATH DE number 176067 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176068 (Why is no real title available?) | 1993-05-18 | Paper |
On being incoherent without being very hard
Computational Complexity | 1993-01-16 | Paper |
Equipartitions of graphs
Discrete Mathematics | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 15884 (Why is no real title available?) | 1992-06-25 | Paper |
On Factorable Extensions and Subgraphs of Prime Graphs
SIAM Journal on Discrete Mathematics | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4191108 (Why is no real title available?) | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4213418 (Why is no real title available?) | 1990-01-01 | Paper |
Secure circuit evaluation. A protocol based on hiding information from an oracle
Journal of Cryptology | 1990-01-01 | Paper |
On hiding information from an oracle
Journal of Computer and System Sciences | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 3952653 (Why is no real title available?) | 1986-01-01 | Paper |
Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
Discrete Applied Mathematics | 1986-01-01 | Paper |
Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism
SIAM Journal on Computing | 1986-01-01 | Paper |
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
Discrete Applied Mathematics | 1985-01-01 | Paper |
