Seyed Hamed Hassani

IEEE Trans. Inf. Theory, February, 2024

Automated Black-box Prompt Engineering for Personalized Text-to-Image Generation.

[BibT_eX]

[DOI]

CoRR, 2024

Approaching Rate-Distortion Limits in Neural Compression with Lattice Transform Coding.

[BibT_eX]

[DOI]

CoRR, 2024

Defending Large Language Models against Jailbreak Attacks via Semantic Smoothing.

[BibT_eX]

[DOI]

CoRR, 2024

Stochastic Approximation with Delayed Updates: Finite-Time Rates under Markovian Sampling.

[BibT_eX]

[DOI]

CoRR, 2024

Compression of Structured Data with Autoencoders: Provable Benefit of Nonlinearities and Depth.

[BibT_eX]

[DOI]

CoRR, 2024

Generalization Properties of Adversarial Training for 𝓁0-Bounded Adversarial Attacks.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Provable Tradeoffs in Adversarially Robust Classification.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, December, 2023

Provably Private Distributed Averaging Consensus: An Information-Theoretic Approach.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, November, 2023

Channel Coding at Low Capacity.

[BibT_eX]

[DOI]

Mohammad Vahid Jamali

Hessam Mahdavifar

IEEE J. Sel. Areas Inf. Theory, 2023

Data-Driven Modeling and Verification of Perception-Based Autonomous Systems.

[BibT_eX]

[DOI]

CoRR, 2023

Score-Based Methods for Discrete Optimization in Deep Learning.

[BibT_eX]

[DOI]

CoRR, 2023

Jailbreaking Black Box Large Language Models in Twenty Queries.

[BibT_eX]

[DOI]

CoRR, 2023

A Theory of Non-Linear Feature Learning with One Gradient Step in Two-Layer Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2023

SmoothLLM: Defending Large Language Models Against Jailbreaking Attacks.

[BibT_eX]

[DOI]

CoRR, 2023

Provable Multi-Task Representation Learning by Two-Layer ReLU Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2023

Min-Max Optimization under Delays.

[BibT_eX]

[DOI]

CoRR, 2023

Text + Sketch: Image Compression at Ultra Low Rates.

[BibT_eX]

[DOI]

Yigit Berkay Uslu

CoRR, 2023

Adversarial Training Should Be Cast as a Non-Zero-Sum Game.

[BibT_eX]

[DOI]

CoRR, 2023

Optimal Heterogeneous Collaborative Linear Regression and Contextual Bandits.

[BibT_eX]

[DOI]

CoRR, 2023

Performance-Robustness Tradeoffs in Adversarially Robust Control and Estimation.

[BibT_eX]

[DOI]

CoRR, 2023

Federated Temporal Difference Learning with Linear Function Approximation under Environmental Heterogeneity.

[BibT_eX]

[DOI]

CoRR, 2023

Temporal Difference Learning with Compressed Updates: Error-Feedback meets Reinforcement Learning.

[BibT_eX]

[DOI]

CoRR, 2023

Linear Stochastic Bandits over a Bit-Constrained Channel.

[BibT_eX]

[DOI]

Proceedings of the Learning for Dynamics and Control Conference, 2023

Generalization Properties of Adversarial Training for -ℓ0 Bounded Adversarial Attacks.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

Federated Neural Compression Under Heterogeneous Data.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Fundamental Limits of Two-layer Autoencoders, and Achieving Them with Gradient Methods.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Demystifying Disagreement-on-the-Line in High Dimensions.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Share Your Representation Only: Guaranteed Improvement of the Privacy-Utility Tradeoff in Federated Learning.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

On a Relation Between the Rate-Distortion Function and Optimal Transport.

[BibT_eX]

[DOI]

Proceedings of the First Tiny Papers Track at ICLR 2023, 2023

Adversarial Tradeoffs in Robust State Estimation.

[BibT_eX]

[DOI]

Proceedings of the American Control Conference, 2023

2022

Neural Estimation of the Rate-Distortion Function With Applications to Operational Source Coding.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, December, 2022

