( en | de | ru )

 

Disambiguation of "Dietz, Paul F."

Author of the publication

copydeleteadd this publication to your clipboard
A Tight Lower Bound for On-line Monotonic List Labeling.

, , and . SWAT, volume 824 of Lecture Notes in Computer Science, page 131-142. Springer, (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Paul Dietz

Paul F Buschenhofen

Paul F Bütler

Paul F DuVivier

Paul-Roland Dietz

 

Other publications of authors with the same name

Very fast optimal parallel algorithms for heap construction., and . SPDP, page 514-521. IEEE Computer Society, (1994)Fully Persistent Arrays (Extended Array).. WADS, volume 382 of Lecture Notes in Computer Science, page 67-74. Springer, (1989)Bits and Relative Order From Residues, Space Efficiently., , and . Inf. Process. Lett., 50 (3): 123-127 (1994)Recognition of Topological Equivalence of Patterns by Array Automata., and . J. Comput. Syst. Sci., 20 (1): 111-116 (1980)A Constant Update Time Finger Search Tree., and . ICCI, volume 468 of Lecture Notes in Computer Science, page 100-109. Springer, (1990)A Tight Lower Bound for On-line Monotonic List Labeling., , and . SWAT, volume 824 of Lecture Notes in Computer Science, page 131-142. Springer, (1994)Two Algorithms for Maintaining Order in a List, and . STOC, page 365-372. ACM, (1987)Persistence, Amortization and Randomization., and . SODA, page 78-88. ACM/SIAM, (1991)Optimal Algorithms for List Indexing and Subset Rank.. WADS, volume 382 of Lecture Notes in Computer Science, page 39-46. Springer, (1989)Small-Rank Selection in Parallel, with Applications to Heap Construction., and . J. Algorithms, 30 (1): 33-51 (1999)