Publications

Found 10 results
Author Title [ Type(Asc)] Year
Filters: Author is Avi Wigderson  [Clear All Filters]
Journal Article
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1994).  On the power of randomization in on-line algorithms. Algorithmica. 11(1), 2-14.
Karp, R. M., & Wigderson A. (1985).  A fast parallel algorithm for the maximal independent set problem. Journal of the Association for Computing Machinery. 32(4), 762-773.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Conference Paper
Karp, R. M., Saks M., & Wigderson A. (1986).  On a Search Problem Related to Branch-and-Bound Procedures. Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 19-28.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the power of randomization in online algorithms. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 379-386.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.