generated by bibbase.org
  2021 (6)
Semiquantitative Group Testing in at Most Two Rounds. Cheraghchi, M.; Gabrys, R.; and Milenkovic, O. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2021.
Semiquantitative Group Testing in at Most Two Rounds [link] paper   bibtex   abstract  
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel. abd Joseph Downs, M. C.; Ribeiro, J.; and Veliche, A. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2021.
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel [link] paper   bibtex   abstract  
Improved Algorithms for Non-adaptive Group Testing with Consecutive Positives. Bui, T. V.; Cheraghchi, M.; and Nguyen, T. D. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2021.
Improved Algorithms for Non-adaptive Group Testing with Consecutive Positives [link] paper   bibtex   abstract  
List Learning with Attribute Noise. Cheraghchi, M.; Grigorescu, E.; Juba, B.; Wimmer, K.; and Xie, N. In Banerjee, A.; and Fukumizu, K., editor(s), Proceedings of The 24th International Conference on Artificial Intelligence and Statistics (AISTATS), volume 130, of Proceedings of Machine Learning Research, pages 2215–2223, 13–15 Apr 2021. PMLR
List Learning with Attribute Noise [link] link   List Learning with Attribute Noise [link] paper   bibtex   abstract  
One-tape Turing machine and branching program lower bounds for MCSP. Cheraghchi, M.; Hirahara, S.; Myrisiotis, D.; and Yoshida, Y. In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS), 2021. Invited to the special issue of Theory of Computing Systems.
One-tape Turing machine and branching program lower bounds for MCSP [link] link   One-tape Turing machine and branching program lower bounds for MCSP [link] paper   doi   bibtex   abstract  
An Overview of Capacity Results for Synchronization Channels. Cheraghchi, M.; and Ribeiro, J. IEEE Transactions on Information Theory, 67(6): 3207–3232. 2021.
An Overview of Capacity Results for Synchronization Channels [link] link   An Overview of Capacity Results for Synchronization Channels [link] paper   doi   bibtex   abstract  
  2020 (6)
AC-DC: Amplification Curve Diagnostics for Covid-19 Group Testing. Gabrys, R.; Pattabiraman, S.; Rana, V.; Ribeiro, J.; Cheraghchi, M.; Guruswami, V.; and Milenkovic, O. 2020. arXiv:2011.05223
AC-DC: Amplification Curve Diagnostics for Covid-19 Group Testing [link] paper   bibtex   abstract  
Combinatorial Group Testing Schemes with Near-Optimal Decoding Time. Cheraghchi, M.; and Nakos, V. In Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2020.
Combinatorial Group Testing Schemes with Near-Optimal Decoding Time [link] link   Combinatorial Group Testing Schemes with Near-Optimal Decoding Time [link] paper   doi   bibtex   abstract  
Leakage-Resilient Secret Sharing in Non-compartmentalized Models. Lin, F.; Cheraghchi, M.; Guruswami, V.; Safavi-Naini, R.; and Wang, H. In Proceedings of the Conference on Information-Theoretic Cryptography (ITC), volume 163, of Leibniz International Proceedings in Informatics (LIPIcs), pages 7:1–7:24, 2020.
Leakage-Resilient Secret Sharing in Non-compartmentalized Models [link] link   Leakage-Resilient Secret Sharing in Non-compartmentalized Models [link] paper   doi   bibtex   abstract  
Improved Non-adaptive algorithms for Threshold Group Testing with a Gap. Bui, T. V.; Cheraghchi, M.; and Echizen, I. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2020.
Improved Non-adaptive algorithms for Threshold Group Testing with a Gap [link] link   Improved Non-adaptive algorithms for Threshold Group Testing with a Gap [link] paper   doi   bibtex   abstract  
Coded Trace Reconstruction. Cheraghchi, M.; Gabrys, R.; Milenkovic, O.; and Ribeiro, J. IEEE Transactions on Information Theory, 66(10): 6084-6103. 2020. Preliminary version in Proceedings of ITW 2019.
Coded Trace Reconstruction [link] link   Coded Trace Reconstruction [link] paper   doi   bibtex   abstract  
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. Cheraghchi, M.; Kabanets, V.; Lu, Z.; and Myrisiotis, D. ACM Transactions on Computation Theory (ToCT), 12(3). 2020. Preliminary version in Proceedings of ICALP 2019.
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators [link] paper   Circuit Lower Bounds for MCSP from Local Pseudorandom Generators [link] link   doi   bibtex   abstract  
  2019 (11)
