dblp.uni-trier.dewww.uni-trier.de

Edith Cohen Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
101EEEdith Cohen, Haim Kaplan: Leveraging discarded samples for tighter estimation of multiple-set aggregates. SIGMETRICS/Performance 2009: 251-262
100EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Stream sampling for variance-optimal estimation of subset sums. SODA 2009: 1255-1264
99EEEdith Cohen, Haim Kaplan: Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates CoRR abs/0903.0625: (2009)
98EEEdith Cohen, Haim Kaplan, Subhabrata Sen: Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments CoRR abs/0906.4560: (2009)
97EEEdith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Envy-Free Makespan Approximation CoRR abs/0909.1072: (2009)
96EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. PVLDB 2(1): 431-442 (2009)
95EEEdith Cohen, Haim Kaplan, Subhabrata Sen: Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. PVLDB 2(1): 646-657 (2009)
2008
94EEEdith Cohen, Haim Kaplan: Estimating Aggregates over Multiple Sets. ICDM 2008: 761-766
93EEEdith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup: Confident estimation for multistage measurement sampling and aggregation. SIGMETRICS 2008: 109-120
92EEEdith Cohen, Haim Kaplan: Sketch-Based Estimation of Subpopulation-Weight CoRR abs/0802.3448: (2008)
91EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Variance optimal sampling based estimation of subset sums CoRR abs/0803.0473: (2008)
90EEEdith Cohen, Nadav Grossaug, Haim Kaplan: Processing top-k queries from samples. Computer Networks 52(14): 2605-2622 (2008)
89EEEdith Cohen, Haim Kaplan: Tighter estimation using bottom k sketches. PVLDB 1(1): 213-224 (2008)
2007
88EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Comference 2007: 265-278
87EEEdith Cohen, Haim Kaplan: Summarizing data using bottom-k sketches. PODC 2007: 225-234
86EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Sketching unaggregated data streams for subpopulation-size queries. PODS 2007: 253-262
85EEEdith Cohen, Haim Kaplan: Bottom-k sketches: better and more efficient estimation of aggregates. SIGMETRICS 2007: 353-354
84EEEdith Cohen, Amos Fiat, Haim Kaplan: Associative search in peer to peer networks: Harnessing latent semantics. Computer Networks 51(8): 1861-1881 (2007)
83EEEdith Cohen, Haim Kaplan: Spatially-decaying aggregation over a network. J. Comput. Syst. Sci. 73(3): 265-288 (2007)
2006
82EEEdith Cohen, Nadav Grossaug, Haim Kaplan: Processing top k queries from samples. CoNEXT 2006: 7
81EEEdith Cohen, Balachander Krishnamurthy: A short walk in the Blogistan. Computer Networks 50(5): 615-630 (2006)
80EEDavid Applegate, Edith Cohen: Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans. Netw. 16(6): 1193-1206 (2006)
79EEEdith Cohen, Martin J. Strauss: Maintaining time-decaying stream aggregates. J. Algorithms 59(1): 19-36 (2006)
2005
78EEEdith Cohen, Carsten Lund: Packet classification in large ISPs: design and evaluation of decision tree classifiers. SIGMETRICS 2005: 73-84
77EEEdith Cohen, Eran Halperin, Haim Kaplan: Performance aspects of distributed caches using TTL-based consistency. Theor. Comput. Sci. 331(1): 73-96 (2005)
2004
76EEDavid Applegate, Lee Breslau, Edith Cohen: Coping with network failures: routing strategies for optimal demand oblivious restoration. SIGMETRICS 2004: 270-281
75EEEdith Cohen, Haim Kaplan: Spatially-decaying aggregation over a network: model and algorithms. SIGMOD Conference 2004: 707-718
74EEEdith Cohen, Haim Kaplan: Efficient estimation algorithms for neighborhood variance and other moments. SODA 2004: 157-166
73EEEdith Cohen, Venkatesan Guruswami: Guest Editors' foreword. J. Comput. Syst. Sci. 68(4): 701 (2004)
72EEYossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke: Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci. 69(3): 383-394 (2004)
71EEEdith Cohen, Haim Kaplan: Balanced-Replication Algorithms for Distribution Trees. SIAM J. Comput. 34(1): 227-247 (2004)
2003
70EEEdith Cohen, Amos Fiat, Haim Kaplan: Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM 2003
69EEEdith Cohen, Martin Strauss: Maintaining time-decaying stream aggregates. PODS 2003: 223-233
68EEDavid Applegate, Edith Cohen: Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. SIGCOMM 2003: 313-324
67EEEdith Cohen, Amos Fiat, Haim Kaplan: Efficient sequences of trials. SODA 2003: 737-746
66EEYossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke: Optimal oblivious routing in polynomial time. STOC 2003: 383-388
65EEEdith Cohen, Amos Fiat, Haim Kaplan: A case for associative peer to peer overlays. Computer Communication Review 33(1): 95-100 (2003)
64EEEdith Cohen, Haim Kaplan: Proactive caching of DNS records: addressing a performance bottleneck. Computer Networks 41(6): 707-726 (2003)
63EEEdith Cohen, Haim Kaplan, Uri Zwick: Connection caching: model and algorithms. J. Comput. Syst. Sci. 67(1): 92-126 (2003)
62EEEdith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick: Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. 32(5): 1338-1355 (2003)
2002
61EEEdith Cohen, Haim Kaplan: Balanced-Replication Algorithms for Distribution Trees. ESA 2002: 297-309
60EEQin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker: Search and replication in unstructured peer-to-peer networks. ICS 2002: 84-95
59EEAnat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour: Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop 2002: 307-320
58EEEdith Cohen, Haim Kaplan, Tova Milo: Labeling Dynamic XML Trees. PODS 2002: 271-281
57EEEdith Cohen, Scott Shenker: Replication strategies in unstructured peer-to-peer networks. SIGCOMM 2002: 177-190
56EEQin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker: Search and replication in unstructured peer-to-peer networks. SIGMETRICS 2002: 258-259
55EEEdith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick: Reachability and distance queries via 2-hop labels. SODA 2002: 937-946
54EEEdith Cohen, Haim Kaplan: Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica 32(3): 459-466 (2002)
53EEEdith Cohen, Haim Kaplan: Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica 33(3): 300-334 (2002)
52EEEdith Cohen, Haim Kaplan, Uri Zwick: Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33(4): 511-516 (2002)
51EEEdith Cohen, Haim Kaplan: Refreshment policies for Web content caches. Computer Networks 38(6): 795-808 (2002)
50EEEdith Cohen, Haim Kaplan: Prefetching the means for document transfer: a new approach for reducing Web latency. Computer Networks 39(4): 437-455 (2002)
49EEYehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration by path concatenation: fast recovery of MPLS paths. Distributed Computing 15(4): 273-283 (2002)
2001
48EEEdith Cohen, Eran Halperin, Haim Kaplan: Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001: 744-756
47EEEdith Cohen, Haim Kaplan: Refreshment Policies for Web Content Caches. INFOCOM 2001: 1398-1406
46EEAnat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001: 43-52
45EEEdith Cohen, Haim Kaplan: Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT 2001: 85-94
44EEEdith Cohen, Haim Kaplan: Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM 2001: 41-53
43EEAnat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001: 316-317
42EEEdith Cohen, Haim Kaplan: The Age Penalty and Its Effect on Cache Performance. USITS 2001: 73-84
41EEEdith Cohen, Haim Kaplan, Uri Zwick: Competitive Analysis of the LRFU Paging Algorithm. WADS 2001: 148-154
40EEEdith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang: Finding Interesting Associations without Support Pruning. IEEE Trans. Knowl. Data Eng. 13(1): 64-78 (2001)
39 Edith Cohen, Uri Zwick: All-Pairs Small-Stretch Paths. J. Algorithms 38(2): 335-353 (2001)
2000
38EEEdith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang: Finding Interesting Associations without Support Pruning. ICDE 2000: 489-499
37EEEdith Cohen, Haim Kaplan: Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM 2000: 854-863
36EEEdith Cohen, Haim Kaplan, Uri Zwick: Connection caching under vaious models of communication. SPAA 2000: 54-63
35EEEdith Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths. J. ACM 47(1): 132-166 (2000)
1999
34 Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford: Efficient Algorithms for Predicting Requests to Web Servers. INFOCOM 1999: 284-293
33EEEdith Cohen, Haim Kaplan: LP-based Analysis of Greedy-dual-size. SODA 1999: 879-880
32EEEdith Cohen, Haim Kaplan: Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC 1999: 109-118
31EEEdith Cohen, Haim Kaplan, Uri Zwick: Connection Caching. STOC 1999: 612-621
30EEEdith Cohen, Haim Kaplan, Jeffrey D. Oldham: Managing TCP Connections Under Persistent HTTP. Computer Networks 31(11-16): 1709-1723 (1999)
29 Edith Cohen, David D. Lewis: Approximating Matrix Multiplication for Pattern Recognition Tasks. J. Algorithms 30(2): 211-252 (1999)
1998
28EEEdith Cohen, Balachander Krishnamurthy, Jennifer Rexford: Evaluating Server-Assisted Cache Replacement in the Web. ESA 1998: 307-319
27EEEdith Cohen, Balachander Krishnamurthy, Jennifer Rexford: Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters. SIGCOMM 1998: 241-253
26 Edith Cohen: Structure Prediction and Computation of Sparse Matrix Products. J. Comb. Optim. 2(4): 307-332 (1998)
25 Edith Cohen: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. SIAM J. Comput. 28(1): 210-236 (1998)
1997
24EEEdith Cohen: Learning Noisy Perceptrons by a Perceptron in Polynomial Time. FOCS 1997: 514-523
23 Edith Cohen, David D. Lewis: Approximating Matrix Multiplication for Pattern Recognition Tasks. SODA 1997: 682-691
22 Edith Cohen, Uri Zwick: All-Pairs Small-Stretch Paths. SODA 1997: 93-102
21 Edith Cohen: Using Selective Path-Doubling for Parallel Shortest-Path Computations. J. Algorithms 22(1): 30-56 (1997)
20 Edith Cohen: Size-Estimation Framework with Applications to Transitive Closure and Reachability. J. Comput. Syst. Sci. 55(3): 441-453 (1997)
1996
19EEEdith Cohen: On Optimizing Multiplications of Sparse Matrices. IPCO 1996: 219-233
18 Edith Cohen: Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. J. Algorithms 21(2): 331-357 (1996)
1995
17 Naser S. Barghouti, Eleftherios Koutsofios, Edith Cohen: Improvise: Interactive Multimedia Process Visualization Environment. ESEC 1995: 28-43
16 Edith Cohen: Approximate Max-Flow on Small Depth Networks. SIAM J. Comput. 24(3): 579-597 (1995)
1994
15 Edith Cohen: Estimating the Size of the Transitive Closure in Linear Time FOCS 1994: 190-200
14EEEdith Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths. STOC 1994: 16-26
13 Edith Cohen, Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica 11(3): 320-340 (1994)
12 Edith Cohen, Nimrod Megiddo: New algorithms for generalized network flows. Math. Program. 64: 325-336 (1994)
11 Edith Cohen, Nimrod Megiddo: Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. 23(6): 1313-1347 (1994)
1993
10 Edith Cohen: Fast algorithms for constructing t-spanners and paths with stretch t FOCS 1993: 648-658
9 Edith Cohen: Using Selective Path-Doubling for Parallel Shortest-Path Computations. ISTCS 1993: 78-87
8EEEdith Cohen: Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. SPAA 1993: 57-67
7EEEdith Cohen, Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. J. ACM 40(4): 791-830 (1993)
1992
6 Edith Cohen: Approximate Max Flow on Small Depth Networks FOCS 1992: 648-658
5EEEdith Cohen, Nimrod Megiddo: New Algorithms for Generalized Network Flows. ISTCS 1992: 103-114
1991
4 Edith Cohen, Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991: 120-130
3 Edith Cohen, Nimrod Megiddo: Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) STOC 1991: 145-155
2EEEdith Cohen, Michael Tarsi: NP-Completeness of graph decomposition problems. J. Complexity 7(2): 200-212 (1991)
1989
1 Edith Cohen, Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version) STOC 1989: 523-534

