default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHolger Petersen 0001
Person information
- affiliation: University of Stuttgart, Germany
Other persons with the same name
- Holger Petersen 0002 — University of Technology Chemnitz-Zwickau, Chemnitz, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c30]Holger Petersen:
LIKE Patterns and Complexity. COCOON 2019: 469-477- [i17]Holger Petersen:
Some Remarks on Real-Time Turing Machines. CoRR abs/1902.00975 (2019) - [i16]Holger Petersen:
LIKE Patterns and Complexity. CoRR abs/1903.06195 (2019) - 2017
- [c29]Holger Petersen:
Busy Beaver Scores and Alphabet Size. FCT 2017: 409-417 - [i15]Holger Petersen:
Busy Beaver Scores and Alphabet Size. CoRR abs/1704.08752 (2017) - 2016
- [c28]Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen:
Simpler, faster and shorter labels for distances in graphs. SODA 2016: 338-350 - [i14]Holger Petersen:
A Note on Nested String Replacements. CoRR abs/1607.01828 (2016) - 2015
- [i13]Holger Petersen:
Efficient Computation by Three Counter Machines. CoRR abs/1501.02212 (2015) - [i12]Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen:
Simpler, faster and shorter labels for distances in graphs. CoRR abs/1504.04498 (2015) - [i11]Holger Petersen:
A Non-Oblivious Reduction of Counting Ones to Multiplication. CoRR abs/1506.03473 (2015) - [i10]Holger Petersen:
An NL-Complete Puzzle. CoRR abs/1507.02723 (2015) - [i9]Holger Petersen:
The Complexity of Some Combinatorial Puzzles. CoRR abs/1507.08690 (2015) - [i8]Holger Petersen:
Counting Ones Without Broadword Operations. CoRR abs/1511.05210 (2015) - 2014
- [c27]Holger Petersen:
A Note on Pushdown Automata Systems. DCFS 2014: 342-351 - [c26]Holger Petersen:
Professionelles Testmanagement in Datenreinigungsprozessen. GI-Jahrestagung 2014: 83-84 - [i7]Holger Petersen:
On Practical Regular Expressions. CoRR abs/1408.1258 (2014) - 2013
- [c25]Holger Petersen:
The Power of Centralized PC Systems of Pushdown Automata. DCFS 2013: 241-252 - [i6]Holger Petersen:
A Note on Asynchronous PC Systems of Pushdown Automata (Preliminary Report). CoRR abs/1310.0504 (2013) - [i5]Holger Petersen:
Some Remarks on Lower Bounds for Queues Machines (Preliminary Report). CoRR abs/1310.6398 (2013) - 2012
- [c24]Holger Petersen:
Bounded Counter Languages. DCFS 2012: 266-279 - [i4]Holger Petersen:
Bounded Counter Languages. CoRR abs/1204.0833 (2012) - [i3]Holger Petersen:
The Power of Centralized PC Systems of Pushdown Automata. CoRR abs/1208.1283 (2012) - [i2]Holger Petersen:
A Note on Kolmogorov-Uspensky Machines. CoRR abs/1211.5544 (2012) - 2011
- [j28]Holger Petersen:
Simulations by Time-Bounded Counter Machines. Int. J. Found. Comput. Sci. 22(2): 395-409 (2011) - [p3]Volker Claus, Volker Diekert, Holger Petersen:
Marriage Broker. Algorithms Unplugged 2011: 345-355 - [i1]Holger Petersen:
A SWAR Approach to Counting Ones. CoRR abs/1108.3860 (2011)
2000 – 2009
- 2009
- [j27]Holger Petersen, Szymon Grabowski
:
Range mode and range median queries in constant time and sub-quadratic space. Inf. Process. Lett. 109(4): 225-228 (2009) - [j26]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): 2972-2981 (2009) - [c23]Holger Petersen:
Simulations by Time-Bounded Counter Machines. Developments in Language Theory 2009: 410-418 - 2008
- [c22]Holger Petersen:
Sorting and Element Distinctness on One-Way Turing Machines. LATA 2008: 433-439 - [c21]Holger Petersen:
Element Distinctness and Sorting on One-Tape Off-Line Turing Machines. SOFSEM 2008: 406-417 - [c20]Holger Petersen:
Improved Bounds for Range Mode and Range Median Queries. SOFSEM 2008: 418-423 - [p2]Volker Claus, Volker Diekert, Holger Petersen:
Partnerschaftsvermittlung. Taschenbuch der Algorithmen 2008: 373-383 - 2007
- [j25]Holger Petersen:
String matching with simple devices. Inf. Process. Lett. 105(1): 32-34 (2007) - 2006
- [j24]Amir M. Ben-Amram, Holger Petersen:
Backing up in singly linked lists. J. ACM 53(4): 681-705 (2006) - [j23]Holger Petersen, John Michael Robson:
Efficient Simulations by Queue Machines. SIAM J. Comput. 35(5): 1059-1069 (2006) - [p1]Holger Petersen:
Computable Lower Bounds for Busy Beaver Turing Machines. Recent Advances in Formal Languages and Applications 2006: 305-319 - 2005
- [j22]Markus Lohrey, Holger Petersen:
Complexity results for prefix grammars. RAIRO Theor. Informatics Appl. 39(2): 391-401 (2005) - [j21]Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen:
Regular frequency computations. Theor. Comput. Sci. 330(1): 15-21 (2005) - 2004
- [j20]Katsushi Inoue, Akira Ito, Takashi Kamiura, Holger Petersen, Lan Zhang:
A Note On Rebound Turing Machines. Int. J. Found. Comput. Sci. 15(5): 791-807 (2004) - 2003
- [j19]Amir M. Ben-Amram, Omer Berkman, Holger Petersen:
Element distinctness on one-tape Turing machines: a complete solution. Acta Informatica 40(2): 81-94 (2003) - [j18]Ingmar Camphausen, Holger Petersen, Claus Stark:
Konzepte zum Root-CA Zertifikatswechsel. Datenschutz und Datensicherheit 27(2) (2003) - [j17]Dörte Neundorf, Holger Petersen:
Information Security Management - Vom Prozess zur Umsetzung. Datenschutz und Datensicherheit 27(4) (2003) - [c19]Holger Petersen:
Complexity Results for Prefix Grammars. DCFS 2003: 295-302 - 2002
- [j16]Holger Petersen:
Bounds for the Element Distinctness Problem on one-tape Turing machines. Inf. Process. Lett. 81(2): 75-79 (2002) - [j15]Amir M. Ben-Amram, Holger Petersen:
Improved Bounds for Functions Related to Busy Beavers. Theory Comput. Syst. 35(1): 1-11 (2002) - [c18]Holger Petersen:
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL. STACS 2002: 513-522 - 2001
- [c17]Holger Petersen:
Stacks versus Deques. COCOON 2001: 218-227 - 2000
- [j14]Holger Petersen:
Prefix Rewriting and Descriptional Complexity. J. Autom. Lang. Comb. 5(3): 245-254 (2000) - [c16]Holger Petersen:
Separation Results for Rebound Automata. MFCS 2000: 589-598
1990 – 1999
- 1999
- [j13]Holger Petersen:
Privilege Management Infrastructure - PMI. Datenschutz und Datensicherheit 23(4) (1999) - [j12]James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit:
Separating Words with Small Grammars. J. Autom. Lang. Comb. 4(2): 101-110 (1999) - [j11]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): 117-142 (1999) - [c15]Holger Petersen:
Fooling Rebound Automata. MFCS 1999: 241-250 - [c14]Amir M. Ben-Amram, Holger Petersen:
Backing Up in Singly Linked Lists. STOC 1999: 780-786 - 1998
- [c13]Amir M. Ben-Amram, Holger Petersen:
CONS-Free Programs with Tree Input (Extended Abstract). ICALP 1998: 271-282 - [c12]Holger Petersen, John Michael Robson:
Efficient Simulations by Queue Machines. ICALP 1998: 884-895 - [c11]Alexander Herrigel, Joseph Ó Ruanaidh, Holger Petersen, Shelby Pereira, Thierry Pun:
Secure Copyright Protection Techniques for Digital Images. Information Hiding 1998: 169-190 - [c10]Holger Petersen:
The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses. MFCS 1998: 296-304 - 1997
- [c9]Holger Petersen:
The Equivalence of Pebbles and Sensing Heads for Finite Automata. FCT 1997: 400-410 - [c8]Holger Petersen:
Homomorphic Images os Sentential Forms and Terminating Grammars (Extended Abstract). MFCS 1997: 448-457 - [c7]Holger Petersen:
How to Convert any Digital Signature Scheme into a Group Signature Scheme. Security Protocols Workshop 1997: 177-190 - 1996
- [b1]Holger Petersen:
Entscheidbarkeitsfragen und Hierarchieresultate für Mehrkopfautomaten. Universität Stuttgart, 1996, pp. 1-86 - [j10]Anca Muscholl, Holger Petersen:
A Note on the Commutative Closure of Star-Free Languages. Inf. Process. Lett. 57(2): 71-74 (1996) - [j9]Holger Petersen:
The Computation of Partial Recursive Word-Functions Without Read Instructions. Math. Log. Q. 42: 312-318 (1996) - [j8]Holger Petersen:
On the Language of Primitive Words. Theor. Comput. Sci. 161(1&2): 141-156 (1996) - 1995
- [j7]Holger Petersen:
On Space Functions Fully Constructed by Two-Dimensional Turing Machines. Inf. Process. Lett. 54(1): 9-10 (1995) - [j6]Holger Petersen:
A Remark on a Paper by Armando B. Matos. Theor. Comput. Sci. 141(1&2): 329-330 (1995) - [c6]Holger Petersen:
Some Results Concerning Two-Dimensional Turing Machines and Finite Automata. FCT 1995: 374-382 - [c5]Holger Petersen:
Alternation in Simple Devices. ICALP 1995: 315-323 - [c4]Holger Petersen:
Automata with Sensing Heads. ISTCS 1995: 150-157 - 1994
- [j5]M. Ladermann, Holger Petersen:
Notes on Looping Deterministic Two-Way Pushdown Automata. Inf. Process. Lett. 49(3): 123-127 (1994) - [j4]Holger Petersen:
Refined Simulation of Multihead Automata. Inf. Process. Lett. 52(5): 229-233 (1994) - [j3]Holger Petersen:
On the Determinacy Problem for Two-Way Pushdown Automata. Inf. Process. Lett. 52(6): 323-324 (1994) - [j2]Holger Petersen:
Two-way one-counter automata accepting bounded languages. SIGACT News 25(3): 102-105 (1994) - [j1]Matthias Jantzen, Holger Petersen:
Cancellation in Context-Free Languages: Enrichment by Reduction. Theor. Comput. Sci. 127(1): 149-170 (1994) - [c3]Holger Petersen:
The Ambiguity of Primitive Words. STACS 1994: 679-690 - 1993
- [c2]Matthias Jantzen, Holger Petersen:
Cancellation on Context-Free Languages: Enrichment by Reduction. STACS 1993: 206-215
1980 – 1989
- 1987
- [c1]Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen:
Dyck1-Reductions of Context-free Languages. FCT 1987: 218-227
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
