The following pages link to Mahdi Cheraghchi (Q378255):
Displaying 40 items.
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Noise-resilient group testing: limitations and constructions (Q1759866) (← links)
- Nearly optimal robust secret sharing (Q1999899) (← links)
- Capacity of Non-Malleable Codes (Q2976946) (← links)
- Capacity of non-malleable codes (Q2988875) (← links)
- Noise-Resilient Group Testing: Limitations and Constructions (Q3183597) (← links)
- Local Testing of Lattices (Q4565131) (← links)
- Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform (Q4575600) (← links)
- AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product. (Q4598171) (← links)
- Local Testing for Membership in Lattices (Q4636596) (← links)
- An Overview of Capacity Results for Synchronization Channels (Q5001711) (← links)
- Improved Non-Adaptive Algorithms for Threshold Group Testing With a Gap (Q5032567) (← links)
- Circuit Lower Bounds for MCSP from Local Pseudorandom Generators (Q5053073) (← links)
- Mean-Based Trace Reconstruction Over Oblivious Synchronization Channels (Q5088552) (← links)
- (Q5090431) (← links)
- (Q5091189) (← links)
- Coded Trace Reconstruction (Q5138794) (← links)
- Efficiently Decodable Non-Adaptive Threshold Group Testing (Q5211383) (← links)
- Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels (Q5211486) (← links)
- Expressions for the Entropy of Basic Discrete Distributions (Q5224049) (← links)
- Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel (Q5224054) (← links)
- Capacity upper bounds for deletion-type channels (Q5230313) (← links)
- Capacity Upper Bounds for Deletion-type Channels (Q5244382) (← links)
- Invertible Extractors and Wiretap Protocols (Q5272138) (← links)
- Graph-Constrained Group Testing (Q5272163) (← links)
- Group Testing With Probabilistic Tests: Theory, Design and Application (Q5272323) (← links)
- Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties (Q5389984) (← links)
- Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes (Q5396950) (← links)
- Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes (Q5741739) (← links)
- (Q5743502) (← links)
- Approximating Linear Threshold Predicates (Q5892185) (← links)
- Approximating Linear Threshold Predicates (Q5901178) (← links)
- Leakage-Resilient Secret Sharing in Non-Compartmentalized Models. (Q6059366) (← links)
- Simple Codes and Sparse Recovery with Fast Decoding (Q6101016) (← links)
- (Q6187019) (← links)
- Secret Sharing with Binary Shares (Q6305209) (← links)
- One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms (Q6621748) (← links)
