Dyck1-Reductions of Context-free Languages. - Matthias Jantzen; Manfred Kudlek; Klaus-Jörn Lange; Holger Petersen 001 (FCT, 1987)

The Ambiguity of Primitive Words. - Holger Petersen 001 (STACS, 1994)

Notes on Looping Deterministic Two-Way Pushdown Automata. - M. Ladermann; Holger Petersen 001 (Inf. Process. Lett., 1994)

Refined Simulation of Multihead Automata. - Holger Petersen 001 (Inf. Process. Lett., 1994)

On the Determinacy Problem for Two-Way Pushdown Automata. - Holger Petersen 001 (Inf. Process. Lett., 1994)

Two-way one-counter automata accepting bounded languages. - Holger Petersen 001 (SIGACT News, 1994)

Cancellation in Context-Free Languages: Enrichment by Reduction. - Matthias Jantzen; Holger Petersen 001 (Theor. Comput. Sci., 1994)

Some Results Concerning Two-Dimensional Turing Machines and Finite Automata. - Holger Petersen 001 (FCT, 1995)

Alternation in Simple Devices. - Holger Petersen 001 (ICALP, 1995)

Automata with Sensing Heads. - Holger Petersen 001 (ISTCS, 1995)

On Space Functions Fully Constructed by Two-Dimensional Turing Machines. - Holger Petersen 001 (Inf. Process. Lett., 1995)

A Remark on a Paper by Armando B. Matos. - Holger Petersen 001 (Theor. Comput. Sci., 1995)

Entscheidbarkeitsfragen und Hierarchieresultate für Mehrkopfautomaten. - Holger Petersen 001 (1996)

A Note on the Commutative Closure of Star-Free Languages. - Anca Muscholl; Holger Petersen 001 (Inf. Process. Lett., 1996)

The Computation of Partial Recursive Word-Functions Without Read Instructions. - Holger Petersen 001 (Math. Log. Q., 1996)

On the Language of Primitive Words. - Holger Petersen 001 (Theor. Comput. Sci., 1996)

The Equivalence of Pebbles and Sensing Heads for Finite Automata. - Holger Petersen 001 (FCT, 1997)

Homomorphic Images os Sentential Forms and Terminating Grammars (Extended Abstract). - Holger Petersen 001 (MFCS, 1997)

How to Convert any Digital Signature Scheme into a Group Signature Scheme. - Holger Petersen 001 (Security Protocols Workshop, 1997)

CONS-Free Programs with Tree Input (Extended Abstract). - Amir M. Ben-Amram; Holger Petersen 001 (ICALP, 1998)

Secure Copyright Protection Techniques for Digital Images. - Alexander Herrigel; Joseph Ó Ruanaidh; Holger Petersen 001; Shelby Pereira; Thierry Pun (Information Hiding, 1998)

The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses. - Holger Petersen 001 (MFCS, 1998)

Fooling Rebound Automata. - Holger Petersen 001 (MFCS, 1999)

Privilege Management Infrastructure - PMI. - Holger Petersen 001 (Datenschutz und Datensicherheit, 1999)

Separating Words with Small Grammars. - James D. Currie; Holger Petersen 001; John Michael Robson; Jeffrey O. Shallit (J. Autom. Lang. Comb., 1999)

Cryptographic Copyright Protection for Digital Images Based on Watermarking Techniques. - Joseph Ó Ruanaidh; Holger Petersen 001; Alexander Herrigel; Shelby Pereira; Thierry Pun (Theor. Comput. Sci., 1999)

Separation Results for Rebound Automata. - Holger Petersen 001 (MFCS, 2000)

Prefix Rewriting and Descriptional Complexity. - Holger Petersen 001 (J. Autom. Lang. Comb., 2000)

Stacks versus Deques. - Holger Petersen 001 (COCOON, 2001)

The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL. - Holger Petersen 001 (STACS, 2002)

Bounds for the Element Distinctness Problem on one-tape Turing machines. - Holger Petersen 001 (Inf. Process. Lett., 2002)

Improved Bounds for Functions Related to Busy Beavers. - Amir M. Ben-Amram; Holger Petersen 001 (Theory Comput. Syst., 2002)

Complexity Results for Prefix Grammars. - Holger Petersen 001 (DCFS, 2003)

Element distinctness on one-tape Turing machines: a complete solution. - Amir M. Ben-Amram; Omer Berkman; Holger Petersen 001 (Acta Informatica, 2003)

