Paul F. Dietz

According to our database, Paul F. Dietz authored at least 18 papers between 1980 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2004

A Tight Lower Bound for Online Monotonic List Labeling.

Paul F. Dietz, Joel I. Seiferas, Ju Zhang

SIAM J. Discret. Math., 2004

1999

Small-Rank Selection in Parallel, with Applications to Heap Construction.

Paul F. Dietz, Rajeev Raman

J. Algorithms, 1999

1996

A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets.

Paul F. Dietz

J. Comput. Syst. Sci., 1996

1995

Lower Bounds for Set Intersection Queries.

Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig

Algorithmica, 1995

1994

A Constant Update Time Finger Search Tree.

Paul F. Dietz, Rajeev Raman

Inf. Process. Lett., 1994

Bits and Relative Order From Residues, Space Efficiently.

Paul F. Dietz, Ioan I. Macarie, Joel I. Seiferas

Inf. Process. Lett., 1994

A Tight Lower Bound for On-line Monotonic List Labeling.

Paul F. Dietz, Joel I. Seiferas, Ju Zhang

Proceedings of the Algorithm Theory, 1994

Very fast optimal parallel algorithms for heap construction.

Paul F. Dietz, Rajeev Raman

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

1993

Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract).

Paul F. Dietz, Rajeev Raman

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992

Heap Construction in the Parallel Comparison Tree Model.

Paul F. Dietz

Proceedings of the Algorithm Theory, 1992

1991

Finding Level-Ancestors in Dynamic Trees.

Paul F. Dietz

Proceedings of the Algorithms and Data Structures, 1991

Persistence, Amortization and Randomization.

Paul F. Dietz, Rajeev Raman

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

Lower Bounds for Monotonic List Labeling.

Paul F. Dietz, Ju Zhang

Proceedings of the SWAT 90, 1990

1989

Fully Persistent Arrays (Extended Array).

Paul F. Dietz

Proceedings of the Algorithms and Data Structures, 1989

Optimal Algorithms for List Indexing and Subset Rank.

Paul F. Dietz

Proceedings of the Algorithms and Data Structures, 1989

1987

Two Algorithms for Maintaining Order in a List

Paul F. Dietz, Daniel Dominic Sleator

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1982

Maintaining Order in a Linked List

Paul F. Dietz

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1980

Recognition of Topological Equivalence of Patterns by Array Automata.

Paul F. Dietz, S. Rao Kosaraju

J. Comput. Syst. Sci., 1980