Pramod Viswanath

Orcid: 0000-0003-3171-8667

Affiliations:
  • University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, IL, USA


According to our database1, Pramod Viswanath authored at least 187 papers between 1996 and 2024.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2013, "For contributions to the theory and practice of wireless communications".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
OML: Open, Monetizable, and Loyal AI.
IACR Cryptol. ePrint Arch., 2024

AgileRate: Bringing Adaptivity and Robustness to DeFi Lending Markets.
CoRR, 2024

Thinking Fast and Slow: Data-Driven Adaptive DeFi Borrow-Lending Protocol.
CoRR, 2024

Unconditionally Safe Light Client.
CoRR, 2024

BFT-PoLoc: A Byzantine Fortified Trigonometric Proof of Location Protocol using Internet Delays.
CoRR, 2024

Proof of Diligence: Cryptoeconomic Security for Rollups.
CoRR, 2024

Proof of Backhaul: Trustfree Measurement of Broadband Bandwidth.
Proceedings of the 31st Annual Network and Distributed System Security Symposium, 2024

DeepPolar: Inventing Nonlinear Large-Kernel Polar Codes via Deep Learning.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

CFT-Forensics: High-Performance Byzantine Accountability for Crash Fault Tolerant Protocols.
Proceedings of the 6th Conference on Advances in Financial Technologies, 2024

Proof of Diligence: Cryptoeconomic Security for Rollups.
Proceedings of the 6th Conference on Advances in Financial Technologies, 2024

Adaptive Curves for Optimally Efficient Market Making.
Proceedings of the 6th Conference on Advances in Financial Technologies, 2024

Thinking Fast and Slow: Data-Driven Adaptive DeFi Borrow-Lending Protocol.
Proceedings of the 6th Conference on Advances in Financial Technologies, 2024

2023
Machine Learning-Aided Efficient Decoding of Reed-Muller Subcodes.
IEEE J. Sel. Areas Inf. Theory, 2023

ZeroSwap: Data-driven Optimal Market Making in DeFi.
CoRR, 2023

SAKSHI: Decentralized AI Platforms.
CoRR, 2023

Raft-Forensics: High Performance CFT Consensus with Accountability for Byzantine Faults.
CoRR, 2023

Compressed Error HARQ: Feedback Communication on Noise-Asymmetric Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

CRISP: Curriculum based Sequential neural decoders for Polar code family.
Proceedings of the International Conference on Machine Learning, 2023

2022
Free2Shard: Adversary-resistant Distributed Resource Allocation for Blockchains.
Proc. ACM Meas. Anal. Comput. Syst., 2022

TrustBoost: Boosting Trust among Interoperable Blockchains.
IACR Cryptol. ePrint Arch., 2022

Player-Replaceability and Forensic Support are Two Sides of the Same (Crypto) Coin.
IACR Cryptol. ePrint Arch., 2022

Minotaur: Multi-Resource Blockchain Consensus.
IACR Cryptol. ePrint Arch., 2022

Optimal bootstrapping of PoW blockchains.
Proceedings of the MobiHoc '22: The Twenty-third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, Seoul, Republic of Korea, October 17, 2022

TinyTurbo: Efficient Turbo Decoders on Edge.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Trust-free service measurement and payments for decentralized cellular networks.
Proceedings of the 21st ACM Workshop on Hot Topics in Networks, 2022

Proof-of-Stake Longest Chain Protocols: Security vs Predictability.
Proceedings of the 2022 ACM Workshop on Developments in Consensus, 2022

2021
PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously.
IEEE Trans. Inf. Forensics Secur., 2021

Securing Parallel-chain Protocols under Variable Mining Power.
IACR Cryptol. ePrint Arch., 2021

Reed-Muller Subcodes: Machine Learning-Aided Design of Efficient Soft Recursive Decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2021

KO codes: inventing nonlinear encoding and decoding for reliable wireless communication via deep-learning.
Proceedings of the 38th International Conference on Machine Learning, 2021

ACeD: Scalable Data Availability Oracle.
Proceedings of the Financial Cryptography and Data Security, 2021

Blockchain CAP Theorem Allows User-Dependent Adaptivity and Finality.
Proceedings of the Financial Cryptography and Data Security, 2021

BFT Protocol Forensics.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Physical Layer Communication via Deep Learning.
IEEE J. Sel. Areas Inf. Theory, 2020

Deepcode: Feedback Codes via Deep Learning.
IEEE J. Sel. Areas Inf. Theory, 2020

