| Publication | Date of Publication | Type |
|---|
The complexity of broadcasting in planar and decomposable graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Data transmission in processor networks
Distributed Algorithms | 2023-12-01 | Paper |
The complexity of scheduling problems with communication delays for trees
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
The average case complexity of the parallel prefix problem
Automata, Languages and Programming | 2019-04-29 | Paper |
Malign distributions for average case circuit complexity
STACS 95 | 2017-12-04 | Paper |
On the complexity of worst case and expected time in a circuit
STACS 96 | 2017-11-16 | Paper |
Circuit complexity: from the worst case to the average case
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
| Algorithmic meta theorems for circuit classes of constant and logarithmic depth | 2012-08-23 | Paper |
Privacy in non-private environments
Theory of Computing Systems | 2011-04-01 | Paper |
One-way communication complexity of symmetric Boolean functions.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Preserving Privacy versus Data Retention
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Improving the average delay of sorting
Theoretical Computer Science | 2009-03-20 | Paper |
Susceptible Two-Party Quantum Computations
Lecture Notes in Computer Science | 2009-01-09 | Paper |
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Revealing Additional Information in Two-Party Computations
Lecture Notes in Computer Science | 2008-03-18 | Paper |
Improving the Average Delay of Sorting
Lecture Notes in Computer Science | 2007-11-13 | Paper |
t-Private and Secure Auctions
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Communications in unknown networks: preserving the secret of topology
Theoretical Computer Science | 2007-10-02 | Paper |
Approximating schedules for dynamic process graphs efficiently
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Private computation: \(k\)-connected versus 1-connected networks
Journal of Cryptology | 2006-11-03 | Paper |
Space efficient algorithms for directed series–parallel graphs
Journal of Algorithms | 2006-10-05 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| Privacy in Non-private Environments | 2005-08-12 | Paper |
| scientific article; zbMATH DE number 2086628 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2081107 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081021 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1962807 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1942421 (Why is no real title available?) | 2003-06-30 | Paper |
Malign distributions for average case circuit complexity.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1696537 (Why is no real title available?) | 2002-07-09 | Paper |
| scientific article; zbMATH DE number 1696686 (Why is no real title available?) | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1689046 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1500663 (Why is no real title available?) | 2000-11-07 | Paper |
The complexity of broadcasting in planar and decomposable graphs
Discrete Applied Mathematics | 1998-12-02 | Paper |
Finite-element semi-discretization of linearized compressible and resistive MHD
Journal of Computational Physics | 1986-01-01 | Paper |