Coded Trace Reconstruction. Cheraghchi, M.; Gabrys, R.; Milenkovic, O.; and Ribeiro, J. In Proceedings of the IEEE Information Theory Workshop (ITW), pages 1–5, 2019. Extended version in IEEE Transactions on Information Theory.
Coded Trace Reconstruction [link] link   Coded Trace Reconstruction [link] paper   doi   bibtex   abstract  
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. Cheraghchi, M.; Kabanets, V.; Lu, Z.; and Myrisiotis, D. In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP), volume 132, of Leibniz International Proceedings in Informatics (LIPIcs), pages 39:1–39:14, 2019. Extended version to appear in ACM Transactions on Computation Theory (ToCT).
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators [link] link   Circuit Lower Bounds for MCSP from Local Pseudorandom Generators [link] paper   doi   bibtex   abstract  
Non-Malleable Codes against Active Physical Layer Adversary. Lin, F.; Safavi-Naini, R.; Cheraghchi, M.; and Wang, H. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 2753–2757, 2019.
Non-Malleable Codes against Active Physical Layer Adversary [link] link   doi   bibtex   abstract  
Simple Codes and Sparse Recovery with Fast Decoding. Cheraghchi, M.; and Ribeiro, J. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 156–160, 2019.
Simple Codes and Sparse Recovery with Fast Decoding [link] link   Simple Codes and Sparse Recovery with Fast Decoding [link] paper   doi   bibtex   abstract  
Secret Sharing with Binary Shares. Lin, F.; Cheraghchi, M.; Guruswami, V.; Safavi-Naini, R.; and Wang, H. In Proceedings of the 10th Innovations in Theoretical Computer Science Conference (ITCS), volume 124, of Leibniz International Proceedings in Informatics (LIPIcs), pages 53:1–53:20, 2019.
Secret Sharing with Binary Shares [link] link   Secret Sharing with Binary Shares [link] paper   doi   bibtex   abstract  
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. Cheraghchi, M.; and Ribeiro, J. IEEE Transactions on Information Theory, 65(11): 6950–6974. 2019. Preliminary version in Proceedings of Allerton 2018.
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels [link] link   Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels [link] paper   doi   bibtex   abstract  
Capacity Upper Bounds for Deletion-type Channels. Cheraghchi, M. Journal of the ACM, 66(2). Mar 2019. Preliminary version in Proceedings of STOC 2018.
Capacity Upper Bounds for Deletion-type Channels [link] link   Capacity Upper Bounds for Deletion-type Channels [link] paper   doi   bibtex   abstract  
Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel. Cheraghchi, M.; and Ribeiro, J. IEEE Transactions on Information Theory, 65(7): 4052–4068. 2019. Preliminary version in Proceedings of ISIT 2018.
Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel [link] link   Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel [link] paper   doi   bibtex   abstract  
Expressions for the Entropy of Basic Discrete Distributions. Cheraghchi, M. IEEE Transactions on Information Theory, 65(7): 3999–4009. 2019. Preliminary version in Proceedings of ISIT 2018.
Expressions for the Entropy of Basic Discrete Distributions [link] link   Expressions for the Entropy of Basic Discrete Distributions [link] paper   doi   bibtex   abstract  
Efficiently Decodable Non-Adaptive Threshold Group Testing. Bui, T. V.; Kuribayashi, M.; Cheraghchi, M.; and Echizen, I. IEEE Transactions on Information Theory, 65(9): 5519–5528. 2019. Preliminary version in Proceedings of ISIT 2018.
Efficiently Decodable Non-Adaptive Threshold Group Testing [link] link   Efficiently Decodable Non-Adaptive Threshold Group Testing [link] paper   doi   bibtex   abstract  
Nearly optimal robust secret sharing. Cheraghchi, M. Designs, Codes and Cryptography, 87(8): 1777–1796. 2019. Preliminary version in Proceedings of ISIT 2016.
Nearly optimal robust secret sharing [link] link   Nearly optimal robust secret sharing [link] paper   doi   bibtex   abstract  
  2018 (7)
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. Cheraghchi, M.; and Ribeiro, J. In Proceedings of the 56th Annual Allerton Conference on Communication, Control, and Computing, pages 1104–1111, 2018. Extended version in IEEE Transactions on Information Theory.
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels [link] link   Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels [link] paper   doi   bibtex   abstract  
Capacity Upper Bounds for Deletion-type Channels. Cheraghchi, M. In Proceedings of the 50th ACM Symposium on Theory of Computing (STOC), pages 493–506, 2018. Extended version in Journal of the ACM.
Capacity Upper Bounds for Deletion-type Channels [link] link   Capacity Upper Bounds for Deletion-type Channels [link] paper   doi   bibtex   abstract  
Improved Upper Bounds on the Capacity of the Discrete-Time Poisson Channel. Cheraghchi, M.; and Ribeiro, J. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 1769–1773, 2018. Extended version in IEEE Transactions on Information Theory.
Improved Upper Bounds on the Capacity of the Discrete-Time Poisson Channel [link] link   Improved Upper Bounds on the Capacity of the Discrete-Time Poisson Channel [link] paper   doi   bibtex   abstract  
Expressions for the Entropy of Binomial-Type Distributions. Cheraghchi, M. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 2520–2524, 2018. Extended version in IEEE Transactions on Information Theory.
Expressions for the Entropy of Binomial-Type Distributions [link] link   Expressions for the Entropy of Binomial-Type Distributions [link] paper   doi   bibtex   abstract  
Efficiently Decodable Non-Adaptive Threshold Group Testing. Bui, T. V.; Kuribayashi, M.; Cheraghchi, M.; and Echizen, I. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 2584–2588, 2018. Extended version in IEEE Transactions on Information Theory.
Efficiently Decodable Non-Adaptive Threshold Group Testing [link] link   Efficiently Decodable Non-Adaptive Threshold Group Testing [link] paper   doi   bibtex   abstract  
Local Testing of Lattices. Chandrasekaran, K.; Cheraghchi, M.; Gandikota, V.; and Grigorescu, E. SIAM Journal on Discrete Mathematics, 32(2): 1265–1295. 2018. Preliminary version in Proceedings of FSTTCS 2016.
Local Testing of Lattices [link] link   Local Testing of Lattices [link] paper   doi   bibtex   abstract  
AC0-MOD2 lower bounds for the Boolean Inner Product. Cheraghchi, M.; Grigorescu, E.; Juba, B.; Wimmer, K.; and Xie, N. Journal of Computer and System Sciences, 97: 45–59. 2018. Preliminary version in Proceedings of ICALP 2016.
AC0-MOD2 lower bounds for the Boolean Inner Product [link] link   AC0-MOD2 lower bounds for the Boolean Inner Product [link] paper   doi   bibtex   abstract  
  2017 (2)
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. Cheraghchi, M.; and Indyk, P. ACM Transactions on Algorithms, 13(3). March 2017. Preliminary version in Proceedings of SODA 2016.
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform [link] link   Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform [link] paper   doi   bibtex   abstract  
Non-malleable Coding Against Bit-Wise and Split-State Tampering. Cheraghchi, M.; and Guruswami, V. Journal of Cryptology, 30: 191–241. 2017. Preliminary version in Proceedings of TCC 2014.
Non-malleable Coding Against Bit-Wise and Split-State Tampering [link] link   Non-malleable Coding Against Bit-Wise and Split-State Tampering [link] paper   doi   bibtex   abstract  
  2016 (5)
