Andreas Jakoby

Publication Activity (10 Years)

Years Active: 1991-2021
Publications (10 Years): 4

Top Topics

Graph Clustering

Error Correction

Formal Language Theory

Top Venues

Publications

Andreas Jakoby, Jannis Leuther, Stefan Lucks
Formal Language Theory for Practical Security - Extended Abstract -. SP Workshops (2021)
Christian Schindelhauer, Andreas Jakoby, Sven Köhler
Cyclone codes. ISIT (2017)
Andreas Jakoby, Naveen Kumar Goswami, Eik List, Stefan Lucks
Critical Graphs for Minimum Vertex Cover. CoRR (2017)
Christian Schindelhauer, Andreas Jakoby, Sven Köhler
Cyclone Codes. CoRR (2016)
Michael Elberfeld, Andreas Jakoby, Till Tantau
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. STACS (2012)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Privacy in Non-private Environments. Theory Comput. Syst. 48 (1) (2011)
Michael Elberfeld, Andreas Jakoby, Till Tantau
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. Electron. Colloquium Comput. Complex. 18 (2011)
Markus Hinkelmann, Andreas Jakoby, Nina Moebius, Tiark Rompf, Peer Stechert
-private auction system. Concurr. Comput. Pract. Exp. 23 (12) (2011)
Michael Elberfeld, Andreas Jakoby, Till Tantau
Logspace Versions of the Theorems of Bodlaender and Courcelle. Electron. Colloquium Comput. Complex. 17 (2010)
Michael Elberfeld, Andreas Jakoby, Till Tantau
Logspace Versions of the Theorems of Bodlaender and Courcelle. FOCS (2010)
Markus Hinkelmann, Andreas Jakoby
Preserving Privacy versus Data Retention. TAMC (2009)
Markus Hinkelmann, Andreas Jakoby, Nina Moebius, Tiark Rompf, Peer Stechert
A Cryptographically t-Private Auction System. NSS (2009)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
Improving the average delay of sorting. Theor. Comput. Sci. 410 (11) (2009)
Markus Hinkelmann, Andreas Jakoby, Peer Stechert
-Secure Auctions. J. Comput. Sci. Technol. 23 (5) (2008)
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
Susceptible Two-Party Quantum Computations. ICITS (2008)
Markus Hinkelmann, Andreas Jakoby
Communications in unknown networks: Preserving the secret of topology. Theor. Comput. Sci. 384 (2-3) (2007)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
Improving the Average Delay of Sorting. TAMC (2007)
Markus Hinkelmann, Andreas Jakoby, Peer Stechert
-Private and Secure Auctions. TAMC (2007)
Andreas Jakoby, Till Tantau
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. FSTTCS (2007)
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
Using quantum oblivious transfer to cheat sensitive quantum bit commitment CoRR (2006)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60 (2) (2006)
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Complexity of Boolean Functions (2006)
Andreas Jakoby, Till Tantau
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. Complexity of Boolean Functions (2006)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Private Computation: k-Connected versus 1-Connected Networks. J. Cryptol. 19 (3) (2006)
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Electron. Colloquium Comput. Complex. 13 (085) (2006)
Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
One-way communication complexity of symmetric Boolean functions. RAIRO Theor. Informatics Appl. 39 (4) (2005)
Andreas Jakoby, Maciej Liskiewicz
Revealing Additional Information in Two-Party Computations. ASIACRYPT (2005)
Markus Hinkelmann, Andreas Jakoby
Communications in Unknown Networks: Preserving the Secret of Topology. SIROCCO (2005)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Privacy in Non-private Environments. ASIACRYPT (2004)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms 2 (4) (2004)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Privacy in Non-Private Environments Electron. Colloquium Comput. Complex. (071) (2003)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
Private Computation - k-connected versus 1-connected Networks Electron. Colloquium Comput. Complex. 10 (009) (2003)
Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
One-Way Communication Complexity of Symmetric Boolean Functions Electron. Colloquium Comput. Complex. (083) (2003)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Private Computations in Networks: Topology versus Randomness. STACS (2003)
Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
One-Way Communication Complexity of Symmetric Boolean Functions. FCT (2003)
Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert
Private Computation - k-Connected versus 1-Connected Networks. CRYPTO (2002)
Andreas Jakoby, Maciej Liskiewicz
Paths Problems in Symmetric Logarithmic Space. ICALP (2002)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Space Efficient Algorithms for Directed Series-Parallel Graphs Electron. Colloquium Comput. Complex. (021) (2002)
Andreas Jakoby, Christian Schindelhauer
Efficient Addition on Field Programmable Gate Arrays. FSTTCS (2001)
Andreas Jakoby, Maciej Liskiewicz
The Complexity of Some Basic Problems for Dynamic Process Graphs. ISAAC (2001)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Dynamic Process Graphs and the Complexity of Scheduling Electron. Colloquium Comput. Complex. (090) (2001)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Space Efficient Algorithms for Series-Parallel Graphs. STACS (2001)
Faith E. Fich, Andreas Jakoby
Short Headers Suffice for Communication in a DAG with Link Failures. DISC (2000)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
The Expressive Power and Complexity of Dynamic Process Graphs. WG (2000)
Andreas Jakoby, Rüdiger Reischuk
Average Case Complexity of Unbounded Fanin Circuits. Computational Complexity Conference (2000)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Scheduling Dynamic Graphs. STACS (1999)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Malign Distributions for Average Case Circuit Complexity. Inf. Comput. 150 (2) (1999)
Andreas Jakoby
The Average Time Complexity to Compute Prefix Functions in Processor Networks. STACS (1999)
Christian Schindelhauer, Andreas Jakoby
The Non-Recursive Power of Erroneous Computation. FSTTCS (1999)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
The complexity of broadcasting in planar and decomposable graphs. Discret. Appl. Math. 83 (1-3) (1998)
Andreas Jakoby, Christian Schindelhauer
On the Complexity of Worst Case and Expected Time in a Circuit. STACS (1996)
Andreas Jakoby, Rüdiger Reischuk
Data Transmission in Processor Networks. WDAG (1995)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Malign Distributions for Average Case Circuit Complexity. STACS (1995)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
The Complexity of Broadcasting in Planar and Decomposable Graphs. WG (1994)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis
The Average Case Complexity of the Parallel Prefix Problem. ICALP (1994)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Circuit complexity: from the worst case to the average case. STOC (1994)
Andreas Jakoby, Rüdiger Reischuk
The Complexity of Scheduling Problems with Communication Delays for Trees. SWAT (1992)
Andreas Jakoby, K. Degener-Boening, A. Gohlke, P. Schrott
Ein Konzept zur verteilten Datenhaltung in einem Netz mit Standard-Datenbanksystemen als Elementareinheiten. Kommunikation in Verteilten Systemen (1991)