
Mary Wootters
Assistant Professor of Computer Science and of Electrical Engineering
Academic Appointments
-
Assistant Professor, Computer Science
-
Assistant Professor, Electrical Engineering
2020-21 Courses
- Algebraic Error Correcting Codes
CS 250, EE 387 (Win) - Open Problems in Coding Theory
CS 351 (Spr) - Randomized Algorithms and Probabilistic Analysis
CME 309, CS 265 (Aut) -
Independent Studies (19)
- Advanced Reading and Research
CS 499 (Aut, Win, Spr) - Advanced Reading and Research
CS 499P (Aut, Win, Spr, Sum) - Curricular Practical Training
CS 390A (Aut, Win, Sum) - Curricular Practical Training
CS 390B (Win) - Independent Project
CS 399 (Aut, Win, Spr) - Independent Work
CS 199 (Aut, Win, Spr) - Independent Work
CS 199P (Aut) - Master's Research
CME 291 (Spr) - Master's Thesis and Thesis Research
EE 300 (Win, Spr, Sum) - Part-time Curricular Practical Training
CS 390D (Aut, Win) - Research
PHYSICS 490 (Spr) - Senior Honors Thesis
MATH 197 (Aut, Win) - Senior Project
CS 191 (Aut, Win, Spr) - Special Studies and Reports in Electrical Engineering
EE 191 (Win, Spr, Sum) - Special Studies and Reports in Electrical Engineering
EE 191A (Aut) - Special Studies and Reports in Electrical Engineering
EE 391 (Aut, Win, Spr, Sum) - Special Studies and Reports in Electrical Engineering (WIM)
EE 191W (Aut, Win, Spr, Sum) - Special Studies or Projects in Electrical Engineering
EE 190 (Aut, Win, Spr, Sum) - Special Studies or Projects in Electrical Engineering
EE 390 (Aut, Win, Spr, Sum)
- Advanced Reading and Research
-
Prior Year Courses
2019-20 Courses
- Design and Analysis of Algorithms
CS 161 (Win) - Randomness: Computational and Philosophical Approaches
CS 57N, PHIL 3N (Aut)
2018-19 Courses
- Algebraic Error Correcting Codes
CS 250, EE 387 (Win) - Design and Analysis of Algorithms
CS 161 (Win)
2017-18 Courses
- Algebraic Error Correcting Codes
CS 250, EE 387 (Win) - Design and Analysis of Algorithms
CS 161 (Aut)
- Design and Analysis of Algorithms
Stanford Advisees
-
Doctoral Dissertation Reader (AC)
Burak Bartan, Shubham Chandak, Kabir Chandrasekher, Qijia Jiang, Sam Kim, Shaked Regev, Declan Thompson -
Postdoctoral Faculty Sponsor
Ani Krishna -
Doctoral Dissertation Advisor (AC)
Yun Liao, Shashwat Silas -
Master's Program Advisor
Sophie Decoppet, Jabari Hastings, Yiwen Jin, Amy Kanne, Jiangshan Li, Crystal Liu, Xiaoteng Lu, Mengman Nie, William Park, Charlotte Peale, Carmen Strassle, Lucia Zheng, Albert Zuo -
Doctoral Dissertation Co-Advisor (AC)
Noah Shutty -
Doctoral (Program)
Margalit Glasgow, Reyna Hulett, Jay Mardia, Kamilla Nazirkhanova, Joachim Neu, Alexandra Porter, Shashwat Silas
All Publications
-
A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2019: 1128–40
Abstract
Neural interfaces of the future will be used to help restore lost sensory, motor, and other capabilities. However, realizing this futuristic promise requires a major leap forward in how electronic devices interface with the nervous system. Next generation neural interfaces must support parallel recording from tens of thousands of electrodes within the form factor and power budget of a fully implanted device, posing a number of significant engineering challenges. In this paper, we exploit sparsity and diversity of neural signals to achieve simultaneous data compression and channel multiplexing for neural recordings. The architecture uses wired-OR interactions within an array of single-slope A/D converters to obtain massively parallel digitization of neural action potentials. The achieved compression is lossy but effective at retaining the critical samples belonging to action potentials, enabling efficient spike sorting and cell type identification. Simulation results of the architecture using data obtained from primate retina ex-vivo with a 512-channel electrode array show average compression rates up to ∼ 40× while missing less than 5% of cells. In principle, the techniques presented here could be used to design interfaces to other parts of the nervous system.
View details for DOI 10.1109/TBCAS.2019.2935468
View details for Web of Science ID 000507321400002
View details for PubMedID 31425051
-
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2019: 5592–5603
View details for DOI 10.1109/TIT.2019.2902397
View details for Web of Science ID 000481981000022
-
Fast Blind MIMO Decoding Through Vertex Hopping
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
2019; 18 (7): 3669–82
View details for DOI 10.1109/TWC.2019.2917002
View details for Web of Science ID 000475339700024
-
Repairing Multiple Failures for Scalar MDS Codes
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2019: 2661–72
View details for DOI 10.1109/TIT.2018.2876542
View details for Web of Science ID 000466029900003
-
Blind Joint MIMO Channel Estimation and Decoding
IEEE TRANSACTIONS ON INFORMATION THEORY
2019; 65 (4): 2507–24
View details for DOI 10.1109/TIT.2018.2878016
View details for Web of Science ID 000461840600035
-
Resistive RAM Endurance: Array-Level Characterization and Correction Techniques Targeting Deep Learning Applications
IEEE TRANSACTIONS ON ELECTRON DEVICES
2019; 66 (3): 1281–88
View details for DOI 10.1109/TED.2019.2894387
View details for Web of Science ID 000460970400022
-
A 43pJ/Cycle Non-Volatile Microcontroller with 4.7 mu s Shutdown/Wake-up Integrating 2.3-bit/Cell Resistive RAM and Resilience Techniques
IEEE. 2019: 226-+
View details for Web of Science ID 000463153600071
-
A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording
IEEE. 2019
View details for Web of Science ID 000483076401065
-
The N3XT Approach to Energy-Efficient Abundant-Data Computing
PROCEEDINGS OF THE IEEE
2019; 107 (1): 19–48
View details for DOI 10.1109/JPROC.2018.2882603
View details for Web of Science ID 000454770800004
-
Linear-time list recovery of high-rate expander codes
ACADEMIC PRESS INC ELSEVIER SCIENCE. 2018: 202–18
View details for DOI 10.1016/j.ic.2018.02.004
View details for Web of Science ID 000436490400004
-
Fast Blind MIMO Decoding through Vertex Hopping
IEEE. 2018: 148–49
View details for Web of Science ID 000467845100025
-
Average-radius list-recoverability of random linear codes
ASSOC COMPUTING MACHINERY. 2018: 644–62
View details for Web of Science ID 000483921200043
-
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing
IEEE. 2018: 188–95
View details for Web of Science ID 000461021200028
-
On taking advantage of multiple requests in error correcting codes
IEEE. 2018: 1340–44
View details for Web of Science ID 000448139300269
-
Load-Balanced Fractional Repetition Codes
IEEE. 2018: 2072–76
View details for Web of Science ID 000448139300416
-
Improved decoding of Folded Reed-Solomon and Multiplicity Codes
IEEE COMPUTER SOC. 2018: 212–23
View details for DOI 10.1109/FOCS.2018.00029
View details for Web of Science ID 000455014500020
-
Repairing Reed-Solomon Codes
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2017: 5684–98
View details for DOI 10.1109/TIT.2017.2702660
View details for Web of Science ID 000411016000017
-
Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals
IEEE TRANSACTIONS ON INFORMATION THEORY
2017; 63 (6): 3368–85
View details for DOI 10.1109/TIT.2017.2688381
View details for Web of Science ID 000402058900003
-
De-biasing low-rank projection for matrix completion
SPIE-INT SOC OPTICAL ENGINEERING. 2017
View details for DOI 10.1117/12.2275004
View details for Web of Science ID 000416302900033
-
Repairing multiple failures for scalar MDS codes
IEEE. 2017: 1145–52
View details for Web of Science ID 000428047800156
-
Blind Joint MIMO Channel Estimation and Decoding
IEEE. 2017
View details for Web of Science ID 000428054301082
-
Limitations of Piggybacking Codes with Low Substriping
IEEE. 2017: 1131–38
View details for Web of Science ID 000428047800154
-
SPECIAL ISSUE: APPROX-RANDOM 2015 Foreword
THEORY OF COMPUTING
2016; 12
View details for DOI 10.4086/toc.2016.v012a013
View details for Web of Science ID 000433607300004
-
Local correctability of expander codes
ACADEMIC PRESS INC ELSEVIER SCIENCE. 2015: 178–90
View details for DOI 10.1016/j.ic.2014.12.013
View details for Web of Science ID 000355665500012
-
Linear-Time List Recovery of High-Rate Expander Codes
SPRINGER-VERLAG BERLIN. 2015: 701–12
View details for DOI 10.1007/978-3-662-47672-7_57
View details for Web of Science ID 000364317700057
-
Configuration spaces of convex and embedded polygons in the plane
GEOMETRIAE DEDICATA
2014; 172 (1): 121–34
View details for DOI 10.1007/s10711-013-9910-x
View details for Web of Science ID 000341500400005
-
1-Bit matrix completion
INFORMATION AND INFERENCE-A JOURNAL OF THE IMA
2014; 3 (3): 189–223
View details for DOI 10.1093/imaiai/iau006
View details for Web of Science ID 000218926400001
-
Optimal entanglement-assisted one-shot classical communication
PHYSICAL REVIEW A
2013; 87 (6)
View details for DOI 10.1103/PhysRevA.87.062301
View details for Web of Science ID 000319909500001
-
Lower Bounds for Quantized Matrix Completion
IEEE. 2013: 296-+
View details for Web of Science ID 000348913400060
-
Local Correctability of Expander Codes
SPRINGER-VERLAG BERLIN. 2013: 540–51
View details for Web of Science ID 000342686600046
-
REUSABLE LOW-ERROR COMPRESSIVE SAMPLING SCHEMES THROUGH PRIVACY
IEEE. 2012: 536–39
View details for Web of Science ID 000309943200135