Local Testing for Membership in Lattices. Chandrasekaran, K.; Cheraghchi, M.; Gandikota, V.; and Grigorescu, E. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 65, of Leibniz International Proceedings in Informatics (LIPIcs), pages 46:1–46:14, 2016. Extended version in SIAM Journal on Discrete Mathematics.
Local Testing for Membership in Lattices [link] link   Local Testing for Membership in Lattices [link] paper   doi   bibtex   abstract  
AC0-MOD2 lower bounds for the Boolean Inner Product. Cheraghchi, M.; Grigorescu, E.; Juba, B.; Wimmer, K.; and Xie, N. In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), volume 55, of Leibniz International Proceedings in Informatics (LIPIcs), pages 35:1–35:14, 2016. Extended version in Journal of Computer and System Sciences
AC0-MOD2 lower bounds for the Boolean Inner Product [link] link   AC0-MOD2 lower bounds for the Boolean Inner Product [link] paper   doi   bibtex   abstract  
Nearly optimal robust secret sharing. Cheraghchi, M. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 2509–2513, 2016. Extended version in Designs, Codes and Cryptography.
Nearly optimal robust secret sharing [link] link   Nearly optimal robust secret sharing [link] paper   doi   bibtex   abstract  
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. Cheraghchi, M.; and Indyk, P. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 298–317, 2016. Preliminary version in Proceedings of SODA 2016.
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform [link] link   Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform [link] paper   bibtex   abstract  
Capacity of Non-Malleable Codes. Cheraghchi, M.; and Guruswami, V. IEEE Transactions on Information Theory, 62(3): 1097–1118. 2016. Preliminary version in Proceedings of ITCS 2014.
Capacity of Non-Malleable Codes [link] link   Capacity of Non-Malleable Codes [link] paper   doi   bibtex   abstract  
  2014 (2)
