Farhad Shirani Chaharsooghi

IEEE Trans. Inf. Theory, 2024

Explanation-Preserving Augmentation for Semi-Supervised Graph Representation Learning.

[BibT_eX]

[DOI]

CoRR, 2024

F-Fidelity: A Robust Framework for Faithfulness Evaluation of Explainable AI.

[BibT_eX]

[DOI]

CoRR, 2024

CorBin-FL: A Differentially Private Federated Learning Mechanism using Common Randomness.

[BibT_eX]

[DOI]

CoRR, 2024

On Non-Interactive Simulation of Distributed Sources with Finite Alphabets.

[BibT_eX]

[DOI]

Hojat Allah Salehi

CoRR, 2024

PAC Learnability under Explanation-Preserving Graph Perturbations.

[BibT_eX]

[DOI]

CoRR, 2024

Quantum Advantage in Non-Interactive Source Simulation.

[BibT_eX]

[DOI]

Hojat Allah Salehi

CoRR, 2024

Non-Linear Analog Processing Gains in Task-Based Quantization.

[BibT_eX]

[DOI]

Neil Irwin Bernardo

Yonina C. Eldar

Proceedings of the IEEE International Symposium on Information Theory, 2024

TimeX++: Learning Time-Series Explanations with Information Bottleneck.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Towards Robust Fidelity for Evaluating Explainability of Graph Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Factorized Explainer for Graph Neural Networks.

[BibT_eX]

[DOI]

Rundong Huang

Dongsheng Luo

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

On Non-Interactive Source Simulation via Fourier Transform.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

Optimal Fault-Tolerant Data Fusion in Sensor Networks: Fundamental Limits and Efficient Algorithms.

[BibT_eX]

[DOI]

S. Sitharama Iyengar

Proceedings of the IEEE Information Theory Workshop, 2023

The Privacy-Utility Tradeoff in Rank-Preserving Dataset Obfuscation.

[BibT_eX]

[DOI]

Mahshad Shariatnasab

S. Sitharama Iyengar

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

MIMO Networks With One-Bit ADCs: Receiver Design and Communication Strategies.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2022

Fundamental Privacy Limits in Bipartite Networks Under Active Attacks.

[BibT_eX]

[DOI]

Mahshad Shariatnasab

IEEE J. Sel. Areas Commun., 2022

Opportunistic Temporal Fair Mode Selection and User Scheduling in Full-Duplex Systems.

[BibT_eX]

[DOI]

Mohammad Ali Khojastepour

IEEE J. Sel. Areas Commun., 2022

Capacity Gains in MIMO Systems with Few-Bit ADCs Using Nonlinear Analog Operators.

[BibT_eX]

[DOI]

Xuyang Liu

Hamidreza Aghasi

CoRR, 2022

Optimal Distributed Fault-Tolerant Sensor Fusion: Fundamental Limits and Efficient Algorithms.

[BibT_eX]

[DOI]

S. Sitharama Iyengar

CoRR, 2022

Lattices from Linear Codes: Source and Channel Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

MIMO Systems with One-bit ADCs: Capacity Gains using Nonlinear Analog Operations.

[BibT_eX]

[DOI]

Hamidreza Aghasi

Proceedings of the IEEE International Symposium on Information Theory, 2022

Privacy Limits in Power-Law Bipartite Networks under Active Fingerprinting Attacks.

[BibT_eX]

[DOI]

Mahshad Shariatnasab

Zahid Anwar

Proceedings of the IEEE International Symposium on Information Theory, 2022

Quantifying the Capacity Gains in Coarsely Quantized SISO Systems with Nonlinear Analog Operators.

[BibT_eX]

[DOI]

Hamidreza Aghasi

Proceedings of the IEEE Globecom 2022 Workshops, 2022

2021

A New Achievable Rate-Distortion Region for Distributed Source Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

A Concentration of Measure Approach to Correlated Graph Matching.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

On Graph Matching Using Generalized Seed Side-Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

An Algebraic and Probabilistic Framework for Network Information Theory.

[BibT_eX]

[DOI]

Arun Padakandla

Found. Trends Commun. Inf. Theory, 2020

On the Joint Typicality of Permutations of Sequences of Random Variables.

[BibT_eX]

[DOI]

CoRR, 2020

On Throughput of Millimeter Wave MIMO Systems with Low Resolution ADCs.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019

Quasi Structured Codes for Multi-Terminal Communications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

On the Sub-Optimality of Single-Letter Coding Over Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

A General Framework for Temporal Fair User Scheduling in NOMA Systems.

[BibT_eX]

[DOI]

IEEE J. Sel. Top. Signal Process., 2019

On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

On Multiterminal Communication over MIMO Channels with One-bit ADCs at the Receivers.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Tradeoff Between Delay and High SNR Capacity in Quantized MIMO Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

A Concentration of Measure Approach to Database De-anonymization.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Optimal Active social Network De-anonymization Using Information Thresholds.

[BibT_eX]

[DOI]

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

Typicality Matching for Pairs of Correlated Graphs.

[BibT_eX]

[DOI]

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

Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback.

[BibT_eX]

[DOI]

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

Lattices from Linear Codes and Fine Quantization: General Continuous Sources and Channels.

[BibT_eX]

[DOI]

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

Matching Graphs with Community Structure: A Concentration of Measure Approach.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

Opportunistic Temporal Fair Scheduling for Non-Orthogonal Multiple Access.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

How to Compute Modulo Prime-Power Sums ?

[BibT_eX]

[DOI]

CoRR, 2017

On the necessity of structured codes for communications over MAC with feedback.

[BibT_eX]

[DOI]

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

A new achievable rate region for multiple-access channel with states.

[BibT_eX]

[DOI]

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

On the sub-optimality of single-letter coding in multi-terminal communications.

[BibT_eX]

[DOI]

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

On the correlation between Boolean functions of sequences of random variables.

[BibT_eX]

[DOI]

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

An information theoretic framework for active de-anonymization in social networks based on group memberships.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

Seeded graph matching: Efficient algorithms and theoretical guarantees.

[BibT_eX]

[DOI]

Proceedings of the 51st Asilomar Conference on Signals, Systems, and Computers, 2017

2016

New sufficient conditions for Multiple-Access Channel with correlated sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Trade-off between communication and cooperation in the Interference Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Quasi Linear Codes: Application to point-to-point and multi-terminal source coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Beyond group capacity in multi-terminal communications.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

New lattice codes for multiple-descriptions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Finite block-length gains in distributed source coding.

[BibT_eX]

[DOI]

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

An achievable rate-distortion region for the multiple descriptions problem.

[BibT_eX]

[DOI]

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

2013

Distributed source coding in absence of common components.

[BibT_eX]

[DOI]

Aria Ghasemian Sahebi

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

2011

Achievable Rate Region for Multiple Access Channel with Correlated Channel States and Cooperating Encoders

[BibT_eX]

[DOI]

Mahdi Zamanighomi

Mohammad Javad Emadi

Mohammad Reza Aref

CoRR, 2011

Multiple access channel with correlated channel states and cooperating encoders.

[BibT_eX]

[DOI]

Mahdi Zamanighomi

Mohammad Javad Emadi

Mohammad Reza Aref

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

A new method for variable elimination in systems of inequations.

[BibT_eX]

[DOI]