Reductions Between Classification Tasks - Alina Beygelzimer; Varsha Dani; Thomas P. Hayes; John Langford 001 (Electron. Colloquium Comput. Complex., 2004)

Error limiting reductions between classification tasks. - Alina Beygelzimer; Varsha Dani; Thomas P. Hayes; John Langford 001; Bianca Zadrozny (ICML, 2005)

Allocating indivisible goods. - Ivona Bezáková; Varsha Dani (SIGecom Exch., 2005)

Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. - Varsha Dani; Thomas P. Hayes (SODA, 2006)

An Empirical Comparison of Algorithms for Aggregating Expert Predictions. - Varsha Dani; Omid Madani; David M. Pennock; Sumit K. Sanghai; Brian Galebach (UAI, 2006)

How to Beat the Adaptive Multi-Armed Bandit - Varsha Dani; Thomas P. Hayes (CoRR, 2006)

Review of "Fair Division and Collective Welfare by Hervé Moulin", MIT Press, 2003. - Varsha Dani (SIGACT News, 2006)

The Price of Bandit Information for Online Optimization. - Varsha Dani; Thomas P. Hayes; Sham M. Kakade (NIPS, 2007)

High-Probability Regret Bounds for Bandit Online Linear Optimization. - Peter L. Bartlett; Varsha Dani; Thomas P. Hayes; Sham M. Kakade; Alexander Rakhlin; Ambuj Tewari (COLT, 2008)

Stochastic Linear Optimization under Bandit Feedback. - Varsha Dani; Thomas P. Hayes; Sham M. Kakade (COLT, 2008)

Independent Sets in Random Graphs from the Weighted Second Moment Method. - Varsha Dani; Cristopher Moore (APPROX-RANDOM, 2011)

Scalable rational secret sharing. - Varsha Dani; Mahnush Movahedi; Yamel Rodriguez; Jared Saia (PODC, 2011)

Tight Bounds on the Threshold for Permuted k-Colorability. - Varsha Dani; Cristopher Moore; Anna Olson (APPROX-RANDOM, 2012)

Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary. - Varsha Dani; Valerie King; Mahnush Movahedi; Jared Saia (PODC, 2012)

Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary - Varsha Dani; Valerie King; Mahnush Movahedi; Jared Saia (CoRR, 2012)

The Power of Choice for Random Satisfiability. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (APPROX-RANDOM, 2013)

Resource-competitive error correction. - Varsha Dani (FOMC, 2014)

Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation. - Varsha Dani; Valerie King; Mahnush Movahedi; Jared Saia (ICDCN, 2014)

Interactive Communication with Unknown Noise Rate. - Varsha Dani; Mahnush Movahedi; Jared Saia; Maxwell Young (ICALP (2), 2015)

Scalable mechanisms for rational secret sharing. - Varsha Dani; Mahnush Movahedi; Jared Saia (Distributed Comput., 2015)

Resource-Competitive Algorithms. - Michael A. Bender; Jeremy T. Fineman; Mahnush Movahedi; Jared Saia; Varsha Dani; Seth Gilbert; Seth Pettie; Maxwell Young (SIGACT News, 2015)

Secure Multiparty Interactive Communication with Unknown Noise Rate. - Abhinav Aggarwal; Varsha Dani; Nico Döttling; Thomas P. Hayes; Jared Saia (CoRR, 2016)

Secure one-way interactive communication. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (CoRR, 2016)

Codes, lower bounds, and phase transitions in the symmetric rendezvous problem. - Varsha Dani; Thomas P. Hayes; Cristopher Moore; Alexander Russell (Random Struct. Algorithms, 2016)

Phase transitions in the $q$-coloring of random hypergraphs. - Marylou Gabrié; Varsha Dani; Guilhem Semerjian; Lenka Zdeborová (CoRR, 2017)

Secure multi-party computation in large networks. - Varsha Dani; Valerie King; Mahnush Movahedi; Jared Saia; Mahdi Zamani (Distributed Comput., 2017)

Distributed Computing with Channel Noise. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (IACR Cryptol. ePrint Arch., 2017)

Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections. - Umang Bhaskar; Varsha Dani; Abheek Ghosh (AAAI, 2018)

Sending a Message with Unknown Noise. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (ICDCN, 2018)

The Energy Complexity of Broadcast. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes; Qizheng He; Wenzheng Li; Seth Pettie (PODC, 2018)

Interactive communication with unknown noise rate. - Varsha Dani; Thomas P. Hayes; Mahnush Movahedi; Jared Saia; Maxwell Young (Inf. Comput., 2018)

Multiparty Interactive Communication with Private Channels. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (PODC, 2019)

A Scalable Algorithm for Multiparty Interactive Communication with Private Channels. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (ICDCN, 2020)

The Energy Complexity of BFS in Radio Networks. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes; Seth Pettie (PODC, 2020)

On the Power of Choice for k-Colorability of Random Graphs. - Varsha Dani; Diksha Gupta; Thomas P. Hayes (APPROX-RANDOM, 2021)

Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks. - Varsha Dani; Aayush Gupta; Thomas P. Hayes; Seth Pettie (PODC, 2021)

Improved Reconstruction of Random Geometric Graphs. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (ICALP, 2022)

How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. - Varsha Dani; Thomas P. Hayes (DISC, 2022)

Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks. - Varsha Dani; Aayush Gupta; Thomas P. Hayes; Seth Pettie (Distributed Comput., 2023)

Fraud Detection for Random Walks. - Varsha Dani; Thomas P. Hayes; Seth Pettie; Jared Saia (ITCS, 2024)

Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes (PODC, 2024)

Navigating the Edge: UAS Boundary Tracing for Efficient Volcanic Plume Monitoring. - John Ericksen; Abir Islam; Carter Frost; Kevin Aubert; G. Matthew Fricke; Varsha Dani; Rafael Fierro; Tobias Fischer 007; Scott Nowicki; Jared Saia; Melanie E. Moses (SSRR, 2024)

Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (Eur. J. Comb., 2024)

Boundary sketching with asymptotically optimal distance and rotation. - Varsha Dani; Abir Islam; Jared Saia (Theor. Comput. Sci., 2024)

Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks. - Dominick Banasik; Varsha Dani; Fabien Dufoulon; Aayush Gupta; Thomas P. Hayes; Gopal Pandurangan (PODC, 2025)

Low-Distortion Clustering in Bounded Growth Graphs. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes (SIROCCO, 2025)

A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs. - Varsha Dani; Thomas P. Hayes (SODA, 2025)