Age of Information in Random Access Channels.

[BibT_eX]

[DOI]

Xingran Chen

Konstantinos Gatsis

IEEE Trans. Inf. Theory, 2022

Robust Classification Under $\ell_0$ Attack for the Gaussian Mixture Model.

[BibT_eX]

[DOI]

SIAM J. Math. Data Sci., 2022

Straggler-Resilient Federated Learning: Leveraging the Interplay Between Statistical Accuracy and System Heterogeneity.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2022

Fundamental Limits of Two-layer Autoencoders, and Achieving Them with Gradient Methods.

[BibT_eX]

[DOI]

CoRR, 2022

Toward Certified Robustness Against Real-World Distribution Shifts.

[BibT_eX]

[DOI]

CoRR, 2022

Straggler-Resilient Personalized Federated Learning.

[BibT_eX]

[DOI]

CoRR, 2022

Collaborative Learning of Distributions under Heterogeneity and Communication Constraints.

[BibT_eX]

[DOI]

CoRR, 2022

Binary Classification Under 𝓁0 Attacks for General Noise Distribution.

[BibT_eX]

[DOI]

CoRR, 2022

T-Cal: An optimal test for the calibration of predictive models.

[BibT_eX]

[DOI]

CoRR, 2022

The Exact Class of Graph Functions Generated by Graph Neural Networks.

[BibT_eX]

[DOI]

Javid Dadashkarimi

CoRR, 2022

The curse of overparametrization in adversarial training: Precise analysis of robust generalization for random features regression.

[BibT_eX]

[DOI]

Adel Javanmard

CoRR, 2022

Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Collaborative Learning of Discrete Distributions under Heterogeneity and Communication Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Probable Domain Generalization via Quantile Risk Minimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

FedAvg with Fine Tuning: Local Updates Lead to Representation Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Neural Estimation of the Rate-Distortion Function for Massive Datasets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Efficient and Robust Classification for Sparse Attacks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Probabilistically Robust Learning: Balancing Average and Worst-case Performance.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Do deep networks transfer invariances across classes?

[BibT_eX]

[DOI]

Proceedings of the Tenth International Conference on Learning Representations, 2022

An Agnostic Approach to Federated Learning with Class Imbalance.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Conference on Learning Representations, 2022

Low-Complexity Decoding of a Class of Reed-Muller Subcodes for Low-Capacity Channels.

[BibT_eX]

[DOI]

Mohammad Vahid Jamali

Hessam Mahdavifar

Proceedings of the IEEE International Conference on Communications, 2022

Adaptive Node Participation for Straggler-Resilient Federated Learning.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2022

Self-Consistency of the Fokker Planck Equation.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Chordal Sparsity for Lipschitz Constant Estimation of Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Conference on Decision and Control, 2022

Performance-Robustness Tradeoffs in Adversarially Robust Linear-Quadratic Control.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Conference on Decision and Control, 2022

Distributed Statistical Min-Max Learning in the Presence of Byzantine Agents.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Conference on Decision and Control, 2022

Federated Functional Gradient Boosting.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Minimax Optimization: The Case of Convex-Submodular.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Dynamic Online Learning via Frank-Wolfe Algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2021

Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Latency-Reliability Tradeoffs for State Estimation.

[BibT_eX]

[DOI]

Konstantinos Gatsis

IEEE Trans. Autom. Control., 2021

Adversarial Tradeoffs in Linear Inverse Problems and Robust State Estimation.

[BibT_eX]

[DOI]

CoRR, 2021

Out-of-Distribution Robustness in Deep Learning Compression.

[BibT_eX]

[DOI]

CoRR, 2021

Exploiting Heterogeneity in Robust Federated Best-Arm Identification.

[BibT_eX]

[DOI]

CoRR, 2021

AutoEKF: Scalable System Identification for COVID-19 Forecasting from Large-Scale GPS Data.

[BibT_eX]

[DOI]

CoRR, 2021

Robust Classification Under 𝓁0 Attack for the Gaussian Mixture Model.

