Publications

Found 10 results
Author Title Type [ Year(Asc)]
Filters: Author is Avi Wigderson  [Clear All Filters]
1990
Ben-David S, Borodin A, Karp RM, 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.
Ben-David S, Borodin A, Karp RM, Tardos G, Wigderson A.  1990.  On the Power of Randomization in Online Algorithms.
1988
Karp RM, Upfal E, Wigderson A.  1988.  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36
Karp RM, Upfal E, Wigderson A.  1988.  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. :225-253.
1986
Karp RM, 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.
1985
Karp RM, Wigderson A.  1985.  A fast parallel algorithm for the maximal independent set problem. Journal of the Association for Computing Machinery. 32(4):762-773.