Anna C. Gilbert

from Wikipedia, the free encyclopedia

Anna Catherine Gilbert (born January 14, 1972 ) is an American mathematician.

Gilbert studied at the University of Chicago with a bachelor's degree in 1993 and received his doctorate in 1997 from Princeton University under Ingrid Daubechies ( Multiresolution homogenization schemes for differential equations and applications ). As a post-doctoral student , she was at ATT Laboratories in Florham Park, New Jersey, at Yale University and Stanford University. From 1998 she was at ATT Laboratories, from 2002 as Principal Technical Staff Member. In 2004 she became Assistant Professor, 2007 Associate Professor and 2010 Professor at the University of Michigan (from 2014 as Herman H. Goldstine Collegiate Professor).

It deals with networks, algorithms (especially sublinear and streaming algorithms), signal processing, stochastics and analysis and in particular randomized algorithms used in networks, harmonic analysis (wavelets), big data and signal and image processing. She worked on sparse approximations in signal processing, sensor networks, high throughput biological screening, traffic analysis in networks, and inverse problems.

In 2014 she was invited speaker at the International Congress of Mathematicians in Seoul (Sparse Analysis). In 2006 she was a Sloan Fellow and received an NSF Career Award, and in 2013 she received the SIAM's Ralph E. Kleinman Prize. In 2008 she received the Douglas Engelbart Best Paper Award from ACM for The very small world of the well connected .

Fonts (selection)

In addition to the works cited in the footnotes:

  • with I. Daubechies: Harmonic analysis, wavelets, and applications. In: Luis Cafarelli, E. Weinen (Ed.): Hyperbolic Equations and Frequency Interactions. (= IAS / Park City Mathematics Series. Volume 5). 1998.
  • with A. Feldmann and W. Willinger: Data networks as cascades: Investigating the multifractal nature of Internet WAN traffic. In: Proc. of the ACM SIGCOMM '98. Vancouver, BC 1998, pp. 42-55.
  • Multiscale analysis and data networks. In: Applied and Computational Harmonic Analysis. Volume 10, 2001, pp. 185-202.
  • with J. Zou, A. Gilbert and M. Strauss: Theoretical and Experimental Analysis of a Randomized Algorithm for Sparse Fourier Transform Analysis. In: Journal of Computational Physics. Volume 211, 2006, pp. 572-595.
  • with Joel A. Tropp: Signal recovery from random measurements via Orthogonal Matching Pursuit. In: IEEE Trans. On Info. Theory. Volume 53, No. 12, 2007, pp. 4655-4666.
  • with MJ Strauss and JA Tropp: A Tutorial on Fast Fourier Sampling. In: IEEE Signal Processing Magazine. Tape. 25, No. 2, 2008, pp. 57-66.
  • with Martin J. Strauss, Joel A. Tropp and Roman Vershynin: One sketch for all: fast algorithms for compressed sensing. In: Proc. of ACM Symposium on Theory of Computing 2007. STOC, 2007, pp. 237-246.
  • with Yi Li, Ely Porat and Martin J. Strauss: Approximate sparse recovery: optimizing time and measurements. In: Proc. of ACM Symposium on Theory of Computing 2010. STOC, 2010, pp. 475-484.

Web links

Individual evidence

  1. ↑ Published in: Ronald Coifman (Ed.): Topics in analysis and its applications: Selected theses. World Scientific, 2000.
  2. ^ X. Shi, M. Bonner, L. Adamic, AC Gilbert: The very small world of the well-connected. In: Proceedings of ACM Conference on Hypertext and Hypermedia. 2008.
personal data
SURNAME Gilbert, Anna C.
ALTERNATIVE NAMES Gilbert, Anna Catherine (full name)
BRIEF DESCRIPTION American mathematician
DATE OF BIRTH January 14, 1972