| Publication | Date of Publication | Type |
|---|
| Complexity results for POMSET languages | 2024-04-29 | Paper |
| An information-theoretic treatment of random-self-reducibility | 2022-11-09 | Paper |
| Approximate Privacy | 2018-10-30 | Paper |
| Secure multiparty computation of approximations | 2015-09-02 | Paper |
| Mechanism design for policy routing | 2015-08-03 | Paper |
| Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions | 2015-05-07 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Systematizing Secure Computation for Research and Decision Support | 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) | 2014-09-26 | Paper |
| A BGP-based mechanism for lowest-cost routing | 2014-07-25 | Paper |
| Mechanism design for policy routing | 2013-06-13 | Paper |
| A BGP-based mechanism for lowest-cost routing | 2013-06-07 | Paper |
| Incentive-compatible interdomain routing | 2012-02-06 | Paper |
| Graph Distances in the Data-Stream Model | 2009-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395958 | 2009-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524723 | 2008-09-12 | Paper |
| A Model of Onion Routing with Provable Anonymity | 2008-03-07 | Paper |
| Towards a theory of data entanglement | 2008-01-07 | Paper |
| Subjective-cost policy routing | 2007-06-13 | Paper |
| On graph problems in a semi-streaming model | 2006-01-09 | Paper |
| Computation in a distributed information market | 2005-10-26 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668738 | 2005-04-15 | Paper |
| Computing diameter in the streaming and sliding-window models | 2005-02-21 | Paper |
| Approximation and collusion in multicast cost sharing | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817518 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818872 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739515 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738939 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738953 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252382 | 2004-03-09 | Paper |
| Hardness results for multicast cost sharing. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415250 | 2003-07-28 | Paper |
| An Approximate L1 -Difference Algorithm for Massive Data Streams | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535073 | 2002-06-12 | Paper |
| Sharing the cost of multicast transmissions | 2002-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941196 | 2000-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249642 | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267798 | 1999-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259979 | 1999-09-07 | Paper |
| On coherence, random-self-reducibility, and self-correction | 1999-01-03 | Paper |
| A formal framework for evaluating heuristic programs | 1998-10-13 | Paper |
| Games, complexity classes, and approximation algorithms. | 1998-08-05 | Paper |
| Locally random reductions: Improvements and applications | 1997-05-28 | Paper |
| Random Debaters and the Hardness of Approximating Stochastic Functions | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863699 | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873827 | 1996-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314042 | 1995-01-26 | Paper |
| The power of adaptiveness and additional queries in random-self- reductions | 1994-09-01 | Paper |
| Universal Traversal Sequences | 1994-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287358 | 1994-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279585 | 1994-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279564 | 1994-03-07 | Paper |
| Random-Self-Reducibility of Complete Sets | 1993-12-20 | Paper |
| Finding the prime factors of strong direct product graphs in polynomial time | 1993-10-14 | Paper |
| Complexity Results for POMSET Languages | 1993-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035167 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035168 | 1993-05-18 | Paper |
| On being incoherent without being very hard | 1993-01-16 | Paper |
| Equipartitions of graphs | 1992-06-28 | Paper |
| On Factorable Extensions and Subgraphs of Prime Graphs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972530 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210168 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359734 | 1990-01-01 | Paper |
| Secure circuit evaluation. A protocol based on hiding information from an oracle | 1990-01-01 | Paper |
| On hiding information from an oracle | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3722414 | 1986-01-01 | Paper |
| Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time | 1986-01-01 | Paper |
| Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism | 1986-01-01 | Paper |
| A polynomial time algorithm for finding the prime factors of Cartesian- product graphs | 1985-01-01 | Paper |