LEARN Codes: Inventing Low-Latency Codes via Recurrent Neural Networks.
IEEE J. Sel. Areas Inf. Theory, 2020

Everything is a Race and Nakamoto Always Wins.
IACR Cryptol. ePrint Arch., 2020

The Checkpointed Longest Chain: User-dependent Adaptivity and Finality.
CoRR, 2020

Deepcode and Modulo-SK are Designed for Different Settings.
CoRR, 2020

Free2Shard: Adaptive-adversary-resistant sharding via Dynamic Self Allocation.
CoRR, 2020

Joint Channel Coding and Modulation via Deep Learning.
Proceedings of the 21st IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2020

Feedback Turbo Autoencoder.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Prism Removes Consensus Bottleneck for Smart Contracts.
Proceedings of the Crypto Valley Conference on Blockchain Technology, 2020

Enriching Word Embeddings with Temporal and Spatial Information.
Proceedings of the 24th Conference on Computational Natural Language Learning, 2020

Learning in Gated Neural Networks.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains.
IACR Cryptol. ePrint Arch., 2019

Proof-of-Stake Longest Chain Protocols Revisited.
CoRR, 2019

Prism: Scaling Bitcoin by 10, 000x.
CoRR, 2019

Context-Sensitive Malicious Spelling Error Correction.
Proceedings of the World Wide Web Conference, 2019

DEEPTURBO: Deep Turbo Decoder.
Proceedings of the 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2019

Coded State Machine - Scaling State Machine Execution under Byzantine Faults.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Barracuda: The Power of ℓ-polling in Proof-of-Stake Blockchains.
Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2019

Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithms.
Proceedings of the 36th International Conference on Machine Learning, 2019

Compounding of Wealth in Proof-of-Stake Cryptocurrencies.
Proceedings of the Financial Cryptography and Data Security, 2019

Prism: Deconstructing the Blockchain to Approach Physical Limits.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

Learning One-hidden-layer Neural Networks under General Input Distributions.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Interactive Communication for Data Exchange.
IEEE Trans. Inf. Theory, 2018

Demystifying Fixed k-Nearest Neighbor Information Estimators.
IEEE Trans. Inf. Theory, 2018

Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation.
IEEE Trans. Inf. Theory, 2018

Costly circuits, submodular schedules and approximate Carathéodory Theorems.
Queueing Syst. Theory Appl., 2018

Dandelion++: Lightweight Cryptocurrency Networking with Formal Anonymity Guarantees.
Proc. ACM Meas. Anal. Comput. Syst., 2018

PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously.
IACR Cryptol. ePrint Arch., 2018

Deconstructing the Blockchain to Approach Physical Limits.
IACR Cryptol. ePrint Arch., 2018

Globally Consistent Algorithms for Mixture of Experts.
CoRR, 2018

Graph2Seq: Scalable Learning Dynamics for Graphs.
CoRR, 2018

Estimators for Multivariate Information Measures in General Probability Spaces.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Embedding Syntax and Semantics of Prepositions via Tensor Decomposition.
Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2018

All-but-the-Top: Simple and Effective Postprocessing for Word Representations.
Proceedings of the 6th International Conference on Learning Representations, 2018

Communication Algorithms via Deep Learning.
Proceedings of the 6th International Conference on Learning Representations, 2018

Routing Cryptocurrency with the Spider Network.
Proceedings of the 17th ACM Workshop on Hot Topics in Networks, 2018

Preposition Sense Disambiguation and Representation.
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, October 31, 2018

2017
The Composition Theorem for Differential Privacy.
IEEE Trans. Inf. Theory, 2017

Hiding the Rumor Source.
IEEE Trans. Inf. Theory, 2017

Dandelion: Redesigning the Bitcoin Network for Anonymity.
Proc. ACM Meas. Anal. Comput. Syst., 2017

Discovering Potential Correlations via Hypercontractivity.
Entropy, 2017

Fixing the Infix: Unsupervised Discovery of Root-and-Pattern Morphology.
CoRR, 2017

All-but-the-Top: Simple and Effective Postprocessing for Word Representations.
CoRR, 2017

Prepositions in Context.
CoRR, 2017

Anonymity Properties of the Bitcoin P2P Network.
CoRR, 2017

Estimating Mutual Information for Discrete-Continuous Mixtures.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Deanonymization in the Bitcoin P2P Network.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Density functional estimators with k-nearest neighbor bandwidths.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Geometry of Polysemy.
Proceedings of the 5th International Conference on Learning Representations, 2017

MORSE: Semantic-ally Drive-n MORpheme SEgment-er.
Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, 2017

