Author of the publication

Fast Parallel Algorithms for Coloring Random Graphs.

, , , , and . WG, volume 570 of Lecture Notes in Computer Science, page 135-147. Springer, (1991)

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

Comments on the All Nearest-Neighbor Problem for Convex Polygons., and . Inf. Process. Lett., 9 (3): 105-107 (1979)A Non-Two-Phase Locking Protocol for Concurrency Control in General Databases., and . VLDB, page 92-94. Morgan Kaufmann, (1983)Sustaining moore's law in embedded computing through probabilistic and approximate design: retrospects and prospects., , , , and . CASES, page 1-10. ACM, (2009)Optimizing energy to minimize errors in dataflow graphs using approximate adders., , , , , and . CASES, page 177-186. ACM, (2010)Optimal Allocation of Area for Single-Chip Computations.. SIAM J. Comput., 14 (3): 730-743 (1985)Reducing the effect of mobility on TCP by making route caches quickly adapt to topology changes., and . ICC, page 4103-4110. IEEE, (2004)Deadlock Removal Using Partial Rollback in Database Systems., , and . SIGMOD Conference, page 65-73. ACM Press, (1981)Optimal surface reconstruction from planar contours., , and . SIGGRAPH, page 236. ACM, (1977)On high-speed computing with a programmable linear array., and . SC, page 425-432. IEEE Computer Society, (1988)Fast Parallel Algorithms for Coloring Random Graphs., , , , and . WG, volume 570 of Lecture Notes in Computer Science, page 135-147. Springer, (1991)