| Publication | Date of Publication | Type |
|---|
Instance-optimal information-based voting
Theoretical Computer Science | 2024-12-12 | Paper |
On additive approximate submodularity
Theoretical Computer Science | 2022-06-13 | Paper |
On the Complexity of Sampling Vertices Uniformly from a Graph
| 2021-07-28 | Paper |
On Additive Approximate Submodularity
| 2020-10-06 | Paper |
How to schedule a cascade in an arbitrary graph
SIAM Journal on Computing | 2020-05-31 | Paper |
Learning entangled single-sample Gaussians
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Voting with limited information and many alternatives
| 2019-05-10 | Paper |
LSH-preserving functions and their applications
| 2019-05-10 | Paper |
On the Distortion of Locality Sensitive Hashing
SIAM Journal on Computing | 2019-05-07 | Paper |
Rumor spreading and conductance
Journal of the ACM | 2018-12-06 | Paper |
LSH-preserving functions and their applications
Journal of the ACM | 2018-08-02 | Paper |
The distortion of locality sensitive hashing
| 2018-05-03 | Paper |
Discrete choice, permutations, and reconstruction
| 2018-03-15 | Paper |
On discrete preferences and coordination
Journal of Computer and System Sciences | 2017-12-21 | Paper |
Designing Floating Codes for Expected Performance
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On learning mixture models for permutations
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
On reconstructing a hidden permutation
| 2017-03-22 | Paper |
Voting with Limited Information and Many Alternatives
SIAM Journal on Computing | 2015-02-09 | Paper |
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Markov Layout
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Models for the Compressible Web
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Finding the Jaccard median
| 2014-05-22 | Paper |
Rumour spreading and graph conductance
| 2014-05-22 | Paper |
The complexity of LSH feasibility
Theoretical Computer Science | 2014-03-27 | Paper |
Models for the Compressible Web
SIAM Journal on Computing | 2014-02-04 | Paper |
Rumor spreading in social networks
Theoretical Computer Science | 2011-06-07 | Paper |
The local nature of list colorings for graphs of high girth
SIAM Journal on Computing | 2011-01-17 | Paper |
Pictures from Mongolia. Extracting the top elements from a partially ordered set
Theory of Computing Systems | 2009-08-06 | Paper |
Rumor Spreading in Social Networks
Automata, Languages and Programming | 2009-07-14 | Paper |
The Local Nature of List Colorings for Graphs of High Girth
Automata, Languages and Programming | 2008-08-28 | Paper |
Pictures from Mongolia – Partial Sorting in a Partial World
Lecture Notes in Computer Science | 2007-11-15 | Paper |