Non-malleable Coding Against Bit-Wise and Split-State Tampering. Cheraghchi, M.; and Guruswami, V. In Proceedings of Theory of Cryptography Conference (TCC), pages 440–464, 2014. Extended version in Journal of Cryptology.
Non-malleable Coding Against Bit-Wise and Split-State Tampering [link] link   Non-malleable Coding Against Bit-Wise and Split-State Tampering [link] paper   doi   bibtex   abstract  
Capacity of Non-Malleable Codes. Cheraghchi, M.; and Guruswami, V. In Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS), pages 155–168, 2014. Extended version in IEEE Transactions on Information Theory.
Capacity of Non-Malleable Codes [link] link   Capacity of Non-Malleable Codes [link] paper   doi   bibtex   abstract  
  2013 (4)
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. Cheraghchi, M.; Guruswami, V.; and Velingker, A. SIAM Journal on Computing, 42(5): 1888–1914. 2013. Preliminary version in Proceedings of SODA 2013.
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes [link] link   Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes [link] paper   doi   bibtex   abstract  
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. Cheraghchi, M.; Guruswami, V.; and Velingker, A. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 432–442, 2013. Extended version in SIAM Journal on Computing (SICOMP).
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes [link] link   Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes [link] paper   bibtex   abstract  
Improved Constructions for Non-adaptive Threshold Group Testing. Cheraghchi, M. Algorithmica, 67: 384–417. 2013. Preliminary version in Proceedings of ICALP 2010.
Improved Constructions for Non-adaptive Threshold Group Testing [link] link   Improved Constructions for Non-adaptive Threshold Group Testing [link] slides   Improved Constructions for Non-adaptive Threshold Group Testing [link] paper   doi   bibtex   abstract  
Noise-resilient group testing: Limitations and constructions. Cheraghchi, M. Discrete Applied Mathematics, 161(1): 81–95. 2013. Preliminary version in Proceedings of the FCT 2009. arXiv manuscript published in 2008.
Noise-resilient group testing: Limitations and constructions [link] link   Noise-resilient group testing: Limitations and constructions [link] paper   doi   bibtex   abstract  
  2012 (5)
Correctness and Corruption of Locally Decodable Codes. Cheraghchi, M.; Gál, A.; and Mills, A. 2012. Manuscript.
Correctness and Corruption of Locally Decodable Codes [link] paper   bibtex   abstract  
Submodular Functions Are Noise Stable. Cheraghchi, M.; Klivans, A.; Kothari, P.; and Lee, H. K. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1586–1592, 2012.
Submodular Functions Are Noise Stable [link] link   Submodular Functions Are Noise Stable [link] paper   bibtex   abstract  
Approximating Linear Threshold Predicates. Cheraghchi, M.; Håstad, J.; Isaksson, M.; and Svensson, O. ACM Transactions on Computation Theory (ToCT), 4(1). March 2012. Preliminary version in Proceedings of APPROX 2010.
Approximating Linear Threshold Predicates [link] link   Approximating Linear Threshold Predicates [link] paper   doi   bibtex   abstract  
Graph-Constrained Group Testing. Cheraghchi, M.; Karbasi, A.; Mohajer, S.; and Saligrama, V. IEEE Transactions on Information Theory, 58(1): 248–262. 2012. Preliminary version in Proceedings of ISIT 2010.
Graph-Constrained Group Testing [link] link   Graph-Constrained Group Testing [link] paper   doi   bibtex   abstract  
Invertible Extractors and Wiretap Protocols. Cheraghchi, M.; Didier, F.; and Shokrollahi, A. IEEE Transactions on Information Theory, 58(2): 1254–1274. 2012. Preliminary version in Proceedings of ISIT 2009.
Invertible Extractors and Wiretap Protocols [link] link   Invertible Extractors and Wiretap Protocols [link] paper   doi   bibtex   abstract  
  2011 (2)
Coding-Theoretic Methods for Sparse Recovery. Cheraghchi, M. In Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing, pages 909–916, 2011.
Coding-Theoretic Methods for Sparse Recovery [link] link   Coding-Theoretic Methods for Sparse Recovery [link] paper   doi   bibtex   abstract  
Group Testing With Probabilistic Tests: Theory, Design and Application. Cheraghchi, M.; Hormati, A.; Karbasi, A.; and Vetterli, M. IEEE Transactions on Information Theory, 57(10): 7057–7067. 2011. Preliminary version in Proceedings of the Allerton 2009.
Group Testing With Probabilistic Tests: Theory, Design and Application [link] link   Group Testing With Probabilistic Tests: Theory, Design and Application [link] paper   doi   bibtex   abstract  
  2010 (5)
