Andreas Jakoby

61 papers A* 5A 11B 7C 2Journal 23Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Overview of PAN 2026: Voight-Kampff Generative AI Detection, Text Watermarking, Multi-Author Writing Style Analysis, Generative Plagiarism Detection, and Reasoning Trajectory Detection. CoRR Janek Bevendorff, Maik Fröbe, André Greiner-Petter, Andreas Jakoby, Maximilian Mayerl, Preslav Nakov, Henry Plutz, Martin Potthast, Benno Stein, Minh Ngoc Ta, Yuxia Wang, Eva Zangerle
2026	—	`conf`	Overview of PAN 2026: Voight-Kampff Generative AI Detection, Text Watermarking, Multi-author Writing Style Analysis, Generative Plagiarism Detection, and Reasoning Trajectory Detection. ECIR (4) Janek Bevendorff, Maik Fröbe, André Greiner-Petter, Andreas Jakoby, Maximilian Mayerl, Preslav Nakov, Henry Plutz, Martin Potthast, Benno Stein, Minh Ngoc Ta, Yuxia Wang, Eva Zangerle
2025	—	`conf`	How Pinball Wizards Simulate a Turing Machine. FSTTCS Rosemary Adejoh, Andreas Jakoby, Sneha Mohanty, Christian Schindelhauer
2025	J	`jnl`	How Pinball Wizards Simulate a Turing Machine. CoRR Rosemary Adejoh, Andreas Jakoby, Sneha Mohanty, Christian Schindelhauer
2021	—	`conf`	Formal Language Theory for Practical Security - Extended Abstract -. SP (Workshops) Andreas Jakoby, Jannis Leuther, Stefan Lucks
2017	J	`jnl`	Critical Graphs for Minimum Vertex Cover. CoRR Andreas Jakoby, Naveen Kumar Goswami, Eik List, Stefan Lucks
2017	B	`conf`	Cyclone codes. ISIT Christian Schindelhauer, Andreas Jakoby, Sven Köhler
2016	J	`jnl`	Cyclone Codes. CoRR Christian Schindelhauer, Andreas Jakoby, Sven Köhler
2012	A	`conf`	Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. STACS Michael Elberfeld, Andreas Jakoby, Till Tantau
2011	J	`jnl`	A cryptographically Concurr. Comput. Pract. Exp. Markus Hinkelmann, Andreas Jakoby, Nina Moebius, Tiark Rompf, Peer Stechert
2011	J	`jnl`	Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. Electron. Colloquium Comput. Complex. Michael Elberfeld, Andreas Jakoby, Till Tantau
2011	J	`jnl`	Privacy in Non-private Environments. Theory Comput. Syst. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2010	A*	`conf`	Logspace Versions of the Theorems of Bodlaender and Courcelle. FOCS Michael Elberfeld, Andreas Jakoby, Till Tantau
2010	J	`jnl`	Logspace Versions of the Theorems of Bodlaender and Courcelle. Electron. Colloquium Comput. Complex. Michael Elberfeld, Andreas Jakoby, Till Tantau
2009	B	`conf`	A Cryptographically t-Private Auction System. NSS Markus Hinkelmann, Andreas Jakoby, Nina Moebius, Tiark Rompf, Peer Stechert
2009	J	`jnl`	Improving the average delay of sorting. Theor. Comput. Sci. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
2009	C	`conf`	Preserving Privacy versus Data Retention. TAMC Markus Hinkelmann, Andreas Jakoby
2008	—	`conf`	Susceptible Two-Party Quantum Computations. ICITS Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
2007	J	`jnl`	Communications in unknown networks: Preserving the secret of topology. Theor. Comput. Sci. Markus Hinkelmann, Andreas Jakoby
2007	C	`conf`	Improving the Average Delay of Sorting. TAMC Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
2007	—	`conf`	Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. FSTTCS Andreas Jakoby, Till Tantau
2006	—	`conf`	Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. Complexity of Boolean Functions Andreas Jakoby, Till Tantau
2006	J	`jnl`	Private Computation: k-Connected versus 1-Connected Networks. J. Cryptol. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2006	J	`jnl`	Space efficient algorithms for directed series-parallel graphs. J. Algorithms Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2006	—	`conf`	Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Complexity of Boolean Functions Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
2006	J	`jnl`	Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Electron. Colloquium Comput. Complex. Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
2006	J	`jnl`	Using quantum oblivious transfer to cheat sensitive quantum bit commitment CoRR Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
2005	B	`conf`	Communications in Unknown Networks: Preserving the Secret of Topology. SIROCCO Markus Hinkelmann, Andreas Jakoby
2005	J	`jnl`	One-way communication complexity of symmetric Boolean functions. RAIRO Theor. Informatics Appl. Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
2005	A	`conf`	Revealing Additional Information in Two-Party Computations. ASIACRYPT Andreas Jakoby, Maciej Liskiewicz
2004	J	`jnl`	Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2004	A	`conf`	Privacy in Non-private Environments. ASIACRYPT Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2003	J	`jnl`	One-Way Communication Complexity of Symmetric Boolean Functions Electron. Colloquium Comput. Complex. Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
2003	B	`conf`	One-Way Communication Complexity of Symmetric Boolean Functions. FCT Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
2003	J	`jnl`	Privacy in Non-Private Environments Electron. Colloquium Comput. Complex. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2003	J	`jnl`	Private Computation - k-connected versus 1-connected Networks Electron. Colloquium Comput. Complex. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2003	A	`conf`	Private Computations in Networks: Topology versus Randomness. STACS Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2002	A*	`conf`	Paths Problems in Symmetric Logarithmic Space. ICALP Andreas Jakoby, Maciej Liskiewicz
2002	A*	`conf`	Private Computation - k-Connected versus 1-Connected Networks. CRYPTO Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert
2002	J	`jnl`	Space Efficient Algorithms for Directed Series-Parallel Graphs Electron. Colloquium Comput. Complex. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2001	J	`jnl`	Dynamic Process Graphs and the Complexity of Scheduling Electron. Colloquium Comput. Complex. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2001	—	`conf`	Efficient Addition on Field Programmable Gate Arrays. FSTTCS Andreas Jakoby, Christian Schindelhauer
2001	A	`conf`	Space Efficient Algorithms for Series-Parallel Graphs. STACS Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2001	B	`conf`	The Complexity of Some Basic Problems for Dynamic Process Graphs. ISAAC Andreas Jakoby, Maciej Liskiewicz
2000	A	`conf`	Average Case Complexity of Unbounded Fanin Circuits. CCC Andreas Jakoby, Rüdiger Reischuk
2000	A	`conf`	Short Headers Suffice for Communication in a DAG with Link Failures. DISC Faith E. Fich, Andreas Jakoby
2000	B	`conf`	The Expressive Power and Complexity of Dynamic Process Graphs. WG Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
1999	J	`jnl`	Malign Distributions for Average Case Circuit Complexity. Inf. Comput. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1999	A	`conf`	Scheduling Dynamic Graphs. STACS Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
1999	A	`conf`	The Average Time Complexity to Compute Prefix Functions in Processor Networks. STACS Andreas Jakoby
1999	—	`conf`	The Non-Recursive Power of Erroneous Computation. FSTTCS Christian Schindelhauer, Andreas Jakoby
1998	—	`book`	Die Komplexität von Präfixfunktionen bezüglich ihres mittleren Zeitverhaltens. Andreas Jakoby
1998	J	`jnl`	The complexity of broadcasting in planar and decomposable graphs. Discret. Appl. Math. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1996	A	`conf`	On the Complexity of Worst Case and Expected Time in a Circuit. STACS Andreas Jakoby, Christian Schindelhauer
1995	—	`conf`	Data Transmission in Processor Networks. WDAG Andreas Jakoby, Rüdiger Reischuk
1995	A	`conf`	Malign Distributions for Average Case Circuit Complexity. STACS Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1994	A*	`conf`	Circuit complexity: from the worst case to the average case. STOC Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1994	A*	`conf`	The Average Case Complexity of the Parallel Prefix Problem. ICALP Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis
1994	B	`conf`	The Complexity of Broadcasting in Planar and Decomposable Graphs. WG Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1992	—	`conf`	The Complexity of Scheduling Problems with Communication Delays for Trees. SWAT Andreas Jakoby, Rüdiger Reischuk
1991	—	`conf`	Ein Konzept zur verteilten Datenhaltung in einem Netz mit Standard-Datenbanksystemen als Elementareinheiten. Kommunikation in Verteilten Systemen Andreas Jakoby, K. Degener-Boening, A. Gohlke, P. Schrott