| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Edith Cohen Edith Cohen, Eran Halperin , Haim Kaplan : Performance aspects of distributed caches using TTL-based consistency. Theor. Comput. Sci. 331 (1): 73-96 (2005) David Applegate , Lee Breslau , Edith Cohen: Coping with network failures: routing strategies for optimal demand oblivious restoration. SIGMETRICS 2004 : 270-281 Edith Cohen, Haim Kaplan : Spatially-decaying aggregation over a network: model and algorithms. SIGMOD Conference 2004 : 707-718 Edith Cohen, Haim Kaplan : Efficient estimation algorithms for neighborhood variance and other moments. SODA 2004 : 157-166 Edith Cohen, Haim Kaplan : Balanced-Replication Algorithms for Distribution Trees. SIAM J. Comput. 34 (1): 227-247 (2004) Edith Cohen, Amos Fiat , Haim Kaplan : Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM 2003 Edith Cohen, Martin Strauss : Maintaining time-decaying stream aggregates. PODS 2003 : 223-233 David Applegate , Edith Cohen: Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. SIGCOMM 2003 : 313-324 Edith Cohen, Amos Fiat , Haim Kaplan : Efficient sequences of trials. SODA 2003 : 737-746 Yossi Azar , Edith Cohen, Amos Fiat , Haim Kaplan , Harald Räcke : Optimal oblivious routing in polynomial time. STOC 2003 : 383-388 Edith Cohen, Amos Fiat , Haim Kaplan : A case for associative peer to peer overlays. Computer Communication Review 33 (1): 95-100 (2003) Edith Cohen, Haim Kaplan : Proactive caching of DNS records: addressing a performance bottleneck. Computer Networks 41 (6): 707-726 (2003) Edith Cohen, Haim Kaplan , Uri Zwick : Connection caching: model and algorithms. J. Comput. Syst. Sci. 67 (1): 92-126 (2003) Edith Cohen, Eran Halperin , Haim Kaplan , Uri Zwick : Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. 32 (5): 1338-1355 (2003) Edith Cohen, Haim Kaplan : Balanced-Replication Algorithms for Distribution Trees. ESA 2002 : 297-309 Qin Lv , Pei Cao , Edith Cohen, Kai Li , Scott Shenker : Search and replication in unstructured peer-to-peer networks. ICS 2002 : 84-95 Anat Bremler-Barr , Edith Cohen, Haim Kaplan , Yishay Mansour : Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop 2002 : 307-320 Edith Cohen, Haim Kaplan , Tova Milo : Labeling Dynamic XML Trees. PODS 2002 : 271-281 Edith Cohen, Scott Shenker : Replication strategies in unstructured peer-to-peer networks. SIGCOMM 2002 : 177-190 Qin Lv , Pei Cao , Edith Cohen, Kai Li , Scott Shenker : Search and replication in unstructured peer-to-peer networks. SIGMETRICS 2002 : 258-259 Edith Cohen, Eran Halperin , Haim Kaplan , Uri Zwick : Reachability and distance queries via 2-hop labels. SODA 2002 : 937-946 Edith Cohen, Haim Kaplan : Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica 32 (3): 459-466 (2002) Edith Cohen, Haim Kaplan : Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica 33 (3): 300-334 (2002) Edith Cohen, Haim Kaplan , Uri Zwick : Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33 (4): 511-516 (2002) Edith Cohen, Haim Kaplan : Refreshment policies for Web content caches. Computer Networks 38 (6): 795-808 (2002) Edith Cohen, Haim Kaplan : Prefetching the means for document transfer: a new approach for reducing Web latency. Computer Networks 39 (4): 437-455 (2002) 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) Edith Cohen, Eran Halperin , Haim Kaplan : Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001 : 744-756 Edith Cohen, Haim Kaplan : Refreshment Policies for Web Content Caches. INFOCOM 2001 : 1398-1406 Anat Bremler-Barr , Yehuda Afek , Haim Kaplan , Edith Cohen, Michael Merritt : Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001 : 43-52 Edith Cohen, Haim Kaplan : Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT 2001 : 85-94 Edith Cohen, Haim Kaplan : Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM 2001 : 41-53 Anat Bremler-Barr , Yehuda Afek , Haim Kaplan , Edith Cohen, Michael Merritt : Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001 : 316-317 Edith Cohen, Haim Kaplan : The Age Penalty and Its Effect on Cache Performance. USITS 2001 : 73-84 Edith Cohen, Haim Kaplan , Uri Zwick : Competitive Analysis of the LRFU Paging Algorithm. WADS 2001 : 148-154 Edith 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) Edith Cohen, Uri Zwick : All-Pairs Small-Stretch Paths. J. Algorithms 38 (2): 335-353 (2001) 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 Edith Cohen, Haim Kaplan : Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM 2000 : 854-863 Edith Cohen, Haim Kaplan , Uri Zwick : Connection caching under vaious models of communication. SPAA 2000 : 54-63 Edith Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths. J. ACM 47 (1): 132-166 (2000) Edith Cohen, Balachander Krishnamurthy , Jennifer Rexford : Efficient Algorithms for Predicting Requests to Web Servers. INFOCOM 1999 : 284-293 Edith Cohen, Haim Kaplan : LP-based Analysis of Greedy-dual-size. SODA 1999 : 879-880 Edith Cohen, Haim Kaplan : Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC 1999 : 109-118 Edith Cohen, Haim Kaplan , Uri Zwick : Connection Caching. STOC 1999 : 612-621 Edith Cohen, Haim Kaplan , Jeffrey D. Oldham : Managing TCP Connections Under Persistent HTTP. Computer Networks 31 (11-16): 1709-1723 (1999) Edith Cohen, David D. Lewis : Approximating Matrix Multiplication for Pattern Recognition Tasks. J. Algorithms 30 (2): 211-252 (1999) Edith Cohen, Balachander Krishnamurthy , Jennifer Rexford : Evaluating Server-Assisted Cache Replacement in the Web. ESA 1998 : 307-319 Edith Cohen, Balachander Krishnamurthy , Jennifer Rexford : Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters. SIGCOMM 1998 : 241-253 Edith Cohen: Structure Prediction and Computation of Sparse Matrix Products. J. Comb. Optim. 2 (4): 307-332 (1998) Edith Cohen: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. SIAM J. Comput. 28 (1): 210-236 (1998) Edith Cohen: Learning Noisy Perceptrons by a Perceptron in Polynomial Time. FOCS 1997 : 514-523 Edith Cohen, David D. Lewis : Approximating Matrix Multiplication for Pattern Recognition Tasks. SODA 1997 : 682-691 Edith Cohen, Uri Zwick : All-Pairs Small-Stretch Paths. SODA 1997 : 93-102 Edith Cohen: Using Selective Path-Doubling for Parallel Shortest-Path Computations. J. Algorithms 22 (1): 30-56 (1997) Edith Cohen: Size-Estimation Framework with Applications to Transitive Closure and Reachability. J. Comput. Syst. Sci. 55 (3): 441-453 (1997) Edith Cohen: On Optimizing Multiplications of Sparse Matrices. IPCO 1996 : 219-233 Edith Cohen: Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. J. Algorithms 21 (2): 331-357 (1996) Naser S. Barghouti , Eleftherios Koutsofios , Edith Cohen: Improvise: Interactive Multimedia Process Visualization Environment. ESEC 1995 : 28-43 Edith Cohen: Approximate Max-Flow on Small Depth Networks. SIAM J. Comput. 24 (3): 579-597 (1995) Edith Cohen: Estimating the Size of the Transitive Closure in Linear Time FOCS 1994 : 190-200 Edith Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths. STOC 1994 : 16-26 Edith Cohen, Nimrod Megiddo : Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica 11 (3): 320-340 (1994) Edith Cohen, Nimrod Megiddo : New algorithms for generalized network flows. Math. Program. 64 : 325-336 (1994) Edith Cohen, Nimrod Megiddo : Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. 23 (6): 1313-1347 (1994) Edith Cohen: Fast algorithms for constructing t-spanners and paths with stretch t FOCS 1993 : 648-658 Edith Cohen: Using Selective Path-Doubling for Parallel Shortest-Path Computations. ISTCS 1993 : 78-87 Edith Cohen: Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. SPAA 1993 : 57-67 Edith Cohen, Nimrod Megiddo : Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. J. ACM 40 (4): 791-830 (1993) Edith Cohen: Approximate Max Flow on Small Depth Networks FOCS 1992 : 648-658 Edith Cohen, Nimrod Megiddo : New Algorithms for Generalized Network Flows. ISTCS 1992 : 103-114 Edith Cohen, Nimrod Megiddo : Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991 : 120-130 Edith Cohen, Nimrod Megiddo : Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) STOC 1991 : 145-155 Edith Cohen, Nimrod Megiddo : Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version) STOC 1989 : 523-534 1 [ 42 ] [ 45 ] [ 48 ] 2 [ 67 ] [ 73 ] 3 [ 65 ] 4 [ 16 ] 5 [ 42 ] [ 45 ] [ 48 ] [ 58 ] 6 [ 73 ] 7 [ 55 ] [ 59 ] 8 [ 37 ] [ 39 ] 9 [ 64 ] [ 65 ] [ 66 ] [ 69 ] 10 [ 37 ] [ 39 ] 11 [ 37 ] [ 39 ] 12 [ 47 ] [ 54 ] [ 61 ] [ 74 ] 13 [ 37 ] [ 39 ] 14 [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 35 ] [ 36 ] [ 40 ] [ 41 ] [ 42 ] [ 43 ] [ 44 ] [ 45 ] [ 46 ] [ 47 ] [ 48 ] [ 49 ] [ 50 ] [ 51 ] [ 52 ] [ 53 ] [ 54 ] [ 57 ] [ 58 ] [ 60 ] [ 61 ] [ 62 ] [ 63 ] [ 64 ] [ 65 ] [ 66 ] [ 69 ] [ 70 ] [ 71 ] [ 72 ] [ 74 ] 15 [ 16 ] 16 [ 26 ] [ 27 ] [ 33 ] 17 [ 22 ] [ 28 ] 18 [ 55 ] [ 59 ] 19 [ 55 ] [ 59 ] 20 [ 58 ] 21 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 6 ] [ 10 ] [ 11 ] [ 12 ] 22 [ 42 ] [ 45 ] [ 48 ] 23 [ 57 ] 24 [ 37 ] [ 39 ] 25 [ 29 ] 26 [ 65 ] 27 [ 26 ] [ 27 ] [ 33 ] 28 [ 55 ] [ 56 ] [ 59 ] 29 [ 68 ] 30 [ 37 ] [ 39 ] 31 [ 37 ] [ 39 ] 32 [ 21 ] [ 30 ] [ 35 ] [ 38 ] [ 40 ] [ 51 ] [ 54 ] [ 61 ] [ 62 ]  ©2005 Association for Computing Machinery |
