| A generalized processor sharing approach to flow control in integrated services networks: the multiple node case AK Parekh, RG Gallager IEEE/ACM Transactions on Networking (TON) 2 (2), 137-150, 1994 | 5305 | 1994 |
| Spectrum sharing for unlicensed bands R Etkin, A Parekh, D Tse IEEE Journal on selected areas in communications 25 (3), 517-528, 2007 | 1336 | 2007 |
| A generalized processor sharing approach to flow control in integrated services networks-the single node case AK Parekh, RG Gallager [Proceedings] IEEE INFOCOM'92: The Conference on Computer Communications …, 1992 | 1099 | 1992 |
| Selecting routers in ad-hoc wireless networks AK Parekh Proceedings of the SBT/IEEE International Telecommunications Symposium 204, 1994 | 414 | 1994 |
| Rate-controlled service disciplines AK Parekh, H Zhang, D Ferrari Journal of high speed networks 3 (4), 389-412, 1994 | 406 | 1994 |
| The approximate capacity of the many-to-one and one-to-many Gaussian interference channels G Bresler, A Parekh, NC David IEEE Transactions on Information Theory 56 (9), 4566-4592, 2010 | 378 | 2010 |
| Optimal multiplexing on a single link: delay and buffer requirements L Georgiadis, R Guérin, A Parekh IEEE transactions on information theory 43 (5), 1518-1535, 1997 | 219 | 1997 |
| Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence NB Shah, S Balakrishnan, J Bradley, A Parekh, K Ramch, MJ Wainwright Journal of Machine Learning Research 17 (58), 1-47, 2016 | 207 | 2016 |
| Optimal multiplexing on a single link: Delay and buffer requirements L Georgiadis, R Guerin, A Parekh Proceedings of INFOCOM'94 Conference on Computer Communications, 524-532, 1994 | 133 | 1994 |
| A case for ordinal peer-evaluation in MOOCs NB Shah, JK Bradley, A Parekh, M Wainwright, K Ramchandran NIPS workshop on data driven education 15, 67, 2013 | 129 | 2013 |
| Generalized processor sharing networks with exponentially bounded burstiness arrivals AK Parekh, O Yaron, M Sidi Journal of High Speed Networks 3 (4), 375-387, 1994 | 115 | 1994 |
| Analysis of a greedy heuristic for finding small dominating sets in graphs AK Parekh Information processing letters 39 (5), 237-240, 1991 | 97 | 1991 |
| Truth serums for massively crowdsourced evaluation tasks V Kamble, N Shah, D Marn, A Parekh, K Ramachandran arXiv preprint arXiv:1507.07045 96, 2015 | 39 | 2015 |
| Some scaling laws for MOOC assessments NB Shah, J Bradley, S Balakrishnan, A Parekh, K Ramchandran, ... KDD Workshop on Data Mining for Educational Assessment and Feedback (ASSESS …, 2014 | 39 | 2014 |
| When is it better to compare than to score? NB Shah, S Balakrishnan, J Bradley, A Parekh, K Ramchandran, ... arXiv preprint arXiv:1406.6618, 2014 | 27 | 2014 |
| OPENET Architecture, The I Cidon, T Hsiao, A Khamisy, A Parekh, R Rom, M Sidi Sun Microsystems, Inc., 1995 | 24 | 1995 |
| A distributed multichannel demand-adaptive P2P VoD system with optimized caching and neighbor-selection H Zhang, M Chen, A Parekh, K Ramchandran Applications of Digital Image Processing XXXIV 8135, 301-319, 2011 | 22 | 2011 |
| Finite-horizon statistical quality-of-service measures for high-speed networks AK Parekh, R Nagarajan, J Kurose, D Towsley Journal of High Speed Networks 3 (4), 351-373, 1994 | 22 | 1994 |
| A simulation study of space priorities in a shared memory ATM switch AK Parekh, AK Choudhury, EL Hahne Journal of High Speed Networks 3 (4), 491-512, 1994 | 21 | 1994 |
| On per-session end-to-end delay and the call admission problem for real-time applications with QOS requirements AK Parekh, D Yates, J Kurose, D Towsley, MG Hluchyj Journal of High Speed Networks 3 (4), 429-457, 1994 | 20 | 1994 |
Kannan RamchandranProfessor of Electrical Engineering and Computer Science, UC BerkeleyVerified email at eecs.berkeley.edu