Representing Sentences as Low-Rank Subspaces.
Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, 2017

Geometry of Compositionality.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Metadata-Conscious Anonymous Messaging.
IEEE Trans. Signal Inf. Process. over Networks, 2016

Optimal Noise Adding Mechanisms for Approximate Differential Privacy.
IEEE Trans. Inf. Theory, 2016

The Optimal Noise-Adding Mechanism in Differential Privacy.
IEEE Trans. Inf. Theory, 2016

Extremal Mechanisms for Local Differential Privacy.
J. Mach. Learn. Res., 2016

Causal Strength via Shannon Capacity: Axioms, Estimators and Applications.
CoRR, 2016

Rumor Source Obfuscation on Irregular Trees.
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016

Conditional Dependence via Shannon Capacity: Axioms, Estimators and Applications.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Differentially private multi-party computation.
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

Algorithmic advances in anonymous communication over networks.
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

2015
Multicommodity Flows and Cuts in Polymatroidal Networks.
SIAM J. Comput., 2015

The Staircase Mechanism in Differential Privacy.
IEEE J. Sel. Top. Signal Process., 2015

Information Complexity Density and Simulation of Protocols.
Electron. Colloquium Comput. Complex., 2015

Costly Circuits, Submodular Schedules: Hybrid Switch Scheduling for Data Centers.
CoRR, 2015

Deterministic Near-Optimal P2P Streaming.
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Spy vs. Spy: Rumor Source Obfuscation.
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Secure Multi-party Differential Privacy.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Delay-constrained unicast and the triangle-cast problem.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Interference Channels With Half-Duplex Source Cooperation.
IEEE Trans. Inf. Theory, 2014

Capacity of Gaussian Channels With Energy Harvesting and Processing Cost.
IEEE Trans. Inf. Theory, 2014

Compress-and-Forward Scheme for Relay Networks: Backword Decoding and Connection to Bisubmodular Flows.
IEEE Trans. Inf. Theory, 2014

Capacity of Multiple Unicast in Wireless Networks: A Polymatroidal Approach.
IEEE Trans. Inf. Theory, 2014

Network Capacity Under Traffic Symmetry: Wireline and Wireless Networks.
IEEE Trans. Inf. Theory, 2014

Interactive Interference Alignment.
IEEE J. Sel. Areas Commun., 2014

Spy vs. Spy: Rumor Source Obfuscation.
CoRR, 2014

Optimality of Non-Interactive Randomized Response.
CoRR, 2014

Degrees of Freedom for multiple-multicast traffic.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The optimal mechanism in differential privacy.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
An Asymptotically Optimal Push-Pull Method for Multicasting Over a Random Network.
IEEE Trans. Inf. Theory, 2013

Classification of Homogeneous Data With Large Alphabets.
IEEE Trans. Inf. Theory, 2013

Multi-Session Function Computation and Multicasting in Undirected Graphs.
IEEE J. Sel. Areas Commun., 2013

The Optimal Mechanism in $(ε,δ)$-Differential Privacy
CoRR, 2013

The Composition Theorem for Differential Privacy.
CoRR, 2013

The Optimal Mechanism in Differential Privacy: Multidimensional Setting.
CoRR, 2013

Bursty interference channel with feedback.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Multi-terminal function multicasting in undirected graphs.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Approximately Optimal Wireless Broadcasting.
IEEE Trans. Inf. Theory, 2012

Information Capacity of an Energy Harvesting Sensor Node
CoRR, 2012

An asymptotically optimal push-pull method for multicasting over a random network
CoRR, 2012

Flashback: decoupled lightweight wireless control.
Proceedings of the ACM SIGCOMM 2012 Conference, 2012

An asymptotically optimal push-pull method for multicasting over a random network.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

An information-theoretic meta-theorem on edge-cut bounds.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Wireless networks with symmetric demands.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Probability Estimation in the Rare-Events Regime.
IEEE Trans. Inf. Theory, 2011

Diversity-Multiplexing Tradeoff of the Two-User Interference Channel.
IEEE Trans. Inf. Theory, 2011

Interference Channels With Destination Cooperation.
IEEE Trans. Inf. Theory, 2011

Interference Channels With Source Cooperation.
IEEE Trans. Inf. Theory, 2011

Information capacity of energy harvesting sensor nodes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Compress-and-forward scheme for a relay network: Approximate optimality and connection to algebraic flows.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Multiple-unicast in fading wireless networks: A separation scheme is approximately optimal.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Approximately optimal broadcasting-cum-multicasting in wireless networks.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Local phy + global flow: A layering principle for wireless networks.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Capacity of Fading Gaussian Channel with an Energy Harvesting Sensor Node.
Proceedings of the Global Communications Conference, 2011

