DBLife: Edith Cohen

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

2009

100

Envy-Free Makespan Approximation. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. CoRR (abs/0909.1072) (2009). Web SearchBibTeXDownload

Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates. Edith Cohen, Haim Kaplan. CoRR (abs/0903.0625) (2009). Cited by 1Web SearchBibTeXDownload

Decay Models. Edith Cohen. Encyclopedia of Database Systems 2009, 757-761. Web SearchBibTeXDownload

Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. PVLDB (2): 431-442 (2009). Web SearchBibTeXDownload

Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. Edith Cohen, Haim Kaplan, Subhabrata Sen. PVLDB (2): 646-657 (2009). Web SearchBibTeXDownload

Leveraging discarded samples for tighter estimation of multiple-set aggregates. Edith Cohen, Haim Kaplan. SIGMETRICS/Performance 2009, 251-262. Web SearchBibTeXDownload

Stream sampling for variance-optimal estimation of subset sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. SODA 2009, 1255-1264. Cited by 2Web SearchBibTeXDownload

2008

Processing top-k queries from samples. Edith Cohen, Nadav Grossaug, Haim Kaplan. Computer Networks (52): 2605-2622 (2008). Cited by 3Web SearchBibTeXDownload

Sketch-Based Estimation of Subpopulation-Weight. Edith Cohen, Haim Kaplan. CoRR (abs/0802.3448) (2008). Cited by 1Web SearchBibTeXDownload

Variance optimal sampling based estimation of subset sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. CoRR (abs/0803.0473) (2008). Cited by 3Web SearchBibTeXDownload

Estimating Aggregates over Multiple Sets. Edith Cohen, Haim Kaplan. ICDM 2008, 761-766. Cited by 1Web SearchBibTeXDownload

Tighter estimation using bottom k sketches. Edith Cohen, Haim Kaplan. PVLDB (1): 213-224 (2008). Cited by 5Web SearchBibTeXDownload

Confident estimation for multistage measurement sampling and aggregation. Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup. SIGMETRICS 2008, 109-120. Cited by 1Web SearchBibTeXDownload

2007

Associative search in peer to peer networks: Harnessing latent semantics. Edith Cohen, Amos Fiat, Haim Kaplan. Computer Networks (51): 1861-1881 (2007). Cited by 183Web SearchBibTeXDownload

Algorithms and estimators for accurate summarization of internet traffic. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. Internet Measurement Comference 2007, 265-278. Cited by 8Web SearchBibTeXDownload

Spatially-decaying aggregation over a network. Edith Cohen, Haim Kaplan. J. Comput. Syst. Sci. (73): 265-288 (2007). Cited by 27Web SearchBibTeXDownload

Summarizing data using bottom-k sketches. Edith Cohen, Haim Kaplan. PODC 2007, 225-234. Cited by 12Web SearchBibTeXDownload

Sketching unaggregated data streams for subpopulation-size queries. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. PODS 2007, 253-262. Cited by 10Web SearchBibTeXDownload

Bottom-k sketches: better and more efficient estimation of aggregates. Edith Cohen, Haim Kaplan. SIGMETRICS 2007, 353-354. Cited by 7Web SearchBibTeXDownload

2006

A short walk in the Blogistan. Edith Cohen, Balachander Krishnamurthy. Computer Networks (50): 615-630 (2006). Cited by 33Web SearchBibTeXDownload

Processing top k queries from samples. Edith Cohen, Nadav Grossaug, Haim Kaplan. CoNEXT 2006, 7. Web SearchBibTeXDownload

Making routing robust to changing traffic demands: algorithms and evaluation. David Applegate, Edith Cohen. IEEE/ACM Trans. Netw. (16): 1193-1206 (2006). Cited by 6Web SearchBibTeXDownload

Maintaining time-decaying stream aggregates. Edith Cohen, Martin J. Strauss. J. Algorithms (59): 19-36 (2006). Cited by 76Web SearchBibTeXDownload

2005

Packet classification in large ISPs: design and evaluation of decision tree classifiers. Edith Cohen, Carsten Lund. SIGMETRICS 2005, 73-84. Cited by 28Web SearchBibTeXDownload

Performance aspects of distributed caches using TTL-based consistency. Edith Cohen, Eran Halperin, Haim Kaplan. Theor. Comput. Sci. (331): 73-96 (2005). Cited by 10Web SearchBibTeXDownload

2004

Guest Editors' foreword. Sampath Kannan, Mihalis Yannakakis, Pavel A. Pevzner, Ron Shamir. J. Comput. Syst. Sci. (68): 701 (2004). Web SearchBibTeXDownload

