Varsha Dani

According to our database1, Varsha Dani authored at least 41 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fraud Detection for Random Walks.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks.
Distributed Comput., September, 2023

Boundary Sketching with Asymptotically Optimal Distance and Rotation.
Proceedings of the Structural Information and Communication Complexity, 2023

2022
How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Improved Reconstruction of Random Geometric Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

On the Power of Choice for k-Colorability of Random Graphs.
Proceedings of the Approximation, 2021

2020
The Energy Complexity of BFS in Radio Networks.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

A Scalable Algorithm for Multiparty Interactive Communication with Private Channels.
Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019
Multiparty Interactive Communication with Private Channels.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018
Interactive communication with unknown noise rate.
Inf. Comput., 2018

The Energy Complexity of Broadcast.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Sending a Message with Unknown Noise.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Distributed Computing with Channel Noise.
IACR Cryptol. ePrint Arch., 2017

Secure multi-party computation in large networks.
Distributed Comput., 2017

Phase transitions in the $q$-coloring of random hypergraphs.
CoRR, 2017

2016
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem.
Random Struct. Algorithms, 2016

Secure one-way interactive communication.
CoRR, 2016

Secure Multiparty Interactive Communication with Unknown Noise Rate.
CoRR, 2016

2015
Resource-Competitive Algorithms.
SIGACT News, 2015

Scalable mechanisms for rational secret sharing.
Distributed Comput., 2015

Interactive Communication with Unknown Noise Rate.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation.
Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

Resource-competitive error correction.
Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, 2014

2013
The Power of Choice for Random Satisfiability.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary
CoRR, 2012

Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Tight Bounds on the Threshold for Permuted k-Colorability.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Scalable rational secret sharing.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Independent Sets in Random Graphs from the Weighted Second Moment Method.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2008
Stochastic Linear Optimization under Bandit Feedback.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

High-Probability Regret Bounds for Bandit Online Linear Optimization.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007
The Price of Bandit Information for Online Optimization.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

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

How to Beat the Adaptive Multi-Armed Bandit
CoRR, 2006

An Empirical Comparison of Algorithms for Aggregating Expert Predictions.
Proceedings of the UAI '06, 2006

Robbing the bandit: less regret in online geometric optimization against an adaptive adversary.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Allocating indivisible goods.
SIGecom Exch., 2005

Error limiting reductions between classification tasks.
Proceedings of the Machine Learning, 2005

2004
Reductions Between Classification Tasks
Electron. Colloquium Comput. Complex., 2004


  Loading...