Citation:
Chung, Kai-Min, Michael Mitzenmacher, and Salil Vadhan. “When simple hash functions suffice.” In Beyond the Worst-Case Analysis of Algorithms (Tim Roughgarden, ed.). Cambridge, UK: Cambridge University Press, 2021.
See also: Surveys
Salil Vadhan
Vicky Joseph Professor of Computer Science and Applied Mathematics
This portion of the site is new and papers are still being added.
For a more complete list of my publications, please see my former site, Digital Access to Scholarship at Harvard (DASH), the DBLP Computer Science Bibliography, the Privacy Tools Project, and/or my CV.
Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder. Also, some of these works have been submitted for publication. Copyright may be transferred without further notice and this version may no longer be accessible.
Search Publications
Search by Grant
- A Unified Theory of Pseudorandomness (NSF CCF-0133096) (17)
- Alfred P. Sloan Research Fellowship (11)
- Applying Theoretical Advances in Privacy to Computational Social Science Practice (Sloan Foundation) (9)
- Computational Entropy (NSF CCF-1116616) (10)
- Computational Notions of Entropy and Cryptographic Applications (US-Israel Binational Science Foundation; BSF 2010196) (5)
- Computing Over Distributed Sensitive Data (NSF CNS-1565387) (2)
- Exploiting Opportunities in Pseudorandomness (NSF CCF-1763299) (10)
- Formal Privacy Models and Title 13 (Census Cooperative Agreement CB16ADR0160001) (3)
- Guggenheim Fellowship (7)
- ITR: Information Theoretic Secure Hyper-Encryption and Protocols (NSF CNS-0205423) (3)
- Identifying Opportunities in Pseudorandomness (NSF CCF-1749750) (1)
- Incentive-Compatible Machine Learning (NSF CCF-0915016) (2)
- Miller Institute for Basic Research in Science (1)
- New Complexity-Theoretic Techniques in Cryptography (NSF CNS-0430336) (11)
- Privacy Tools for Sharing Research Data (NSF CNS-1237235) (19)
- Privacy for Social Science Research (Gift from Google, Inc.) (8)
- Pseudorandomness and Applications (ONR Young Investigator Award; ONR Grant N00014-04-1-0478) (18)
- Pseudorandomness and Combinatorial Constructions (US-Israel Binational Science Foundation; BSF 2002246) (18)
- Pseudorandomness for Space-Bounded Computation and Cryptography (NSF CCF-1420938) (2)
- Radcliffe Institute Research Fellowship
Copyright © 2024 The President and Fellows of Harvard College | Accessibility | Digital Accessibility | Report Copyright Infringement