Paul F. Dietz

Available identifiers

Publication	Date of Publication	Type
Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)	2023-01-18	Paper
A tight lower bound for on-line monotonic list labeling	2022-12-09	Paper
Heap construction in the parallel comparison tree model	2022-12-09	Paper
Lower bounds for monotonic list labeling	2022-12-09	Paper
A Tight Lower Bound for Online Monotonic List Labeling	2005-09-16	Paper
https://portal.mardi4nfdi.de/entity/Q4450993	2004-02-16	Paper
Small-Rank Selection in Parallel, with Applications to Heap Construction	1999-02-02	Paper
A space efficient variant of path copying for partially persistent sorted sets	1997-03-13	Paper
A constant update time finger search tree	1996-02-26	Paper
Lower bounds for set intersection queries	1995-10-09	Paper
Bits and relative order from residues, space efficiently	1994-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q3140421	1993-12-15	Paper
https://portal.mardi4nfdi.de/entity/Q3138942	1993-10-20	Paper
https://portal.mardi4nfdi.de/entity/Q4037405	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4028873	1993-03-28	Paper
https://portal.mardi4nfdi.de/entity/Q4028876	1993-03-28	Paper
https://portal.mardi4nfdi.de/entity/Q4016520	1993-01-16	Paper
Recognition of topological equivalence of patterns by array automata	1980-01-01	Paper

This page was built for person: Paul F. Dietz