Publications
(1992).
(1992).
(1993).
(1993).
A generalization of binary search.
Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93). 27-34.
(1993). LogP: towards a realistic model of parallel computation.
Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 1-12.
(1993). LogP: towards a realistic model of parallel computation.
SIGPLAN Notices. 28,
(1993). Mapping the Genome: some combinatorial problems arising in molecular biology.
Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
(1993). A Monte-Carlo algorithm for estimating the permanent.
SIAM Journal on Computing. 22(2), 284-293.
(1993). The mortgage problem.
Proceedings of the Second Israel Symposium on Theory and Computing Systems . 304-312.
(1993).
(1993). Probabilistic analysis of network flow algorithms.
Mathematics of Operations Research. 18(1), 71-97.
(1993). Randomized parallel algorithms for backtrack search and branch-and-bound computation.
Journal of the Association for Computing Machinery. 40(3), 765-789.
(1993). Average case analysis of a heuristic for the assignment problem.
Mathematics of Operations Research. 19(3), 513-522.
(1994). Coding techniques for handling failures in large disk arrays.
Algorithmica. 12(2-3), 182-208.
(1994). An information entropy approach to the small-lot concept.
IEEE Transactions on Engineering Management. 41(1), 89-92.
(1994). Physical mapping of chromosomes using unique probes.
Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 489-500.
(1994). On the power of randomization in on-line algorithms.
Algorithmica. 11(1), 2-14.
(1994). Probabilistic recurrence relations.
Journal of the Association for Computing Machinery. 41(6), 1136-1150.
(1994). Selection in the presence of noise: the design of playoff systems.
Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 564-572.
(1994). The bit vector intersection problem.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 621-630.
(1995). Bounded branching process and AND/OR tree evaluation.
Random Structures and Algorithms. 7(2), 97-116.
(1995). A graph-theoretic game and its application to the k-server problem.
SIAM Journal on Computing. 24(1), 78-100.
(1995). Modeling parallel communication.
Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
(1995). An optimal algorithm for Monte Carlo estimation.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 142-149.
(1995).