Low Contention Linearizable Counting - Maurice Herlihy; Nir Shavit; Orli Waarts (FOCS, 1991)

Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor - James Aspnes; Orli Waarts (FOCS, 1992)

Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! - Cynthia Dwork; Orli Waarts (STOC, 1992)

New algorithms and primitives for multi-processor coordination. - Orli Waarts (1992)

Bounded Round Numbers. - Cynthia Dwork; Maurice Herlihy; Orli Waarts (PODC, 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 (STOC, 1993)

Online Load Balancing of Temporary Tasks. - Yossi Azar; Bala Kalyanasundaram; Serge A. Plotkin; Kirk Pruhs; Orli Waarts (WADS, 1993)

Perfectly Secure Message Transmission. - Danny Dolev; Cynthia Dwork; Orli Waarts; Moti Yung (J. ACM, 1993)

A Theory of Competitive Analysis for Distributed Algorithms - Miklós Ajtai; James Aspnes; Cynthia Dwork; Orli Waarts (FOCS, 1994)

Competitiveness in Distributed Algorithms. - Miklós Ajtai; James Aspnes; Cynthia Dwork; Orli Waarts (PODC, 1994)

Coordinated Traversal: (t + 1)- Round Byzantine Agreement in Polynomial Time. - Yoram Moses; Orli Waarts (J. Algorithms, 1994)

Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). - Amos Fiat; Yishay Mansour; Adi Rosén; Orli Waarts (FOCS, 1995)

The Bit Vector Intersection Problem (Preliminary Version). - Richard M. Karp; Orli Waarts; Geoffrey Zweig (FOCS, 1995)

A Modular Measure of Competitiveness for Distributed Algorithms (Abstract). - James Aspnes; Orli Waarts (PODC, 1995)

Efficient Information Gathering on the Internet (extended abstract). - Oren Etzioni; Steve Hanks; Tao Jiang 001; Richard M. Karp; Omid Madani; Orli Waarts (FOCS, 1996)

Modular Competitiveness for Distributed Algorithms. - James Aspnes; Orli Waarts (STOC, 1996)

Linearizable Counting Networks. - Maurice Herlihy; Nir Shavit; Orli Waarts (Distributed Comput., 1996)

Randomized Consensus in Expected O(n log² n) Operations Per Processor. - James Aspnes; Orli Waarts (SIAM J. Comput., 1996)

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)

Contention in shared memory algorithms. - Cynthia Dwork; Maurice Herlihy; Orli Waarts (J. ACM, 1997)

On-Line Load Balancing of Temporary Tasks. - Yossi Azar; Bala Kalyanasundaram; Serge A. Plotkin; Kirk Pruhs; Orli Waarts (J. Algorithms, 1997)

Fairness in Scheduling - Miklós Ajtai; James Aspnes; Moni Naor; Yuval Rabani; Leonard J. Schulman; Orli Waarts (J. Algorithms, 1998)

Performing Work Efficiently in the Presence of Faults. - Cynthia Dwork; Joseph Y. Halpern; Orli Waarts (SIAM J. Comput., 1998)

Error-resilient DNA computation. - Richard M. Karp; Claire Kenyon; Orli Waarts (Random Struct. Algorithms, 1999)

Time-Lapse Snapshots. - Cynthia Dwork; Maurice Herlihy; Serge A. Plotkin; Orli Waarts (SIAM J. Comput., 1999)

Competitive Routing of Virtual Circuits with Unknown Duration. - Baruch Awerbuch; Yossi Azar; Serge A. Plotkin; Orli Waarts (J. Comput. Syst. Sci., 2001)

A Characterization of Eventual Byzantine Agreement. - Joseph Y. Halpern; Yoram Moses; Orli Waarts (SIAM J. Comput., 2001)

Improved Algorithms and Analysis for Secretary Problems and Generalizations. - Miklós Ajtai; Nimrod Megiddo; Orli Waarts (SIAM J. Discret. Math., 2001)

Compositional competitiveness for distributed algorithms. - James Aspnes; Orli Waarts (J. Algorithms, 2005)