default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVishwaraj Doshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Jie Hu
, Vishwaraj Doshi, Do Young Eun:
Minimizing File Transfer Time in Opportunistic Spectrum Access Model. IEEE Trans. Mob. Comput. 23(1): 630-644 (2024)- [c10]Jie Hu, Vishwaraj Doshi, Do Young Eun:
Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applications. AISTATS 2024: 1477-1485 - [c9]Jie Hu, Vishwaraj Doshi, Do Young Eun:
Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks. ICLR 2024 - [c8]Shailaja Mallick, Vishwaraj Doshi, Do Young Eun:
Keeping Up with the Winner! Targeted Advertisement to Communities in Social Networks. ICWSM 2024: 1013-1026 - [c7]Vishwaraj Doshi, Jie Hu, Do Young Eun:
Self-Repellent Random Walks on General Graphs - Achieving Minimal Sampling Variance via Nonlinear Markov Chains (Extended Abstract). IJCAI 2024: 8394-8398 - [i10]Jie Hu, Vishwaraj Doshi, Do Young Eun:
Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applications. CoRR abs/2401.09339 (2024) - [i9]Jie Hu, Vishwaraj Doshi, Do Young Eun:
Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks. CoRR abs/2401.09665 (2024) - [i8]Shailaja Mallick, Vishwaraj Doshi, Do Young Eun:
Keeping Up With the Winner! Targeted Advertisement to Communities in Social Networks. CoRR abs/2403.19903 (2024) - 2023
- [j2]Vishwaraj Doshi, Shailaja Mallick, Do Young Eun:
Convergence of Bi-Virus Epidemic Models With Non-Linear Rates on Networks - A Monotone Dynamical Systems Approach. IEEE/ACM Trans. Netw. 31(3): 1187-1201 (2023) - [c6]Vishwaraj Doshi, Jie Hu, Do Young Eun:
Self-Repellent Random Walks on General Graphs - Achieving Minimal Sampling Variance via Nonlinear Markov Chains. ICML 2023: 8403-8423 - [i7]Vishwaraj Doshi, Jie Hu, Do Young Eun:
Self-Repellent Random Walks on General Graphs - Achieving Minimal Sampling Variance via Nonlinear Markov Chains. CoRR abs/2305.05097 (2023) - 2022
- [c5]Vishwaraj Doshi, Jie Hu, Do Young Eun:
Bi-SIS Epidemics on Graphs - Quantitative Analysis of Coexistence Equilibria. CDC 2022: 5608-5613 - [c4]Jie Hu, Vishwaraj Doshi, Do Young Eun:
Efficiency Ordering of Stochastic Gradient Descent. NeurIPS 2022 - [i6]Vishwaraj Doshi, Jie Hu, Do Young Eun:
Bi-SIS Epidemics on Graphs - Quantitative Analysis of Coexistence Equilibria. CoRR abs/2209.07304 (2022) - [i5]Jie Hu, Vishwaraj Doshi, Do Young Eun:
Efficiency Ordering of Stochastic Gradient Descent. CoRR abs/2209.07446 (2022) - [i4]Jie Hu, Vishwaraj Doshi, Do Young Eun:
Minimizing File Transfer Time in Opportunistic Spectrum Access Model. CoRR abs/2210.02557 (2022) - [i3]Vishwaraj Doshi, Shailaja Mallick, Do Young Eun:
Convergence of Bi-Virus Epidemic Models with Non-Linear Rates on Networks - A Monotone Dynamical Systems Approach. CoRR abs/2210.05083 (2022) - 2021
- [c3]Vishwaraj Doshi, Shailaja Mallick, Do Young Eun:
Competing Epidemics on Graphs - Global Convergence and Coexistence. INFOCOM 2021: 1-10 - [c2]Jie Hu, Vishwaraj Doshi, Do Young Eun:
Opportunistic Spectrum Access: Does Maximizing Throughput Minimize File Transfer Time? WiOpt 2021: 25-32 - [i2]Vishwaraj Doshi, Shailaja Mallick, Do Young Eun:
Competing Epidemics on Graphs - Global Convergence and Coexistence. CoRR abs/2104.10872 (2021) - [i1]Jie Hu, Vishwaraj Doshi, Do Young Eun:
Opportunistic Spectrum Access: Does Maximizing Throughput Minimize File Transfer Time? CoRR abs/2109.11624 (2021) - 2020
- [j1]Vishwaraj Doshi, Do Young Eun:
Fiedler Vector Approximation via Interacting Random Walks. Proc. ACM Meas. Anal. Comput. Syst. 4(1): 01:1-01:28 (2020) - [c1]Vishwaraj Doshi, Do Young Eun:
Fiedler Vector Approximation via Interacting Random Walks. SIGMETRICS (Abstracts) 2020: 101-102
Coauthor Index
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 2025-01-09 12:47 CET 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:
