default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVarsha Dani
- > Home > Persons > Varsha Dani
Publications
- 2024
[j10]Varsha Dani
, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. Eur. J. Comb. 121: 103842 (2024)- [c28]Varsha Dani, Thomas P. Hayes, Seth Pettie, Jared Saia:
Fraud Detection for Random Walks. ITCS 2024: 36:1-36:22 - [c27]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes:
Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. PODC 2024: 412-415 - [i22]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes:
Low-Distortion Clustering in Bounded Growth Graphs. CoRR abs/2405.05132 (2024) - 2023
- [j8]Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks. Distributed Comput. 36(3): 373-384 (2023) - 2022
- [c25]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Improved Reconstruction of Random Geometric Graphs. ICALP 2022: 48:1-48:17 - [c24]Varsha Dani, Thomas P. Hayes:
How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. DISC 2022: 16:1-16:22 - [i21]Varsha Dani, Thomas P. Hayes:
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. CoRR abs/2205.12830 (2022) - 2021
- [c23]Varsha Dani, Diksha Gupta, Thomas P. Hayes:
On the Power of Choice for k-Colorability of Random Graphs. APPROX-RANDOM 2021: 59:1-59:17 - [c22]Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks. PODC 2021: 151-153 - [c21]Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks. DISC 2021: 19:1-19:14 - [i20]Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks. CoRR abs/2104.09096 (2021) - [i19]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Improved Reconstruction of Random Geometric Graphs. CoRR abs/2107.14323 (2021) - 2020
- [c20]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
A Scalable Algorithm for Multiparty Interactive Communication with Private Channels. ICDCN 2020: 8:1-8:15 - [c19]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie:
The Energy Complexity of BFS in Radio Networks. PODC 2020: 273-282 - [i18]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie:
The Energy Complexity of BFS in Radio Networks. CoRR abs/2007.09816 (2020) - 2019
- [c18]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
Multiparty Interactive Communication with Private Channels. PODC 2019: 147-149 - 2018
- [j7]Varsha Dani, Thomas P. Hayes, Mahnush Movahedi, Jared Saia, Maxwell Young:
Interactive communication with unknown noise rate. Inf. Comput. 261: 464-486 (2018) - [c16]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
Sending a Message with Unknown Noise. ICDCN 2018: 8:1-8:10 - [c15]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie:
The Energy Complexity of Broadcast. PODC 2018: 95-104 - 2017
- [i16]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie:
The Energy Complexity of Broadcast. CoRR abs/1710.01800 (2017) - [i15]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
Distributed Computing with Channel Noise. IACR Cryptol. ePrint Arch. 2017: 710 (2017) - 2016
- [j5]Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell:
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem. Random Struct. Algorithms 49(4): 742-765 (2016) - [i13]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
Secure one-way interactive communication. CoRR abs/1605.04486 (2016) - [i12]Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell:
Codes, Lower Bounds, and Phase Transitions in the Symmetric Rendezvous Problem. CoRR abs/1609.01582 (2016) - [i11]Abhinav Aggarwal, Varsha Dani, Nico Döttling, Thomas P. Hayes, Jared Saia:
Secure Multiparty Interactive Communication with Unknown Noise Rate. CoRR abs/1612.05943 (2016) - 2013
- [c11]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
The Power of Choice for Random Satisfiability. APPROX-RANDOM 2013: 484-496 - 2012
- [i5]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
The Power of Choice for Random Satisfiability. CoRR abs/1211.6997 (2012) - 2008
- [c6]Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, Sham M. Kakade, Alexander Rakhlin, Ambuj Tewari:
High-Probability Regret Bounds for Bandit Online Linear Optimization. COLT 2008: 335-342 - [c5]Varsha Dani, Thomas P. Hayes, Sham M. Kakade:
Stochastic Linear Optimization under Bandit Feedback. COLT 2008: 355-366 - 2007
- [c4]Varsha Dani, Thomas P. Hayes, Sham M. Kakade:
The Price of Bandit Information for Online Optimization. NIPS 2007: 345-352 - 2006
- [c3]Varsha Dani, Thomas P. Hayes:
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. SODA 2006: 937-943 - [i2]Varsha Dani, Thomas P. Hayes:
How to Beat the Adaptive Multi-Armed Bandit. CoRR abs/cs/0602053 (2006) - 2005
- [c1]Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford, Bianca Zadrozny:
Error limiting reductions between classification tasks. ICML 2005: 49-56 - 2004
- [i1]Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford:
Reductions Between Classification Tasks. Electron. Colloquium Comput. Complex. TR04 (2004)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
