default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSameer Pawar
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
- 2021
[j8]Vishnu V. Ratnam
, Hao Chen, Sameer Pawar, Bingwen Zhang, Charlie Jianzhong Zhang, Young-Jin Kim, Soonyoung Lee, Minsung Cho, Sung-Rok Yoon:
FadeNet: Deep Learning-Based mm-Wave Large-Scale Channel Fading Prediction and its Applications. IEEE Access 9: 3278-3290 (2021)
2010 – 2019
- 2019
- [j7]Xiao Li, Dong Yin, Sameer Pawar, Ramtin Pedarsani, Kannan Ramchandran:
Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes. IEEE Trans. Inf. Theory 65(10): 6580-6619 (2019) - [c24]Avik Sengupta, Alexei Davydov, Guotong Wang, Sameer Pawar, Gregory Morozov:
Low PAPR DM-RS Design for 5G Systems Operating in High Frequency Bands. VTC Fall 2019: 1-5 - 2018
- [j6]Sameer Pawar, Kannan Ramchandran:
FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time. IEEE Trans. Inf. Theory 64(1): 429-450 (2018) - [j5]Sameer Pawar, Kannan Ramchandran:
R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT. IEEE Trans. Inf. Theory 64(1): 451-466 (2018) - 2016
- [j4]Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Efficient Algorithms for the Data Exchange Problem. IEEE Trans. Inf. Theory 62(4): 1878-1896 (2016) - [c23]Frank Ong, Sameer Pawar, Kannan Ramchandran:
Fast sparse 2-D DFT computation using sparse-graph alias codes. ICASSP 2016: 4059-4063 - 2015
- [c22]Christian Ibars, Utsaw Kumar, Huaning Niu, Hyejung Jung, Sameer Pawar:
A comparison of waveform candidates for 5G millimeter wave systems. ACSSC 2015: 1747-1751 - [c21]Sameer Pawar, Huaning Niu, Apostolos Papathanassiou:
Front-Haul Compression Using Scheduling Side Information for Cloud Radio Access Networks. GLOBECOM 2015: 1-6 - [c20]Xiao Li, Sameer Pawar, Kannan Ramchandran:
Sub-linear time compressed sensing using sparse-graph codes. ISIT 2015: 1645-1649 - [c19]Sameer Pawar, Venkatesan Nallampatti Ekambaram, Kannan Ramchandran:
Computationally-efficient sparse polynomial interpolation. IWSDA 2015: 33-37 - [i15]Sameer Pawar, Kannan Ramchandran:
A robust sub-linear time R-FFAST algorithm for computing a sparse DFT. CoRR abs/1501.00320 (2015) - [i14]Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Efficient Algorithms for the Data Exchange Problem. CoRR abs/1502.06149 (2015) - [i13]Xiao Li, Joseph K. Bradley, Sameer Pawar, Kannan Ramchandran:
SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform. CoRR abs/1508.06336 (2015) - [i12]Frank Ong, Sameer Pawar, Kannan Ramchandran:
Fast and Efficient Sparse 2D Discrete Fourier Transform using Sparse-Graph Codes. CoRR abs/1509.05849 (2015) - 2014
- [c18]Sameer Pawar, Kannan Ramchandran:
A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes. ISIT 2014: 1852-1856 - [c17]Xiao Li, Joseph Kurata Bradley, Sameer Pawar, Kannan Ramchandran:
The SPRIGHT algorithm for robust sparse Hadamard Transforms. ISIT 2014: 1857-1861 - [i11]Xiao Li, Sameer Pawar, Kannan Ramchandran:
Sub-linear Time Support Recovery for Compressed Sensing using Sparse-Graph Codes. CoRR abs/1412.7646 (2014) - 2013
- [c16]Sameer Pawar, Venkatesan N. Ekambaram, Kannan Ramchandran:
Computationally-efficient blind sub-Nyquist sampling for sparse spectra. GlobalSIP 2013: 1065-1068 - [c15]Sameer Pawar, Kannan Ramchandran:
Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity. ISIT 2013: 464-468 - [i10]Sameer Pawar, Kannan Ramchandran:
Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity. CoRR abs/1305.0870 (2013) - 2012
- [c14]Nebojsa Milosavljevic, Sameer Pawar, Michael Gastpar, Kannan Ramchandran:
Efficient algorithms for the data exchange problem under fairness constraints. Allerton Conference 2012: 502-508 - [c13]Sameer Pawar, Kannan Ramchandran:
A hybrid DFT-LDPC framework for fast, efficient and robust compressive sensing. Allerton Conference 2012: 1943-1950 - [c12]Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Data exchange problem with helpers. ISIT 2012: 2611-2615 - [c11]Longbo Huang, Sameer Pawar, Hao Zhang, Kannan Ramchandran:
Codes can reduce queueing delay in data centers. ISIT 2012: 2766-2770 - [i9]Longbo Huang, Sameer Pawar, Hao Zhang, Kannan Ramchandran:
Codes Can Reduce Queueing Delay in Data Centers. CoRR abs/1202.1359 (2012) - [i8]Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Data Exchange Problem with Helpers. CoRR abs/1202.1612 (2012) - [i7]Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Minimum Cost Multicast with Decentralized Sources. CoRR abs/1203.2298 (2012) - 2011
- [j3]Sameer Pawar, Salim Y. El Rouayheb, Kannan Ramchandran:
Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks. IEEE Trans. Inf. Theory 57(10): 6734-6753 (2011) - [c10]Sameer Pawar, Salim Y. El Rouayheb, Hao Zhang, Kangwook Lee, Kannan Ramchandran:
Codes for a distributed caching based Video-on-Demand system. ACSCC 2011: 1783-1787 - [c9]Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Deterministic algorithm for the cooperative data exchange problem. ISIT 2011: 410-414 - [c8]Sameer Pawar, Salim Y. El Rouayheb, Kannan Ramchandran:
Securing dynamic distributed storage systems from malicious nodes. ISIT 2011: 1452-1456 - [c7]Sameer Pawar, Nima Noorshams, Salim Y. El Rouayheb, Kannan Ramchandran:
DRESS codes for the storage cloud: Simple randomized constructions. ISIT 2011: 2338-2342 - [i6]Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Optimal Deterministic Polynomial-Time Data Exchange for Omniscience. CoRR abs/1108.6046 (2011) - 2010
- [c6]Sameer Pawar, Salim Y. El Rouayheb, Kannan Ramchandran:
On secure distributed data storage under repair dynamics. ISIT 2010: 2543-2547 - [i5]Sameer Pawar, Salim Y. El Rouayheb, Kannan Ramchandran:
On Secure Distributed Data Storage Under Repair Dynamics. CoRR abs/1003.0488 (2010) - [i4]Sameer Pawar, Salim Y. El Rouayheb, Kannan Ramchandran:
Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks. CoRR abs/1009.2556 (2010)
2000 – 2009
- 2009
- [j2]Sameer A. Pawar, K. Raj Kumar, Petros Elia, P. Vijay Kumar, B. A. Sethuraman:
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel. IEEE Trans. Inf. Theory 55(7): 3101-3114 (2009) - [c5]Vinayak Nagpal, Sameer Pawar, David Tse, Borivoje Nikolic:
Cooperative multiplexing in the multiple antenna half duplex relay channel. ISIT 2009: 1438-1442 - [i3]Vinayak Nagpal, Sameer Pawar, David Tse, Borivoje Nikolic:
Cooperative Multiplexing in the Multiple Antenna Half Duplex Relay Channel. CoRR abs/0901.2164 (2009) - 2008
- [c4]Sameer Pawar, Amir Salman Avestimehr, David N. C. Tse:
Diversity-multiplexing tradeoff of the half-duplex relay channel. Allerton 2008: 27-33 - [i2]Sameer Pawar, Amir Salman Avestimehr, David N. C. Tse:
Diversity-Multiplexing Tradeoff of the Half-Duplex Relay Channel. CoRR abs/0810.2133 (2008) - 2006
- [j1]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff. IEEE Trans. Inf. Theory 52(9): 3869-3884 (2006) - [i1]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff. CoRR abs/cs/0602054 (2006) - 2005
- [c3]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff. ISIT 2005: 896-900 - [c2]Sameer A. Pawar, K. Raj Kumar, P. Vijay Kumar, Petros Elia, B. A. Sethuraman:
Achieving the DMD tradeoff of the MIMO-ARQ channel. ISIT 2005: 901-905 - 2004
- [c1]P. Vijay Kumar, Hsiao-feng Lu, Sameer A. Pawar:
On the decoding and diversity-multiplexing gain tradeoff of a recent multilevel construction of space-time codes. ISIT 2004: 128
Coauthor Index
aka: Salim Y. El Rouayheb
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:42 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:
