Author of the publication

Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms.

, , and . SIAM J. Comput., 18 (3): 499-532 (1989)

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.

 

Other publications of authors with the same name

Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms., , and . SIAM J. Comput., 18 (3): 499-532 (1989)On k-Hulls and Related Problems., , and . SIAM J. Comput., 16 (1): 61-77 (1987)Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract., and . SPAA, page 351-362. ACM, (2017)Prompt Mechanisms for Online Auctions., , and . SAGT, volume 4997 of Lecture Notes in Computer Science, page 170-181. Springer, (2008)Fast Algorithms for Constructing Maximum Entropy Summary Trees., and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 332-343. Springer, (2014)Partitioning Point Sets in 4 Dimensions.. ICALP, volume 194 of Lecture Notes in Computer Science, page 111-119. Springer, (1985)Faster Suffix Tree Construction with Missing Suffix Links., and . SIAM J. Comput., 33 (1): 26-42 (2003)Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm.. SIAM J. Comput., 23 (5): 1075-1091 (1994)Tree Pattern Matching to Subset Matching in Linear Time., and . SIAM J. Comput., 32 (4): 1056-1066 (2003)Note on the AKS Sorting Network, and . (September 1986)