default search action
Abhay Parekh
Person information
- affiliation: University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Vijay Kamble
, Nihar B. Shah, David Marn, Abhay Parekh, Kannan Ramchandran:
The Square Root Agreement Rule for Incentivizing Truthful Feedback on Online Platforms. Manag. Sci. 69(1): 377-403 (2023)
2010 – 2019
- 2019
- [c10]Sinho Chewi, Forest Yang, Avishek Ghosh, Abhay Parekh, Kannan Ramchandran:
Matching Observations to Distributions: Efficient Estimation via Sparsified Hungarian Algorithm. Allerton 2019: 368-375 - 2018
- [i6]Sinho Chewi, Forest Yang, Avishek Ghosh, Abhay Parekh, Kannan Ramchandran:
Online Absolute Ranking with Partial Information: A Bipartite Graph Matching Approach. CoRR abs/1806.06766 (2018) - 2016
- [j10]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. J. Mach. Learn. Res. 17: 58:1-58:47 (2016) - 2015
- [c9]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. AISTATS 2015 - [i5]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. CoRR abs/1505.01462 (2015) - [i4]Vijay Kamble, Nihar B. Shah, David Marn, Abhay Parekh, Kannan Ramchandran:
Truth Serums for Massively Crowdsourced Evaluation Tasks. CoRR abs/1507.07045 (2015) - 2014
- [b2]Abhay Parekh, Jean C. Walrand:
Sharing Network Resources. Synthesis Lectures on Communication Networks, Morgan & Claypool Publishers 2014, ISBN 978-3-031-79265-6 - [i3]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
When is it Better to Compare than to Score? CoRR abs/1406.6618 (2014) - 2013
- [j9]Jean C. Walrand, Abhay K. Parekh:
Congestion Control, Routing and Scheduling in Communication Networks: A Tutorial. IEICE Trans. Commun. 96-B(11): 2714-2723 (2013) - [c8]Kohei Sugiyama, Takeshi Kubo, Atsushi Tagami, Abhay Parekh:
Incentive mechanism for DTN-based message delivery services. GLOBECOM 2013: 3108-3113 - [c7]Kangwook Lee, Lisa Yan, Abhay Parekh, Kannan Ramchandran:
A VoD System for Massively Scaled, Heterogeneous Environments: Design and Implementation. MASCOTS 2013: 1-10 - 2012
- [c6]Kangwook Lee, Hao Zhang, Ziyu Shao, Minghua Chen
An optimized distributed video-on-demand streaming system: Theory and design. Allerton Conference 2012: 1347-1354 - 2011
- [c5]David Hausheer, Abhay Parekh, Jean C. Walrand, Galina Schwartz:
Towards a compelling new Internet platform. Integrated Network Management 2011: 1224-1227 - 2010
- [j8]Guy Bresler, Abhay Parekh, David N. C. Tse:
The approximate capacity of the many-to-one and one-to-many Gaussian interference channels. IEEE Trans. Inf. Theory 56(9): 4566-4592 (2010) - [i2]Hao Zhang, Minghua Chen, Abhay Parekh, Kannan Ramchandran:
An Adaptive Multi-channel P2P Video-on-Demand System using Plug-and-Play Helpers. CoRR abs/1011.5469 (2010)
2000 – 2009
- 2008
- [i1]Guy Bresler, Abhay Parekh, David Tse:
The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels. CoRR abs/0809.3554 (2008) - 2007
- [j7]Raúl H. Etkin, Abhay Parekh, David Tse:
Spectrum sharing for unlicensed bands. IEEE J. Sel. Areas Commun. 25(3): 517-528 (2007)
1990 – 1999
- 1999
- [j6]Israel Cidon, Tony Hsiao, Asad Khamisy, Abhay K. Parekh, Raphael Rom, Moshe Sidi:
OPENET: an open and efficient control platform for ATM networks[1]This work was performed in and sponsored by Sun Microsystems Labs. J. High Speed Networks 8(3): 195-210 (1999) - 1998
- [c4]Israel Cidon, Tony Hsiao, Asad Khamisy, Abhay K. Parekh, Raphael Rom, Moshe Sidi:
OPENET: An Open and Efficient Control Platform for ATM Networks. INFOCOM 1998: 824-831 - 1997
- [j5]Leonidas Georgiadis, Roch Guérin, Abhay K. Parekh:
Optimal multiplexing on a single link: delay and buffer requirements. IEEE Trans. Inf. Theory 43(5): 1518-1535 (1997) - 1994
- [j4]Abhay K. Parekh:
Guest Editor's Introduction: Quality of Service in Integrated Services Networks. J. High Speed Networks 3(4): 331-333 (1994) - [j3]Abhay K. Parekh, Robert G. Gallager:
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Netw. 2(2): 137-150 (1994) - [c3]Leonidas Georgiadis, Roch Guérin, Abhay K. Parekh:
Optimal Multiplexing on a Single Link: Delay and Buffer Requirements. INFOCOM 1994: 524-532 - 1993
- [j2]Abhay K. Parekh, Robert G. Gallager:
A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Netw. 1(3): 344-357 (1993) - [c2]Abhay K. Parekh, Robert G. Gallager:
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case. INFOCOM 1993: 521-530 - 1992
- [b1]Abhay K. Parekh:
A generalized processor sharing approach to flow control in integrated services networks. Massachusetts Institute of Technology, Cambridge, MA, USA, 1992 - [c1]Abhay K. Parekh, Robert G. Gallager:
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks - The Single Node Case. INFOCOM 1992: 915-924 - 1991
- [j1]Abhay K. Parekh:
Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs. Inf. Process. Lett. 39(5): 237-240 (1991)
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-09-13 00:41 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: