default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul F. Dietz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j7]Paul F. Dietz, Joel I. Seiferas, Ju Zhang:
A Tight Lower Bound for Online Monotonic List Labeling. SIAM J. Discret. Math. 18(3): 626-637 (2004)
1990 – 1999
- 1999
- [j6]Paul F. Dietz, Rajeev Raman:
Small-Rank Selection in Parallel, with Applications to Heap Construction. J. Algorithms 30(1): 33-51 (1999) - 1996
- [j5]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
- [j4]Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman
, Christian Uhrig:
Lower Bounds for Set Intersection Queries. Algorithmica 14(2): 154-168 (1995) - 1994
- [j3]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) - [j2]Paul F. Dietz, Rajeev Raman:
A Constant Update Time Finger Search Tree. Inf. Process. Lett. 52(3): 147-154 (1994) - [c13]Paul F. Dietz, Rajeev Raman:
Very fast optimal parallel algorithms for heap construction. SPDP 1994: 514-521 - [c12]Paul F. Dietz, Joel I. Seiferas, Ju Zhang:
A Tight Lower Bound for On-line Monotonic List Labeling. SWAT 1994: 131-142 - 1993
- [c11]Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig:
Lower Bounds for Set Intersection Queries. SODA 1993: 194-201 - [c10]Paul F. Dietz, Rajeev Raman:
Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). WADS 1993: 289-301 - 1992
- [c9]Paul F. Dietz:
Heap Construction in the Parallel Comparison Tree Model. SWAT 1992: 140-150 - 1991
- [c8]Paul F. Dietz, Rajeev Raman:
Persistence, Amortization and Randomization. SODA 1991: 78-88 - [c7]Paul F. Dietz:
Finding Level-Ancestors in Dynamic Trees. WADS 1991: 32-40 - 1990
- [c6]Paul F. Dietz, Rajeev Raman:
A Constant Update Time Finger Search Tree. ICCI 1990: 100-109 - [c5]Paul F. Dietz, Ju Zhang:
Lower Bounds for Monotonic List Labeling. SWAT 1990: 173-180
1980 – 1989
- 1989
- [c4]Paul F. Dietz:
Optimal Algorithms for List Indexing and Subset Rank. WADS 1989: 39-46 - [c3]Paul F. Dietz:
Fully Persistent Arrays (Extended Array). WADS 1989: 67-74 - 1987
- [c2]Paul F. Dietz, Daniel Dominic Sleator:
Two Algorithms for Maintaining Order in a List. STOC 1987: 365-372 - 1982
- [c1]Paul F. Dietz:
Maintaining Order in a Linked List. STOC 1982: 122-127 - 1980
- [j1]Paul F. Dietz, S. Rao Kosaraju:
Recognition of Topological Equivalence of Patterns by Array Automata. J. Comput. Syst. Sci. 20(1): 111-116 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
