| 2004 |
|---|
| 19 | EE | Paul F. Dietz,
Joel I. Seiferas,
Ju Zhang:
A Tight Lower Bound for Online Monotonic List Labeling.
SIAM J. Discrete Math. 18(3): 626-637 (2004) |
| 1999 |
|---|
| 18 | | Paul F. Dietz,
Rajeev Raman:
Small-Rank Selection in Parallel, with Applications to Heap Construction.
J. Algorithms 30(1): 33-51 (1999) |
| 1996 |
|---|
| 17 | | Paul F. Dietz:
A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets.
J. Comput. Syst. Sci. 53(1): 148-152 (1996) |
| 1995 |
|---|
| 16 | | Paul F. Dietz,
Kurt Mehlhorn,
Rajeev Raman,
Christian Uhrig:
Lower Bounds for Set Intersection Queries.
Algorithmica 14(2): 154-168 (1995) |
| 1994 |
|---|
| 15 | | Paul F. Dietz,
Joel I. Seiferas,
Ju Zhang:
A Tight Lower Bound for On-line Monotonic List Labeling.
SWAT 1994: 131-142 |
| 14 | | Paul F. Dietz,
Ioan I. Macarie,
Joel I. Seiferas:
Bits and Relative Order From Residues, Space Efficiently.
Inf. Process. Lett. 50(3): 123-127 (1994) |
| 13 | | Paul F. Dietz,
Rajeev Raman:
A Constant Update Time Finger Search Tree.
Inf. Process. Lett. 52(3): 147-154 (1994) |
| 1993 |
|---|
| 12 | | Paul F. Dietz,
Kurt Mehlhorn,
Rajeev Raman,
Christian Uhrig:
Lower Bounds for Set Intersection Queries.
SODA 1993: 194-201 |
| 11 | | Paul F. Dietz,
Rajeev Raman:
Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract).
WADS 1993: 289-301 |
| 1992 |
|---|
| 10 | | Paul F. Dietz:
Heap Construction in the Parallel Comparison Tree Model.
SWAT 1992: 140-150 |
| 1991 |
|---|
| 9 | | Paul F. Dietz,
Rajeev Raman:
Persistence, Amortization and Randomization.
SODA 1991: 78-88 |
| 8 | | Paul F. Dietz:
Finding Level-Ancestors in Dynamic Trees.
WADS 1991: 32-40 |
| 1990 |
|---|
| 7 | | Paul F. Dietz,
Rajeev Raman:
A Constant Update Time Finger Search Tree.
ICCI 1990: 100-109 |
| 6 | | Paul F. Dietz,
Ju Zhang:
Lower Bounds for Monotonic List Labeling.
SWAT 1990: 173-180 |
| 1989 |
|---|
| 5 | | Paul F. Dietz:
Optimal Algorithms for List Indexing and Subset Rank.
WADS 1989: 39-46 |
| 4 | | Paul F. Dietz:
Fully Persistent Arrays (Extended Array).
WADS 1989: 67-74 |
| 1987 |
|---|
| 3 | | Paul F. Dietz,
Daniel Dominic Sleator:
Two Algorithms for Maintaining Order in a List
STOC 1987: 365-372 |
| 1982 |
|---|
| 2 | | Paul F. Dietz:
Maintaining Order in a Linked List
STOC 1982: 122-127 |
| 1980 |
|---|
| 1 | | Paul F. Dietz,
S. Rao Kosaraju:
Recognition of Topological Equivalence of Patterns by Array Automata.
J. Comput. Syst. Sci. 20(1): 111-116 (1980) |
