( en | de | ru )

 

Disambiguation of "Rauhe, Theis"

Author of the publication

copydeleteadd this publication to your clipboard
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems.

, and . SIAM J. Comput., 32 (3): 736-753 (2003)

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.

Dieter Rauhe

Kurt Rauhe

Hermann Rauhe

Kurt Rauhe

Kurt Rauhe

 

Other publications of authors with the same name

Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching., , and . Nord. J. Comput., 3 (4): 323-336 (1996)Improved labeling scheme for ancestor queries., and . SODA, page 947-953. ACM/SIAM, (2002)Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment., , , and . Theory Comput. Syst., 37 (3): 441-456 (2004)New Data Structures for Orthogonal Range Searching., , and . FOCS, page 198-207. IEEE Computer Society, (2000)Union-Find with Constant Time Deletions., , , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 78-89. Springer, (2005)Nearest common ancestors: a survey and a new distributed algorithm., , , and . SPAA, page 258-264. ACM, (2002)Black box for constant-time insertion in priority queues (note)., , , and . ACM Trans. Algorithms, 1 (1): 102-106 (2005)Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching., , and . SWAT, volume 1097 of Lecture Notes in Computer Science, page 198-211. Springer, (1996)Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method., and . ICALP, volume 1443 of Lecture Notes in Computer Science, page 67-78. Springer, (1998)Optimal static range reporting in one dimension., , and . STOC, page 476-482. ACM, (2001)