| Consensus in the presence of partial synchrony C Dwork, N Lynch, L Stockmeyer Journal of the ACM (JACM) 35 (2), 288-323, 1988 | 2530 | 1988 |
| Consensus in the presence of partial synchrony C Dwork, N Lynch, L Stockmeyer Journal of the ACM (JACM) 35 (2), 288-323, 1988 | 2530 | 1988 |
| On the minimal synchronism needed for distributed consensus D Dolev, C Dwork, L Stockmeyer Journal of the ACM (JACM) 34 (1), 77-97, 1987 | 972 | 1987 |
| Concentrated differential privacy C Dwork, GN Rothblum arXiv preprint arXiv:1603.01887, 2016 | 539 | 2016 |
| Upper and lower time bounds for parallel random access machines without simultaneous writes S Cook, C Dwork, R Reischuk SIAM Journal on Computing 15 (1), 87-97, 1986 | 434 | 1986 |
| Preserving statistical validity in adaptive data analysis C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, AL Roth Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 394 | 2015 |
| Toward privacy in public databases S Chawla, C Dwork, F McSherry, A Smith, H Wee Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005 …, 2005 | 385 | 2005 |
| Knowledge and common knowledge in a Byzantine environment: crash failures C Dwork, Y Moses Information and Computation 88 (2), 156-186, 1990 | 344 | 1990 |
| Knowledge and common knowledge in a Byzantine environment: crash failures C Dwork, Y Moses Information and Computation 88 (2), 156-186, 1990 | 344 | 1990 |
| On the sequential nature of unification C Dwork, PC Kanellakis, JC Mitchell The Journal of Logic Programming 1 (1), 35-50, 1984 | 310 | 1984 |
| Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement A Bar-Noy, D Dolev, C Dwork, HR Strong Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed …, 1987 | 217 | 1987 |
| Fault tolerance in networks of bounded degree C Dwork, D Peleg, N Pippenger, E Upfal Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986 | 203 | 1986 |
| Robust traceability from trace amounts C Dwork, A Smith, T Steinke, J Ullman, S Vadhan 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 650-669, 2015 | 190 | 2015 |
| Bounds on the time to reach agreement in the presence of timing uncertainty H Attiya, C Dwork, N Lynch, L Stockmeyer Journal of the ACM (JACM) 41 (1), 122-152, 1994 | 157 | 1994 |
| A time complexity gap for two-way probabilistic finite-state automata C Dwork, L Stockmeyer SIAM Journal on Computing 19 (6), 1011-1023, 1990 | 133 | 1990 |
| Pebbling and proofs of work C Dwork, M Naor, H Wee Advances in Cryptology–CRYPTO 2005: 25th Annual International Cryptology …, 2005 | 131 | 2005 |
| Performing Work Efficiently in the Presence of Faults OW Cynthia Dwork, Joseph Y. Halpern PODC, 91-102, 1992 | 107* | 1992 |
| Bounds on the time for parallel RAM's to compute simple functions S Cook, C Dwork Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982 | 106 | 1982 |
| Superconcentrators, generalizers and generalized connectors with limited depth D Dolev, C Dwork, N Pippenger, A Wigderson Proceedings of the fifteenth annual ACM Symposium on Theory of Computing, 42-51, 1983 | 101 | 1983 |
| The inherent cost of nonblocking commitment C Dwork, D Skeen Proceedings of the second annual ACM symposium on Principles of distributed …, 1983 | 70 | 1983 |
