The following pages link to Holger Petersen (Q672728):
Displaying 46 items.
- A note on the commutative closure of star-free languages (Q672729) (← links)
- Range mode and range median queries in constant time and sub-quadratic space (Q976080) (← links)
- (Q1325839) (redirect page) (← links)
- Cancellation in context-free languages: enrichment by reduction (Q1325840) (← links)
- Cryptographic copyright protection for digital images based on watermarking techniques (Q1578486) (← links)
- Improved bounds for functions related to busy beavers (Q1597757) (← links)
- Bounds for the Element Distinctness Problem on one-tape Turing machines (Q1603524) (← links)
- Busy beaver scores and alphabet size (Q1679996) (← links)
- Regular frequency computations (Q1763697) (← links)
- Element distinctness on one-tape Turing machines: a complete solution (Q1889761) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- LIKE patterns and complexity (Q2300067) (← links)
- String matching with simple devices (Q2380036) (← links)
- (Q2742600) (← links)
- The Power of Centralized PC Systems of Pushdown Automata (Q2843100) (← links)
- Complexity results for prefix grammars (Q3025324) (← links)
- SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES (Q3086246) (← links)
- Bounded Counter Languages (Q3167588) (← links)
- (Q3471701) (← links)
- Sorting and Element Distinctness on One-Way Turing Machines (Q3540134) (← links)
- Simulations by Time-Bounded Counter Machines (Q3637243) (← links)
- (Q3766878) (← links)
- (Q3783607) (← links)
- (Q4218105) (← links)
- (Q4281522) (← links)
- (Q4338855) (← links)
- (Q4341792) (← links)
- (Q4387315) (← links)
- (Q4387323) (← links)
- (Q4503148) (← links)
- (Q4536395) (← links)
- (Q4551361) (← links)
- Simpler, faster and shorter labels for distances in graphs (Q4575602) (← links)
- A NOTE ON REBOUND TURING MACHINES (Q4667926) (← links)
- (Q4699321) (← links)
- (Q4736867) (← links)
- The Computation of Partial Recursive Word‐Functions Without Read Instructions (Q4888343) (← links)
- (Q4939575) (← links)
- (Q4941906) (← links)
- The equivalence of pebbles and sensing heads for finite automata (Q5055952) (← links)
- Element Distinctness and Sorting on One-Tape Off-Line Turing Machines (Q5448667) (← links)
- Improved Bounds for Range Mode and Range Median Queries (Q5448668) (← links)
- Efficient Simulations by Queue Machines (Q5470725) (← links)
- A Note on Pushdown Automata Systems (Q5496201) (← links)
- Backing up in singly linked lists (Q5890871) (← links)
- Backing up in singly linked lists (Q5900517) (← links)
