1 citations · 2 across the 5 of their papers we have counts for
6 papers
The 2D Ray Tracing Problem using ABCD Lenses and Mirrors is Turing Complete
Rosemary U. Adejoh, Andreas Jakoby, Sneha Mohanty +1
We establish that the two-dimensional ray tracing problem with thin lenses and plane mirrors is Turing-complete, thereby resolving an open question posed by Reif et al. in 1994 as…
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 Fröbe, André Greiner-Petter +9
The goal of the PAN workshop is to advance computational stylometry and text forensics via objective and reproducible evaluation. In 2026, we run the following five tasks: (1) Voig…
How Pinball Wizards Simulate a Turing Machine
Rosemary Adejoh, Andreas Jakoby, Sneha Mohanty +1
We introduce and investigate the computational complexity of a novel physical problem known as the Pinball Wizard problem. It involves an idealized pinball moving through a maze co…
Critical Graphs for Minimum Vertex Cover
Andreas Jakoby, Naveen Kumar Goswami, Eik List +1
In the context of the chromatic-number problem, a critical graph is an instance where the deletion of any element would decrease the graph's chromatic number. Such instances have s…
Cyclone Codes
Christian Schindelhauer, Andreas Jakoby, Sven Köhler
We introduce Cyclone codes which are rateless erasure resilient codes. They combine Pair codes with Luby Transform (LT) codes by computing a code symbol from a random set of data s…
Using quantum oblivious transfer to cheat sensitive quantum bit commitment
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independentl…