Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Gilbert, Anna C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
For-all sparse recovery in near-optimal time
Anna C. Gilbert
,
Yi Li
,
Ely Porat
,
Martin J. Strauss
Lecture Notes in Computer Science
8572
, 2014, pp. 538-550
\ell_2/\ell_2
-foreach sparse recovery with low risk
Anna C. Gilbert
,
Hung Q. Ngo
,
Ely Porat
,
Atri Rudra
,
Martin J. Strauss
Lecture Notes in Computer Science
7965
, 2013, pp. 461-472
Approximate sparse recovery: Optimizing time and measurements
Anna C. Gilbert
,
Yi Li
,
Ely Porat
,
Martin J. Strauss
SIAM Journal on Computing
41
(2), 2012, pp. 436-453
Approximate sparse recovery: Optimizing time and measurements
Anna C. Gilbert
,
Yi Li
,
Ely Porat
,
Martin J. Strauss
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 475-484
Better alternatives to OSFP routing
Jessica H. Fong
,
Anna C. Gilbert
,
Sampath Kannan
,
Martin J. Strauss
Algorithmica
43
(1-2), 2005, pp. 113-131
Fast, small-space algorithms for approximate histogram maintenance
Anna C. Gilbert
,
Sudipto Guha
,
Piotr Indyk
,
Yannis Kotidis
,
S. Muthukrishnan
,
Martin J. Strauss
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 389-398