The following pages link to Paul F. Dietz (Q1327294):
Displaying 19 items.
- (Q1146518) (redirect page) (← links)
- Recognition of topological equivalence of patterns by array automata (Q1146519) (← links)
- Bits and relative order from residues, space efficiently (Q1327295) (← links)
- A constant update time finger search tree (Q1338781) (← links)
- A space efficient variant of path copying for partially persistent sorted sets (Q1816748) (← links)
- Lower bounds for set intersection queries (Q1899448) (← links)
- (Q3138942) (← links)
- (Q3140421) (← links)
- (Q4016520) (← links)
- (Q4028873) (← links)
- (Q4028876) (← links)
- (Q4037405) (← links)
- Small-Rank Selection in Parallel, with Applications to Heap Construction (Q4228284) (← links)
- (Q4450993) (← links)
- Lower bounds for monotonic list labeling (Q5056101) (← links)
- Heap construction in the parallel comparison tree model (Q5056136) (← links)
- A tight lower bound for on-line monotonic list labeling (Q5056172) (← links)
- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) (Q5060121) (← links)
- A Tight Lower Bound for Online Monotonic List Labeling (Q5317575) (← links)