Konzepte zum Root-CA Zertifikatswechsel. - Ingmar Camphausen; Holger Petersen 001; Claus Stark (Datenschutz und Datensicherheit, 2003)

Information Security Management - Vom Prozess zur Umsetzung. - Dörte Neundorf; Holger Petersen 001 (Datenschutz und Datensicherheit, 2003)

A Note On Rebound Turing Machines. - Katsushi Inoue; Akira Ito 001; Takashi Kamiura; Holger Petersen 001; Lan Zhang (Int. J. Found. Comput. Sci., 2004)

Complexity results for prefix grammars. - Markus Lohrey; Holger Petersen 001 (RAIRO Theor. Informatics Appl., 2005)

Regular frequency computations. - Holger Austinat; Volker Diekert; Ulrich Hertrampf; Holger Petersen 001 (Theor. Comput. Sci., 2005)

Backing up in singly linked lists. - Amir M. Ben-Amram; Holger Petersen 001 (J. ACM, 2006)

Efficient Simulations by Queue Machines. - Holger Petersen 001; John Michael Robson (SIAM J. Comput., 2006)

Computable Lower Bounds for Busy Beaver Turing Machines. - Holger Petersen 001 (Recent Advances in Formal Languages and Applications, 2006)

String matching with simple devices. - Holger Petersen 001 (Inf. Process. Lett., 2007)

Sorting and Element Distinctness on One-Way Turing Machines. - Holger Petersen 001 (LATA, 2008)

Element Distinctness and Sorting on One-Tape Off-Line Turing Machines. - Holger Petersen 001 (SOFSEM, 2008)

Improved Bounds for Range Mode and Range Median Queries. - Holger Petersen 001 (SOFSEM, 2008)

Partnerschaftsvermittlung. - Volker Claus; Volker Diekert; Holger Petersen 001 (Taschenbuch der Algorithmen, 2008)

Range mode and range median queries in constant time and sub-quadratic space. - Holger Petersen 001; Szymon Grabowski (Inf. Process. Lett., 2009)

On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's. - Juraj Hromkovic; Holger Petersen 001; Georg Schnitger (Theor. Comput. Sci., 2009)

Marriage Broker. - Volker Claus; Volker Diekert; Holger Petersen 001 (Algorithms Unplugged, 2011)

A SWAR Approach to Counting Ones - Holger Petersen 001 (CoRR, 2011)

Simulations by Time-Bounded Counter Machines. - Holger Petersen 001 (Int. J. Found. Comput. Sci., 2011)

Bounded Counter Languages. - Holger Petersen 001 (DCFS, 2012)

A Note on Kolmogorov-Uspensky Machines - Holger Petersen 001 (CoRR, 2012)

The Power of Centralized PC Systems of Pushdown Automata. - Holger Petersen 001 (DCFS, 2013)

A Note on Asynchronous PC Systems of Pushdown Automata (Preliminary Report). - Holger Petersen 001 (CoRR, 2013)

Some Remarks on Lower Bounds for Queues Machines (Preliminary Report). - Holger Petersen 001 (CoRR, 2013)

A Note on Pushdown Automata Systems. - Holger Petersen 001 (DCFS, 2014)

Professionelles Testmanagement in Datenreinigungsprozessen. - Holger Petersen 001 (GI-Jahrestagung, 2014)

On Practical Regular Expressions. - Holger Petersen 001 (CoRR, 2014)

Efficient Computation by Three Counter Machines. - Holger Petersen 001 (CoRR, 2015)

A Non-Oblivious Reduction of Counting Ones to Multiplication. - Holger Petersen 001 (CoRR, 2015)

An NL-Complete Puzzle. - Holger Petersen 001 (CoRR, 2015)

The Complexity of Some Combinatorial Puzzles. - Holger Petersen 001 (CoRR, 2015)

Counting Ones Without Broadword Operations. - Holger Petersen 001 (CoRR, 2015)

Simpler, faster and shorter labels for distances in graphs. - Stephen Alstrup; Cyril Gavoille; Esben Bistrup Halvorsen; Holger Petersen 001 (SODA, 2016)

A Note on Nested String Replacements. - Holger Petersen 001 (CoRR, 2016)

Busy Beaver Scores and Alphabet Size. - Holger Petersen 001 (FCT, 2017)

LIKE Patterns and Complexity. - Holger Petersen 001 (COCOON, 2019)

Some Remarks on Real-Time Turing Machines. - Holger Petersen 001 (CoRR, 2019)