Orli Waarts

41 papers A* 21B 1Journal 17Unranked 1
YearRankTypeTitle / Venue / Authors
2005 J jnl
Compositional competitiveness for distributed algorithms.
J. Algorithms
James Aspnes, Orli Waarts
2003 J jnl
Compositional competitiveness for distributed algorithms
CoRR
James Aspnes, Orli Waarts
2001 J jnl
A Characterization of Eventual Byzantine Agreement.
SIAM J. Comput.
Joseph Y. Halpern, Yoram Moses, Orli Waarts
2001 J jnl
Competitive Routing of Virtual Circuits with Unknown Duration.
J. Comput. Syst. Sci.
Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
2001 J jnl
Improved Algorithms and Analysis for Secretary Problems and Generalizations.
SIAM J. Discret. Math.
Miklós Ajtai, Nimrod Megiddo, Orli Waarts
2000 J jnl
Performing work efficiently in the presence of faults
CoRR
Cynthia Dwork, Joseph Y. Halpern, Orli Waarts
1999 J jnl
Error-resilient DNA computation.
Random Struct. Algorithms
Richard M. Karp, Claire Kenyon, Orli Waarts
1999 J jnl
Time-Lapse Snapshots.
SIAM J. Comput.
Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
1998 J jnl
Fairness in Scheduling
J. Algorithms
Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
1998 J jnl
Performing Work Efficiently in the Presence of Faults.
SIAM J. Comput.
Cynthia Dwork, Joseph Y. Halpern, Orli Waarts
1997 J jnl
Contention in shared memory algorithms.
J. ACM
Cynthia Dwork, Maurice Herlihy, Orli Waarts
1997 J jnl
On-Line Load Balancing of Temporary Tasks.
J. Algorithms
Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
1997 J jnl
On-line routing of virtual circuits with applications to load balancing and machine scheduling.
J. ACM
James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
1996 A* conf
Efficient Information Gathering on the Internet (extended abstract).
FOCS
Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts
1996 A* conf
Error-Resilient DNA Computation.
SODA
Richard M. Karp, Claire Kenyon, Orli Waarts
1996 J jnl
Linearizable Counting Networks.
Distributed Comput.
Maurice Herlihy, Nir Shavit, Orli Waarts
1996 A* conf
Modular Competitiveness for Distributed Algorithms.
STOC
James Aspnes, Orli Waarts
1996 J jnl
Randomized Consensus in Expected O(n log² n) Operations Per Processor.
SIAM J. Comput.
James Aspnes, Orli Waarts
1995 A* conf
A Modular Measure of Competitiveness for Distributed Algorithms (Abstract).
PODC
James Aspnes, Orli Waarts
1995 A* conf
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).
FOCS
Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts
1995 A* conf
Fairness in Scheduling.
SODA
Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
1995 A* conf
Improved Algorithms and Analysis for Secretary Problems and Generalizations.
FOCS
Miklós Ajtai, Nimrod Megiddo, Orli Waarts
1995 A* conf
The Bit Vector Intersection Problem (Preliminary Version).
FOCS
Richard M. Karp, Orli Waarts, Geoffrey Zweig
1994 A* conf
A Theory of Competitive Analysis for Distributed Algorithms
FOCS
Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
1994 A* conf
Competitive Routing of Virtual Circuits with Unknown Duration.
SODA
Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
1994 A* conf
Competitiveness in Distributed Algorithms.
PODC
Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
1994 J jnl
Coordinated Traversal: (t + 1)- Round Byzantine Agreement in Polynomial Time.
J. Algorithms
Yoram Moses, Orli Waarts
1993 A* conf
Bounded Round Numbers.
PODC
Cynthia Dwork, Maurice Herlihy, Orli Waarts
1993 A* conf
Contention in shared memory algorithms.
STOC
Cynthia Dwork, Maurice Herlihy, Orli Waarts
1993 A* conf
On-line load balancing with applications to machine scheduling and virtual circuit routing.
STOC
James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
1993 B conf
Online Load Balancing of Temporary Tasks.
WADS
Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
1993 J jnl
Perfectly Secure Message Transmission.
J. ACM
Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung
1992 — —
New algorithms and primitives for multi-processor coordination.
Orli Waarts
1992 A* conf
Performing Work Efficiently in the Presence of Faults.
PODC
Cynthia Dwork, Joseph Y. Halpern, Orli Waarts
1992 A* conf
Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor
FOCS
James Aspnes, Orli Waarts
1992 A* conf
Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible!
STOC
Cynthia Dwork, Orli Waarts
1992 — conf
Time-Lapse Snapshots.
ISTCS
Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
1991 A* conf
Low Contention Linearizable Counting
FOCS
Maurice Herlihy, Nir Shavit, Orli Waarts
1990 A* conf
A Characterization of Eventual Byzantine Agreement.
PODC
Joseph Y. Halpern, Yoram Moses, Orli Waarts
1990 A* conf
Perfectly Secure Message Transmission
FOCS
Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung
1988 A* conf
Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
FOCS
Yoram Moses, Orli Waarts