Anoosheh Heidarzadeh

CoRR, 2024

A New Approach to Harnessing Side Information in Multi-Server Private Information Retrieval.

[BibT_eX]

[DOI]

Ningze Wang

CoRR, 2024

2022

Single-Server Private Linear Transformation: The Joint Privacy Case.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2022

Sparse Random Khatri-Rao Product Codes for Distributed Matrix Multiplication.

[BibT_eX]

[DOI]

Ruowan Ji

Proceedings of the IEEE Information Theory Workshop, 2022

Single-Server Private Information Retrieval With Side Information Under Arbitrary Popularity Profiles.

[BibT_eX]

[DOI]

Alejandro Gomez-Leos

Proceedings of the IEEE Information Theory Workshop, 2022

The Linear Capacity of Single-Server Individually-Private Information Retrieval With Side Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

The Role of Reusable and Single-Use Side Information in Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Multi-Message Private Information Retrieval: A Scalar Linear Solution.

[BibT_eX]

[DOI]

Ningze Wang

Proceedings of the 58th Annual Allerton Conference on Communication, 2022

Noisy Group Testing with Side Information.

[BibT_eX]

[DOI]

Proceedings of the 56th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2022, Pacific Grove, CA, USA, October 31, 2022

2021

The Role of Coded Side Information in Single-Server Private Information Retrieval.

[BibT_eX]

[DOI]

Fatemeh Kazemi

IEEE Trans. Inf. Theory, 2021

Factored LT and Factored Raptor Codes for Large-Scale Distributed Matrix Multiplication.

[BibT_eX]

[DOI]

Asit Kumar Pradhan

IEEE J. Sel. Areas Inf. Theory, 2021

Single-Server Private Information Retrieval Schemes are Equivalent to Locally Recoverable Coding Schemes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Scheduling Improves the Performance of Belief Propagation for Noisy Group Testing.

[BibT_eX]

[DOI]

CoRR, 2021

Multi-Server Private Linear Computation with Joint and Individual Privacy Guarantees.

[BibT_eX]

[DOI]

CoRR, 2021

Single-Server Private Linear Transformation: The Individual Privacy Case.

[BibT_eX]

[DOI]

CoRR, 2021

Multi-Server Private Linear Computation with Joint and Individual Privacy Guarantees.

[BibT_eX]

[DOI]

Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Squeezed Random Khatri-Rao Product Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

Single-Server Individually-Private Information Retrieval: A Combinatorial Approach.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

Asymptotic Analysis of Factored LT Codes for Distributed Matrix Multiplication.

[BibT_eX]

[DOI]

Asit Kumar Pradhan

Proceedings of the IEEE International Symposium on Information Theory, 2021

Private Linear Transformation: The Individual Privacy Case.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Private Linear Transformation: The Joint Privacy Case.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Two-Stage Adaptive Pooling with RT-QPCR for Covid-19 Screening.

[BibT_eX]

[DOI]

Krishna Narayanan

Proceedings of the IEEE International Conference on Acoustics, 2021

2020

Private Information Retrieval With Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

On Accelerated Testing for COVID-19 Using Group Testing.

[BibT_eX]

[DOI]

Ramanan Laxminarayan

CoRR, 2020

Product Lagrange Coded Computing.

[BibT_eX]

[DOI]

Adarsh M. Subramaniam

Asit Kumar Pradhan

Proceedings of the IEEE International Symposium on Information Theory, 2020

Private Computation with Individual and Joint Privacy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

A Systematic Approach to Incremental Redundancy With Application to Erasure Channels.

[BibT_eX]

[DOI]

Jean-François Chamberland

Richard D. Wesel

Parimal Parag

IEEE Trans. Commun., 2019

Collaborative Decoding of Polynomial Codes for Distributed Computation.

[BibT_eX]

[DOI]

Adarsh M. Subramaniam

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Sparse Graph Codes for Non-adaptive Quantitative Group Testing.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Single-Server Single-Message Online Private Information Retrieval with Side Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Private Computation with Side Information: The Single-Server Case.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Capacity of Single-Server Single-Message Private Information Retrieval with Private Coded Side Information.

