Skip to main content

Search

Reset

Add filters:

Use filters to refine the search results.

 | 
Item hits:
Publication DateArticle TitleAuthor(s)
2018The menu complexity of “one-and-a-half-dimensional” mechanism designSaxena, Raghuvansh R; Schvartzman, Ariel; Weinberg, S Matthew
Dec-2018Cutting-edge cryptography through the lens of secret sharingKomargodski, Ilan; Zhandry, Mark
2018The Sample Complexity of Up-to-ε Multi-Dimensional Revenue MaximizationGonczarowski, Yannai A; Weinberg, S Matthew
2016How to Generate and Use Universal SamplersHofheinz, Dennis; Jager, Tibor; Khurana, Dakshita; Sahai, Amit; Waters, Brent, et al
2018Communication-computation efficient gradient codingYe, M; Abbe, Emmanuel
2019Efficient Verification of Network Fault Tolerance via Counterexample-Guided RefinementGiannarakis, Nick; Beckett, Ryan; Mahajan, Ratul; Walker, David
12Conditional random fields, planted constraint satisfaction, and entropy concentrationAbbe, Emmanuel; Montanari, A
2014A new entropy power inequality for integer-valued random variablesHaghighatshoar, S; Abbe, Emmanuel; Telatar, IE
Nov-2019Don't mind the gap: Bridging network-wide objectives and device-level configurations: brief reflections on abstractions for network programmingBeckett, Ryan; Mahajan, Ratul; Millstein, Todd; Padhye, Jitendra; Walker, David
Sep-2011Forest: a language and toolkit for programming with filestoresFisher, Kathleen; Foster, Nate; Walker, David; Zhu, Kenny Q