Mary Wootters

CoRR, May, 2025

Robust Gray Codes Approaching the Optimal Rate.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, March, 2025

Optimization by decoded quantum interferometry.

[BibT_eX]

[DOI]

Alexander Schmidhuber

Nat., 2025

List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel.

[BibT_eX]

[DOI]

Francisco Pernice

Oscar Sprumont

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Improved Bounds on Access-Redundancy Tradeoffs in Quantized Linear Computations.

[BibT_eX]

[DOI]

Ching-Fang Li

Proceedings of the IEEE International Symposium on Information Theory, 2025

2024

Low-Density Parity-Check Codes Achieve List-Decoding Capacity.

[BibT_eX]

[DOI]

SIAM J. Comput., 2024

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2024

Interactive Coding with Small Memory and Improved Rate.

[BibT_eX]

[DOI]

CoRR, 2024

Improved Construction of Robust Gray Code.

[BibT_eX]

[DOI]

Dorsa Fathollahi

CoRR, 2024

Viderman's algorithm for quantum LDPC codes.

[BibT_eX]

[DOI]

Anirudh Krishna

Inbal Livni Navon

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Improved Construction of Robust Gray Codes.

[BibT_eX]

[DOI]

Dorsa Fathollahi

Proceedings of the IEEE International Symposium on Information Theory, 2024

A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Improved Trade-Offs Between Amortization and Download Bandwidth for Linear HSS.

[BibT_eX]

[DOI]

Proceedings of the 5th Conference on Information-Theoretic Cryptography, 2024

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?

[BibT_eX]

[DOI]

Dean Doron

Jonathan Mosheiff

Proceedings of the Approximation, 2024

2023

Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes.

[BibT_eX]

[DOI]

SIAM J. Comput., June, 2023

Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Max-Margin Works while Large Margin Fails: Generalization without Uniform Convergence.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Threshold Rates for Properties of Random Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Efficient Near-Optimal Codes for General Repeat Channels.

[BibT_eX]

[DOI]

Francisco Pernice

CoRR, 2022

Efficient Capacity-Achieving Codes for General Repeat Channels.

[BibT_eX]

[DOI]

Francisco Pernice

Proceedings of the IEEE International Symposium on Information Theory, 2022

Improved batch code lower bounds.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Lower bounds on the redundancy of linear codes with disjoint repair groups.

[BibT_eX]

[DOI]

Sankeerth Rao Karingula

Alexander Vardy

Proceedings of the IEEE International Symposium on Information Theory, 2022

Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data.

[BibT_eX]

[DOI]

Noah Shutty

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

On the Download Rate of Homomorphic Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

High-Probability List-Recovery, and Applications to Heavy Hitters.

[BibT_eX]

[DOI]

Dean Doron

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Asynchronous Distributed Optimization with Stochastic Delays.

[BibT_eX]

[DOI]

Margalit R. Glasgow

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Hermitian-lifted codes.

[BibT_eX]

[DOI]

Hiram H. López

Beth Malmskog

Gretchen L. Matthews

Fernando Piñero-González

Des. Codes Cryptogr., 2021

A Note on the Permuted Puzzles Toy Conjecture.

[BibT_eX]

[DOI]

CoRR, 2021

On Greedy Approaches to Hierarchical Aggregation.

[BibT_eX]

[DOI]

Alexandra M. Porter

Proceedings of the IEEE International Symposium on Information Theory, 2021

On Coding for an Abstracted Nanopore Channel for DNA Storage.

[BibT_eX]

[DOI]

Reyna Hulett

Shubham Chandak

Proceedings of the IEEE International Symposium on Information Theory, 2021

Wedge-Lifted Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Approximate Gradient Coding with Optimal Decoding.

[BibT_eX]

[DOI]

Margalit Glasgow

Proceedings of the IEEE International Symposium on Information Theory, 2021

Sharp Threshold Rates for Random Codes.

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Local List Recovery of High-Rate Tensor Codes and Applications.

[BibT_eX]

[DOI]

Noga Ron-Zewi

SIAM J. Comput., 2020

Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning.

[BibT_eX]

[DOI]

Rawad Bitar

Salim El Rouayheb

IEEE J. Sel. Areas Inf. Theory, 2020

Improved List-Decodability of Reed-Solomon Codes via Tree Packings.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

Asynchronous Distributed Optimization with Randomized Delays.

[BibT_eX]

[DOI]

Margalit Glasgow

CoRR, 2020