[BibT_eX]

[DOI]

CoRR, 2021

Achieving Linear Convergence in Federated Learning under Objective and Systems Heterogeneity.

[BibT_eX]

[DOI]

CoRR, 2021

Model-Based Domain Generalization.

[BibT_eX]

[DOI]

Alexander Robey

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Adversarial Robustness with Semi-Infinite Constrained Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradients.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Optimal Algorithms for Submodular Maximization with Distributed Constraints.

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual Conference on Learning for Dynamics and Control, 2021

Deep Reinforcement Learning for Active Target Tracking.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Exploiting Shared Representations for Personalized Federated Learning.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Federated Learning with Incrementally Aggregated Gradients.

[BibT_eX]

[DOI]

Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

Online Federated Learning.

[BibT_eX]

[DOI]

Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

2020

Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2020

Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2020

Safe Learning under Uncertain Objectives and Constraints.

[BibT_eX]

[DOI]

CoRR, 2020

Learning to Track Dynamic Targets in Partially Known Environments.

[BibT_eX]

[DOI]

CoRR, 2020

Model-Based Robust Deep Learning.

[BibT_eX]

[DOI]

Alexander Robey

CoRR, 2020

Quantized Push-sum for Gossip and Decentralized Optimization over Directed Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Sinkhorn Natural Gradient for Generative Models.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Sinkhorn Barycenter via Functional Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Submodular Meta-Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Quantized Decentralized Stochastic Learning over Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Precise Tradeoffs in Adversarial Training for Linear Regression.

[BibT_eX]

[DOI]

Adel Javanmard

Mahdi Soltanolkotabi

Proceedings of the Conference on Learning Theory, 2020

One Sample Stochastic Frank-Wolfe.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Black Box Submodular Maximization: Discrete and Continuous Settings.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

An Exact Quantized Decentralized Gradient Descent Algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2019

Construction of Polar Codes With Sublinear Complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Stochastic Conditional Gradient++.

[BibT_eX]

[DOI]

CoRR, 2019

Quantized Frank-Wolfe: Communication-Efficient Distributed Optimization.

[BibT_eX]

[DOI]

CoRR, 2019

A New Coding Paradigm for the Primitive Relay Channel.

[BibT_eX]

[DOI]

Algorithms, 2019

Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Robust and Communication-Efficient Collaborative Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Stochastic Continuous Greedy ++: When Upper and Lower Bounds Match.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Non-asymptotic Coded Slotted ALOHA.

[BibT_eX]

[DOI]

Xingran Chen

Proceedings of the IEEE International Symposium on Information Theory, 2019

Learning Q-network for Active Information Acquisition.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2019

Hessian Aided Policy Gradient.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Entropic GANs meet VAEs: A Statistical Approach to Compute Sample Likelihoods in GANs.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

How to Achieve the Capacity of Asymmetric Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Decoder Partitioning: Towards Practical List Decoding of Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2018

SPECTRE: Seedless Network Alignment via Spectral Centralities.

[BibT_eX]

[DOI]

CoRR, 2018

Discrete Sampling using Semigradient-based Product Mixtures.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Decentralized Submodular Maximization: Bridging Discrete and Continuous Settings.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Quantized Decentralized Consensus Optimization.

[BibT_eX]

[DOI]

Proceedings of the 57th IEEE Conference on Decision and Control, 2018

Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Online Continuous Submodular Maximization.

[BibT_eX]

[DOI]

Lin Chen

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Learning to Interact With Learning Agents.

[BibT_eX]

[DOI]

Adish Singla

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Binary Linear Codes with Optimal Scaling and Quasi-Linear Complexity.

[BibT_eX]

[DOI]

CoRR, 2017

Learning to Use Learners' Advice.

[BibT_eX]

[DOI]

Adish Singla

CoRR, 2017

Accelerated Dual Learning by Homotopic Initialization.

[BibT_eX]

[DOI]

Hadi Daneshmand

Thomas Hofmann

CoRR, 2017

Uniform Deviation Bounds for Unbounded Loss Functions like k-Means.

