| Year |
Citation |
Score |
| 2017 |
Dwork C, Feldman V, Hardt M, Pitassi T, Reingold O, Roth A. Guilt-free data reuse Communications of the Acm. 60: 86-93. DOI: 10.1145/3051088 |
0.301 |
|
| 2015 |
Dwork C, Nikolov A, Talwar K. Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations Discrete and Computational Geometry. 53: 650-673. DOI: 10.1007/S00454-015-9678-X |
0.339 |
|
| 2007 |
Dwork C, Naor M. Zaps and their applications Siam Journal On Computing. 36: 1513-1543. DOI: 10.1137/S0097539703426817 |
0.357 |
|
| 2004 |
Chien S, Dwork C, Kumar R, Simon DR, Sivakumar D. Link Evolution: Analysis and Algorithms Internet Mathematics. 1: 277-304. DOI: 10.1080/15427951.2004.10129090 |
0.338 |
|
| 2003 |
Dwork C, Naor M, Reingold O, Stockmeyer L. Magic functions Journal of the Acm. 50: 852-921. DOI: 10.1145/950620.950623 |
0.329 |
|
| 2000 |
Dolev D, Dwork C, Naor M. Nonmalleable cryptography Siam Journal On Computing. 30: 391-437. DOI: 10.1137/S0097539795291562 |
0.307 |
|
| 1999 |
Dwork C, Waarts O. Simple and efficient bounded concurrent timestamping and the traceable use abstraction Journal of the Acm. 46: 633-666. DOI: 10.1145/324133.324161 |
0.386 |
|
| 1999 |
Dwork C, Herlihy M, Plotkin S, Waarts O. Time-lapse snapshots Siam Journal On Computing. 28: 1848-1874. DOI: 10.1137/S0097539793243685 |
0.363 |
|
| 1998 |
Dwork C, Halpern JY, Waarts O. Performing Work Efficiently in the Presence of Faults Siam Journal On Computing. 27: 1457-1491. DOI: 10.1137/S0097539793255527 |
0.318 |
|
| 1997 |
Dwork C, Herlihy M, Waarts O. Contention in shared memory algorithms Journal of the Acm. 44: 779-805. DOI: 10.1145/268999.269000 |
0.345 |
|
| 1994 |
Attiya H, Dwork C, Lynch N, Stockmeyer L. Bounds on the time to reach agreement in the presence of timing uncertainty Journal of the Acm. 41: 122-152. DOI: 10.1145/174644.174649 |
0.301 |
|
| 1993 |
Dolev D, Dwork C, Waarts O, Yung M. Perfectly secure message transmission Journal of the Acm. 40: 17-47. DOI: 10.1145/138027.138036 |
0.324 |
|
| 1992 |
Dwork C, Stockmeyer L. Finite state verifiers I: the power of interaction Journal of the Acm. 39: 800-828. DOI: 10.1145/146585.146599 |
0.308 |
|
| 1992 |
Bar-Noy A, Dolev D, Dwork C, Raymond Strong H. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement Information and Computation. 97: 205-233. DOI: 10.1016/0890-5401(92)90035-E |
0.304 |
|
| 1991 |
Coan BA, Dwork C. Simultaneity is harder than agreement Information & Computation. 91: 205-231. DOI: 10.1016/0890-5401(91)90067-C |
0.37 |
|
| 1990 |
Dwork C, Stockmeyer L. A time complexity gap for two-way probabilistic finite-state automata Siam Journal On Computing. 19: 1011-1123. DOI: 10.1137/0219069 |
0.315 |
|
| 1990 |
Dwork C, Stockmeyer L. Flipping persuasively in constant time Siam Journal On Computing. 19: 472-499. DOI: 10.1137/0219032 |
0.366 |
|
| 1990 |
Dwork C, Moses Y. Knowledge and common knowledge in a byzantine environment: crash failures Information & Computation. 88: 156-186. DOI: 10.1016/0890-5401(90)90014-9 |
0.373 |
|
| 1989 |
Coan BA, Dolev D, Dwork C, Stockmeyer L. The distributed firing squad problem Siam Journal On Computing. 18: 990-1012. DOI: 10.1137/0218068 |
0.374 |
|
| 1988 |
Dwork C, Lynch N, Stockmeyer L. Consensus in the presence of partial synchrony Journal of the Acm. 35: 288-323. DOI: 10.1145/42282.42283 |
0.374 |
|
| 1988 |
Dwork C, Peleg D, Pippenger N, Upfal E. Fault Tolerance in Networks of Bounded Degree Siam Journal On Computing. 17: 975-988. DOI: 10.1137/0217061 |
0.333 |
|
| 1988 |
Dwork C, Kanellakis PC, Stockmeyer L. Parallel algorithms for term matching Siam Journal On Computing. 17: 711-731. DOI: 10.1137/0217046 |
0.35 |
|
| 1987 |
Dolev D, Dwork C, Stockmeyer L. On the minimal synchronism needed for distributed consensus Journal of the Acm. 34: 77-97. DOI: 10.1145/7531.7533 |
0.359 |
|
| 1986 |
Cook S, Dwork C, duml R, Reischuk g. Upper and lower time bounds for parallel random access machines without simultaneous writes Siam Journal On Computing. 15: 87-97. DOI: 10.1137/0215006 |
0.383 |
|
| Show low-probability matches. |