2005 |
40 | EE | James Aspnes,
Orli Waarts:
Compositional competitiveness for distributed algorithms.
J. Algorithms 54(2): 127-151 (2005) |
2003 |
39 | EE | James Aspnes,
Orli Waarts:
Compositional competitiveness for distributed algorithms
CoRR cs.DS/0306044: (2003) |
2001 |
38 | | Baruch Awerbuch,
Yossi Azar,
Serge A. Plotkin,
Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration.
J. Comput. Syst. Sci. 62(3): 385-397 (2001) |
37 | EE | Joseph Y. Halpern,
Yoram Moses,
Orli Waarts:
A Characterization of Eventual Byzantine Agreement.
SIAM J. Comput. 31(3): 838-865 (2001) |
36 | EE | Miklós Ajtai,
Nimrod Megiddo,
Orli Waarts:
Improved Algorithms and Analysis for Secretary Problems and Generalizations.
SIAM J. Discrete Math. 14(1): 1-27 (2001) |
2000 |
35 | EE | Cynthia Dwork,
Joseph Y. Halpern,
Orli Waarts:
Performing work efficiently in the presence of faults
CoRR cs.DC/0006008: (2000) |
1999 |
34 | | Richard M. Karp,
Claire Kenyon,
Orli Waarts:
Error-resilient DNA computation.
Random Struct. Algorithms 15(3-4): 450-466 (1999) |
33 | | Cynthia Dwork,
Maurice Herlihy,
Serge A. Plotkin,
Orli Waarts:
Time-Lapse Snapshots.
SIAM J. Comput. 28(5): 1848-1874 (1999) |
1998 |
32 | | Miklós Ajtai,
James Aspnes,
Moni Naor,
Yuval Rabani,
Leonard J. Schulman,
Orli Waarts:
Fairness in Scheduling
J. Algorithms 29(2): 306-357 (1998) |
31 | EE | Cynthia Dwork,
Joseph Y. Halpern,
Orli Waarts:
Performing Work Efficiently in the Presence of Faults.
SIAM J. Comput. 27(5): 1457-1491 (1998) |
1997 |
30 | EE | James Aspnes,
Yossi Azar,
Amos Fiat,
Serge A. Plotkin,
Orli Waarts:
On-line routing of virtual circuits with applications to load balancing and machine scheduling.
J. ACM 44(3): 486-504 (1997) |
29 | EE | Cynthia Dwork,
Maurice Herlihy,
Orli Waarts:
Contention in shared memory algorithms.
J. ACM 44(6): 779-805 (1997) |
28 | | Yossi Azar,
Bala Kalyanasundaram,
Serge A. Plotkin,
Kirk Pruhs,
Orli Waarts:
On-Line Load Balancing of Temporary Tasks.
J. Algorithms 22(1): 93-110 (1997) |
1996 |
27 | | Oren Etzioni,
Steve Hanks,
Tao Jiang,
Richard M. Karp,
Omid Madani,
Orli Waarts:
Efficient Information Gathering on the Internet (extended abstract).
FOCS 1996: 234-243 |
26 | | Richard M. Karp,
Claire Kenyon,
Orli Waarts:
Error-Resilient DNA Computation.
SODA 1996: 458-467 |
25 | EE | James Aspnes,
Orli Waarts:
Modular Competitiveness for Distributed Algorithms.
STOC 1996: 237-246 |
24 | | Maurice Herlihy,
Nir Shavit,
Orli Waarts:
Linearizable Counting Networks.
Distributed Computing 9(4): 193-203 (1996) |
23 | | James Aspnes,
Orli Waarts:
Randomized Consensus in Expected O(n log² n) Operations Per Processor.
SIAM J. Comput. 25(5): 1024-1044 (1996) |
1995 |
22 | | Amos Fiat,
Yishay Mansour,
Adi Rosén,
Orli Waarts:
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).
FOCS 1995: 392-401 |
21 | | Miklós Ajtai,
Nimrod Megiddo,
Orli Waarts:
Improved Algorithms and Analysis for Secretary Problems and Generalizations.
FOCS 1995: 473-482 |
20 | | Richard M. Karp,
Orli Waarts,
Geoffrey Zweig:
The Bit Vector Intersection Problem (Preliminary Version).
FOCS 1995: 621-630 |
19 | | James Aspnes,
Orli Waarts:
A Modular Measure of Competitiveness for Distributed Algorithms (Abstract).
PODC 1995: 252 |
18 | | Miklós Ajtai,
James Aspnes,
Moni Naor,
Yuval Rabani,
Leonard J. Schulman,
Orli Waarts:
Fairness in Scheduling.
SODA 1995: 477-485 |
1994 |
17 | | Miklós Ajtai,
James Aspnes,
Cynthia Dwork,
Orli Waarts:
A Theory of Competitive Analysis for Distributed Algorithms
FOCS 1994: 401-411 |
16 | | Miklós Ajtai,
James Aspnes,
Cynthia Dwork,
Orli Waarts:
Competitiveness in Distributed Algorithms.
PODC 1994: 398 |
15 | | Baruch Awerbuch,
Yossi Azar,
Serge A. Plotkin,
Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration.
SODA 1994: 321-327 |
14 | | Yoram Moses,
Orli Waarts:
Coordinated Traversal: (t + 1)- Round Byzantine Agreement in Polynomial Time.
J. Algorithms 17(1): 110-156 (1994) |
1993 |
13 | | Cynthia Dwork,
Maurice Herlihy,
Orli Waarts:
Bounded Round Numbers.
PODC 1993: 53-64 |
12 | EE | Cynthia Dwork,
Maurice Herlihy,
Orli Waarts:
Contention in shared memory algorithms.
STOC 1993: 174-183 |
11 | EE | James Aspnes,
Yossi Azar,
Amos Fiat,
Serge A. Plotkin,
Orli Waarts:
On-line load balancing with applications to machine scheduling and virtual circuit routing.
STOC 1993: 623-631 |
10 | | Yossi Azar,
Bala Kalyanasundaram,
Serge A. Plotkin,
Kirk Pruhs,
Orli Waarts:
Online Load Balancing of Temporary Tasks.
WADS 1993: 119-130 |
9 | EE | Danny Dolev,
Cynthia Dwork,
Orli Waarts,
Moti Yung:
Perfectly Secure Message Transmission.
J. ACM 40(1): 17-47 (1993) |
1992 |
8 | | James Aspnes,
Orli Waarts:
Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor
FOCS 1992: 137-146 |
7 | | Cynthia Dwork,
Maurice Herlihy,
Serge A. Plotkin,
Orli Waarts:
Time-Lapse Snapshots.
ISTCS 1992: 154-170 |
6 | | Cynthia Dwork,
Joseph Y. Halpern,
Orli Waarts:
Performing Work Efficiently in the Presence of Faults.
PODC 1992: 91-102 |
5 | | Cynthia Dwork,
Orli Waarts:
Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible!
STOC 1992: 655-666 |
1991 |
4 | | Maurice Herlihy,
Nir Shavit,
Orli Waarts:
Low Contention Linearizable Counting
FOCS 1991: 526-535 |
1990 |
3 | | Danny Dolev,
Cynthia Dwork,
Orli Waarts,
Moti Yung:
Perfectly Secure Message Transmission
FOCS 1990: 36-45 |
2 | EE | Joseph Y. Halpern,
Yoram Moses,
Orli Waarts:
A Characterization of Eventual Byzantine Agreement.
PODC 1990: 333-346 |
1988 |
1 | | Yoram Moses,
Orli Waarts:
Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
FOCS 1988: 246-255 |