| * | 2009 |
|---|
| 45 | EE | Holger Petersen:
Simulations by Time-Bounded Counter Machines.
Developments in Language Theory 2009: 410-418 |
| 44 | EE | 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) |
| 43 | EE | 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) |
| 2008 |
|---|
| 42 | EE | Holger Petersen:
Sorting and Element Distinctness on One-Way Turing Machines.
LATA 2008: 433-439 |
| 41 | EE | Holger Petersen:
Element Distinctness and Sorting on One-Tape Off-Line Turing Machines.
SOFSEM 2008: 406-417 |
| 40 | EE | Holger Petersen:
Improved Bounds for Range Mode and Range Median Queries.
SOFSEM 2008: 418-423 |
| 39 | EE | Volker Claus,
Volker Diekert,
Holger Petersen:
Partnerschaftsvermittlung.
Taschenbuch der Algorithmen 2008: 373-383 |
| 2007 |
|---|
| 38 | EE | Holger Petersen:
String matching with simple devices.
Inf. Process. Lett. 105(1): 32-34 (2007) |
| 2006 |
|---|
| 37 | EE | Holger Petersen:
Computable Lower Bounds for Busy Beaver Turing Machines.
Recent Advances in Formal Languages and Applications 2006: 305-319 |
| 36 | EE | Amir M. Ben-Amram,
Holger Petersen:
Backing up in singly linked lists.
J. ACM 53(4): 681-705 (2006) |
| 35 | EE | Holger Petersen,
John Michael Robson:
Efficient Simulations by Queue Machines.
SIAM J. Comput. 35(5): 1059-1069 (2006) |
| 2005 |
|---|
| 34 | EE | Holger Austinat,
Volker Diekert,
Ulrich Hertrampf,
Holger Petersen:
Regular frequency computations.
Theor. Comput. Sci. 330(1): 15-21 (2005) |
| 2004 |
|---|
| 33 | EE | 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 |
|---|
| 32 | EE | Amir M. Ben-Amram,
Omer Berkman,
Holger Petersen:
Element distinctness on one-tape Turing machines: a complete solution.
Acta Inf. 40(2): 81-94 (2003) |
| 31 | | Ingmar Camphausen,
Holger Petersen,
Claus Stark:
Konzepte zum Root-CA Zertifikatswechsel.
Datenschutz und Datensicherheit 27(2): (2003) |
| 30 | | Dörte Neundorf,
Holger Petersen:
Information Security Management - Vom Prozess zur Umsetzung.
Datenschutz und Datensicherheit 27(4): (2003) |
| 2002 |
|---|
| 29 | EE | Holger Petersen:
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL.
STACS 2002: 513-522 |
| 28 | EE | Holger Petersen:
Bounds for the Element Distinctness Problem on one-tape Turing machines.
Inf. Process. Lett. 81(2): 75-79 (2002) |
| 27 | EE | Amir M. Ben-Amram,
Holger Petersen:
Improved Bounds for Functions Related to Busy Beavers.
Theory Comput. Syst. 35(1): 1-11 (2002) |
| 2001 |
|---|
| 26 | EE | Holger Petersen:
Stacks versus Deques.
COCOON 2001: 218-227 |
| 2000 |
|---|
| 25 | EE | Holger Petersen:
Separation Results for Rebound Automata.
MFCS 2000: 589-598 |
| 24 | | Holger Petersen:
Prefix Rewriting and Descriptional Complexity.
Journal of Automata, Languages and Combinatorics 5(3): 245-254 (2000) |
| 1999 |
|---|
| 23 | EE | Holger Petersen:
Fooling Rebound Automata.
MFCS 1999: 241-250 |
| 22 | EE | Amir M. Ben-Amram,
Holger Petersen:
Backing Up in Singly Linked Lists.
STOC 1999: 780-786 |
| 21 | | Holger Petersen:
Privilege Management Infrastructure - PMI.
Datenschutz und Datensicherheit 23(4): (1999) |
| 20 | | James D. Currie,
Holger Petersen,
John Michael Robson,
Jeffrey Shallit:
Seperating Words with Small Grammars.
Journal of Automata, Languages and Combinatorics 4(2): 101-110 (1999) |
| 19 | EE | 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) |
| 1998 |
|---|
| 18 | EE | Amir M. Ben-Amram,
Holger Petersen:
CONS-Free Programs with Tree Input (Extended Abstract).
ICALP 1998: 271-282 |
| 17 | EE | Holger Petersen,
John Michael Robson:
Efficient Simulations by Queue Machines.
ICALP 1998: 884-895 |
| 16 | EE | Alexander Herrigel,
Joseph Ó Ruanaidh,
Holger Petersen,
Shelby Pereira,
Thierry Pun:
Secure Copyright Protection Techniques for Digital Images.
Information Hiding 1998: 169-190 |
| 15 | EE | Holger Petersen:
The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses.
MFCS 1998: 296-304 |
| 1997 |
|---|
| 14 | EE | Holger Petersen:
Homomorphic Images os Sentential Forms and Terminating Grammars (Extended Abstract).
MFCS 1997: 448-457 |
| 13 | | Holger Petersen:
How to Convert any Digital Signature Scheme into a Group Signature Scheme.
Security Protocols Workshop 1997: 177-190 |
| 12 | | Holger Petersen,
Markus Michels:
On Signature Schemes with Threshold Verification Detecting Malicious Verifiers.
Security Protocols Workshop 1997: 67-78 |
| 1996 |
|---|
| 11 | EE | Markus Michels,
Holger Petersen,
Patrick Horster:
Breaking and Repairing a Convertible Undeniable Signature Scheme.
ACM Conference on Computer and Communications Security 1996: 148-152 |
| 10 | | Yun Ding,
Patrick Horster,
Holger Petersen:
A New Approach for Delegation Using Hierarchical Delegation Tokens.
Communications and Multimedia Security 1996: 128-143 |
| 9 | EE | Markus Michels,
David Naccache,
Holger Petersen:
GOST 34.10 - A brief overview of Russia's DSA.
Computers & Security 15(8): 725-732 (1996) |
| 8 | EE | Anca Muscholl,
Holger Petersen:
A Note on the Commutative Closure of Star-Free Languages.
Inf. Process. Lett. 57(2): 71-74 (1996) |
| 7 | | Holger Petersen:
The Computation of Partial Recursive Word-Functions Without Read Instructions.
Math. Log. Q. 42: 312-318 (1996) |
| 1995 |
|---|
| 6 | | Patrick Horster,
Markus Michels,
Holger Petersen:
Das Meta-ElGamal Signaturverfahren und seine Anwendungen.
VIS 1995: 207- |
| 1994 |
|---|
| 5 | EE | Patrick Horster,
Holger Petersen,
Markus Michels:
Meta-ElGamal Signature Schemes.
ACM Conference on Computer and Communications Security 1994: 96-107 |
| 4 | EE | Patrick Horster,
Markus Michels,
Holger Petersen:
Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications.
ASIACRYPT 1994: 224-237 |
| 3 | | Matthias Jantzen,
Holger Petersen:
Cancellation in Context-Free Languages: Enrichment by Reduction.
Theor. Comput. Sci. 127(1): 149-170 (1994) |
| 1993 |
|---|
| 2 | EE | Matthias Jantzen,
Holger Petersen:
Cancellation on Context-Free Languages: Enrichment by Reduction.
STACS 1993: 206-215 |
| 1987 |
|---|
| 1 | | Matthias Jantzen,
Manfred Kudlek,
Klaus-Jörn Lange,
Holger Petersen:
Dyck1-Reductions of Context-free Languages.
FCT 1987: 218-227 |
