Simple and efficient bounded concurrent timestamping and the traceable use abstraction
- Cynthia Dwork
- Orli Waarts
- 1999
- Journal of the ACM
Publications
Date
Featured collections
Popular topics
17 results for Orli Waarts
On-line routing of virtual circuits with applications to load balancing and machine scheduling
- James Aspnes
- Yossi Azar
- et al.
- 1997
- Journal of the ACM
Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!
- Cynthia Dwork
- Orli Waarts
- 1992
- STOC 1992
Improved algorithms and analysis for secretary problems and generalizations
- Miklos Ajtai
- Nimrod Megiddo
- et al.
- 1995
- FOCS 1995
Fairness in scheduling
- Miklos Ajtai
- James Aspnes
- et al.
- 1995
- SODA 1995
A theory of competitive analysis for distributed algorithms
- Miklos Ajtai
- James Aspnes
- et al.
- 1994
- FOCS 1994
Bounded round numbers
- Cynthia Dwork
- Maurice Herlihy
- et al.
- 1993
- PODC 1993
Contention in shared memory algorithms
- Cynthia Dwork
- Maurice Herlihy
- et al.
- 1993
- STOC 1993
On-line load balancing with applications to machine scheduling and virtual circuit routing
- James Aspnes
- Yossi Azar
- et al.
- 1993
- STOC 1993
Randomized consensus in expected O(n log2 n) operations per processor
- James Aspnes
- Orli Waarts
- 1992
- FOCS 1992