List-Decodability of Structured Ensembles of Codes (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Linear-time Erasure List-decoding of Expander Codes.

[BibT_eX]

[DOI]

Noga Ron-Zewi

Gilles Zémor

Proceedings of the IEEE International Symposium on Information Theory, 2020

Overcoming High Nanopore Basecaller Error Rates for DNA Storage via Basecaller-Decoder Integration and Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Sparse Recovery for Orthogonal Polynomial Transforms.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise.

[BibT_eX]

[DOI]

Noah Shutty

Patrick Hayden

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

LDPC Codes Achieve List Decoding Capacity.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Bounds for List-Decoding and List-Recovery of Random Linear Codes.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2020

2019

Repairing Multiple Failures for Scalar MDS Codes.

[BibT_eX]

[DOI]

Jay Mardia

Burak Bartan

IEEE Trans. Inf. Theory, 2019

The N3XT Approach to Energy-Efficient Abundant-Data Computing.

[BibT_eX]

[DOI]

Proc. IEEE, 2019

Lifted Multiplicity Codes.

[BibT_eX]

[DOI]

CoRR, 2019

Embedded Index Coding.

[BibT_eX]

[DOI]

Alexandra M. Porter

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning.

[BibT_eX]

[DOI]

Rawad Bitar

Salim El Rouayheb

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

A 43pJ/Cycle Non-Volatile Microcontroller with 4.7μs Shutdown/Wake-up Integrating 2.3-bit/Cell Resistive RAM and Resilience Techniques.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Solid- State Circuits Conference, 2019

A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Circuits and Systems, 2019

Unconstraining Graph-Constrained Group Testing.

[BibT_eX]

[DOI]

Bruce Spang

Proceedings of the Approximation, 2019

Lifted Multiplicity Codes and the Disjoint Repair Group Property.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

Improved read/write cost tradeoff in DNA-based data storage using LDPC codes.

[BibT_eX]

[DOI]

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

2018

Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation.

[BibT_eX]

[DOI]

Noah Shutty

Patrick Hayden

CoRR, 2018

Random linear binary codes have smaller list sizes than uniformly random binary codes.

[BibT_eX]

[DOI]

CoRR, 2018

Average-radius list-recoverability of random linear codes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On Taking Advantage of Multiple Requests in Error Correcting Codes.

[BibT_eX]

[DOI]

Prasanna Ramakrishnan

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

Load-Balanced Fractional Repetition Codes.

[BibT_eX]

[DOI]

Alexandra M. Porter

Shashwat Silas

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

Improved Decoding of Folded Reed-Solomon and Multiplicity Codes.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Improved List-Decodability of Random Linear Binary Codes.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2018

On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing.

[BibT_eX]

[DOI]

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

Fast Blind MIMO Decoding through Vertex Hopping.

[BibT_eX]

[DOI]

Proceedings of the 52nd Asilomar Conference on Signals, Systems, and Computers, 2018

2017

Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Average-radius list-recovery of random linear codes: it really ties the room together.

[BibT_eX]

[DOI]

CoRR, 2017

Limitations on the Achievable Repair Bandwidth of Piggybacking Codes with Low Substriping.

[BibT_eX]

[DOI]

Reyna Hulett

CoRR, 2017

Can We Access a Database Both Locally and Privately?

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Blind Joint MIMO Channel Estimation and Decoding.

[BibT_eX]

[DOI]

Thomas R. Dean

Andrea Goldsmith

Proceedings of the 2017 IEEE Global Communications Conference, 2017

Local List Recovery of High-Rate Tensor Codes & Applications.

[BibT_eX]

[DOI]

Noga Ron-Zewi

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Locality via Partially Lifted Codes.

[BibT_eX]

[DOI]

S. Luna Frank-Fischer

Venkatesan Guruswami

Proceedings of the Approximation, 2017

Limitations of piggybacking codes with low substriping.

[BibT_eX]

[DOI]

Reyna Hulett

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

Repairing multiple failures for scalar MDS codes.

[BibT_eX]

[DOI]

Burak Bartan

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

2016

Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword.

[BibT_eX]

[DOI]

Nicole Megow

Theory Comput., 2016

One-Bit Compressive Sensing of Dictionary-Sparse Signals.

[BibT_eX]

[DOI]

CoRR, 2016

Repairing Reed-solomon codes.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Christos H. Papadimitriou

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Strategic Classification.

[BibT_eX]

[DOI]

Moritz Hardt

Nimrod Megiddo

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015

It'll Probably Work Out: Improved List-Decoding Through Random Operations.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Linear-Time List Recovery of High-Rate Expander Codes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Every list-decodable code for high noise has abundant near-optimal rate puncturings.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

New constructions of RIP matrices with fast multiplication and fewer rows.

[BibT_eX]

[DOI]

Jelani Nelson

Eric Price

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Fast matrix completion without the condition number.

[BibT_eX]

[DOI]

Moritz Hardt

Proceedings of The 27th Conference on Learning Theory, 2014

2013

On the list decodability of random linear codes with large error rate

[BibT_eX]

[DOI]

CoRR, 2013

Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

On the list decodability of random linear codes with large error rates.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Lower bounds for quantized matrix completion.

[BibT_eX]

[DOI]

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

Local Correctability of Expander Codes.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

1-Bit Matrix Completion

[BibT_eX]

[DOI]

CoRR, 2012

Reusable low-error compressive sampling schemes through privacy.

[BibT_eX]

[DOI]

Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

Recovering simple signals.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

2011

Public Key Locally Decodable Codes with Short Keys.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2008

Configuration spaces of convex and embedded polygons in the plane

[BibT_eX]

[DOI]

Don Shimamoto