default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVirag Shah
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Jose H. Blanchet
, Martin I. Reiman, Virag Shah, Lawrence M. Wein, Linjia Wu:
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities. Oper. Res. 70(6): 3355-3370 (2022)- 2020
- [j11]Virag Shah, Lennart Gulikers, Laurent Massoulié, Milan Vojnovic:
Adaptive Matching for Expert Systems with Uncertain Task Types. Oper. Res. 68(5): 1403-1424 (2020) - [i10]Jose H. Blanchet, Martin I. Reiman, Virag Shah, Lawrence M. Wein:
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities. CoRR abs/2002.03205 (2020)
2010 – 2019
- 2019
- [c13]Sven Schmit, Virag Shah, Ramesh Johari:
Optimal Testing in the Experiment-rich Regime. AISTATS 2019: 626-633 - [c12]Virag Shah, Ramesh Johari, Jose H. Blanchet:
Semi-Parametric Dynamic Contextual Pricing. NeurIPS 2019: 2360-2370 - [i9]Virag Shah, Jose H. Blanchet, Ramesh Johari:
Semi-parametric dynamic contextual pricing. CoRR abs/1901.02045 (2019) - 2018
- [c11]Virag Shah, Jose H. Blanchet, Ramesh Johari:
Bandit Learning with Positive Externalities. NeurIPS 2018: 4923-4933 - [i8]Virag Shah, Jose H. Blanchet, Ramesh Johari:
Bandit Learning with Positive Externalities. CoRR abs/1802.05693 (2018) - [i7]Sven Schmit, Virag Shah, Ramesh Johari:
Optimal Testing in the Experiment-rich Regime. CoRR abs/1805.11754 (2018) - 2017
- [j10]Thomas Bonald, Céline Comte, Virag Shah, Gustavo de Veciana:
Poly-symmetry in processor-sharing systems. Queueing Syst. Theory Appl. 86(3-4): 327-359 (2017) - [c10]Virag Shah, Anne Bouillard, François Baccelli:
Delay comparison of delivery and coding policies in data clusters. Allerton 2017: 397-404 - [c9]Virag Shah, Lennart Gulikers, Laurent Massoulié, Milan Vojnovic:
Adaptive matching for expert systems with uncertain task types. Allerton 2017: 753-760 - [i6]Virag Shah, Lennart Gulikers, Laurent Massoulié, Milan Vojnovic:
Adaptive Matching for Expert Systems with Uncertain Task Types. CoRR abs/1703.00674 (2017) - [i5]Virag Shah, Anne Bouillard, François Baccelli:
Delay Comparison of Delivery and Coding Policies in Data Clusters. CoRR abs/1706.02384 (2017) - 2016
- [j9]Virag Shah, Gustavo de Veciana:
Asymptotic independence of servers' activity in queueing systems with limited resource pooling. Queueing Syst. Theory Appl. 83(1-2): 13-28 (2016) - [j8]Virag Shah, Gustavo de Veciana:
Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems. Queueing Syst. Theory Appl. 83(3-4): 361-397 (2016) - [j7]Virag Shah, Gustavo de Veciana, George Kesidis:
A Stable Approach for Routing Queries in Unstructured P2P Networks. IEEE/ACM Trans. Netw. 24(5): 3136-3147 (2016) - [i4]Thomas Bonald, Céline Comte, Virag Shah, Gustavo de Veciana:
Poly-Symmetry in Processor-Sharing Networks. CoRR abs/1610.00560 (2016) - 2015
- [j6]Virag Shah, Gustavo de Veciana:
High-Performance Centralized Content Delivery Infrastructure: Models and Asymptotics. IEEE/ACM Trans. Netw. 23(5): 1674-1687 (2015) - [c8]Virag Shah, Gustavo de Veciana:
Impact of Fairness and Heterogeneity on Delays in Large-scale Content Delivery Networks. SIGMETRICS 2015: 375-387 - 2014
- [c7]Virag Shah, Gustavo de Veciana:
Performance evaluation and asymptotics for Content Delivery Networks. INFOCOM 2014: 2607-2615 - 2013
- [j5]Virag Shah, Bikash Kumar Dey, D. Manjunath:
Network Flows for Function Computation. IEEE J. Sel. Areas Commun. 31(4): 714-730 (2013) - 2012
- [c6]Virag Shah, Gustavo de Veciana, George Kesidis:
Learning to route queries in unstructured P2P networks: Achieving throughput optimality subject to query resolution constraints. INFOCOM 2012: 2327-2335 - 2011
- [j4]Virag Shah, Neelesh B. Mehta, Dilip Bethanabhotla:
Performance of a Fast, Distributed Multiple Access Based Relay Selection Algorithm Under Imperfect Statistical Knowledge. IEEE Trans. Wirel. Commun. 10(10): 3516-3527 (2011) - [c5]Virag Shah, Bikash Kumar Dey, D. Manjunath:
Efficient Flow Allocation Algorithms for In-Network Function Computation. GLOBECOM 2011: 1-6 - [c4]Virag Shah, Bikash Kumar Dey, D. Manjunath:
Network flows for functions. ISIT 2011: 234-238 - 2010
- [j3]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Optimal timer based selection schemes. IEEE Trans. Commun. 58(6): 1814-1823 (2010) - [j2]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view. IEEE Trans. Wirel. Commun. 9(4): 1525-1535 (2010) - [j1]Virag Shah, Neelesh B. Mehta, Raymond Yim:
The Relay Selection and Transmission Trade-off in Cooperative Communication Systems. IEEE Trans. Wirel. Commun. 9(8): 2505-2515 (2010) - [c3]Virag Shah, Neelesh B. Mehta, Raymond Yim:
A Complete Characterization of an Optimal Timer Based Selection Scheme. ICC 2010: 1-5 - [i3]Virag Shah, Bikash Kumar Dey, D. Manjunath:
Network Flows for Functions. CoRR abs/1009.6057 (2010)
2000 – 2009
- 2009
- [c2]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Relay Selection and Data Transmission Throughput Tradeoff in Cooperative Systems. GLOBECOM 2009: 1-6 - [c1]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism. ICC 2009: 1-6 - [i2]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Optimal Timer Based Selection Schemes. CoRR abs/0909.1241 (2009) - [i1]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View. CoRR abs/0911.4357 (2009)
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 2024-04-25 05:56 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:
