Orli Waarts

According to our database, Orli Waarts authored at least 29 papers between 1988 and 2005.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2005

Compositional competitiveness for distributed algorithms.

James Aspnes, Orli Waarts

J. Algorithms, 2005

1997

On-Line Load Balancing of Temporary Tasks.

Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts

J. Algorithms, 1997

On-line routing of virtual circuits with applications to load balancing and machine scheduling.

James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts

J. ACM, 1997

1996

Randomized Consensus in Expected O(n log² n) Operations Per Processor.

James Aspnes, Orli Waarts

SIAM J. Comput., 1996

Linearizable Counting Networks.

Maurice Herlihy, Nir Shavit, Orli Waarts

Distributed Comput., 1996

Modular Competitiveness for Distributed Algorithms.

James Aspnes, Orli Waarts

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Error-Resilient DNA Computation.

Richard M. Karp, Claire Kenyon, Orli Waarts

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Efficient Information Gathering on the Internet (extended abstract).

Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Fairness in Scheduling.

Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

A Modular Measure of Competitiveness for Distributed Algorithms (Abstract).

James Aspnes, Orli Waarts

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

The Bit Vector Intersection Problem (Preliminary Version).

Richard M. Karp, Orli Waarts, Geoffrey Zweig

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).

Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Improved Algorithms and Analysis for Secretary Problems and Generalizations.

Miklós Ajtai, Nimrod Megiddo, Orli Waarts

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Competitive Routing of Virtual Circuits with Unknown Duration.

Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Competitiveness in Distributed Algorithms.

Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

A Theory of Competitive Analysis for Distributed Algorithms

Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Online Load Balancing of Temporary Tasks.

Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Contention in shared memory algorithms.

Cynthia Dwork, Maurice Herlihy, Orli Waarts

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

On-line load balancing with applications to machine scheduling and virtual circuit routing.

James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Bounded Round Numbers.

Cynthia Dwork, Maurice Herlihy, Orli Waarts

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

New algorithms and primitives for multi-processor coordination.

Orli Waarts

PhD thesis, 1992

Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible!

Cynthia Dwork, Orli Waarts

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Performing Work Efficiently in the Presence of Faults.

Cynthia Dwork, Joseph Y. Halpern, Orli Waarts

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

Time-Lapse Snapshots.

Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts

Proceedings of the Theory of Computing and Systems, 1992

Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor

James Aspnes, Orli Waarts

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Low Contention Linearizable Counting

Maurice Herlihy, Nir Shavit, Orli Waarts

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

A Characterization of Eventual Byzantine Agreement.

Joseph Y. Halpern, Yoram Moses, Orli Waarts

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

Perfectly Secure Message Transmission

Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1988

Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time

Yoram Moses, Orli Waarts

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988