| Explicit space–time codes achieving the diversity–multiplexing gain tradeoff P Elia, KR Kumar, SA Pawar, PV Kumar, HF Lu IEEE Transactions on information theory 52 (9), 3869-3884, 2006 | 379* | 2006 |
| Securing dynamic distributed storage systems against eavesdropping and adversarial attacks S Pawar, S El Rouayheb, K Ramchandran IEEE Transactions on Information Theory 57 (10), 6734-6753, 2011 | 209 | 2011 |
| Codes can reduce queueing delay in data centers L Huang, S Pawar, H Zhang, K Ramchandran 2012 IEEE International Symposium on Information Theory Proceedings, 2766-2770, 2012 | 113 | 2012 |
| Computing a k-sparse n-length discrete Fourier transform using at most 4k samples and O (k log k) complexity S Pawar, K Ramchandran 2013 IEEE International Symposium on Information Theory, 464-468, 2013 | 99 | 2013 |
| Dress codes for the storage cloud: Simple randomized constructions S Pawar, N Noorshams, S El Rouayheb, K Ramchandran 2011 IEEE International Symposium on Information Theory Proceedings, 2338-2342, 2011 | 87 | 2011 |
| On secure distributed data storage under repair dynamics S Pawar, S El Rouayheb, K Ramchandran 2010 IEEE International Symposium on Information Theory, 2543-2547, 2010 | 79 | 2010 |
| Diversity-multiplexing tradeoff of the half-duplex relay channel S Pawar, AS Avestimehr, NCT David 2008 46th Annual Allerton Conference on Communication, Control, and …, 2008 | 64 | 2008 |
| Modified architecture for cloud radio access networks and approach for compression of front-haul data S Pawar, H Niu, A Papathanassiou US Patent 10,064,242, 2018 | 57 | 2018 |
| Deterministic algorithm for the cooperative data exchange problem N Milosavljevic, S Pawar, S El Rouayheb, M Gastpar, K Ramchandran 2011 IEEE International Symposium on Information Theory Proceedings, 410-414, 2011 | 51 | 2011 |
| FFAST: An Algorithm for Computing an Exactly -Sparse DFT in Time S Pawar, K Ramchandran IEEE Transactions on Information Theory 64 (1), 429-450, 2017 | 46 | 2017 |
| Sub-linear time support recovery for compressed sensing using sparse-graph codes X Li, D Yin, S Pawar, R Pedarsani, K Ramchandran IEEE Transactions on Information Theory 65 (10), 6580-6619, 2019 | 38 | 2019 |
| Beam management for carrier aggregation (CA) A Davydov, H He, G Xiong, S Pawar, Y Zhang, G Wang, J Cui, B Mondal US Patent 10,849,152, 2020 | 37 | 2020 |
| Cell search and synchronization in millimeter-wave capable small cells H Niu, Q Li, Y Tang, S Pawar, CI Casas US Patent 9,930,656, 2018 | 36 | 2018 |
| Efficient algorithms for the data exchange problem N Milosavljevic, S Pawar, S El Rouayheb, M Gastpar, K Ramchandran IEEE Transactions on Information Theory 62 (4), 1878-1896, 2016 | 31 | 2016 |
| A robust R-FFAST framework for computing a k-sparse n-length DFT in O (k log n) sample complexity using sparse-graph codes S Pawar, K Ramchandran 2014 IEEE International Symposium on Information Theory, 1852-1856, 2014 | 30 | 2014 |
| Uplink synchronization with assisted mmWAVE enhanced node B S Pawar, H Niu US Patent 10,075,985, 2018 | 29 | 2018 |
| R-FFAST: A robust sub-linear time algorithm for computing a sparse DFT S Pawar, K Ramchandran IEEE Transactions on Information Theory 64 (1), 451-466, 2017 | 29 | 2017 |
| Codes for a distributed caching based video-on-demand system S Pawar, S El Rouayheb, H Zhang, K Lee, K Ramchandran 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals …, 2011 | 26 | 2011 |
| Subframe structure for discrete Fourier transform (DFT) spread orthogonal frequency division multiplexing (S-OFDM) waveforms S Pawar, H Niu, H Jung, U Kumar US Patent 10,461,979, 2019 | 25 | 2019 |
| Scrambling sequence initial seed configuration for reference signals, data, and control channel for new radio A Davydov, G Xiong, D Chatterjee, H He, G Morozov, S Pawar, Y Zhang, ... US Patent 11,575,554, 2023 | 24 | 2023 |
Kannan RamchandranProfessor of Electrical Engineering and Computer Science, UC BerkeleyVerified email at eecs.berkeley.edu
