Holger Petersen

79 papers A* 5A 3B 10C 2Misc 2Journal 45Unranked 8
YearRankTypeTitle / Venue / Authors
2019 Misc conf
LIKE Patterns and Complexity.
COCOON
Holger Petersen
2019 J jnl
LIKE Patterns and Complexity.
CoRR
Holger Petersen
2019 J jnl
Some Remarks on Real-Time Turing Machines.
CoRR
Holger Petersen
2017 B conf
Busy Beaver Scores and Alphabet Size.
FCT
Holger Petersen
2017 J jnl
Busy Beaver Scores and Alphabet Size.
CoRR
Holger Petersen
2016 J jnl
A Note on Nested String Replacements.
CoRR
Holger Petersen
2016 A* conf
Simpler, faster and shorter labels for distances in graphs.
SODA
Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen
2015 J jnl
A Non-Oblivious Reduction of Counting Ones to Multiplication.
CoRR
Holger Petersen
2015 J jnl
An NL-Complete Puzzle.
CoRR
Holger Petersen
2015 J jnl
Counting Ones Without Broadword Operations.
CoRR
Holger Petersen
2015 J jnl
Efficient Computation by Three Counter Machines.
CoRR
Holger Petersen
2015 J jnl
Simpler, faster and shorter labels for distances in graphs.
CoRR
Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen
2015 J jnl
The Complexity of Some Combinatorial Puzzles.
CoRR
Holger Petersen
2014 — conf
A Note on Pushdown Automata Systems.
DCFS
Holger Petersen
2014 J jnl
On Practical Regular Expressions.
CoRR
Holger Petersen
2014 — conf
Professionelles Testmanagement in Datenreinigungsprozessen.
GI-Jahrestagung
Holger Petersen
2013 J jnl
A Note on Asynchronous PC Systems of Pushdown Automata (Preliminary Report).
CoRR
Holger Petersen
2013 J jnl
Some Remarks on Lower Bounds for Queues Machines (Preliminary Report).
CoRR
Holger Petersen
2013 — conf
The Power of Centralized PC Systems of Pushdown Automata.
DCFS
Holger Petersen
2012 J jnl
A Note on Kolmogorov-Uspensky Machines
CoRR
Holger Petersen
2012 J jnl
Bounded Counter Languages
CoRR
Holger Petersen
2012 — conf
Bounded Counter Languages.
DCFS
Holger Petersen
2012 J jnl
The Power of Centralized PC Systems of Pushdown Automata
CoRR
Holger Petersen
2011 J jnl
A SWAR Approach to Counting Ones
CoRR
Holger Petersen
2011 — ch.
Marriage Broker.
Algorithms Unplugged
Volker Claus, Volker Diekert, Holger Petersen
2011 J jnl
Simulations by Time-Bounded Counter Machines.
Int. J. Found. Comput. Sci.
Holger Petersen
2009 J jnl
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's.
Theor. Comput. Sci.
Juraj Hromkovic, Holger Petersen, Georg Schnitger
2009 J jnl
Range mode and range median queries in constant time and sub-quadratic space.
Inf. Process. Lett.
Holger Petersen, Szymon Grabowski
2009 C conf
Simulations by Time-Bounded Counter Machines.
Developments in Language Theory
Holger Petersen
2008 B conf
Element Distinctness and Sorting on One-Tape Off-Line Turing Machines.
SOFSEM
Holger Petersen
2008 B conf
Improved Bounds for Range Mode and Range Median Queries.
SOFSEM
Holger Petersen
2008 — ch.
Partnerschaftsvermittlung.
Taschenbuch der Algorithmen
Volker Claus, Volker Diekert, Holger Petersen
2008 C conf
Sorting and Element Distinctness on One-Way Turing Machines.
LATA
Holger Petersen
2007 J jnl
String matching with simple devices.
Inf. Process. Lett.
Holger Petersen
2006 J jnl
Backing up in singly linked lists.
J. ACM
Amir M. Ben-Amram, Holger Petersen
2006 — ch.
Computable Lower Bounds for Busy Beaver Turing Machines.
Recent Advances in Formal Languages and Applications
Holger Petersen
2006 J jnl
Efficient Simulations by Queue Machines.
SIAM J. Comput.
Holger Petersen, John Michael Robson
2005 J jnl
Complexity results for prefix grammars.
RAIRO Theor. Informatics Appl.
Markus Lohrey, Holger Petersen
2005 J jnl
Regular frequency computations.
Theor. Comput. Sci.
Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen
2004 J jnl
A Note On Rebound Turing Machines.
Int. J. Found. Comput. Sci.
Katsushi Inoue, Akira Ito, Takashi Kamiura, Holger Petersen, Lan Zhang
2003 — conf
Complexity Results for Prefix Grammars.
DCFS
Holger Petersen
2003 J jnl
Element distinctness on one-tape Turing machines: a complete solution.
Acta Informatica
Amir M. Ben-Amram, Omer Berkman, Holger Petersen
2003 J jnl
Information Security Management - Vom Prozess zur Umsetzung.
Datenschutz und Datensicherheit
Dörte Neundorf, Holger Petersen
2003 J jnl
Konzepte zum Root-CA Zertifikatswechsel.
Datenschutz und Datensicherheit
Ingmar Camphausen, Holger Petersen, Claus Stark
2002 J jnl
Bounds for the Element Distinctness Problem on one-tape Turing machines.
Inf. Process. Lett.
Holger Petersen
2002 J jnl
Improved Bounds for Functions Related to Busy Beavers.
Theory Comput. Syst.
Amir M. Ben-Amram, Holger Petersen
2002 A conf
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL.
STACS
Holger Petersen
2001 Misc conf
Stacks versus Deques.
COCOON
Holger Petersen
2000 J jnl
Prefix Rewriting and Descriptional Complexity.
J. Autom. Lang. Comb.
Holger Petersen
2000 B conf
Separation Results for Rebound Automata.
MFCS
Holger Petersen
1999 A* conf
Backing Up in Singly Linked Lists.
STOC
Amir M. Ben-Amram, Holger Petersen
1999 J jnl
Cryptographic Copyright Protection for Digital Images Based on Watermarking Techniques.
Theor. Comput. Sci.
Joseph Ó Ruanaidh, Holger Petersen, Alexander Herrigel, Shelby Pereira, Thierry Pun
1999 B conf
Fooling Rebound Automata.
MFCS
Holger Petersen
1999 J jnl
Privilege Management Infrastructure - PMI.
Datenschutz und Datensicherheit
Holger Petersen
1999 J jnl
Separating Words with Small Grammars.
J. Autom. Lang. Comb.
James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit
1998 A* conf
CONS-Free Programs with Tree Input (Extended Abstract).
ICALP
Amir M. Ben-Amram, Holger Petersen
1998 A* conf
Efficient Simulations by Queue Machines.
ICALP
Holger Petersen, John Michael Robson
1998 — conf
Secure Copyright Protection Techniques for Digital Images.
Information Hiding
Alexander Herrigel, Joseph Ó Ruanaidh, Holger Petersen, Shelby Pereira, Thierry Pun
1998 B conf
The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses.
MFCS
Holger Petersen
1997 B conf
Homomorphic Images os Sentential Forms and Terminating Grammars (Extended Abstract).
MFCS
Holger Petersen
1997 — conf
How to Convert any Digital Signature Scheme into a Group Signature Scheme.
Security Protocols Workshop
Holger Petersen
1997 B conf
The Equivalence of Pebbles and Sensing Heads for Finite Automata.
FCT
Holger Petersen
1996 J jnl
A Note on the Commutative Closure of Star-Free Languages.
Inf. Process. Lett.
Anca Muscholl, Holger Petersen
1996 — —
Entscheidbarkeitsfragen und Hierarchieresultate für Mehrkopfautomaten.
Holger Petersen
1996 J jnl
On the Language of Primitive Words.
Theor. Comput. Sci.
Holger Petersen
1996 J jnl
The Computation of Partial Recursive Word-Functions Without Read Instructions.
Math. Log. Q.
Holger Petersen
1995 J jnl
A Remark on a Paper by Armando B. Matos.
Theor. Comput. Sci.
Holger Petersen
1995 A* conf
Alternation in Simple Devices.
ICALP
Holger Petersen
1995 — conf
Automata with Sensing Heads.
ISTCS
Holger Petersen
1995 J jnl
On Space Functions Fully Constructed by Two-Dimensional Turing Machines.
Inf. Process. Lett.
Holger Petersen
1995 B conf
Some Results Concerning Two-Dimensional Turing Machines and Finite Automata.
FCT
Holger Petersen
1994 J jnl
Cancellation in Context-Free Languages: Enrichment by Reduction.
Theor. Comput. Sci.
Matthias Jantzen, Holger Petersen
1994 J jnl
Notes on Looping Deterministic Two-Way Pushdown Automata.
Inf. Process. Lett.
M. Ladermann, Holger Petersen
1994 J jnl
On the Determinacy Problem for Two-Way Pushdown Automata.
Inf. Process. Lett.
Holger Petersen
1994 J jnl
Refined Simulation of Multihead Automata.
Inf. Process. Lett.
Holger Petersen
1994 A conf
The Ambiguity of Primitive Words.
STACS
Holger Petersen
1994 J jnl
Two-way one-counter automata accepting bounded languages.
SIGACT News
Holger Petersen
1993 A conf
Cancellation on Context-Free Languages: Enrichment by Reduction.
STACS
Matthias Jantzen, Holger Petersen
1987 B conf
Dyck
FCT
Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen