Author of the publication

Detecting Race Conditions in Parallel Programs that Use Semaphores.

, , and . Algorithmica, 35 (4): 321-345 (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.

 

Other publications of authors with the same name

A subset spanner for Planar graphs, : with application to subset TSP.. STOC, page 749-756. ACM, (2006)Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling., , and . SPAA, page 243-250. ACM, (1996)Approximation Through Local Optimality: Designing Networks with Small Degree., , and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 279-290. Springer, (1992)Shock-Based Indexing into Large Shape Databases., , and . ECCV (3), volume 2352 of Lecture Notes in Computer Science, page 731-746. Springer, (2002)A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs., and . WADS, volume 709 of Lecture Notes in Computer Science, page 442-451. Springer, (1993)Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs., , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 328-340. Springer, (2009)Solving Planar k -Terminal Cut in $O(n^c k)$ Time., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 569-580. Springer, (2012)Detecting Race Conditions in Parallel Programs that Use Semaphores., , and . Algorithmica, 35 (4): 321-345 (2003)Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs.. J. Algorithms, 14 (3): 331-343 (1993)When cycles collapse: A general approximation technique for constrained two-connectivity problems., and . IPCO, page 39-55. CIACO, (1993)