Optimal oblivious routing in polynomial time. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke. J. Comput. Syst. Sci. (69): 383-394 (2004). Cited by 95Web SearchBibTeXDownload

Balanced-Replication Algorithms for Distribution Trees. Edith Cohen, Haim Kaplan. SIAM J. Comput. (34): 227-247 (2004). Cited by 5Web SearchBibTeXDownload

Coping with network failures: routing strategies for optimal demand oblivious restoration. David Applegate, Lee Breslau, Edith Cohen. SIGMETRICS 2004, 270-281. Cited by 30Web SearchBibTeXDownload

Spatially-decaying aggregation over a network: model and algorithms. Edith Cohen, Haim Kaplan. SIGMOD Conference 2004, 707-718. Cited by 4Web SearchBibTeXDownload

Efficient estimation algorithms for neighborhood variance and other moments. Edith Cohen, Haim Kaplan. SODA 2004, 157-166. Cited by 6Web SearchBibTeXDownload

2003

A case for associative peer to peer overlays. Edith Cohen, Amos Fiat, Haim Kaplan. Computer Communication Review (33): 95-100 (2003). Cited by 37Web SearchBibTeXDownload

Proactive caching of DNS records: addressing a performance bottleneck. Edith Cohen, Haim Kaplan. Computer Networks (41): 707-726 (2003). Cited by 67Web SearchBibTeXDownload

Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. Edith Cohen, Amos Fiat, Haim Kaplan. INFOCOM 2003. Web SearchBibTeXDownload

Connection caching: model and algorithms. Edith Cohen, Haim Kaplan, Uri Zwick. J. Comput. Syst. Sci. (67): 92-126 (2003). Cited by 4Web SearchBibTeXDownload

Maintaining time-decaying stream aggregates. Edith Cohen, Martin J. Strauss. PODS 2003, 223-233. Cited by 76Web SearchBibTeXDownload

Reachability and Distance Queries via 2-Hop Labels. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick. SIAM J. Comput. (32): 1338-1355 (2003). Web SearchBibTeXDownload

Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. David Applegate, Edith Cohen. SIGCOMM 2003, 313-324. Cited by 150Web SearchBibTeXDownload

Efficient sequences of trials. Edith Cohen, Amos Fiat, Haim Kaplan. SODA 2003, 737-746. Cited by 23Web SearchBibTeXDownload

Optimal oblivious routing in polynomial time. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke. STOC 2003, 383-388. Cited by 95Web SearchBibTeXDownload

2002

Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Edith Cohen, Haim Kaplan. Algorithmica (33): 300-334 (2002). Cited by 34Web SearchBibTeXDownload

Competitive Analysis of the LRFU Paging Algorithm. Edith Cohen, Haim Kaplan, Uri Zwick. Algorithmica (33): 511-516 (2002). Cited by 3Web SearchBibTeXDownload

Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Edith Cohen, Haim Kaplan. Algorithmica (32): 459-466 (2002). Cited by 8Web SearchBibTeXDownload

Refreshment policies for Web content caches. Edith Cohen, Haim Kaplan. Computer Networks (38): 795-808 (2002). Cited by 55Web SearchBibTeXDownload

Prefetching the means for document transfer: a new approach for reducing Web latency. Edith Cohen, Haim Kaplan. Computer Networks (39): 437-455 (2002). Cited by 126Web SearchBibTeXDownload

Restoration by path concatenation: fast recovery of MPLS paths. Anat Bremler-Barr, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt. Distributed Computing (15): 273-283 (2002). Cited by 13Web SearchBibTeXDownload

Balanced-Replication Algorithms for Distribution Trees. Edith Cohen, Haim Kaplan. ESA 2002, 297-309. Cited by 5Web SearchBibTeXDownload

Predicting and bypassing end-to-end internet service degradations. Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour. Internet Measurement Workshop 2002, 307-320. Cited by 13Web SearchBibTeXDownload

Labeling Dynamic XML Trees. Edith Cohen, Haim Kaplan, Tova Milo. PODS 2002, 271-281. Cited by 204Web SearchBibTeXDownload

Replication strategies in unstructured peer-to-peer networks. Edith Cohen, Scott Shenker. SIGCOMM 2002, 177-190. Cited by 8Web SearchBibTeXDownload

Search and replication in unstructured peer-to-peer networks. Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker. SIGMETRICS 2002, 258-259. Cited by 1358Web SearchBibTeXDownload

Reachability and distance queries via 2-hop labels. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick. SODA 2002, 937-946. Cited by 88Web SearchBibTeXDownload

2001

