Sameer A. Pawar, Ph.D.
Affiliations: | 2013 | Electrical Engineering and Computer Sciences | University of California, Berkeley, Berkeley, CA, United States |
Area:
Communications & Networking (COMNET); Signal Processing (SP)Google:
"Sameer Pawar"Parents
Sign in to add mentor| Kannan Ramchandran | grad student | 2013 | UC Berkeley | |
| (PULSE: Peeling-based Ultra-Low complexity algorithms for Sparse signal Estimation.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Li X, Yin D, Pawar S, et al. (2019) Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes Ieee Transactions On Information Theory. 65: 6580-6619 |
| Pawar S, Ramchandran K. (2018) FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time Ieee Transactions On Information Theory. 64: 429-450 |
| Pawar S, Ramchandran K. (2018) R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT Ieee Transactions On Information Theory. 64: 451-466 |
| Milosavljevic N, Pawar S, El Rouayheb S, et al. (2016) Efficient Algorithms for the Data Exchange Problem Ieee Transactions On Information Theory. 62: 1878-1896 |
| Pawar S, El Rouayheb S, Ramchandran K. (2011) Securing dynamic distributed storage systems against eavesdropping and adversarial attacks Ieee Transactions On Information Theory. 57: 6734-6753 |
| Pawar SA, Kumar KR, Elia P, et al. (2009) Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel Ieee Transactions On Information Theory. 55: 3101-3114 |
| Elia P, Kumar KR, Pawar SA, et al. (2006) Explicit space-time codes achieving the diversity-multiplexing gain tradeoff Ieee Transactions On Information Theory. 52: 3869-3884 |