 | 2009 |
|---|
| 102 |       | Edith Cohen,
Haim Kaplan:
Leveraging discarded samples for tighter estimation of multiple-set aggregates.
SIGMETRICS/Performance 2009: 251-262 |
| 101 | | Edith Cohen,
Nick G. Duffield,
Haim Kaplan,
Carsten Lund,
Mikkel Thorup:
Stream sampling for variance-optimal estimation of subset sums.
SODA 2009: 1255-1264 |
| 100 | | Edith Cohen:
Decay Models.
Encyclopedia of Database Systems 2009: 757-761 |
| 99 | | Edith Cohen,
Haim Kaplan:
Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates
CoRR abs/0903.0625: (2009) |
| 98 | | Edith Cohen,
Haim Kaplan,
Subhabrata Sen:
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments
CoRR abs/0906.4560: (2009) |
| 97 | | Edith Cohen,
Michal Feldman,
Amos Fiat,
Haim Kaplan,
Svetlana Olonetsky:
Envy-Free Makespan Approximation
CoRR abs/0909.1072: (2009) |
| 96 | | Edith 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) |
| 95 | | Edith Cohen,
Haim Kaplan,
Subhabrata Sen:
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments.
PVLDB 2(1): 646-657 (2009) |
| 2008 |
|---|
| 94 | | Edith Cohen,
Haim Kaplan:
Estimating Aggregates over Multiple Sets.
ICDM 2008: 761-766 |
| 93 | | Edith Cohen,
Nick G. Duffield,
Carsten Lund,
Mikkel Thorup:
Confident estimation for multistage measurement sampling and aggregation.
SIGMETRICS 2008: 109-120 |
| 92 | | Edith Cohen,
Haim Kaplan:
Sketch-Based Estimation of Subpopulation-Weight
CoRR abs/0802.3448: (2008) |
| 91 | | Edith Cohen,
Nick G. Duffield,
Haim Kaplan,
Carsten Lund,
Mikkel Thorup:
Variance optimal sampling based estimation of subset sums
CoRR abs/0803.0473: (2008) |
| 90 | | Edith Cohen,
Nadav Grossaug,
Haim Kaplan:
Processing top-k queries from samples.
Computer Networks 52(14): 2605-2622 (2008) |
| 89 | | Edith Cohen,
Haim Kaplan:
Tighter estimation using bottom k sketches.
PVLDB 1(1): 213-224 (2008) |
| 2007 |
|---|
| 88 | | Edith 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 |
| 87 | | Edith Cohen,
Haim Kaplan:
Summarizing data using bottom-k sketches.
PODC 2007: 225-234 |
| 86 | | Edith Cohen,
Nick G. Duffield,
Haim Kaplan,
Carsten Lund,
Mikkel Thorup:
Sketching unaggregated data streams for subpopulation-size queries.
PODS 2007: 253-262 |
| 85 | | Edith Cohen,
Haim Kaplan:
Bottom-k sketches: better and more efficient estimation of aggregates.
SIGMETRICS 2007: 353-354 |
| 84 | | Edith Cohen,
Amos Fiat,
Haim Kaplan:
Associative search in peer to peer networks: Harnessing latent semantics.
Computer Networks 51(8): 1861-1881 (2007) |
| 83 | | Edith Cohen,
Haim Kaplan:
Spatially-decaying aggregation over a network.
J. Comput. Syst. Sci. 73(3): 265-288 (2007) |
| 2006 |
|---|
| 82 | | Edith Cohen,
Nadav Grossaug,
Haim Kaplan:
Processing top k queries from samples.
CoNEXT 2006: 7 |
| 81 | | Edith Cohen,
Balachander Krishnamurthy:
A short walk in the Blogistan.
Computer Networks 50(5): 615-630 (2006) |
| 80 | | David Applegate,
Edith Cohen:
Making routing robust to changing traffic demands: algorithms and evaluation.
IEEE/ACM Trans. Netw. 16(6): 1193-1206 (2006) |
| 79 | | Edith Cohen,
Martin J. Strauss:
Maintaining time-decaying stream aggregates.
J. Algorithms 59(1): 19-36 (2006) |
| 2005 |
|---|
| 78 | | Edith Cohen,
Carsten Lund:
Packet classification in large ISPs: design and evaluation of decision tree classifiers.
SIGMETRICS 2005: 73-84 |
| 77 | | Edith Cohen,
Eran Halperin,
Haim Kaplan:
Performance aspects of distributed caches using TTL-based consistency.
Theor. Comput. Sci. 331(1): 73-96 (2005) |
| 2004 |
|---|
| 76 | | David Applegate,
Lee Breslau,
Edith Cohen:
Coping with network failures: routing strategies for optimal demand oblivious restoration.
SIGMETRICS 2004: 270-281 |
| 75 | | Edith Cohen,
Haim Kaplan:
Spatially-decaying aggregation over a network: model and algorithms.
SIGMOD Conference 2004: 707-718 |
| 74 | | Edith Cohen,
Haim Kaplan:
Efficient estimation algorithms for neighborhood variance and other moments.
SODA 2004: 157-166 |
| 73 | | Edith Cohen,
Venkatesan Guruswami:
Guest Editors' foreword.
J. Comput. Syst. Sci. 68(4): 701 (2004) |
| 72 | | Yossi 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) |
| 71 | | Edith Cohen,
Haim Kaplan:
Balanced-Replication Algorithms for Distribution Trees.
SIAM J. Comput. 34(1): 227-247 (2004) |
| 2003 |
|---|
| 70 | | Edith Cohen,
Amos Fiat,
Haim Kaplan:
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics.
INFOCOM 2003 |
| 69 | | Edith Cohen,
Martin Strauss:
Maintaining time-decaying stream aggregates.
PODS 2003: 223-233 |
| 68 | | David Applegate,
Edith Cohen:
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs.
SIGCOMM 2003: 313-324 |
| 67 | | Edith Cohen,
Amos Fiat,
Haim Kaplan:
Efficient sequences of trials.
SODA 2003: 737-746 |
| 66 | | Yossi Azar,
Edith Cohen,
Amos Fiat,
Haim Kaplan,
Harald Räcke:
Optimal oblivious routing in polynomial time.
STOC 2003: 383-388 |
| 65 | | Edith Cohen,
Amos Fiat,
Haim Kaplan:
A case for associative peer to peer overlays.
Computer Communication Review 33(1): 95-100 (2003) |
| 64 | | Edith Cohen,
Haim Kaplan:
Proactive caching of DNS records: addressing a performance bottleneck.
Computer Networks 41(6): 707-726 (2003) |
| 63 | | Edith Cohen,
Haim Kaplan,
Uri Zwick:
Connection caching: model and algorithms.
J. Comput. Syst. Sci. 67(1): 92-126 (2003) |
| 62 | | Edith Cohen,
Eran Halperin,
Haim Kaplan,
Uri Zwick:
Reachability and Distance Queries via 2-Hop Labels.
SIAM J. Comput. 32(5): 1338-1355 (2003) |
| 2002 |
|---|
| 61 | | Edith Cohen,
Haim Kaplan:
Balanced-Replication Algorithms for Distribution Trees.
ESA 2002: 297-309 |
| 60 | | Qin Lv,
Pei Cao,
Edith Cohen,
Kai Li,
Scott Shenker:
Search and replication in unstructured peer-to-peer networks.
ICS 2002: 84-95 |
| 59 | | Anat Bremler-Barr,
Edith Cohen,
Haim Kaplan,
Yishay Mansour:
Predicting and bypassing end-to-end internet service degradations.
Internet Measurement Workshop 2002: 307-320 |
| 58 | | Edith Cohen,
Haim Kaplan,
Tova Milo:
Labeling Dynamic XML Trees.
PODS 2002: 271-281 |
| 57 | | Edith Cohen,
Scott Shenker:
Replication strategies in unstructured peer-to-peer networks.
SIGCOMM 2002: 177-190 |
| 56 | | Qin Lv,
Pei Cao,
Edith Cohen,
Kai Li,
Scott Shenker:
Search and replication in unstructured peer-to-peer networks.
SIGMETRICS 2002: 258-259 |
| 55 | | Edith Cohen,
Eran Halperin,
Haim Kaplan,
Uri Zwick:
Reachability and distance queries via 2-hop labels.
SODA 2002: 937-946 |
| 54 | | Edith Cohen,
Haim Kaplan:
Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach.
Algorithmica 32(3): 459-466 (2002) |
| 53 | | Edith Cohen,
Haim Kaplan:
Exploiting Regularities in Web Traffic Patterns for Cache Replacement.
Algorithmica 33(3): 300-334 (2002) |
| 52 | | Edith Cohen,
Haim Kaplan,
Uri Zwick:
Competitive Analysis of the LRFU Paging Algorithm.
Algorithmica 33(4): 511-516 (2002) |
| 51 | | Edith Cohen,
Haim Kaplan:
Refreshment policies for Web content caches.
Computer Networks 38(6): 795-808 (2002) |
| 50 | | Edith Cohen,
Haim Kaplan:
Prefetching the means for document transfer: a new approach for reducing Web latency.
Computer Networks 39(4): 437-455 (2002) |
| 49 | | 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) |
| 2001 |
|---|
| 48 | | Edith Cohen,
Eran Halperin,
Haim Kaplan:
Performance Aspects of Distributed Caches Using TTL-Based Consistency.
ICALP 2001: 744-756 |
| 47 | | Edith Cohen,
Haim Kaplan:
Refreshment Policies for Web Content Caches.
INFOCOM 2001: 1398-1406 |
| 46 | | Anat Bremler-Barr,
Yehuda Afek,
Haim Kaplan,
Edith Cohen,
Michael Merritt:
Restoration by path concatenation: fast recovery of MPLS paths.
PODC 2001: 43-52 |
| 45 | | Edith Cohen,
Haim Kaplan:
Proactive Caching of DNS Records: Addressing a Performance Bottleneck.
SAINT 2001: 85-94 |
| 44 | | Edith Cohen,
Haim Kaplan:
Aging through cascaded caches: performance issues in the distribution of web content.
SIGCOMM 2001: 41-53 |
| 43 | | Anat Bremler-Barr,
Yehuda Afek,
Haim Kaplan,
Edith Cohen,
Michael Merritt:
Restoration path concatenation: fast recovery of MPLS paths.
SIGMETRICS/Performance 2001: 316-317 |
| 42 | | Edith Cohen,
Haim Kaplan:
The Age Penalty and Its Effect on Cache Performance.
USITS 2001: 73-84 |
| 41 | | Edith Cohen,
Haim Kaplan,
Uri Zwick:
Competitive Analysis of the LRFU Paging Algorithm.
WADS 2001: 148-154 |
| 40 | | 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) |
| 39 |  | Edith Cohen,
Uri Zwick:
All-Pairs Small-Stretch Paths.
J. Algorithms 38(2): 335-353 (2001) |
| 2000 |
|---|
| 38 | | 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 |
| 37 | | Edith Cohen,
Haim Kaplan:
Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency.
INFOCOM 2000: 854-863 |
| 36 | | Edith Cohen,
Haim Kaplan,
Uri Zwick:
Connection caching under vaious models of communication.
SPAA 2000: 54-63 |
| 35 | | Edith 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 |
| 33 | | Edith Cohen,
Haim Kaplan:
LP-based Analysis of Greedy-dual-size.
SODA 1999: 879-880 |
| 32 | | Edith Cohen,
Haim Kaplan:
Exploiting Regularities in Web Traffic Patterns for Cache Replacement.
STOC 1999: 109-118 |
| 31 | | Edith Cohen,
Haim Kaplan,
Uri Zwick:
Connection Caching.
STOC 1999: 612-621 |
| 30 | | Edith 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 |
|---|
| 28 | | Edith Cohen,
Balachander Krishnamurthy,
Jennifer Rexford:
Evaluating Server-Assisted Cache Replacement in the Web.
ESA 1998: 307-319 |
| 27 | | Edith 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 |
|---|
| 24 | | Edith 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 |
|---|
| 19 | | Edith 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 |
| 14 | | Edith 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 |
| 8 | | Edith Cohen:
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition.
SPAA 1993: 57-67 |
| 7 | | Edith 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 |
| 5 | | Edith 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 |
| 2 | | Edith 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 |
