Varsha Dani
Orcid: 0009-0008-1651-1987
According to our database1,
Varsha Dani
authored at least 46 papers
between 2004 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Theor. Comput. Sci., 2024
Eur. J. Comb., 2024
Proceedings of the IEEE International Symposium on Safety Security Rescue Robotics, 2024
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024
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
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
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
Proceedings of the Approximation, 2021
2020
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020
Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020
2019
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019
2018
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018
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
2016
Random Struct. Algorithms, 2016
2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
2014
Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014
Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, 2014
2013
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
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012
2011
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2008
Proceedings of the 21st Annual Conference on Learning Theory, 2008
Proceedings of the 21st Annual Conference on Learning Theory, 2008
2007
Proceedings of the Advances in Neural Information Processing Systems 20, 2007
2006
SIGACT News, 2006
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
Proceedings of the Machine Learning, 2005
2004