A theory of competitive analysis for distributed algorithms
- Miklos Ajtai
- James Aspnes
- et al.
- 1994
- FOCS 1994
Publications
Date
Featured collections
Popular topics
43 results for Cynthia Dwork
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
- Hagit Attiya
- Cynthia Dwork
- et al.
- 1994
- Journal of the ACM (JACM)
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
Perfectly Secure Message Transmission
- Danny Dolev
- Cynthia Dwork
- et al.
- 1993
- Journal of the ACM (JACM)
Performing work efficiently in the presence of faults
- Cynthia Dwork
- Joseph Y. Halpern
- et al.
- 1992
- PODC 1992
Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!
- Cynthia Dwork
- Orli Waarts
- 1992
- STOC 1992
Finite State Verifiers I: The Power of Interaction
- Cynthia Dwork
- Larry Stockmeyer
- 1992
- Journal of the ACM
Finite State Verifiers II: Zero Knowledge
- Cynthia Dwork
- Larry Stockmeyer
- 1992
- Journal of the ACM
Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- Amotz Bar-Noy
- Danny Dolev
- et al.
- 1992
- Information and Computation