Performance Aspects of Distributed Caches Using TTL-Based Consistency. Edith Cohen, Eran Halperin, Haim Kaplan. ICALP 2001, 744-756. Web SearchBibTeXDownload

Finding Interesting Associations without Support Pruning. Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang. IEEE Trans. Knowl. Data Eng. (13): 64-78 (2001). Cited by 223Web SearchBibTeXDownload

Refreshment Policies for Web Content Caches. Edith Cohen, Haim Kaplan. INFOCOM 2001, 1398-1406. Web SearchBibTeXDownload

All-Pairs Small-Stretch Paths. Edith Cohen, Uri Zwick. J. Algorithms (38): 335-353 (2001). Cited by 57Web SearchBibTeX

Restoration by path concatenation: fast recovery of MPLS paths. Anat Bremler-Barr, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt. PODC 2001, 43-52. Cited by 13Web SearchBibTeXDownload

Proactive Caching of DNS Records: Addressing a Performance Bottleneck. Edith Cohen, Haim Kaplan. SAINT 2001, 85-94. Web SearchBibTeXDownload

Aging through cascaded caches: performance issues in the distribution of web content. Edith Cohen, Haim Kaplan. SIGCOMM 2001, 41-53. Cited by 35Web SearchBibTeXDownload

Restoration path concatenation: fast recovery of MPLS paths. Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt. SIGMETRICS/Performance 2001, 316-317. Web SearchBibTeXDownload

The Age Penalty and Its Effect on Cache Performance. Edith Cohen, Haim Kaplan. USITS 2001, 73-84. Cited by 1Web SearchBibTeXDownload

Competitive Analysis of the LRFU Paging Algorithm. Edith Cohen, Haim Kaplan, Uri Zwick. WADS 2001, 148-154. Cited by 3Web SearchBibTeXDownload

2000

Finding Interesting Associations without Support Pruning. Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang. ICDE 2000, 489-499. Cited by 223Web SearchBibTeXDownload

Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. Edith Cohen, Haim Kaplan. INFOCOM 2000, 854-863. Web SearchBibTeXDownload

Polylog-time and near-linear work approximation scheme for undirected shortest paths. Edith Cohen. J. ACM (47): 132-166 (2000). Cited by 46Web SearchBibTeXDownload

Connection caching under vaious models of communication. Edith Cohen, Haim Kaplan, Uri Zwick. SPAA 2000, 54-63. Cited by 11Web SearchBibTeXDownload

1999

Managing TCP Connections Under Persistent HTTP. Edith Cohen, Haim Kaplan, Jeffrey D. Oldham. Computer Networks (31): 1709-1723 (1999). Cited by 33Web SearchBibTeXDownload

Efficient Algorithms for Predicting Requests to Web Servers. Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford. INFOCOM 1999, 284-293. Cited by 79Web SearchBibTeX

Approximating Matrix Multiplication for Pattern Recognition Tasks. Edith Cohen, David D. Lewis. J. Algorithms (30): 211-252 (1999). Cited by 39Web SearchBibTeX

LP-based Analysis of Greedy-dual-size. Edith Cohen, Haim Kaplan. SODA 1999, 879-880. Cited by 15Web SearchBibTeXDownload

Connection Caching. Edith Cohen, Haim Kaplan, Uri Zwick. STOC 1999, 612-621. Cited by 17Web SearchBibTeXDownload

Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Edith Cohen, Haim Kaplan. STOC 1999, 109-118. Cited by 34Web SearchBibTeXDownload

1998

Evaluating Server-Assisted Cache Replacement in the Web. Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford. ESA 1998, 307-319. Cited by 30Web SearchBibTeXDownload

Structure Prediction and Computation of Sparse Matrix Products. Edith Cohen. J. Comb. Optim. (2): 307-332 (1998). Cited by 3Web SearchBibTeX

Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. Edith Cohen. SIAM J. Comput. (28): 210-236 (1998). Cited by 106Web SearchBibTeX

Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters. Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford. SIGCOMM 1998, 241-253. Cited by 165Web SearchBibTeXDownload

1997

Learning Noisy Perceptrons by a Perceptron in Polynomial Time. Edith Cohen. FOCS 1997, 514-523. Cited by 47Web SearchBibTeXDownload

Using Selective Path-Doubling for Parallel Shortest-Path Computations. Edith Cohen. J. Algorithms (22): 30-56 (1997). Cited by 13Web SearchBibTeX

Size-Estimation Framework with Applications to Transitive Closure and Reachability. Edith Cohen. J. Comput. Syst. Sci. (55): 441-453 (1997). Cited by 125Web SearchBibTeX