Derandomization and Group Testing. Cheraghchi, M. In Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing, pages 991–997, 2010.
Derandomization and Group Testing [link] link   Derandomization and Group Testing [link] paper   doi   bibtex   abstract  
Approximating Linear Threshold Predicates. Cheraghchi, M.; Håstad, J.; Isaksson, M.; and Svensson, O. In Proceedings of APPROX, pages 110–123, 2010. Extended version in ACM Transactions on Computation Theory (ToCT).
Approximating Linear Threshold Predicates [link] link   Approximating Linear Threshold Predicates [link] paper   doi   bibtex   abstract  
Improved Constructions for Non-adaptive Threshold Group Testing. Cheraghchi, M. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), pages 552–564, 2010. Extended version in Algorithmica.
Improved Constructions for Non-adaptive Threshold Group Testing [link] link   Improved Constructions for Non-adaptive Threshold Group Testing [link] slides   Improved Constructions for Non-adaptive Threshold Group Testing [link] paper   doi   bibtex   abstract  
Graph-constrained group testing. Cheraghchi, M.; Karbasi, A.; Mohajer, S.; and Saligrama, V. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 1913–1917, 2010. Extended version in IEEE Transactions on Information Theory.
Graph-constrained group testing [link] link   Graph-constrained group testing [link] paper   doi   bibtex   abstract  
Applications of Derandomization Theory in Coding. Cheraghchi, M. Ph.D. Thesis, EPFL, Lausanne, Switzerland, 2010.
Applications of Derandomization Theory in Coding [link] link   Applications of Derandomization Theory in Coding [link] paper   Applications of Derandomization Theory in Coding [link]Paper   doi   bibtex   abstract  
  2009 (6)
Compressed sensing with probabilistic measurements: A group testing solution. Cheraghchi, M.; Hormati, A.; Karbasi, A.; and Vetterli, M. In Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, pages 30–35, 2009. Extended version in IEEE Transactions on Information Theory.
Compressed sensing with probabilistic measurements: A group testing solution [link] link   Compressed sensing with probabilistic measurements: A group testing solution [link] paper   doi   bibtex   abstract  
Noise-resilient group testing: Limitations and constructions. Cheraghchi, M. In Proceedings of the 17th International Symposium on Fundamentals of Computation Theory (FCT), pages 62–73, 2009. Extended version in Discrete Applied Mathematics. arXiv manuscript published in 2008.
Noise-resilient group testing: Limitations and constructions [link] link   Noise-resilient group testing: Limitations and constructions [link] paper   doi   bibtex   abstract  
Capacity achieving codes from randomness conductors. Cheraghchi, M. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 2639–2643, 2009.
Capacity achieving codes from randomness conductors [link] link   Capacity achieving codes from randomness conductors [link] paper   doi   bibtex   abstract  
Invertible Extractors and Wiretap Protocols. Cheraghchi, M.; Didier, F.; and Shokrollahi, A. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 1934–1938, 2009. Extended version in IEEE Transactions on Information Theory.
Invertible Extractors and Wiretap Protocols [link] link   Invertible Extractors and Wiretap Protocols [link] paper   doi   bibtex   abstract  
Bit precision analysis for compressed sensing. Ardestanizadeh, E.; Cheraghchi, M.; and Shokrollahi, A. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 1-5, 2009.
Bit precision analysis for compressed sensing [link] link   Bit precision analysis for compressed sensing [link] paper   doi   bibtex   abstract  
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. Cheraghchi, M.; and Shokrollahi, A. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 3, of Leibniz International Proceedings in Informatics (LIPIcs), pages 277–288, 2009.
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties [link] link   Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties [link] paper   doi   bibtex   abstract  
  2006 (1)
Computational Hardness and Explicit Constructions of Error Correcting Codes. Cheraghchi, M.; Shokrollahi, A.; and Wigderson, A. In Proceedings of the 44th Annual Allerton Conference on Communication, Control, and Computing, pages 1173–1179, 2006.
Computational Hardness and Explicit Constructions of Error Correcting Codes [link] paper   bibtex   abstract  
  2005 (2)
On Matrix Rigidity and the Complexity of Linear Forms. Cheraghchi, M. 2005. ECCC Technical Report TR05-070.
bibtex   abstract  
Locally Testble Codes. Cheraghchi, M. Master's thesis, EPFL, Lausanne, Switzerland, 2005.
Locally Testble Codes [link] paper   bibtex   abstract