| 2026 | ECIR | Overview of PAN 2026: Voight-Kampff Generative AI Detection, Text Watermarking, Multi-author Writing Style Analysis, Generative Plagiarism Detection, and Reasoning Trajectory Detection. | Janek Bevendorff, Maik Frbe, Andr Greiner-Petter, Andreas Jakoby, Maximilian Mayerl, Preslav Nakov, Henry Plutz, Martin Potthast, Benno Stein, Minh Ngoc Ta, Yuxia Wang, Eva Zangerle |
| 2026 | MFCS | The 2D Ray Tracing Problem Using ABCD Lenses and Mirrors Is Turing Complete. | Rosemary Adejoh, Andreas Jakoby, Sneha Mohanty, Christian Schindelhauer |
| 2021 | SP | Formal Language Theory for Practical Security - Extended Abstract -. | Andreas Jakoby, Jannis Leuther, Stefan Lucks |
| 2017 | ISIT | Cyclone codes. | Christian Schindelhauer, Andreas Jakoby, Sven Khler |
| 2012 | STACS | Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. | Michael Elberfeld, Andreas Jakoby, Till Tantau |
| 2010 | FOCS | Logspace Versions of the Theorems of Bodlaender and Courcelle. | Michael Elberfeld, Andreas Jakoby, Till Tantau |
| 2009 | NSS | A Cryptographically t-Private Auction System. | Markus Hinkelmann, Andreas Jakoby, Nina Moebius, Tiark Rompf, Peer Stechert |
| 2009 | TAMC | Preserving Privacy versus Data Retention. | Markus Hinkelmann, Andreas Jakoby |
| 2007 | TAMC | Untitled record | Markus Hinkelmann, Andreas Jakoby, Peer Stechert |
| 2007 | TAMC | Improving the Average Delay of Sorting. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk, Christian Schindelhauer |
| 2005 | ASIACRYPT | Revealing Additional Information in Two-Party Computations. | Andreas Jakoby, Maciej Liskiewicz |
| 2005 | SIROCCO | Communications in Unknown Networks: Preserving the Secret of Topology. | Markus Hinkelmann, Andreas Jakoby |
| 2004 | ASIACRYPT | Privacy in Non-private Environments. | Markus Blser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
| 2003 | FCT | One-Way Communication Complexity of Symmetric Boolean Functions. | Jan Arpe, Andreas Jakoby, Maciej Liskiewicz |
| 2003 | STACS | Private Computations in Networks: Topology versus Randomness. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 2002 | CRYPTO | Private Computation - k-Connected versus 1-Connected Networks. | Markus Blser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert |
| 2002 | ICALP | Paths Problems in Symmetric Logarithmic Space. | Andreas Jakoby, Maciej Liskiewicz |
| 2001 | ISAAC | The Complexity of Some Basic Problems for Dynamic Process Graphs. | Andreas Jakoby, Maciej Liskiewicz |
| 2001 | STACS | Space Efficient Algorithms for Series-Parallel Graphs. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 2000 | WG | The Expressive Power and Complexity of Dynamic Process Graphs. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 1999 | STACS | The Average Time Complexity to Compute Prefix Functions in Processor Networks. | Andreas Jakoby |
| 1999 | STACS | Scheduling Dynamic Graphs. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 1996 | STACS | On the Complexity of Worst Case and Expected Time in a Circuit. | Andreas Jakoby, Christian Schindelhauer |
| 1995 | STACS | Malign Distributions for Average Case Circuit Complexity. | Andreas Jakoby, Rdiger Reischuk, Christian Schindelhauer |
| 1994 | ICALP | The Average Case Complexity of the Parallel Prefix Problem. | Andreas Jakoby, Rdiger Reischuk, Christian Schindelhauer, Stephan Weis |
| 1994 | STOC | Circuit complexity: from the worst case to the average case. | Andreas Jakoby, Rdiger Reischuk, Christian Schindelhauer |
| 1994 | WG | The Complexity of Broadcasting in Planar and Decomposable Graphs. | Andreas Jakoby, Rdiger Reischuk, Christian Schindelhauer |