Holger Petersen

Publication Activity (10 Years)

Years Active: 1987-2019
Publications (10 Years): 13

Top Venues

CoRR

DCFS

COCOON

GI-Jahrestagung

Universität Stuttgart (PHD)

Education History

Universität Stuttgart

PHD

Publications

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

Holger Petersen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Holger Petersen