2010
The Gaussian many-help-one distributed source coding problem.
IEEE Trans. Inf. Theory, 2010

On network interference management.
IEEE Trans. Inf. Theory, 2010

Fairness Improvement of Maximum C/I Scheduler by Dumb Antennas in Slow Fading Channel.
Proceedings of the 72nd IEEE Vehicular Technology Conference, 2010

Interference channels with half duplex source cooperation.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Universal hypothesis testing in the learning-limited regime.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
The capacity region of the degraded multiple-input multiple-output compound broadcast channel.
IEEE Trans. Inf. Theory, 2009

Vector Gaussian Multiple Description With Two Levels of Receivers.
IEEE Trans. Inf. Theory, 2009

Fundamentals of Wireless Communication (Tse, D. and Viswanath, P.) [Book review].
IEEE Trans. Inf. Theory, 2009

The two-user compound interference channel.
IEEE Trans. Inf. Theory, 2009

Cognitive radio: an information-theoretic perspective.
IEEE Trans. Inf. Theory, 2009

Reciprocity in linear deterministic networks under linear coding.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Harnessing bursty interference.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Interference management through cooperation.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Opportunistic interference management.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem.
IEEE Trans. Inf. Theory, 2008

Bounds on the capacity region of a class of compound interference channels
CoRR, 2008

The two user Gaussian compound interference channel.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Interference channels with source/destination cooperation.
Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

2007
Throughput scaling in wireless networks with restricted mobility.
IEEE Trans. Wirel. Commun., 2007

Vector Gaussian Multiple Description With Individual and Central Receivers.
IEEE Trans. Inf. Theory, 2007

An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems.
IEEE Trans. Inf. Theory, 2007

The Capacity Region of the Degraded MIMO Compound Broadcast Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A Better Good-Turing Estimator for Sequence Probabilities.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Approximately Universal Codes Over Slow-Fading Channels.
IEEE Trans. Inf. Theory, 2006

Opportunistic orthogonal writing on dirty paper.
IEEE Trans. Inf. Theory, 2006

On outer bounds to the capacity region of wireless networks.
IEEE Trans. Inf. Theory, 2006

Two Proofs of the Fisher Information Inequality via Data Processing Arguments
CoRR, 2006

Strong Consistency of the Good-Turing Estimator.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Symmetric Vector Gaussian Multiple Description with Two Levels of Receivers.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005
Rate Region of the Quadratic Gaussian Two-Terminal Source-Coding Problem
CoRR, 2005

Fundamentals of Wireless Communication.
Cambridge University Press, ISBN: 9780511807213, 2005

2004
Diversity-Multiplexing Tradeoff in Multiple-Access Channels.
IEEE Trans. Inf. Theory, 2004

A Deterministic Approach to Throughput Scaling in Wireless Networks.
IEEE Trans. Inf. Theory, 2004

Upper bounds to transport capacity of wireless networks.
IEEE Trans. Inf. Theory, 2004

Tradeoff-optimality of D-BLAST.
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Fixed binning schemes: an operational duality between channel and source coding problems with side information.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Permutation codes: achieving the diversity-multiplexing tradeoff.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality.
IEEE Trans. Inf. Theory, 2003

Sum Rate of a Class of Multiterminal Gaussian Source Coding Problems.
Proceedings of the Advances in Network Information Theory, 2003

On the capacity of the multiple antenna broadcast channel.
Proceedings of the Multiantenna Channels: Capacity, 2003

Upper bounds to transport capacity of wireless networks.
Proceedings of the 42nd IEEE Conference on Decision and Control, 2003

2002
Opportunistic beamforming using dumb antennas.
IEEE Trans. Inf. Theory, 2002

Optimal sequences for CDMA under colored noise: A Schur-saddle function property.
IEEE Trans. Inf. Theory, 2002

2001
Asymptotically optimal water-filling in vector multiple-access channels.
IEEE Trans. Inf. Theory, 2001

1999
Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers.
IEEE Trans. Inf. Theory, 1999

Optimal sequences and sum capacity of synchronous CDMA systems.
IEEE Trans. Inf. Theory, 1999

1997
On the stability of fuzzy systems.
IEEE Trans. Fuzzy Syst., 1997

1996
A quantitative analysis of processor-programmable logic interface.
Proceedings of the 4th IEEE Symposium on FPGAs for Custom Computing Machines (FCCM '96), 1996


  Loading...