Sameer Pawar

Orcid: 0000-0001-8954-7747

Affiliations:
  • University of California, Berkeley, USA


According to our database1, Sameer Pawar authored at least 38 papers between 2004 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
FadeNet: Deep Learning-Based mm-Wave Large-Scale Channel Fading Prediction and its Applications.
IEEE Access, 2021

2019
Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes.
IEEE Trans. Inf. Theory, 2019

Low PAPR DM-RS Design for 5G Systems Operating in High Frequency Bands.
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019

2018
R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT.
IEEE Trans. Inf. Theory, 2018

FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time.
IEEE Trans. Inf. Theory, 2018

2016
Efficient Algorithms for the Data Exchange Problem.
IEEE Trans. Inf. Theory, 2016

Fast sparse 2-D DFT computation using sparse-graph alias codes.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

2015
A robust sub-linear time R-FFAST algorithm for computing a sparse DFT.
CoRR, 2015

Fast and Efficient Sparse 2D Discrete Fourier Transform using Sparse-Graph Codes.
CoRR, 2015

SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform.
CoRR, 2015

Computationally-efficient sparse polynomial interpolation.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

Sub-linear time compressed sensing using sparse-graph codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Front-Haul Compression Using Scheduling Side Information for Cloud Radio Access Networks.
Proceedings of the 2015 IEEE Global Communications Conference, 2015

A comparison of waveform candidates for 5G millimeter wave systems.
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

2014
Sub-linear Time Support Recovery for Compressed Sensing using Sparse-Graph Codes.
CoRR, 2014

A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The SPRIGHT algorithm for robust sparse Hadamard Transforms.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Computationally-efficient blind sub-Nyquist sampling for sparse spectra.
Proceedings of the IEEE Global Conference on Signal and Information Processing, 2013

2012
Minimum Cost Multicast with Decentralized Sources
CoRR, 2012

Data exchange problem with helpers.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Codes can reduce queueing delay in data centers.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

A hybrid DFT-LDPC framework for fast, efficient and robust compressive sensing.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

Efficient algorithms for the data exchange problem under fairness constraints.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks.
IEEE Trans. Inf. Theory, 2011

Optimal Deterministic Polynomial-Time Data Exchange for Omniscience
CoRR, 2011

Securing dynamic distributed storage systems from malicious nodes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

DRESS codes for the storage cloud: Simple randomized constructions.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Deterministic algorithm for the cooperative data exchange problem.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Codes for a distributed caching based Video-on-Demand system.
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011

2010
On secure distributed data storage under repair dynamics.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel.
IEEE Trans. Inf. Theory, 2009

Cooperative multiplexing in the multiple antenna half duplex relay channel.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Diversity-multiplexing tradeoff of the half-duplex relay channel.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2006
Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff.
IEEE Trans. Inf. Theory, 2006

2005
Achieving the DMD tradeoff of the MIMO-ARQ channel.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
On the decoding and diversity-multiplexing gain tradeoff of a recent multilevel construction of space-time codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004


  Loading...