All-Pairs Small-Stretch Paths. Edith Cohen, Uri Zwick. SODA 1997, 93-102. Cited by 57Web SearchBibTeXDownload

Approximating Matrix Multiplication for Pattern Recognition Tasks. Edith Cohen, David D. Lewis. SODA 1997, 682-691. Cited by 39Web SearchBibTeXDownload

1996

On Optimizing Multiplications of Sparse Matrices. Edith Cohen. IPCO 1996, 219-233. Cited by 3Web SearchBibTeXDownload

Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. Edith Cohen. J. Algorithms (21): 331-357 (1996). Cited by 59Web SearchBibTeX

1995

Improvise: Interactive Multimedia Process Visualization Environment. Naser S. Barghouti, Eleftherios Koutsofios, Edith Cohen. ESEC 1995, 28-43. Cited by 15Web SearchBibTeX

Approximate Max-Flow on Small Depth Networks. Edith Cohen. SIAM J. Comput. (24): 579-597 (1995). Cited by 19Web SearchBibTeX

1994

Algorithms and Complexity Analysis for Some Flow Problems. Edith Cohen, Nimrod Megiddo. Algorithmica (11): 320-340 (1994). Cited by 8Web SearchBibTeX

Estimating the Size of the Transitive Closure in Linear Time. Edith Cohen. FOCS 1994, 190-200. Cited by 14Web SearchBibTeX

New algorithms for generalized network flows. Edith Cohen, Nimrod Megiddo. Math. Program. (64): 325-336 (1994). Cited by 21Web SearchBibTeX

Improved Algorithms for Linear Inequalities With Two Variables per Inequality. Edith Cohen, Nimrod Megiddo. SIAM J. Comput. (23): 1313-1347 (1994). Cited by 48Web SearchBibTeX

Polylog-time and near-linear work approximation scheme for undirected shortest paths. Edith Cohen. STOC 1994, 16-26. Cited by 46Web SearchBibTeXDownload

1993

Fast algorithms for constructing t-spanners and paths with stretch t. Edith Cohen. FOCS 1993, 648-658. Cited by 11Web SearchBibTeX

Using Selective Path-Doubling for Parallel Shortest-Path Computations. Edith Cohen. ISTCS 1993, 78-87. Cited by 13Web SearchBibTeX

Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. Edith Cohen, Nimrod Megiddo. J. ACM (40): 791-830 (1993). Cited by 13Web SearchBibTeXDownload

Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. Edith Cohen. SPAA 1993, 57-67. Cited by 59Web SearchBibTeXDownload

1992

Approximate Max Flow on Small Depth Networks. Edith Cohen. FOCS 1992, 648-658. Cited by 2Web SearchBibTeX

New Algorithms for Generalized Network Flows. Edith Cohen, Nimrod Megiddo. ISTCS 1992, 103-114. Web SearchBibTeXDownload

1991

NP-Completeness of graph decomposition problems. Edith Cohen, Michael Tarsi. J. Complexity (7): 200-212 (1991). Cited by 24Web SearchBibTeXDownload

Algorithms and Complexity Analysis for Some Flow Problems. Edith Cohen, Nimrod Megiddo. SODA 1991, 120-130. Cited by 8Web SearchBibTeXDownload

Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract). Edith Cohen, Nimrod Megiddo. STOC 1991, 145-155. Web SearchBibTeX

1989

Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version). Edith Cohen, Nimrod Megiddo. STOC 1989, 523-534. Cited by 73Web SearchBibTeX

http://www.research.att.com/~edith/
Algorithms Research Department
AT&T
USA
Papers cited 4,774 times
H-Index of 33

Edith Cohen

Related People

Services

Related Organizations

Talks

Tutorials

1.	^ WWW2002 CFP: Performance Area - Retrieved 2009-11-21 - details Original context from http://www2002.org/cfp-performance.html ...ements, software robustness and reliability, traffic characterization Performance Program Committee Edith Cohen , AT&T, USA Michele Colajanni , University of Modena, Italy Mark Crovella , Boston University, ...
2.	^ Forum for Artificial Intelligence - Retrieved 2009-11-20 - details Original context from http://www.cs.utexas.edu/users/ai-lab/fai/archives/2006-2007.html ...2 Dr. Cohen worked at Whizbang Labs, a company specializing in extracting information from the web. Dr. Cohen is member of the board of the International Machine Learning Society, and has served as an action e...
3.	^ SIGMOD/PODS 2003 Conference - Retrieved 2009-11-21 - details Original context from http://db.ucsd.edu/SIGMODPODS03/PODSpapers.html ... Edith Cohen , Martin Strauss ...