| 2007 |
|---|
| 41 | EE | Andreas Jakoby,
Till Tantau:
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.
FSTTCS 2007: 216-227 |
| 40 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk,
Christian Schindelhauer:
Improving the Average Delay of Sorting.
TAMC 2007: 330-341 |
| 39 | EE | Markus Hinkelmann,
Andreas Jakoby,
Peer Stechert:
t -Private and Secure Auctions.
TAMC 2007: 486-498 |
| 38 | EE | Markus Hinkelmann,
Andreas Jakoby:
Communications in unknown networks: Preserving the secret of topology.
Theor. Comput. Sci. 384(2-3): 184-200 (2007) |
| 2006 |
|---|
| 37 | EE | Andreas Jakoby,
Till Tantau:
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space.
Complexity of Boolean Functions 2006 |
| 36 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.
Complexity of Boolean Functions 2006 |
| 35 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using quantum oblivious transfer to cheat sensitive quantum bit commitment
CoRR abs/quant-ph/0605150: (2006) |
| 34 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Space efficient algorithms for directed series-parallel graphs.
J. Algorithms 60(2): 85-114 (2006) |
| 33 | EE | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Manthey:
Private Computation: k-Connected versus 1-Connected Networks.
J. Cryptology 19(3): 341-357 (2006) |
| 2005 |
|---|
| 32 | EE | Andreas Jakoby,
Maciej Liskiewicz:
Revealing Additional Information in Two-Party Computations.
ASIACRYPT 2005: 121-135 |
| 31 | EE | Markus Hinkelmann,
Andreas Jakoby:
Communications in Unknown Networks: Preserving the Secret of Topology.
SIROCCO 2005: 155-169 |
| 2004 |
|---|
| 30 | EE | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Manthey:
Privacy in Non-private Environments.
ASIACRYPT 2004: 137-151 |
| 29 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Approximating schedules for dynamic process graphs efficiently.
J. Discrete Algorithms 2(4): 471-500 (2004) |
| 2003 |
|---|
| 28 | EE | Jan Arpe,
Andreas Jakoby,
Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions.
FCT 2003: 158-170 |
| 27 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Private Computations in Networks: Topology versus Randomness.
STACS 2003: 121-132 |
| 26 | EE | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Manthey:
Private Computation - k-connected versus 1-connected Networks
Electronic Colloquium on Computational Complexity (ECCC) 10(009): (2003) |
| 25 | EE | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Manthey:
Privacy in Non-Private Environments
Electronic Colloquium on Computational Complexity (ECCC)(071): (2003) |
| 24 | EE | Jan Arpe,
Andreas Jakoby,
Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions
Electronic Colloquium on Computational Complexity (ECCC)(083): (2003) |
| 2002 |
|---|
| 23 | EE | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Siebert:
Private Computation - k-Connected versus 1-Connected Networks.
CRYPTO 2002: 194-209 |
| 22 | EE | Andreas Jakoby,
Maciej Liskiewicz:
Paths Problems in Symmetric Logarithmic Space.
ICALP 2002: 269-280 |
| 21 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Space Efficient Algorithms for Directed Series-Parallel Graphs
Electronic Colloquium on Computational Complexity (ECCC)(021): (2002) |
| 2001 |
|---|
| 20 | EE | Andreas Jakoby,
Christian Schindelhauer:
Efficient Addition on Field Programmable Gate Arrays.
FSTTCS 2001: 219-231 |
| 19 | EE | Andreas Jakoby,
Maciej Liskiewicz:
The Complexity of Some Basic Problems for Dynamic Process Graphs.
ISAAC 2001: 562-574 |
| 18 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Space Efficient Algorithms for Series-Parallel Graphs.
STACS 2001: 339-352 |
| 17 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Dynamic Process Graphs and the Complexity of Scheduling
Electronic Colloquium on Computational Complexity (ECCC)(090): (2001) |
| 2000 |
|---|
| 16 | EE | Faith E. Fich,
Andreas Jakoby:
Short Headers Suffice for Communication in a DAG with Link Failures.
DISC 2000: 360-373 |
| 15 | EE | Andreas Jakoby,
Rüdiger Reischuk:
Average Case Complexity of Unbounded Fanin Circuits.
IEEE Conference on Computational Complexity 2000: 170- |
| 14 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
The Expressive Power and Complexity of Dynamic Process Graphs.
WG 2000: 230-242 |
| 1999 |
|---|
| 13 | EE | Christian Schindelhauer,
Andreas Jakoby:
The Non-Recursive Power of Erroneous Computation.
FSTTCS 1999: 394-406 |
| 12 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Scheduling Dynamic Graphs.
STACS 1999: 383-392 |
| 11 | EE | Andreas Jakoby:
The Average Time Complexity to Compute Prefix Functions in Processor Networks.
STACS 1999: 78-89 |
| 10 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
Malign Distributions for Average Case Circuit Complexity.
Inf. Comput. 150(2): 187-208 (1999) |
| 1998 |
|---|
| 9 | EE | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
The complexity of broadcasting in planar and decomposable graphs.
Discrete Applied Mathematics 83(1-3): 179-206 (1998) |
| 1996 |
|---|
| 8 | | Andreas Jakoby,
Christian Schindelhauer:
On the Complexity of Worst Case and Expected Time in a Circuit.
STACS 1996: 295-306 |
| 1995 |
|---|
| 7 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
Malign Distributions for Average Case Circuit Complexity.
STACS 1995: 628-639 |
| 6 | | Andreas Jakoby,
Rüdiger Reischuk:
Data Transmission in Processor Networks.
WDAG 1995: 145-159 |
| 1994 |
|---|
| 5 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer,
Stephan Weis:
The Average Case Complexity of the Parallel Prefix Problem.
ICALP 1994: 593-604 |
| 4 | EE | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
Circuit complexity: from the worst case to the average case.
STOC 1994: 58-67 |
| 3 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
The Complexity of Broadcasting in Planar and Decomposable Graphs.
WG 1994: 219-231 |
| 1992 |
|---|
| 2 | | Andreas Jakoby,
Rüdiger Reischuk:
The Complexity of Scheduling Problems with Communication Delays for Trees.
SWAT 1992: 165-177 |
| 1991 |
|---|
| 1 | | 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: 201-215 |