[BibT_eX]

[DOI]

CoRR, 2017

Capacity-Achieving Rate-Compatible Polar Codes for General Channels.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Wireless Communications and Networking Conference Workshops, 2017

Stochastic Submodular Maximization: The Case of Coverage Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Gradient Methods for Submodular Maximization.

[BibT_eX]

[DOI]

Mahdi Soltanolkotabi

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Time-invariant LDPC convolutional codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Uniform Deviation Bounds for k-Means Clustering.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Global Communications Conference, 2017

Near-optimal Bayesian Active Learning with Correlated and Noisy Tests.

[BibT_eX]

[DOI]

Yuxin Chen

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting.

[BibT_eX]

[DOI]

Lin Chen

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

2016

Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Alignment of Polarized Sets.

[BibT_eX]

[DOI]

Joseph M. Renes

David Sutter

IEEE J. Sel. Areas Commun., 2016

Dimension Coupling: Optimal Active Learning of Halfspaces via Query Synthesis.

[BibT_eX]

[DOI]

Lin Chen

CoRR, 2016

PROPER: global protein interaction network alignment through percolation matching.

[BibT_eX]

[DOI]

Ehsan Kazemi

Matthias Grossglauser

Hassan Pezeshgi Modarres

BMC Bioinform., 2016

Bounds for Random Constraint Satisfaction Problems via Spatial Coupling.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Fast and Provably Good Seedings for k-Means.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Approximate K-Means++ in Sublinear Time.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Scaling Exponent of List Decoders With Applications to Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Achieving Marton's Region for Broadcast Channels Using Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Growing a Graph Matching from a Handful of Seeds.

[BibT_eX]

[DOI]

Ehsan Kazemi

Matthias Grossglauser

Proc. VLDB Endow., 2015

Sampling from Probabilistic Submodular Models.

[BibT_eX]

[DOI]

Alkis Gotovos

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Sequential Information Maximization: When is Greedy Near-optimal?

[BibT_eX]

[DOI]

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Finite-Length Scaling for Polar Codes.

[BibT_eX]

[DOI]

Kasra Alishahi

IEEE Trans. Inf. Theory, 2014

From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2014

Achieving the Superposition and Binning Regions for Broadcast Channels Using Polar Codes.

[BibT_eX]

[DOI]

CoRR, 2014

Universal polar codes.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Polarization and Spatial Coupling - Two Techniques to Boost Performance.

[BibT_eX]

[DOI]

PhD thesis, 2013

Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Extended polar codes perform better in terms of compound rate and scaling behavior.

[BibT_eX]

[DOI]

Proceedings of the Iran Workshop on Communication and Information Theory, 2013

The least degraded and the least upgraded channel with respect to a channel family.

[BibT_eX]

[DOI]

Wei Liu

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

The space of solutions of coupled XORSAT formulae.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Polar codes: Robustness of the successive cancellation decoder with respect to quantization.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Universal bounds on the scaling behavior of polar codes.

[BibT_eX]

[DOI]

Ali Goli

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems

[BibT_eX]

[DOI]

CoRR, 2011

Chains of Mean Field Models

[BibT_eX]

[DOI]

CoRR, 2011

On the construction of polar codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Near concavity of the growth rate for coupled LDPC chains.

[BibT_eX]

[DOI]

Ryuhei Mori

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Coupled graphical models and their thresholds.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

On the scaling of polar codes: I. The behavior of polarized channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

On the scaling of polar codes: II. The behavior of un-polarized channels.

[BibT_eX]

[DOI]

Kasra Alishahi

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

The compound capacity of polar codes.

[BibT_eX]

[DOI]

Satish Babu Korada

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2007

Non-Saturation Mode Analysis of IEEE 802.11 MAC Protocol.

[BibT_eX]

[DOI]

Farid Ashtiani

Pouya Tehrani

Proceedings of the IEEE 18th International Symposium on Personal, 2007

2006

A New (t, n) Multi-Secret Sharing Scheme Based on Linear Algebra.

[BibT_eX]