| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Edith Cohen 56 Edith Cohen, Haim Kaplan : Balanced-Replication Algorithms for Distribution Trees. ESA 2002 : 297-309 55 Qin Lv , Pei Cao , Edith Cohen, Kai Li , Scott Shenker : Search and replication in unstructured peer-to-peer networks. ICS 2002 : 84-95 54 Edith Cohen, Haim Kaplan , Tova Milo : Labeling Dynamic XML Trees. PODS 2002 : 271-281 53 Qin Lv , Pei Cao , Edith Cohen, Kai Li , Scott Shenker : Search and replication in unstructured peer-to-peer networks. SIGMETRICS 2002 : 258-259 52 Edith Cohen, Eran Halperin , Haim Kaplan , Uri Zwick : Reachability and distance queries via 2-hop labels. SODA 2002 : 937-946 51 Edith Cohen, Haim Kaplan : Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica 32 (3): 459-466 (2002) 50 Edith Cohen, Haim Kaplan : Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica 33 (3): 300-334 (2002) 49 Edith Cohen, Haim Kaplan , Uri Zwick : Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33 (4): 511-516 (2002) 48 Edith Cohen, Haim Kaplan : Refreshment policies for Web content caches. Computer Networks 38 (6): 795-808 (2002) 47 Edith Cohen, Haim Kaplan : Prefetching the means for document transfer: a new approach for reducing Web latency. Computer Networks 39 (4): 437-455 (2002) 46 Yehuda 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) 45 Edith Cohen, Eran Halperin , Haim Kaplan : Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001 : 744-756 44 Edith Cohen, Haim Kaplan : Refreshment Policies for Web Content Caches. INFOCOM 2001 : 1398-1406 43 Anat Bremler-Barr , Yehuda Afek , Haim Kaplan , Edith Cohen, Michael Merritt : Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001 : 43-52 42 Edith Cohen, Haim Kaplan : Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT 2001 : 85-94 41 Edith Cohen, Haim Kaplan : Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM 2001 : 41-53 40 Anat Bremler-Barr , Yehuda Afek , Haim Kaplan , Edith Cohen, Michael Merritt : Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001 : 316-317 39 Edith Cohen, Haim Kaplan , Uri Zwick : Competitive Analysis of the LRFU Paging Algorithm. WADS 2001 : 148-154 38 Edith Cohen, Uri Zwick : All-Pairs Small-Stretch Paths. J. Algorithms 38 (2): 335-353 (2001) 37 Edith Cohen, Mayur Datar , Shinji Fujiwara , Aristides Gionis , Piotr Indyk , Rajeev Motwani , Jeffrey D. Ullman , Cheng Yang : Finding Interesting Associations without Support Pruning. TKDE 13 (1): 64-78 (2001) 36 Edith 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 35 Edith Cohen, Haim Kaplan : Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM 2000 : 854-863 34 Edith Cohen, Haim Kaplan , Uri Zwick : Connection caching under vaious models of communication. SPAA 2000 : 54-63 33 Edith Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths. JACM 47 (1): 132-166 (2000) 32 Edith Cohen, Balachander Krishnamurthy , Jennifer Rexford : Efficient Algorithms for Predicting Requests to Web Servers. INFOCOM 1999 : 284-293 31 Edith Cohen, Haim Kaplan : LP-based Analysis of Greedy-dual-size. SODA 1999 : 879-880 30 Edith Cohen, Haim Kaplan : Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC 1999 : 109-118 29 Edith Cohen, Haim Kaplan , Uri Zwick : Connection Caching. STOC 1999 : 612-621 28 Edith Cohen, David D. Lewis : Approximating Matrix Multiplication for Pattern Recognition Tasks. J. Algorithms 30 (2): 211-252 (1999) 27 Edith Cohen, Haim Kaplan , Jeffrey D. Oldham : Managing TCP Connections Under Persistent HTTP. WWW8 / Computer Networks 31 (11-16): 1709-1723 (1999) 26 Edith Cohen, Balachander Krishnamurthy , Jennifer Rexford : Evaluating Server-Assisted Cache Replacement in the Web. ESA 1998 : 307-319 25 Edith Cohen, Balachander Krishnamurthy , Jennifer Rexford : Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters. SIGCOMM 1998 : 241-253 24 Edith Cohen: Structure Prediction and Computation of Sparse Matrix Products. Journal of Combinatorial Optimization 2 (4): 307-332 (1998) 23 Edith Cohen: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. SIAM J. Comput. 28 (1): 210-236 (1998) 22 Edith Cohen: Learning Noisy Perceptrons by a Perceptron in Polynomial Time. FOCS 1997 : 514-523 21 Edith Cohen, David D. Lewis : Approximating Matrix Multiplication for Pattern Recognition Tasks. SODA 1997 : 682-691 20 Edith Cohen, Uri Zwick : All-Pairs Small-Stretch Paths. SODA 1997 : 93-102 19 Edith Cohen: Using Selective Path-Doubling for Parallel Shortest-Path Computations. J. Algorithms 22 (1): 30-56 (1997) 18 Edith Cohen: Size-Estimation Framework with Applications to Transitive Closure and Reachability. JCSS 55 (3): 441-453 (1997) 17 Edith Cohen: On Optimizing Multiplications of Sparse Matrices. IPCO 1996 : 219-233 16 Edith Cohen: Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. J. Algorithms 21 (2): 331-357 (1996) 15 Naser S. Barghouti , Eleftherios Koutsofios , Edith Cohen: Improvise: Interactive Multimedia Process Visualization Environment. ESEC 1995 : 28-43 14 Edith Cohen: Approximate Max-Flow on Small Depth Networks. SIAM J. Comput. 24 (3): 579-597 (1995) 13 Edith Cohen: Estimating the Size of the Transitive Closure in Linear Time. FOCS 1994 : 190-200 12 Edith Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths. STOC 1994 : 16-26 11 Edith Cohen, Nimrod Megiddo : Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica 11 (3): 320-340 (1994) 10 Edith Cohen, Nimrod Megiddo : Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. 23 (6): 1313-1347 (1994) 9 Edith Cohen: Fast algorithms for constructing t-spanners and paths with stretch t. FOCS 1993 : 648-658 8 Edith Cohen: Using Selective Path-Doubling for Parallel Shortest-Path Computations. ISTCS 1993 : 78-87 7 Edith Cohen: Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. SPAA 1993 : 57-67 6 Edith Cohen, Nimrod Megiddo : Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. JACM 40 (4): 791-830 (1993) 5 Edith Cohen: Approximate Max Flow on Small Depth Networks. FOCS 1992 : 648-658 4 Edith Cohen, Nimrod Megiddo : New Algorithms for Generalized Network Flows. ISTCS 1992 : 103-114 3 Edith Cohen, Nimrod Megiddo : Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991 : 120-130 2 Edith Cohen, Nimrod Megiddo : Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract). STOC 1991 : 145-155 1 Edith Cohen, Nimrod Megiddo : Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version). STOC 1989 : 523-534  DiSC'03 © 2003 Association for Computing Machinery |
