default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahdi Cheraghchi
Person information
- affiliation: University of Michigan, Ann Arbor, MI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j28]Ananthan Nambiar, Chao Pan, Vishal Rana, Mahdi Cheraghchi, João Ribeiro, Sergei Maslov, Olgica Milenkovic:
Semi-quantitative group testing for efficient and accurate qPCR screening of pathogens with a wide range of loads. BMC Bioinform. 25(1): 195 (2024)- [j27]Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis
, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. Theory Comput. Syst. 68(4): 868-899 (2024) - [j26]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \({\ell_{{p}}}\) Norms. SIAM J. Comput. 53(5): 1439-1475 (2024) - 2023
- [j25]Mahdi Cheraghchi, João Ribeiro:
Simple Codes and Sparse Recovery with Fast Decoding. SIAM J. Discret. Math. 37(2): 612-631 (2023) - [c39]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms. STOC 2023: 553-566 - [i60]Anantham Nambiar, Chao Pan, Vishal Rana, Mahdi Cheraghchi, João Ribeiro, Sergei Maslov, Olgica Milenkovic:
Semi-Quantitative Group Testing for Efficient and Accurate qPCR Screening of Pathogens with a Wide Range of Loads. CoRR abs/2307.16352 (2023) - [i59]Arash Vaezi, Mahdi Cheraghchi, Seyed Mohammad Hussein Kazemi, Negin Bagheri Noghrehy, Seyed Mohsen Kazemi, Ali Movaghar, Mohammad Ghodsi:
Where Quantum Complexity Helps Classical Complexity. CoRR abs/2312.14075 (2023) - 2022
- [j24]Mahdi Cheraghchi, Joseph Downs, João Ribeiro, Alexandra Veliche:
Mean-Based Trace Reconstruction Over Oblivious Synchronization Channels. IEEE Trans. Inf. Theory 68(7): 4272-4281 (2022) - [i58]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all 𝓁p Norms. CoRR abs/2211.07900 (2022) - [i57]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓp Norms. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j23]Mahdi Cheraghchi, João Ribeiro:
Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel With Positive Dark Current. IEEE Commun. Lett. 25(12): 3829-3832 (2021) - [j22]Mahdi Cheraghchi, João Ribeiro:
An Overview of Capacity Results for Synchronization Channels. IEEE Trans. Inf. Theory 67(6): 3207-3232 (2021) - [j21]Thach V. Bui, Mahdi Cheraghchi, Isao Echizen:
Improved Non-Adaptive Algorithms for Threshold Group Testing With a Gap. IEEE Trans. Inf. Theory 67(11): 7180-7196 (2021) - [c38]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
List Learning with Attribute Noise. AISTATS 2021: 2215-2223 - [c37]Eric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala, Ilya Volkovich:
One-Way Functions and a Conditional Variant of MKTP. FSTTCS 2021: 7:1-7:19 - [c36]Thach V. Bui, Mahdi Cheraghchi, Thuc Dinh Nguyen:
Improved algorithms for non-adaptive group testing with consecutive positives. ISIT 2021: 1961-1966 - [c35]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic:
Semiquantitative Group Testing in at Most Two Rounds. ISIT 2021: 1973-1978 - [c34]Mahdi Cheraghchi, Joseph Downs, João Ribeiro, Alexandra Veliche:
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel. ISIT 2021: 2459-2464 - [c33]Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. STACS 2021: 23:1-23:19 - [i56]Thach V. Bui, Mahdi Cheraghchi, Thuc Dinh Nguyen:
Improved algorithms for non-adaptive group testing with consecutive positives. CoRR abs/2101.11294 (2021) - [i55]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic:
Semiquantitative Group Testing in at Most Two Rounds. CoRR abs/2102.04519 (2021) - [i54]Mahdi Cheraghchi, Joseph Downs, João Ribeiro, Alexandra Veliche:
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel. CoRR abs/2102.09490 (2021) - [i53]Eric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala, Ilya Volkovich:
One-way Functions and Partial MCSP. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j20]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic, João Ribeiro:
Coded Trace Reconstruction. IEEE Trans. Inf. Theory 66(10): 6084-6103 (2020) - [j19]Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. ACM Trans. Comput. Theory 12(3): 21:1-21:27 (2020) - [c32]Mahdi Cheraghchi, Vasileios Nakos:
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. FOCS 2020: 1203-1213 - [c31]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Leakage-Resilient Secret Sharing in Non-Compartmentalized Models. ITC 2020: 7:1-7:24 - [c30]Thach V. Bui, Mahdi Cheraghchi, Isao Echizen:
Improved non-adaptive algorithms for threshold group testing with a gap. ISIT 2020: 1414-1419 - [i52]Thach V. Bui, Mahdi Cheraghchi, Isao Echizen:
Improved non-adaptive algorithms for threshold group testing with a gap. CoRR abs/2001.01008 (2020) - [i51]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
List Learning with Attribute Noise. CoRR abs/2006.06850 (2020) - [i50]Mahdi Cheraghchi, Vasileios Nakos:
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. CoRR abs/2006.08420 (2020) - [i49]Mahdi Cheraghchi, João Ribeiro:
Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel with Positive Dark Current. CoRR abs/2010.14858 (2020) - [i48]Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j18]Mahdi Cheraghchi:
Nearly optimal robust secret sharing. Des. Codes Cryptogr. 87(8): 1777-1796 (2019) - [j17]Mahdi Cheraghchi:
Capacity Upper Bounds for Deletion-type Channels. J. ACM 66(2): 9:1-9:79 (2019) - [j16]Mahdi Cheraghchi:
Expressions for the Entropy of Basic Discrete Distributions. IEEE Trans. Inf. Theory 65(7): 3999-4009 (2019) - [j15]Mahdi Cheraghchi, João Ribeiro:
Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel. IEEE Trans. Inf. Theory 65(7): 4052-4068 (2019) - [j14]Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen:
Efficiently Decodable Non-Adaptive Threshold Group Testing. IEEE Trans. Inf. Theory 65(9): 5519-5528 (2019) - [j13]Mahdi Cheraghchi, João Ribeiro:
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. IEEE Trans. Inf. Theory 65(11): 6950-6974 (2019) - [c29]Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. ICALP 2019: 39:1-39:14 - [c28]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Secret Sharing with Binary Shares. ITCS 2019: 53:1-53:20 - [c27]Mahdi Cheraghchi, João Ribeiro:
Simple Codes and Sparse Recovery with Fast Decoding. ISIT 2019: 156-160 - [c26]Fuchun Lin, Reihaneh Safavi-Naini, Mahdi Cheraghchi, Huaxiong Wang:
Non-Malleable Codes against Active Physical Layer Adversary. ISIT 2019: 2753-2757 - [c25]Mahdi Cheraghchi, João Ribeiro, Ryan Gabrys, Olgica Milenkovic:
Coded Trace Reconstruction. ITW 2019: 1-5 - [i47]Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen:
Improved encoding and decoding for non-adaptive threshold group testing. CoRR abs/1901.02283 (2019) - [i46]Mahdi Cheraghchi, João Ribeiro:
Simple Codes and Sparse Recovery with Fast Decoding. CoRR abs/1901.02852 (2019) - [i45]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Non-Malleable Secret Sharing against Affine Tampering. CoRR abs/1902.06195 (2019) - [i44]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic, João Ribeiro:
Coded trace reconstruction. CoRR abs/1903.09992 (2019) - [i43]Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen:
Efficient and error-tolerant schemes for non-adaptive complex group testing and its application in complex disease genetics. CoRR abs/1904.00349 (2019) - [i42]Mahdi Cheraghchi, João Ribeiro:
An Overview of Capacity Results for Synchronization Channels. CoRR abs/1910.07199 (2019) - [i41]Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j12]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
AC0∘MOD2 lower bounds for the Boolean Inner Product. J. Comput. Syst. Sci. 97: 45-59 (2018) - [j11]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing of Lattices. SIAM J. Discret. Math. 32(2): 1265-1295 (2018) - [c24]Mahdi Cheraghchi, João Ribeiro:
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. Allerton 2018: 1104-1111 - [c23]Mahdi Cheraghchi, João Ribeiro:
Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel. ISIT 2018: 1769-1773 - [c22]Mahdi Cheraghchi:
Expressions for the Entropy of Binomial-Type Distributions. ISIT 2018: 2520-2524 - [c21]Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen:
Efficiently Decodable Non-Adaptive Threshold Group Testing. ISIT 2018: 2584-2588 - [c20]Mahdi Cheraghchi:
Capacity upper bounds for deletion-type channels. STOC 2018: 493-506 - [i40]Mahdi Cheraghchi, João Ribeiro:
Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel. CoRR abs/1801.02745 (2018) - [i39]Mahdi Cheraghchi, João Ribeiro:
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. CoRR abs/1806.06218 (2018) - [i38]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Secret Sharing with Binary Shares. CoRR abs/1808.02974 (2018) - [i37]Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen:
A framework for generalized group testing with inhibitors and its potential application in neuroscience. CoRR abs/1810.01086 (2018) - [i36]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Secret Sharing with Binary Shares. IACR Cryptol. ePrint Arch. 2018: 746 (2018) - 2017
- [j10]Mahdi Cheraghchi, Venkatesan Guruswami:
Non-malleable Coding Against Bit-Wise and Split-State Tampering. J. Cryptol. 30(1): 191-241 (2017) - [j9]Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. ACM Trans. Algorithms 13(3): 34:1-34:36 (2017) - [i35]Fuchun Lin, Reihaneh Safavi-Naini, Mahdi Cheraghchi, Huaxiong Wang:
Non-Malleable Codes with Leakage and Applications to Secure Communication. CoRR abs/1708.05462 (2017) - [i34]Mahdi Cheraghchi:
Expressions for the entropy of binomial-type distributions. CoRR abs/1708.06394 (2017) - [i33]Mahdi Cheraghchi:
Capacity upper bounds for deletion-type channels. CoRR abs/1711.01630 (2017) - [i32]Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen:
Efficiently Decodable Non-Adaptive Threshold Group Testing. CoRR abs/1712.07509 (2017) - 2016
- [j8]Mahdi Cheraghchi, Venkatesan Guruswami:
Capacity of Non-Malleable Codes. IEEE Trans. Inf. Theory 62(3): 1097-1118 (2016) - [c19]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. FSTTCS 2016: 46:1-46:14 - [c18]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product. ICALP 2016: 35:1-35:14 - [c17]Mahdi Cheraghchi:
Nearly optimal robust secret sharing. ISIT 2016: 2509-2513 - [c16]Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. SODA 2016: 298-317 - [i31]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. CoRR abs/1608.00180 (2016) - [i30]Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i29]Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. CoRR abs/1504.07648 (2015) - [i28]Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
AC0 \circ MOD2 lower bounds for the Boolean Inner Product. Electron. Colloquium Comput. Complex. TR15 (2015) - [i27]Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. Electron. Colloquium Comput. Complex. TR15 (2015) - [i26]Mahdi Cheraghchi:
Nearly Optimal Robust Secret Sharing. IACR Cryptol. ePrint Arch. 2015: 951 (2015) - 2014
- [c15]Mahdi Cheraghchi, Venkatesan Guruswami:
Capacity of non-malleable codes. ITCS 2014: 155-168 - [c14]Mahdi Cheraghchi, Venkatesan Guruswami:
Non-malleable Coding against Bit-Wise and Split-State Tampering. TCC 2014: 440-464 - 2013
- [j7]Mahdi Cheraghchi:
Improved Constructions for Non-adaptive Threshold Group Testing. Algorithmica 67(3): 384-417 (2013) - [j6]Mahdi Cheraghchi:
Noise-resilient group testing: Limitations and constructions. Discret. Appl. Math. 161(1-2): 81-95 (2013) - [j5]Mahdi Cheraghchi, Venkatesan Guruswami, Ameya Velingker:
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. SIAM J. Comput. 42(5): 1888-1914 (2013) - [c13]Mahdi Cheraghchi, Venkatesan Guruswami, Ameya Velingker:
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. SODA 2013: 432-442 - [i25]Mahdi Cheraghchi, Venkatesan Guruswami:
Capacity of Non-Malleable Codes. CoRR abs/1309.0458 (2013) - [i24]Mahdi Cheraghchi, Venkatesan Guruswami:
Non-Malleable Coding Against Bit-wise and Split-State Tampering. CoRR abs/1309.1151 (2013) - [i23]Mahdi Cheraghchi, Venkatesan Guruswami:
Capacity of Non-Malleable Codes. Electron. Colloquium Comput. Complex. TR13 (2013) - [i22]Mahdi Cheraghchi, Venkatesan Guruswami:
Non-Malleable Coding Against Bit-wise and Split-State Tampering. Electron. Colloquium Comput. Complex. TR13 (2013) - [i21]Mahdi Cheraghchi, Venkatesan Guruswami:
Capacity of Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2013: 564 (2013) - [i20]Mahdi Cheraghchi, Venkatesan Guruswami:
Non-Malleable Coding Against Bit-wise and Split-State Tampering. IACR Cryptol. ePrint Arch. 2013: 565 (2013) - 2012
- [j4]Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Venkatesh Saligrama:
Graph-Constrained Group Testing. IEEE Trans. Inf. Theory 58(1): 248-262 (2012) - [j3]Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi:
Invertible Extractors and Wiretap Protocols. IEEE Trans. Inf. Theory 58(2): 1254-1274 (2012) - [j2]Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson:
Approximating Linear Threshold Predicates. ACM Trans. Comput. Theory 4(1): 2:1-2:31 (2012) - [c12]Mahdi Cheraghchi, Adam R. Klivans, Pravesh Kothari, Homin K. Lee:
Submodular functions are noise stable. SODA 2012: 1586-1592 - [i19]Mahdi Cheraghchi, Venkatesan Guruswami, Ameya Velingker:
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. CoRR abs/1207.1140 (2012) - [i18]Mahdi Cheraghchi, Anna Gál, Andrew Mills:
Correctness and Corruption of Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR12 (2012) - [i17]Mahdi Cheraghchi, Venkatesan Guruswami, Ameya Velingker:
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j1]Mahdi Cheraghchi, Ali Hormati, Amin Karbasi, Martin Vetterli:
Group Testing With Probabilistic Tests: Theory, Design and Application. IEEE Trans. Inf. Theory 57(10): 7057-7067 (2011) - [c11]Mahdi Cheraghchi:
Coding-theoretic methods for sparse recovery. Allerton 2011: 909-916 - [i16]Mahdi Cheraghchi, Adam R. Klivans, Pravesh Kothari, Homin K. Lee:
Submodular Functions Are Noise Stable. CoRR abs/1106.0518 (2011) - [i15]Mahdi Cheraghchi:
Applications of Derandomization Theory in Coding. CoRR abs/1107.4709 (2011) - [i14]Mahdi Cheraghchi:
Coding-Theoretic Methods for Sparse Recovery. CoRR abs/1110.0279 (2011) - [i13]Mahdi Cheraghchi, Adam R. Klivans, Pravesh Kothari, Homin K. Lee:
Submodular Functions Are Noise Stable. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [b1]Mahdi Cheraghchi:
Applications of Derandomization Theory in Coding. EPFL, Switzerland, 2010 - [c10]Mahdi Cheraghchi:
Derandomization and group testing. Allerton 2010: 991-997 - [c9]Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson:
Approximating Linear Threshold Predicates. APPROX-RANDOM 2010: 110-123 - [c8]Mahdi Cheraghchi:
Improved Constructions for Non-adaptive Threshold Group Testing. ICALP (1) 2010: 552-564 - [c7]Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Venkatesh Saligrama:
Graph-constrained group testing. ISIT 2010: 1913-1917 - [i12]Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Venkatesh Saligrama:
Graph-Constrained Group Testing. CoRR abs/1001.1445 (2010) - [i11]Mahdi Cheraghchi:
Improved Constructions for Non-adaptive Threshold Group Testing. CoRR abs/1002.2244 (2010) - [i10]Mahdi Cheraghchi, Ali Hormati, Amin Karbasi, Martin Vetterli:
Group Testing with Probabilistic Tests: Theory, Design and Application. CoRR abs/1009.3186 (2010) - [i9]Mahdi Cheraghchi:
Derandomization and Group Testing. CoRR abs/1010.0433 (2010) - [i8]Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson:
Approximating Linear Threshold Predicates. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c6]Mahdi Cheraghchi, Ali Hormati, Amin Karbasi, Martin Vetterli:
Compressed sensing with probabilistic measurements: A group testing solution. Allerton 2009: 30-35 - [c5]Mahdi Cheraghchi:
Noise-Resilient Group Testing: Limitations and Constructions. FCT 2009: 62-73 - [c4]Ehsan Ardestanizadeh, Mahdi Cheraghchi, Amin Shokrollahi:
Bit precision analysis for compressed sensing. ISIT 2009: 1-5 - [c3]Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi:
Invertible extractors and wiretap protocols. ISIT 2009: 1934-1938 - [c2]Mahdi Cheraghchi:
Capacity achieving codes From randomness conductors. ISIT 2009: 2639-2643 - [c1]Mahdi Cheraghchi, Amin Shokrollahi:
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. STACS 2009: 277-288 - [i7]Mahdi Cheraghchi:
Capacity Achieving Codes From Randomness Conductors. CoRR abs/0901.1866 (2009) - [i6]Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi:
Invertible Extractors and Wiretap Protocols. CoRR abs/0901.2120 (2009) - [i5]Ehsan Ardestanizadeh, Mahdi Cheraghchi, Amin Shokrollahi:
Bit Precision Analysis for Compressed Sensing. CoRR abs/0901.2147 (2009) - [i4]Mahdi Cheraghchi, Amin Shokrollahi:
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. CoRR abs/0902.1254 (2009) - [i3]Mahdi Cheraghchi, Ali Hormati, Amin Karbasi, Martin Vetterli:
Compressed Sensing with Probabilistic Measurements: A Group Testing Solution. CoRR abs/0909.3508 (2009) - 2008
- [i2]Mahdi Cheraghchi:
Noise-Resilient Group Testing: Limitations and Constructions. CoRR abs/0811.2609 (2008) - 2005
- [i1]Mahdi Cheraghchi:
On Matrix Rigidity and the Complexity of Linear Forms. Electron. Colloquium Comput. Complex. TR05 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