Coauthor Index

1Yehuda Afek [43] [46] [49]
2David Applegate [68] [76] [80]
3Yossi Azar [66] [72]
4Naser S. Barghouti [17]
5Anat Bremler-Barr [43] [46] [49] [59]
6Lee Breslau [76]
7Pei Cao [56] [60]
8Mayur Datar [38] [40]
9Nick G. Duffield [86] [88] [91] [93] [96] [100]
10Michal Feldman [97]
11Amos Fiat [65] [66] [67] [70] [72] [84] [97]
12Shinji Fujiwara [38] [40]
13Aristides Gionis [38] [40]
14Nadav Grossaug [82] [90]
15Venkatesan Guruswami [73]
16Eran Halperin [48] [55] [62] [77]
17Piotr Indyk [38] [40]
18Haim Kaplan [30] [31] [32] [33] [36] [37] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [58] [59] [61] [62] [63] [64] [65] [66] [67] [70] [71] [72] [74] [75] [77] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [94] [95] [96] [97] [98] [99] [100] [101]
19Eleftherios Koutsofios [17]
20Balachander Krishnamurthy [27] [28] [34] [81]
21David D. Lewis [23] [29]
22Kai Li [56] [60]
23Carsten Lund [78] [86] [88] [91] [93] [96] [100]
24Qin Lv [56] [60]
25Yishay Mansour [59]
26Nimrod Megiddo [1] [3] [4] [5] [7] [11] [12] [13]
27Michael Merritt [43] [46] [49]
28Tova Milo [58]
29Rajeev Motwani [38] [40]
30Jeffrey D. Oldham [30]
31Svetlana Olonetsky [97]
32Harald Räcke [66] [72]
33Jennifer Rexford [27] [28] [34]
34Subhabrata Sen [95] [98]
35Scott Shenker [56] [57] [60]
36Martin Strauss (Martin J. Strauss) [69] [79]
37Michael Tarsi [2]
38Mikkel Thorup [86] [88] [91] [93] [96] [100]
39Jeffrey D. Ullman [38] [40]
40Cheng Yang [38] [40]
41Uri Zwick [22] [31] [36] [39] [41] [52] [55] [62] [63]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)