The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paul F. Dietz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002