Recognition of Topological Equivalence of Patterns by Array Automata. - Paul F. Dietz; S. Rao Kosaraju (J. Comput. Syst. Sci., 1980)

Maintaining Order in a Linked List - Paul F. Dietz (STOC, 1982)

Two Algorithms for Maintaining Order in a List - Paul F. Dietz; Daniel Dominic Sleator (STOC, 1987)

Optimal Algorithms for List Indexing and Subset Rank. - Paul F. Dietz (WADS, 1989)

Fully Persistent Arrays (Extended Array). - Paul F. Dietz (WADS, 1989)

Lower Bounds for Monotonic List Labeling. - Paul F. Dietz; Ju Zhang (SWAT, 1990)

Persistence, Amortization and Randomization. - Paul F. Dietz; Rajeev Raman (SODA, 1991)

Finding Level-Ancestors in Dynamic Trees. - Paul F. Dietz (WADS, 1991)

Heap Construction in the Parallel Comparison Tree Model. - Paul F. Dietz (SWAT, 1992)

Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). - Paul F. Dietz; Rajeev Raman (WADS, 1993)

Very fast optimal parallel algorithms for heap construction. - Paul F. Dietz; Rajeev Raman (SPDP, 1994)

A Tight Lower Bound for On-line Monotonic List Labeling. - Paul F. Dietz; Joel I. Seiferas; Ju Zhang (SWAT, 1994)

Bits and Relative Order From Residues, Space Efficiently. - Paul F. Dietz; Ioan I. Macarie; Joel I. Seiferas (Inf. Process. Lett., 1994)

A Constant Update Time Finger Search Tree. - Paul F. Dietz; Rajeev Raman (Inf. Process. Lett., 1994)

Lower Bounds for Set Intersection Queries. - Paul F. Dietz; Kurt Mehlhorn; Rajeev Raman; Christian Uhrig (Algorithmica, 1995)

A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets. - Paul F. Dietz (J. Comput. Syst. Sci., 1996)

Small-Rank Selection in Parallel, with Applications to Heap Construction. - Paul F. Dietz; Rajeev Raman (J. Algorithms, 1999)

A Tight Lower Bound for Online Monotonic List Labeling. - Paul F. Dietz; Joel I. Seiferas; Ju Zhang (SIAM J. Discret. Math., 2004)