default search action
Mary Wootters
Person information
- affiliation: Stanford University, Department of Electrical Engineering, CA, USA
- affiliation (former): Carnegie Mellon University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j24]Zeyu Guo
, Ray Li
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. 53(2): 389-430 (2024) - [c60]Dean Doron, Jonathan Mosheiff, Mary Wootters:
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? APPROX/RANDOM 2024: 53:1-53:12 - [c59]Keller Blackwell, Mary Wootters:
Improved Trade-Offs Between Amortization and Download Bandwidth for Linear HSS. ITC 2024: 7:1-7:21 - [c58]Keller Blackwell, Mary Wootters:
A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications. ITCS 2024: 16:1-16:20 - [c57]Anirudh Krishna, Inbal Livni Navon, Mary Wootters:
Viderman's algorithm for quantum LDPC codes. SODA 2024: 2481-2507 - [i68]Noga Ron-Zewi, S. Venkitesh, Mary Wootters:
Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size. CoRR abs/2401.14517 (2024) - [i67]Dorsa Fathollahi, Mary Wootters:
Improved Construction of Robust Gray Code. CoRR abs/2401.15291 (2024) - [i66]Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters:
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. CoRR abs/2402.02358 (2024) - [i65]Keller Blackwell, Mary Wootters:
Improved Trade-offs Between Amortization and Download Bandwidth for Linear HSS. CoRR abs/2403.08719 (2024) - [i64]Dean Doron, Jonathan Mosheiff, Mary Wootters:
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? CoRR abs/2405.08584 (2024) - [i63]Roni Con, Dorsa Fathollahi, Ryan Gabrys, Mary Wootters, Eitan Yaakobi:
Robust Gray Codes Approaching the Optimal Rate. CoRR abs/2406.17689 (2024) - [i62]Dorsa Fathollahi, Bernhard Haeupler, Nicolas Resch, Mary Wootters:
Interactive Coding with Small Memory and Improved Rate. CoRR abs/2408.06541 (2024) - [i61]Dean Doron, Jonathan Mosheiff, Mary Wootters:
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j23]Swastik Kopparty, Noga Ron-Zewi
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. SIAM J. Comput. 52(3): 794-840 (2023) - [c56]Margalit Glasgow, Colin Wei, Mary Wootters, Tengyu Ma:
Max-Margin Works while Large Margin Fails: Generalization without Uniform Convergence. ICLR 2023 - [c55]Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters:
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. ISIT 2023: 1330-1335 - [i60]Keller Blackwell, Mary Wootters:
A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications. CoRR abs/2311.14842 (2023) - 2022
- [j22]Venkatesan Guruswami
Threshold Rates for Properties of Random Codes. IEEE Trans. Inf. Theory 68(2): 905-922 (2022) - [j21]Venkatesan Guruswami
Bounds for List-Decoding and List-Recovery of Random Linear Codes. IEEE Trans. Inf. Theory 68(2): 923-939 (2022) - [c54]Margalit R. Glasgow, Mary Wootters:
Asynchronous Distributed Optimization with Stochastic Delays. AISTATS 2022: 9247-9279 - [c53]Dean Doron
High-Probability List-Recovery, and Applications to Heavy Hitters. ICALP 2022: 55:1-55:17 - [c52]Ingerid Fosli, Yuval Ishai, Victor I. Kolobov, Mary Wootters:
On the Download Rate of Homomorphic Secret Sharing. ITCS 2022: 71:1-71:22 - [c51]Noah Shutty, Mary Wootters:
Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data. ITCS 2022: 117:1-117:19 - [c50]Sankeerth Rao Karingula, Alexander Vardy, Mary Wootters:
Lower bounds on the redundancy of linear codes with disjoint repair groups. ISIT 2022: 975-979 - [c49]Ray Li, Mary Wootters:
Improved batch code lower bounds. ISIT 2022: 1596-1599 - [c48]Francisco Pernice, Ray Li, Mary Wootters:
Efficient Capacity-Achieving Codes for General Repeat Channels. ISIT 2022: 3097-3102 - [i59]Francisco Pernice, Ray Li, Mary Wootters:
Efficient Near-Optimal Codes for General Repeat Channels. CoRR abs/2201.12746 (2022) - [i58]Margalit Glasgow, Colin Wei, Mary Wootters, Tengyu Ma:
Max-Margin Works while Large Margin Fails: Generalization without Uniform Convergence. CoRR abs/2206.07892 (2022) - 2021
- [j20]Hiram H. López
Hermitian-lifted codes. Des. Codes Cryptogr. 89(3): 497-515 (2021) - [j19]Margalit Glasgow
Approximate Gradient Coding With Optimal Decoding. IEEE J. Sel. Areas Inf. Theory 2(3): 855-866 (2021) - [j18]Ray Li
Lifted Multiplicity Codes and the Disjoint Repair Group Property. IEEE Trans. Inf. Theory 67(2): 716-725 (2021) - [j17]Simon Foucart, Deanna Needell
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns. IEEE Trans. Inf. Theory 67(2): 1264-1290 (2021) - [j16]Alexandra M. Porter
Embedded Index Coding. IEEE Trans. Inf. Theory 67(3): 1461-1477 (2021) - [j15]Ray Li
Improved List-Decodability of Random Linear Binary Codes. IEEE Trans. Inf. Theory 67(3): 1522-1536 (2021) - [j14]Noga Ron-Zewi
Linear-Time Erasure List-Decoding of Expander Codes. IEEE Trans. Inf. Theory 67(9): 5827-5839 (2021) - [c47]Zeyu Guo
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS 2021: 708-719 - [c46]Venkatesan Guruswami, Jonathan Mosheiff
Sharp Threshold Rates for Random Codes. ITCS 2021: 5:1-5:20 - [c45]Margalit Glasgow, Mary Wootters:
Approximate Gradient Coding with Optimal Decoding. ISIT 2021: 2280-2285 - [c44]Reyna Hulett, Shubham Chandak, Mary Wootters:
On Coding for an Abstracted Nanopore Channel for DNA Storage. ISIT 2021: 2465-2470 - [c43]Alexandra M. Porter, Mary Wootters:
On Greedy Approaches to Hierarchical Aggregation. ISIT 2021: 2649-2654 - [c42]Jabari Hastings
Wedge-Lifted Codes. ISIT 2021: 2990-2995 - [e1]Mary Wootters
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference). LIPIcs 207, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-207-5 [contents] - [i57]Alexandra M. Porter, Mary Wootters:
On Greedy Approaches to Hierarchical Aggregation. CoRR abs/2102.01730 (2021) - [i56]Reyna Hulett, Shubham Chandak, Mary Wootters:
On Coding for an Abstracted Nanopore Channel for DNA Storage. CoRR abs/2102.01839 (2021) - [i55]Ray Li, Mary Wootters:
Improved batch code lower bounds. CoRR abs/2106.02163 (2021) - [i54]Noah Shutty
Low-bandwidth recovery of linear functions of Reed-Solomon-encoded data. CoRR abs/2107.11847 (2021) - [i53]Keller Blackwell, Mary Wootters:
A Note on the Permuted Puzzles Toy Conjecture. CoRR abs/2108.07885 (2021) - [i52]Ingerid Fosli, Yuval Ishai, Victor I. Kolobov, Mary Wootters:
On the Download Rate of Homomorphic Secret Sharing. CoRR abs/2111.10126 (2021) - [i51]Ingerid Fosli, Yuval Ishai, Victor I. Kolobov, Mary Wootters:
On the Download Rate of Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. 2021: 1532 (2021) - 2020
- [j13]Rawad Bitar
Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning. IEEE J. Sel. Areas Inf. Theory 1(1): 277-291 (2020) - [j12]Brett Hemenway, Noga Ron-Zewi
Local List Recovery of High-Rate Tensor Codes and Applications. SIAM J. Comput. 49(4) (2020) - [c41]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff
Bounds for List-Decoding and List-Recovery of Random Linear Codes. APPROX-RANDOM 2020: 9:1-9:21 - [c40]Noah Shutty
Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise. FOCS 2020: 206-217 - [c39]Jonathan Mosheiff
LDPC Codes Achieve List Decoding Capacity. FOCS 2020: 458-469 - [c38]Anna C. Gilbert, Albert Gu, Christopher Ré, Atri Rudra, Mary Wootters:
Sparse Recovery for Orthogonal Polynomial Transforms. ICALP 2020: 58:1-58:16 - [c37]Shubham Chandak
Overcoming High Nanopore Basecaller Error Rates for DNA Storage via Basecaller-Decoder Integration and Convolutional Codes. ICASSP 2020: 8822-8826 - [c36]Noga Ron-Zewi
Linear-time Erasure List-decoding of Expander Codes. ISIT 2020: 379-383 - [c35]Mary Wootters:
List-Decodability of Structured Ensembles of Codes (Invited Talk). MFCS 2020: 3:1-3:5 - [i50]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. CoRR abs/2002.08579 (2020) - [i49]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for list-decoding and list-recovery of random linear codes. CoRR abs/2004.13247 (2020) - [i48]Hiram H. López, Beth Malmskog, Gretchen L. Matthews, Fernando Piñero-González, Mary Wootters:
Hermitian-Lifted Codes. CoRR abs/2006.05558 (2020) - [i47]Margalit Glasgow, Mary Wootters:
Approximate Gradient Coding with Optimal Decoding. CoRR abs/2006.09638 (2020) - [i46]Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Sharp threshold rates for random codes. CoRR abs/2009.04553 (2020) - [i45]Margalit Glasgow, Mary Wootters:
Asynchronous Distributed Optimization with Randomized Delays. CoRR abs/2009.10717 (2020) - [i44]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR abs/2011.04453 (2020) - [i43]Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters:
Wedge-Lifted Codes. CoRR abs/2011.12435 (2020) - [i42]Dean Doron, Mary Wootters:
High-Probability List-Recovery, and Applications to Heavy Hitters. Electron. Colloquium Comput. Complex. TR20 (2020) - [i41]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. TR20 (2020) - [i40]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j11]Mohamed M. Sabry Aly
The N3XT Approach to Energy-Efficient Abundant-Data Computing. Proc. IEEE 107(1): 19-48 (2019) - [j10]Dante Gabriel Muratore
A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording. IEEE Trans. Biomed. Circuits Syst. 13(6): 1128-1140 (2019) - [j9]Thomas R. Dean
Blind Joint MIMO Channel Estimation and Decoding. IEEE Trans. Inf. Theory 65(4): 2507-2524 (2019) - [j8]Jay Mardia
Repairing Multiple Failures for Scalar MDS Codes. IEEE Trans. Inf. Theory 65(5): 2661-2672 (2019) - [j7]Huseyin A. Inan
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing. IEEE Trans. Inf. Theory 65(9): 5592-5603 (2019) - [j6]Thomas R. Dean
Fast Blind MIMO Decoding Through Vertex Hopping. IEEE Trans. Wirel. Commun. 18(7): 3669-3682 (2019) - [c34]Shubham Chandak
Improved read/write cost tradeoff in DNA-based data storage using LDPC codes. Allerton 2019: 147-156 - [c33]Ray Li, Mary Wootters:
Lifted Multiplicity Codes and the Disjoint Repair Group Property. APPROX-RANDOM 2019: 38:1-38:18 - [c32]Bruce Spang, Mary Wootters:
Unconstraining Graph-Constrained Group Testing. APPROX-RANDOM 2019: 46:1-46:20 - [c31]Dante G. Muratore
A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording. ISCAS 2019: 1-5 - [c30]Tony F. Wu, Binh Q. Le, Robert M. Radway
A 43pJ/Cycle Non-Volatile Microcontroller with 4.7μs Shutdown/Wake-up Integrating 2.3-bit/Cell Resistive RAM and Resilience Techniques. ISSCC 2019: 226-228 - [c29]Rawad Bitar, Mary Wootters, Salim El Rouayheb:
Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning. ITW 2019: 1-5 - [c28]Alexandra M. Porter, Mary Wootters:
Embedded Index Coding. ITW 2019: 1-5 - [i39]Alexandra M. Porter, Mary Wootters:
Embedded Index Coding. CoRR abs/1904.02179 (2019) - [i38]Ray Li, Mary Wootters:
Lifted Multiplicity Codes. CoRR abs/1905.02270 (2019) - [i37]Rawad Bitar, Mary Wootters, Salim El Rouayheb:
Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning. CoRR abs/1905.05383 (2019) - [i36]Anna C. Gilbert, Albert Gu, Christopher Ré, Atri Rudra, Mary Wootters:
Sparse Recovery for Orthogonal Polynomial Transforms. CoRR abs/1907.08362 (2019) - [i35]Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
LDPC Codes Achieve List Decoding Capacity. CoRR abs/1909.06430 (2019) - [i34]Simon Foucart, Deanna Needell, Reese Pathak, Yaniv Plan, Mary Wootters:
Weighted matrix completion from non-random, non-uniform sampling patterns. CoRR abs/1910.13986 (2019) - [i33]Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
LDPC Codes Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j5]Brett Hemenway, Mary Wootters:
Linear-time list recovery of high-rate expander codes. Inf. Comput. 261: 202-218 (2018) - [c27]Jonathan Perlstein, Thomas R. Dean, Mary Wootters, Andrea Goldsmith:
Fast Blind MIMO Decoding through Vertex Hopping. ACSSC 2018: 148-154 - [c26]Huseyin A. Inan, Peter Kairouz, Mary Wootters, Ayfer Özgür
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing. Allerton 2018: 188-195 - [c25]Ray Li, Mary Wootters:
Improved List-Decodability of Random Linear Binary Codes. APPROX-RANDOM 2018: 50:1-50:19 - [c24]Swastik Kopparty, Noga Ron-Zewi
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. FOCS 2018: 212-223 - [c23]Prasanna Ramakrishnan, Mary Wootters:
On Taking Advantage of Multiple Requests in Error Correcting Codes. ISIT 2018: 1340-1344 - [c22]Alexandra M. Porter, Shashwat Silas
Load-Balanced Fractional Repetition Codes. ISIT 2018: 2072-2076 - [c21]Atri Rudra, Mary Wootters:
Average-radius list-recoverability of random linear codes. SODA 2018: 644-662 - [i32]Ray Li, Mary Wootters:
Random linear binary codes have smaller list sizes than uniformly random binary codes. CoRR abs/1801.07839 (2018) - [i31]Alexandra M. Porter, Shashwat Silas, Mary Wootters:
Load-Balanced Fractional Repetition Codes. CoRR abs/1802.00872 (2018) - [i30]Prasanna Ramakrishnan, Mary Wootters:
On taking advantage of multiple requests in error correcting codes. CoRR abs/1802.00875 (2018) - [i29]Thomas R. Dean, Mary Wootters, Andrea J. Goldsmith:
Blind Joint MIMO Channel Estimation and Decoding. CoRR abs/1802.01049 (2018) - [i28]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. CoRR abs/1805.01498 (2018) - [i27]Huseyin A. Inan, Peter Kairouz, Mary Wootters, Ayfer Özgür:
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing. CoRR abs/1808.01457 (2018) - [i26]Bruce Spang, Mary Wootters:
Unconstraining graph-constrained group testing. CoRR abs/1809.03589 (2018) - [i25]Noah Shutty, Mary Wootters, Patrick Hayden:
Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation. CoRR abs/1809.09748 (2018) - [i24]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j4]Richard G. Baraniuk, Simon Foucart, Deanna Needell
Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals. IEEE Trans. Inf. Theory 63(6): 3368-3385 (2017) - [j3]Venkatesan Guruswami, Mary Wootters
Repairing Reed-Solomon Codes. IEEE Trans. Inf. Theory 63(9): 5684-5698 (2017) - [c20]Reyna Hulett, Mary Wootters:
Limitations of piggybacking codes with low substriping. Allerton 2017: 1131-1138 - [c19]Burak Bartan, Mary Wootters:
Repairing multiple failures for scalar MDS codes. Allerton 2017: 1145-1152 - [c18]S. Luna Frank-Fischer, Venkatesan Guruswami, Mary Wootters:
Locality via Partially Lifted Codes. APPROX-RANDOM 2017: 43:1-43:17 - [c17]Brett Hemenway, Noga Ron-Zewi
Local List Recovery of High-Rate Tensor Codes & Applications. FOCS 2017: 204-215 - [c16]Thomas R. Dean, Mary Wootters, Andrea Goldsmith:
Blind Joint MIMO Channel Estimation and Decoding. GLOBECOM 2017: 1-6 - [c15]Elette Boyle, Yuval Ishai, Rafael Pass
Can We Access a Database Both Locally and Privately? TCC (2) 2017: 662-693 - [i23]Atri Rudra, Mary Wootters:
Average-radius list-recovery of random linear codes: it really ties the room together. CoRR abs/1704.02420 (2017) - [i22]S. Luna Frank-Fischer, Venkatesan Guruswami, Mary Wootters:
Locality via Partially Lifted Codes. CoRR abs/1704.08627 (2017) - [i21]Brett Hemenway, Noga Ron-Zewi, Mary Wootters:
Local List Recovery of High-rate Tensor Codes and Applications. CoRR abs/1706.03383 (2017) - [i20]Burak Bartan, Mary Wootters:
Repairing Multiple Failures for Scalar MDS Codes. CoRR abs/1707.02241 (2017) - [i19]Reyna Hulett, Mary Wootters:
Limitations on the Achievable Repair Bandwidth of Piggybacking Codes with Low Substriping. CoRR abs/1707.02337 (2017) - [i18]Brett Hemenway, Noga Ron-Zewi, Mary Wootters:
Local List Recovery of High-rate Tensor Codes & Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - [i17]Elette Boyle, Yuval Ishai, Rafael Pass, Mary Wootters:
Can We Access a Database Both Locally and Privately? IACR Cryptol. ePrint Arch. 2017: 567 (2017) - 2016
- [j2]Nicole Megow
Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword. Theory Comput. 12(1): 1-3 (2016) - [c14]Moritz Hardt, Nimrod Megiddo, Christos H. Papadimitriou, Mary Wootters:
Strategic Classification. ITCS 2016: 111-122 - [c13]Venkatesan Guruswami, Mary Wootters:
Repairing Reed-solomon codes. STOC 2016: 216-226 - [i16]Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters:
One-Bit Compressive Sensing of Dictionary-Sparse Signals. CoRR abs/1606.07531 (2016) - 2015
- [j1]Brett Hemenway, Rafail Ostrovsky, Mary Wootters:
Local correctability of expander codes. Inf. Comput. 243: 178-190 (2015) - [c12]Brett Hemenway, Mary Wootters:
Linear-Time List Recovery of High-Rate Expander Codes. ICALP (1) 2015: 701-712 - [c11]Atri Rudra, Mary Wootters:
It'll Probably Work Out: Improved List-Decoding Through Random Operations. ITCS 2015: 287-296 - [i15]Brett Hemenway, Mary Wootters:
Linear-time list recovery of high-rate expander codes. CoRR abs/1503.01955 (2015) - [i14]Moritz Hardt, Nimrod Megiddo, Christos H. Papadimitriou, Mary Wootters:
Strategic Classification. CoRR abs/1506.06980 (2015) - [i13]Venkatesan Guruswami, Mary Wootters:
Repairing Reed-Solomon Codes. CoRR abs/1509.04764 (2015) - 2014
- [c10]Moritz Hardt, Mary Wootters:
Fast matrix completion without the condition number. COLT 2014: 638-678 - [c9]Jelani Nelson, Eric Price, Mary Wootters:
New constructions of RIP matrices with fast multiplication and fewer rows. SODA 2014: 1515-1528 - [c8]Atri Rudra, Mary Wootters:
Every list-decodable code for high noise has abundant near-optimal rate puncturings. STOC 2014: 764-773 - [i12]Moritz Hardt, Mary Wootters:
Fast matrix completion without the condition number. CoRR abs/1407.4070 (2014) - [i11]Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters:
Exponential decay of reconstruction error from binary measurements of sparse signals. CoRR abs/1407.8246 (2014) - [i10]Atri Rudra, Mary Wootters:
It'll probably work out: improved list-decoding through random operations. CoRR abs/1408.2237 (2014) - [i9]Atri Rudra, Mary Wootters:
It'll probably work out: improved list-decoding through random operations. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c7]Brett Hemenway, Rafail Ostrovsky, Mary Wootters:
Local Correctability of Expander Codes. ICALP (1) 2013: 540-551 - [c6]Mary Wootters, Yaniv Plan, Mark A. Davenport, Ewout van den Berg:
Lower bounds for quantized matrix completion. ISIT 2013: 296-300 - [c5]Mary Wootters:
On the list decodability of random linear codes with large error rates. STOC 2013: 853-860 - [c4]Denisa Duma, Mary Wootters, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra, Matthew Alpert, Timothy J. Close, Gianfranco Ciardo, Stefano Lonardi
Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing. WABI 2013: 70-84 - [i8]Mary Wootters:
On the list decodability of random linear codes with large error rate. CoRR abs/1302.2261 (2013) - [i7]Brett Hemenway, Rafail Ostrovsky, Mary Wootters:
Local Correctability of Expander Codes. CoRR abs/1304.8129 (2013) - [i6]Atri Rudra, Mary Wootters:
Every list-decodable code for high noise has abundant near-optimal rate puncturings. CoRR abs/1310.1891 (2013) - [i5]Atri Rudra, Mary Wootters:
Every list-decodable code for high noise has abundant near-optimal rate puncturings. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c3]Anna C. Gilbert, Brett Hemenway, Atri Rudra, Martin J. Strauss, Mary Wootters:
Recovering simple signals. ITA 2012: 382-391 - [c2]Anna C. Gilbert, Brett Hemenway, Martin J. Strauss, David P. Woodruff, Mary Wootters:
Reusable low-error compressive sampling schemes through privacy. SSP 2012: 536-539 - [i4]Mark A. Davenport, Yaniv Plan, Ewout van den Berg, Mary Wootters:
1-Bit Matrix Completion. CoRR abs/1209.3672 (2012) - [i3]Jelani Nelson, Eric Price, Mary Wootters:
New constructions of RIP matrices with fast multiplication and fewer rows. CoRR abs/1211.0986 (2012) - 2011
- [c1]Brett Hemenway, Rafail Ostrovsky, Martin J. Strauss, Mary Wootters:
Public Key Locally Decodable Codes with Short Keys. APPROX-RANDOM 2011: 605-615 - [i2]Brett Hemenway, Rafail Ostrovsky, Martin Strauss, Mary Wootters:
Public Key Locally Decodable Codes with Short Keys. Electron. Colloquium Comput. Complex. TR11 (2011)
2000 – 2009
- 2008
- [i1]Don Shimamoto, Mary Wootters:
Configuration spaces of convex and embedded polygons in the plane. CoRR abs/0811.1365 (2008)
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-09-25 00:43 CEST 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: