Mahdi Cheraghchi

Orcid: 0000-0001-8957-0306

Affiliations:
  • University of Michigan, Ann Arbor, MI, USA


According to our database1, Mahdi Cheraghchi authored at least 61 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Simple Codes and Sparse Recovery with Fast Decoding.
SIAM J. Discret. Math., June, 2023

Where Quantum Complexity Helps Classical Complexity.
CoRR, 2023

Semi-Quantitative Group Testing for Efficient and Accurate qPCR Screening of Pathogens with a Wide Range of Loads.
CoRR, 2023

Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓ<i><sub>p</sub></i> Norms.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Mean-Based Trace Reconstruction Over Oblivious Synchronization Channels.
IEEE Trans. Inf. Theory, 2022

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓ<sub>p</sub> Norms.
Electron. Colloquium Comput. Complex., 2022

2021
An Overview of Capacity Results for Synchronization Channels.
IEEE Trans. Inf. Theory, 2021

Improved Non-Adaptive Algorithms for Threshold Group Testing With a Gap.
IEEE Trans. Inf. Theory, 2021

Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel With Positive Dark Current.
IEEE Commun. Lett., 2021

One-way Functions and Partial MCSP.
Electron. Colloquium Comput. Complex., 2021

Semiquantitative Group Testing in at Most Two Rounds.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Improved algorithms for non-adaptive group testing with consecutive positives.
Proceedings of the IEEE International Symposium on Information Theory, 2021

One-Way Functions and a Conditional Variant of MKTP.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

List Learning with Attribute Noise.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Coded Trace Reconstruction.
IEEE Trans. Inf. Theory, 2020

One-Tape Turing Machine and Branching Program Lower Bounds for MCSP.
Electron. Colloquium Comput. Complex., 2020

Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel.
IEEE Trans. Inf. Theory, 2019

Expressions for the Entropy of Basic Discrete Distributions.
IEEE Trans. Inf. Theory, 2019

Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels.
IEEE Trans. Inf. Theory, 2019

Efficiently Decodable Non-Adaptive Threshold Group Testing.
IEEE Trans. Inf. Theory, 2019

Capacity Upper Bounds for Deletion-type Channels.
J. ACM, 2019

Circuit Lower Bounds for MCSP from Local Pseudorandom Generators.
Electron. Colloquium Comput. Complex., 2019

Nearly optimal robust secret sharing.
Des. Codes Cryptogr., 2019

Efficient and error-tolerant schemes for non-adaptive complex group testing and its application in complex disease genetics.
CoRR, 2019

Non-Malleable Secret Sharing against Affine Tampering.
CoRR, 2019

Improved encoding and decoding for non-adaptive threshold group testing.
CoRR, 2019

Non-Malleable Codes against Active Physical Layer Adversary.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Local Testing of Lattices.
SIAM J. Discret. Math., 2018

AC<sup>0</sup>∘MOD<sub>2</sub> lower bounds for the Boolean Inner Product.
J. Comput. Syst. Sci., 2018

Secret Sharing with Binary Shares.
IACR Cryptol. ePrint Arch., 2018

A framework for generalized group testing with inhibitors and its potential application in neuroscience.
CoRR, 2018

Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Expressions for the Entropy of Binomial-Type Distributions.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform.
ACM Trans. Algorithms, 2017

Non-malleable Coding Against Bit-Wise and Split-State Tampering.
J. Cryptol., 2017

Non-Malleable Codes with Leakage and Applications to Secure Communication.
CoRR, 2017

2016
Local Testing for Membership in Lattices.
Electron. Colloquium Comput. Complex., 2016

AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
AC<sup>0</sup> \circ MOD<sub>2</sub> lower bounds for the Boolean Inner Product.
Electron. Colloquium Comput. Complex., 2015

2013
Capacity of Non-Malleable Codes.
Electron. Colloquium Comput. Complex., 2013

Noise-resilient group testing: Limitations and constructions.
Discret. Appl. Math., 2013

Improved Constructions for Non-adaptive Threshold Group Testing.
Algorithmica, 2013

2012
Graph-Constrained Group Testing.
IEEE Trans. Inf. Theory, 2012

Invertible Extractors and Wiretap Protocols.
IEEE Trans. Inf. Theory, 2012

Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes.
Electron. Colloquium Comput. Complex., 2012

Correctness and Corruption of Locally Decodable Codes.
Electron. Colloquium Comput. Complex., 2012

2011
Group Testing With Probabilistic Tests: Theory, Design and Application.
IEEE Trans. Inf. Theory, 2011

Submodular Functions Are Noise Stable.
Electron. Colloquium Comput. Complex., 2011

Applications of Derandomization Theory in Coding
CoRR, 2011

Coding-theoretic methods for sparse recovery.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Applications of Derandomization Theory in Coding.
PhD thesis, 2010

Approximating Linear Threshold Predicates.
Electron. Colloquium Comput. Complex., 2010

Derandomization and group testing.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Capacity achieving codes From randomness conductors.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Bit precision analysis for compressed sensing.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Compressed sensing with probabilistic measurements: A group testing solution.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2005
On Matrix Rigidity and the Complexity of Linear Forms
Electron. Colloquium Comput. Complex., 2005


  Loading...