Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!
- Cynthia Dwork
- Orli Waarts
- 1992
- STOC 1992
Publications
Date
Featured collections
Popular topics
14 results at STOC 1992
Exponential determinization for ω-automata with strong-fairness acceptance condition
- Shmuel Safra
- 1992
- STOC 1992
Asymptotic conditional probabilities for first-order logic
- Adam J. Grove
- Joseph Y. Halpern
- et al.
- 1992
- STOC 1992
On the hardness of computing the permanent of random matrices
- Uriel Feige
- Carsten Lund
- 1992
- STOC 1992
Balanced matroids
- Tomás Feder
- Milena Mihail
- 1992
- STOC 1992
Making zero-knowledge provers efficient
- Mihir Bellare
- Erez Petrankt
- 1992
- STOC 1992
Fully dynamic planarity testing
- Zvi Galil
- Giuseppe F. Italiano
- et al.
- 1992
- STOC 1992
Communication complexity of secure computation
- Matthew Franklin
- Moti Yung
- 1992
- STOC 1992
Efficient program transformations for resilient parallel computation via randomization
- Z.M. Kedem
- Krishna V. Palem
- et al.
- 1992
- STOC 1992
A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension
- Miklos Ajtai
- Nimrod Megiddo
- 1992
- STOC 1992