default search action
Andreas Jakoby
Person information
- affiliation: University of Lübeck, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c34]Andreas Jakoby, Jannis Leuther
, Stefan Lucks:
Formal Language Theory for Practical Security - Extended Abstract -. SP (Workshops) 2021: 101-110
2010 – 2019
- 2017
- [c33]Christian Schindelhauer
Cyclone codes. ISIT 2017: 156-160 - [i13]Andreas Jakoby, Naveen Kumar Goswami, Eik List, Stefan Lucks:
Critical Graphs for Minimum Vertex Cover. CoRR abs/1705.04111 (2017) - 2016
- [i12]Christian Schindelhauer, Andreas Jakoby, Sven Köhler:
Cyclone Codes. CoRR abs/1605.00695 (2016) - 2012
- [c32]Michael Elberfeld, Andreas Jakoby, Till Tantau:
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. STACS 2012: 66-77 - 2011
- [j11]Markus Hinkelmann, Andreas Jakoby, Nina Moebius, Tiark Rompf, Peer Stechert:
A cryptographically t-private auction system. Concurr. Comput. Pract. Exp. 23(12): 1399-1413 (2011) - [j10]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Privacy in Non-private Environments. Theory Comput. Syst. 48(1): 211-245 (2011) - [i11]Michael Elberfeld, Andreas Jakoby, Till Tantau:
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c31]Michael Elberfeld, Andreas Jakoby, Till Tantau:
Logspace Versions of the Theorems of Bodlaender and Courcelle. FOCS 2010: 143-152 - [i10]Michael Elberfeld, Andreas Jakoby, Till Tantau:
Logspace Versions of the Theorems of Bodlaender and Courcelle. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j9]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
Improving the average delay of sorting. Theor. Comput. Sci. 410(11): 1030-1041 (2009) - [c30]Markus Hinkelmann, Andreas Jakoby, Nina Moebius, Tiark Rompf, Peer Stechert:
A Cryptographically t-Private Auction System. NSS 2009: 44-51 - [c29]Markus Hinkelmann, Andreas Jakoby:
Preserving Privacy versus Data Retention. TAMC 2009: 251-260 - 2008
- [j8]Markus Hinkelmann, Andreas Jakoby, Peer Stechert:
t-Private and t-Secure Auctions. J. Comput. Sci. Technol. 23(5): 694-710 (2008) - [c28]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
Susceptible Two-Party Quantum Computations. ICITS 2008: 121-136 - 2007
- [j7]Markus Hinkelmann, Andreas Jakoby:
Communications in unknown networks: Preserving the secret of topology. Theor. Comput. Sci. 384(2-3): 184-200 (2007) - [c27]Andreas Jakoby, Till Tantau:
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. FSTTCS 2007: 216-227 - [c26]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
Improving the Average Delay of Sorting. TAMC 2007: 330-341 - [c25]Markus Hinkelmann, Andreas Jakoby, Peer Stechert:
t -Private and Secure Auctions. TAMC 2007: 486-498 - 2006
- [j6]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60(2): 85-114 (2006) - [j5]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Private Computation: k-Connected versus 1-Connected Networks. J. Cryptol. 19(3): 341-357 (2006) - [i9]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Complexity of Boolean Functions 2006 - [i8]Andreas Jakoby, Till Tantau:
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. Complexity of Boolean Functions 2006 - [i7]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
Using quantum oblivious transfer to cheat sensitive quantum bit commitment. CoRR abs/quant-ph/0605150 (2006) - [i6]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j4]Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-way communication complexity of symmetric Boolean functions. RAIRO Theor. Informatics Appl. 39(4): 687-706 (2005) - [c24]Andreas Jakoby, Maciej Liskiewicz:
Revealing Additional Information in Two-Party Computations. ASIACRYPT 2005: 121-135 - [c23]Markus Hinkelmann, Andreas Jakoby:
Communications in Unknown Networks: Preserving the Secret of Topology. SIROCCO 2005: 155-169 - 2004
- [j3]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms 2(4): 471-500 (2004) - [c22]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Privacy in Non-private Environments. ASIACRYPT 2004: 137-151 - 2003
- [c21]Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions. FCT 2003: 158-170 - [c20]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Private Computations in Networks: Topology versus Randomness. STACS 2003: 121-132 - [i5]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Private Computation - k-connected versus 1-connected Networks. Electron. Colloquium Comput. Complex. TR03 (2003) - [i4]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Privacy in Non-Private Environments. Electron. Colloquium Comput. Complex. TR03 (2003) - [i3]Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c19]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert:
Private Computation - k-Connected versus 1-Connected Networks. CRYPTO 2002: 194-209 - [c18]Andreas Jakoby, Maciej Liskiewicz:
Paths Problems in Symmetric Logarithmic Space. ICALP 2002: 269-280 - [i2]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space Efficient Algorithms for Directed Series-Parallel Graphs. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [c17]Andreas Jakoby, Christian Schindelhauer:
Efficient Addition on Field Programmable Gate Arrays. FSTTCS 2001: 219-231 - [c16]Andreas Jakoby, Maciej Liskiewicz:
The Complexity of Some Basic Problems for Dynamic Process Graphs. ISAAC 2001: 562-574 - [c15]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space Efficient Algorithms for Series-Parallel Graphs. STACS 2001: 339-352 - [i1]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Dynamic Process Graphs and the Complexity of Scheduling. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c14]Andreas Jakoby, Rüdiger Reischuk:
Average Case Complexity of Unbounded Fanin Circuits. CCC 2000: 170- - [c13]Faith E. Fich, Andreas Jakoby:
Short Headers Suffice for Communication in a DAG with Link Failures. DISC 2000: 360-373 - [c12]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
The Expressive Power and Complexity of Dynamic Process Graphs. WG 2000: 230-242
1990 – 1999
- 1999
- [j2]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Malign Distributions for Average Case Circuit Complexity. Inf. Comput. 150(2): 187-208 (1999) - [c11]Christian Schindelhauer
The Non-Recursive Power of Erroneous Computation. FSTTCS 1999: 394-406 - [c10]Andreas Jakoby:
The Average Time Complexity to Compute Prefix Functions in Processor Networks. STACS 1999: 78-89 - [c9]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Scheduling Dynamic Graphs. STACS 1999: 383-392 - 1998
- [b1]Andreas Jakoby:
Die Komplexität von Präfixfunktionen bezüglich ihres mittleren Zeitverhaltens. University of Lübeck, Germany, Berichte aus der Informatik, Shaker 1998, ISBN 978-3-8265-3923-7, pp. I-XII, 1-207 - [j1]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
The complexity of broadcasting in planar and decomposable graphs. Discret. Appl. Math. 83(1-3): 179-206 (1998) - 1996
- [c8]Andreas Jakoby, Christian Schindelhauer
On the Complexity of Worst Case and Expected Time in a Circuit. STACS 1996: 295-306 - 1995
- [c7]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Malign Distributions for Average Case Circuit Complexity. STACS 1995: 628-639 - [c6]Andreas Jakoby, Rüdiger Reischuk:
Data Transmission in Processor Networks. WDAG 1995: 145-159 - 1994
- [c5]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
The Average Case Complexity of the Parallel Prefix Problem. ICALP 1994: 593-604 - [c4]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Circuit complexity: from the worst case to the average case. STOC 1994: 58-67 - [c3]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
The Complexity of Broadcasting in Planar and Decomposable Graphs. WG 1994: 219-231 - 1992
- [c2]Andreas Jakoby, Rüdiger Reischuk:
The Complexity of Scheduling Problems with Communication Delays for Trees. SWAT 1992: 165-177 - 1991
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: