Andreas Jakoby

Jannis Leuther

Stefan Lucks

Proceedings of the IEEE Security and Privacy Workshops, 2021

2017

Critical Graphs for Minimum Vertex Cover.

[BibT_eX]

[DOI]

CoRR, 2017

Cyclone codes.

[BibT_eX]

[DOI]

Sven Köhler

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2011

Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth.

[BibT_eX]

[DOI]

Michael Elberfeld

Electron. Colloquium Comput. Complex., 2011

A cryptographically t-private auction system.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2011

2010

Logspace Versions of the Theorems of Bodlaender and Courcelle.

[BibT_eX]

[DOI]

Michael Elberfeld

Electron. Colloquium Comput. Complex., 2010

2009

Improving the average delay of sorting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Preserving Privacy versus Data Retention.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

A Cryptographically t-Private Auction System.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Network and System Security, 2009

2008

t-Private and t-Secure Auctions.

[BibT_eX]

[DOI]

Peer Stechert

J. Comput. Sci. Technol., 2008

Susceptible Two-Party Quantum Computations.

[BibT_eX]

[DOI]

Aleksander Madry

Proceedings of the Information Theoretic Security, Third International Conference, 2008

2007

Communications in unknown networks: Preserving the secret of topology.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

t -Private and Secure Auctions.

[BibT_eX]

[DOI]

Peer Stechert

Proceedings of the Theory and Applications of Models of Computation, 2007

Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Private Computation: k-Connected versus 1-Connected Networks.

[BibT_eX]

[DOI]

J. Cryptol., 2006

Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.

[BibT_eX]

[DOI]

Aleksander Madry

Electron. Colloquium Comput. Complex., 2006

Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space.

[BibT_eX]

[DOI]

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2005

Revealing Additional Information in Two-Party Computations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Approximating schedules for dynamic process graphs efficiently.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

2003

One-Way Communication Complexity of Symmetric Boolean Functions

[BibT_eX]

[DOI]

Jan Arpe

Electron. Colloquium Comput. Complex., 2003

Privacy in Non-Private Environments

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Private Computations in Networks: Topology versus Randomness.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

Space Efficient Algorithms for Directed Series-Parallel Graphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2002

Paths Problems in Symmetric Logarithmic Space.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Dynamic Process Graphs and the Complexity of Scheduling

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

Space Efficient Algorithms for Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

The Complexity of Some Basic Problems for Dynamic Process Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Efficient Addition on Field Programmable Gate Arrays.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000

The Expressive Power and Complexity of Dynamic Process Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Short Headers Suffice for Communication in a DAG with Link Failures.

[BibT_eX]

[DOI]

Faith E. Fich

Proceedings of the Distributed Computing, 14th International Conference, 2000

Average Case Complexity of Unbounded Fanin Circuits.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999

Malign Distributions for Average Case Circuit Complexity.

[BibT_eX]

[DOI]

Inf. Comput., 1999

Scheduling Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 99, 1999

The Average Time Complexity to Compute Prefix Functions in Processor Networks.

[BibT_eX]

[DOI]

Proceedings of the STACS 99, 1999

The Non-Recursive Power of Erroneous Computation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998

The complexity of broadcasting in planar and decomposable graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Die Komplexität von Präfixfunktionen bezüglich ihres mittleren Zeitverhaltens.

[BibT_eX]

[DOI]

Berichte aus der Informatik, Shaker, ISBN: 978-3-8265-3923-7, 1998

1996

On the Complexity of Worst Case and Expected Time in a Circuit.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

1995

Data Transmission in Processor Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

1994

Circuit complexity: from the worst case to the average case.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

The Average Case Complexity of the Parallel Prefix Problem.

[BibT_eX]

[DOI]

Stephan Weis

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1992

The Complexity of Scheduling Problems with Communication Delays for Trees.

[BibT_eX]

[DOI]