- Near-Optimal Sparse Fourier Representations via Sampling [Extended Abstract]
- Approximation of Functions over Redundant Dictionaries Using Coherence Anna C. Gilbert* S. Muthukrishnan* Martin J. Strauss*
- APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS 5, 135 (1998) ARTICLE NO. HA970220
- GROUP TESTING IN STATISTICAL SIGNAL RECOVERY A. C. GILBERT AND M. J. STRAUSS
- One-Pass Wavelet Decompositions of Data Streams
- Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries
- Improved Time Bounds for Near-Optimal Sparse Fourier Representations
- Anna C. Gilbert Research Statement
- SIGNAL RECOVERY FROM RANDOM MEASUREMENTS VIA ORTHOGONAL MATCHING PURSUIT
- One Sketch for All: Fast Algorithms for Compressed Sensing
- Theoretical and experimental analysis of a randomized algorithm for Sparse Fourier transform analysis q
- Series Logo Volume 00, Number 00, Xxxx 19xx
- TCP/IP traffic dynamics and network performance: A lesson in workload modeling, flow control,
- On the Fractal Behavior of TCP Anna Gilbert and Howard Karloff
- Fast, Small-Space Algorithms for Approximate Histogram Maintenance
- Data networks as cascades: Investigating the multifractal nature of Internet WAN traffic
- Sublinear Approximation of Signals Anna C. Gilberta, Martin J. Straussa, b, Joel A. Troppa and Roman Vershyninc
- From SIAM News, Volume 37, Number 3, April 2004 Sublinear Computing: When Ignorance Is Bliss
- RECOVERING SIMPLE SIGNALS ANNA C. GILBERT, BRETT HEMENWAY, ATRI RUDRA, MARTIN J. STRAUSS, AND MARY WOOTTERS
