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="Cohen, Edith"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms and estimators for summarization of unaggregated data streams
Edith Cohen
,
Nick Duffield
,
Haim Kaplan
,
Carstent Lund
,
Mikkel Thorup
Journal of Computer and System Sciences
80
(7), 2014, pp. 1214-1244
Envy-free makespan approximation
Edith Cohen
,
Michal Feldman
,
Amos Fiat
,
Haim Kaplan
,
Svetlana Olonetsky
SIAM Journal on Computing
41
(1), 2012, pp. 12-25
Efficient stream sampling for variance-optimal estimation of subset sums
Edith Cohen
,
Nick Duffield
,
Haim Kaplan
,
Carsten Lund
,
Mikkel Thorup
SIAM Journal on Computing
40
(5), 2011, pp. 1402-1431
Labeling dynamic XML trees
Edith Cohen
,
Haim Kaplan
,
Tova Milo
SIAM Journal on Computing
39
(5), 2010, pp. 2048-2074
Spatially-decaying aggregation over a network
Edith Cohen
,
Haim Kaplan
Journal of Computer and System Sciences
73
(3), 2007, pp. 265-288
Maintaining time-decaying stream aggregates
Edith Cohen
,
Martin J. Strauss
Journal of Algorithms
59
(1), 2006, pp. 19-36
Performance aspects of distributed caches using TTL-based consistency
Edith Cohen
,
Eran Halperin
,
Haim Kaplan
Theoretical Computer Science
331
(1), 2005, pp. 73-96
Optimal oblivious routing in polynomial time
Yossi Azar
,
Edith Cohen
,
Amos Fiat
,
Haim Kaplan
,
Harald Räcke
Journal of Computer and System Sciences
69
(3), 2004, pp. 383-394
Balanced-replication algorithms for distribution trees
Edith Cohen
,
Haim Kaplan
SIAM Journal on Computing
34
(1), 2004, pp. 227-247
Optimal oblivious routing in polynomial time
Yossi Azar
,
Edith Cohen
,
Amos Fiat
,
Haim Kaplan
,
Harald Räcke
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 383-388
Reachability and distance queries via 2-hop labels
Edith Cohen
,
Eran Halperin
,
Haim Kaplan
,
Uri Zwick
SIAM Journal on Computing
32
(5), 2003, pp. 1338-1355
Connection caching: Model and algorithms
Edith Cohen
,
Haim Kaplan
,
Uri Zwick
Journal of Computer and System Sciences
67
(1), 2003, pp. 92-126
Balanced-replication algorithms for distribution trees
Edith Cohen
,
Haim Kaplan
Lecture Notes in Computer Science
2461
, 2002, pp. 297-309
Performance aspects of distributed caches using TTL-based consistency
Edith Cohen
,
Eran Halperin
,
Haim Kaplan
Lecture Notes in Computer Science
2076
, 2001, pp. 744-756
Competitive analysis of the LRFU paging algorithm
Edith Cohen
,
Haim Kaplan
,
Uri Zwick
Lecture Notes in Computer Science
2125
, 2001, pp. 148-154
All-pairs small-stretch paths
Edith Cohen
,
Uri Zwick
Journal of Algorithms
38
(2), 2001, pp. 335-353
Connection caching under various models of communication
Edith Cohen
,
Haim Kaplan
,
Uri Zwick
Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'2000 (Bar Harbor, Maine, July 9-12, 2000)
, 2000, pp. 54-63
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Edith Cohen
Journal of the ACM
47
(1), 2000, pp. 132-166
Connection caching
Edith Cohen
,
Haim Kaplan
,
Uri Zwick
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 612-621
LP
-based analysis of greedy-dual-size
Edith Cohen
,
Haim Kaplan
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 879-880
Exploiting regularities in web traffic patterns for cache replacement
Edith Cohen
,
Haim Kaplan
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 109-118
Approximating matrix multiplication for pattern recognition tasks
Edith Cohen
,
David D. Lewis
Journal of Algorithms
30
(2), 1999, pp. 211-252
Evaluating server-assisted cache replacement in the Web
Edith Cohen
,
Balachander Krishnamurthy
,
Jennifer Rexford
Lecture Notes in Computer Science
1461
, 1998, pp. 307-319
Fast algorithms for constructing
t
-spanners and paths with stretch
t
Edith Cohen
SIAM Journal on Computing
28
(1), 1998, pp. 210-236
Approximating matrix multiplication for pattern recognition tasks
Edith Cohen
,
David D. Lewis
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 682-691
Seiten 1
2
>