Andreas Jakoby Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Jan Arpe [24] [28] [31]
2Markus Bläser [23] [25] [26] [30] [34]
3K. Degener-Boening [1]
4Faith Ellen (Faith Ellen Fich, Faith E. Fich) [16]
5A. Gohlke [1]
6Markus Hinkelmann [32] [40] [41] [44] [47]
7Maciej Liskiewicz [12] [14] [17] [18] [19] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [33] [34] [35] [36] [37] [38] [42] [45] [46]
8Aleksander Madry [36] [37] [38] [45]
9Bodo Manthey (Bodo Siebert) [23] [25] [26] [30] [34]
10Rüdiger Reischuk [2] [3] [4] [5] [6] [7] [9] [10] [12] [14] [15] [17] [18] [21] [27] [29] [35] [42] [46]
11Christian Schindelhauer [3] [4] [5] [7] [8] [9] [10] [13] [20] [42] [46]
12P. Schrott [1]
13Peer Stechert [41] [44]
14Till Tantau [39] [43]
15Stephan Weis [5]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Complete | Author
Copyright © Mon Nov 23 18:13:59 2009 by Michael Ley (ley@uni-trier.de)