| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth.  |
STACS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Hinkelmann, Andreas Jakoby, Nina Moebius, Tiark Rompf, Peer Stechert |
A cryptographically t-private auction system. |
Concurrency and Computation: Practice and Experience |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Privacy in Non-private Environments. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Logspace Versions of the Theorems of Bodlaender and Courcelle. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Logspace Versions of the Theorems of Bodlaender and Courcelle. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer |
Improving the average delay of sorting. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Hinkelmann, Andreas Jakoby |
Preserving Privacy versus Data Retention. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Hinkelmann, Andreas Jakoby, Nina Moebius, Tiark Rompf, Peer Stechert |
A Cryptographically t-Private Auction System. |
NSS |
2009 |
DBLP DOI BibTeX RDF |
multiparty private computation, garbled circuits, private auctions |
| 1 | Markus Hinkelmann, Andreas Jakoby, Peer Stechert |
t-Private and t-Secure Auctions. |
J. Comput. Sci. Technol. |
2008 |
DBLP DOI BibTeX RDF |
multi-party private and secure computation, garbled circuits, private auctions |
| 1 | Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry |
Susceptible Two-Party Quantum Computations. |
ICITS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Hinkelmann, Andreas Jakoby |
Communications in unknown networks: Preserving the secret of topology. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer |
Improving the Average Delay of Sorting. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Hinkelmann, Andreas Jakoby, Peer Stechert |
t -Private and Secure Auctions. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Till Tantau |
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs |
| 1 | Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry |
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Space efficient algorithms for directed series-parallel graphs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Private Computation: k-Connected versus 1-Connected Networks. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
Connectivity, Randomness, Secure multi-party computation, Secure function evaluation, Parity, Private computation |
| 1 | Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry |
Using quantum oblivious transfer to cheat sensitive quantum bit commitment |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Till Tantau |
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry |
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jan Arpe, Andreas Jakoby, Maciej Liskiewicz |
One-way communication complexity of symmetric Boolean functions. |
ITA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Hinkelmann, Andreas Jakoby |
Communications in Unknown Networks: Preserving the Secret of Topology. |
SIROCCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz |
Revealing Additional Information in Two-Party Computations. |
ASIACRYPT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Approximating schedules for dynamic process graphs efficiently. |
J. Discrete Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Privacy in Non-private Environments. |
ASIACRYPT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arpe, Andreas Jakoby, Maciej Liskiewicz |
One-Way Communication Complexity of Symmetric Boolean Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Privacy in Non-Private Environments |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Private Computation - k-connected versus 1-connected Networks |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Private Computations in Networks: Topology versus Randomness. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arpe, Andreas Jakoby, Maciej Liskiewicz |
One-Way Communication Complexity of Symmetric Boolean Functions. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Space Efficient Algorithms for Directed Series-Parallel Graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz |
Paths Problems in Symmetric Logarithmic Space. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert |
Private Computation - k-Connected versus 1-Connected Networks. |
CRYPTO |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Dynamic Process Graphs and the Complexity of Scheduling |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Space Efficient Algorithms for Series-Parallel Graphs. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz |
The Complexity of Some Basic Problems for Dynamic Process Graphs. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Christian Schindelhauer |
Efficient Addition on Field Programmable Gate Arrays. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
The Expressive Power and Complexity of Dynamic Process Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Andreas Jakoby |
Short Headers Suffice for Communication in a DAG with Link Failures. |
DISC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk |
Average Case Complexity of Unbounded Fanin Circuits. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
Malign Distributions for Average Case Circuit Complexity. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Scheduling Dynamic Graphs. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby |
The Average Time Complexity to Compute Prefix Functions in Processor Networks. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Schindelhauer, Andreas Jakoby |
The Non-Recursive Power of Erroneous Computation. |
FSTTCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
The complexity of broadcasting in planar and decomposable graphs. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby |
Die Komplexität von Präfixfunktionen bezüglich ihres mittleren Zeitverhaltens. |
|
1998 |
RDF |
|
| 1 | Andreas Jakoby, Christian Schindelhauer |
On the Complexity of Worst Case and Expected Time in a Circuit. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
expected time, computational complexity, average case analysis, worst case, theory of parallel and distributed computation, timed circuits |
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
Malign Distributions for Average Case Circuit Complexity. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
delay, distribution, circuit complexity, average case complexity |
| 1 | Andreas Jakoby, Rüdiger Reischuk |
Data Transmission in Processor Networks. |
WDAG |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
The Complexity of Broadcasting in Planar and Decomposable Graphs. |
WG |
1994 |
DBLP DOI BibTeX RDF |
Classification graph algorithms, computational complexity, graph decomposition |
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis |
The Average Case Complexity of the Parallel Prefix Problem. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
Circuit complexity: from the worst case to the average case. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk |
The Complexity of Scheduling Problems with Communication Delays for Trees. |
SWAT |
1992 |
DBLP DOI BibTeX RDF |
|
| 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 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")