[BibT_eX]

[DOI]

Fatemeh Kazemi

Proceedings of the IEEE International Symposium on Information Theory, 2019

Single-Server Multi-Message Individually-Private Information Retrieval with Side Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Multi-Server Private Information Retrieval with Coded Side Information.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Workshop on Information Theory, 2019

Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication.

[BibT_eX]

[DOI]

Adarsh M. Subramaniam

Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Private Information Retrieval with Private Coded Side Information: The Multi-Server Case.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Non-adaptive Quantitative Group Testing Using Irregular Sparse Graph Codes.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018

A Fast and Accurate Failure Frequency Approximation for k-Terminal Reliability Systems.

[BibT_eX]

[DOI]

Chanan Singh

IEEE Trans. Reliab., 2018

Capacity of Single-Server Single-Message Private Information Retrieval with Coded Side Information.

[BibT_eX]

[DOI]

Fatemeh Kazemi

Proceedings of the IEEE Information Theory Workshop, 2018

A Simple and Efficient Strategy for the Coin Weighing Problem with a Spring Scale.

[BibT_eX]

[DOI]

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

A Monetary Mechanism for Stabilizing Cooperative Data Exchange with Selfish Users.

[BibT_eX]

[DOI]

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

A Systematic Approach to Incremental Redundancy over Erasure Channels.

[BibT_eX]

[DOI]

Jean-François Chamberland

Parimal Parag

Richard D. Wesel

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

Transmission Lengths That Maximize Throughput of Variable-Length Coding & ACK/NACK Feedback.

[BibT_eX]

[DOI]

Jean-François Chamberland

Proceedings of the IEEE Global Communications Conference, 2018

On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information.

[BibT_eX]

[DOI]

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

2017

Successive local and successive global omniscience.

[BibT_eX]

[DOI]

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

An algebraic-combinatorial proof technique for the GM-MDS conjecture.

[BibT_eX]

[DOI]

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

Private information retrieval with side information: The single server case.

[BibT_eX]

[DOI]

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

2016

Optimal exchange of data over broadcast networks with adversaries.

[BibT_eX]

[DOI]

Proceedings of the 2016 Information Theory and Applications Workshop, 2016

Cooperative data exchange with priority classes.

[BibT_eX]

[DOI]

Muxi Yan

Proceedings of the IEEE International Symposium on Information Theory, 2016

Cooperative data exchange: A coalition game perspective.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

Cooperative data exchange with unreliable clients.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

How much can knowledge of delay model help chunked coding over networks with perfect feedback?

[BibT_eX]

[DOI]

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

Efficient pooling against strategic adversary with applications in anonymous and reliable networking.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Practical improvements to bus-based strategies for reliable anonymous networking.

[BibT_eX]

[DOI]

Hari Ravi

Tracey Ho

Proceedings of the IEEE Global Conference on Signal and Information Processing, 2013

2012

Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Coding Delay Analysis of Dense and Chunked Network Codes over Line Networks

[BibT_eX]

[DOI]

CoRR, 2012

Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay

[BibT_eX]

[DOI]

CoRR, 2012

Coding delay analysis of Chunked codes over line networks.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Network Coding, 2012

How fast can dense codes achieve the min-cut capacity of line networks?

[BibT_eX]

[DOI]

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

2011

Network Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes

[BibT_eX]

[DOI]

CoRR, 2011

Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressive Sensing

[BibT_eX]

[DOI]

CoRR, 2011

Analysis of overlapped chunked codes with small chunks over line networks.

[BibT_eX]

[DOI]

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

2009

Overlapped Chunked Network Coding

[BibT_eX]

[DOI]

Mohammad Amin Khajehnejad

CoRR, 2009

2007

A sufficient condition for infinite connectivity in two dimensional ad-hoc wireless sensor networks.

[BibT_eX]

[DOI]

Said Nade Esfahani

Proceedings of the 9th International Symposium on Signal Processing and Its Applications, 2007

An enhanced nonlocal-means algorithm for image denoising.

[BibT_eX]

[DOI]