Edith Cohen

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
i14		Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur: Probe Scheduling for Efficient Detection of Silent Failures. CoRR abs/1302.0792 (2013)
i13		Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund: On the Tradeoff between Stability and Fit. CoRR abs/1302.2137 (2013)
	2012
j44		Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Envy-Free Makespan Approximation. SIAM J. Comput. 41(1): 12-25 (2012)
c62		Edith Cohen, Graham Cormode, Nick G. Duffield: Don't let the negatives bring you down: sampling from streams of signed updates. SIGMETRICS 2012: 343-354
i12		Edith Cohen, Haim Kaplan: How to Estimate Change from Samples. CoRR abs/1203.4903 (2012)
i11		Edith Cohen, Haim Kaplan: What you can do with Coordinated Samples. CoRR abs/1206.5637 (2012)
i10		Edith Cohen, Haim Kaplan: A Case for Customizing Estimators: Coordinated Samples. CoRR abs/1212.0243 (2012)
	2011
j43		Edith Cohen, Graham Cormode, Nick G. Duffield: Structure-Aware Sampling: Flexible and Accurate Summarization. PVLDB 4(11): 819-830 (2011)
j42		Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. SIAM J. Comput. 40(5): 1402-1431 (2011)
c61		Edith Cohen, Haim Kaplan: Get the most out of your sample: optimal unbiased estimators using partial information. PODS 2011: 13-24
c60		Edith Cohen, Graham Cormode, Nick G. Duffield: Structure-aware sampling on data streams. SIGMETRICS 2011: 197-208
c59		Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Truth, Envy, and Truthful Market Clearing Bundle Pricing. WINE 2011: 97-108
i9		Edith Cohen, Graham Cormode, Nick G. Duffield: Structure-Aware Sampling: Flexible and Accurate Summarization. CoRR abs/1102.5146 (2011)
i8		Edith Cohen, Haim Kaplan: Get the Most out of Your Sample: Optimal Unbiased Estimators using Partial Information. CoRR abs/1109.1325 (2011)
	2010
j41		Edith Cohen, Haim Kaplan, Tova Milo: Labeling Dynamic XML Trees. SIAM J. Comput. 39(5): 2048-2074 (2010)
c58		Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Envy-free makespan approximation: extended abstract. ACM Conference on Electronic Commerce 2010: 159-166
i7		Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Truth and Envy in Capacitated Allocation Games. CoRR abs/1003.5326 (2010)
i6		Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: On the Interplay between Incentive Compatibility and Envy Freeness. CoRR abs/1003.5328 (2010)
	2009
j40		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)
j39		Edith Cohen, Haim Kaplan, Subhabrata Sen: Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. PVLDB 2(1): 646-657 (2009)
c57		Edith Cohen, Haim Kaplan: Leveraging discarded samples for tighter estimation of multiple-set aggregates. SIGMETRICS/Performance 2009: 251-262
c56		Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Stream sampling for variance-optimal estimation of subset sums. SODA 2009: 1255-1264
r1		Edith Cohen: Decay Models. Encyclopedia of Database Systems 2009: 757-761
i5		Edith Cohen, Haim Kaplan: Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates. CoRR abs/0903.0625 (2009)
i4		Edith Cohen, Haim Kaplan, Subhabrata Sen: Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. CoRR abs/0906.4560 (2009)
i3		Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Envy-Free Makespan Approximation. CoRR abs/0909.1072 (2009)
	2008
j38		Edith Cohen, Nadav Grossaug, Haim Kaplan: Processing top-k queries from samples. Computer Networks 52(14): 2605-2622 (2008)
j37		Edith Cohen, Haim Kaplan: Tighter estimation using bottom k sketches. PVLDB 1(1): 213-224 (2008)
c55		Edith Cohen, Haim Kaplan: Estimating Aggregates over Multiple Sets. ICDM 2008: 761-766
c54		Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup: Confident estimation for multistage measurement sampling and aggregation. SIGMETRICS 2008: 109-120
i2		Edith Cohen, Haim Kaplan: Sketch-Based Estimation of Subpopulation-Weight. CoRR abs/0802.3448 (2008)
i1		Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Variance optimal sampling based estimation of subset sums. CoRR abs/0803.0473 (2008)
	2007
j36		Edith Cohen, Amos Fiat, Haim Kaplan: Associative search in peer to peer networks: Harnessing latent semantics. Computer Networks 51(8): 1861-1881 (2007)
j35		Edith Cohen, Haim Kaplan: Spatially-decaying aggregation over a network. J. Comput. Syst. Sci. 73(3): 265-288 (2007)
c53		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
c52		Edith Cohen, Haim Kaplan: Summarizing data using bottom-k sketches. PODC 2007: 225-234
c51		Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Sketching unaggregated data streams for subpopulation-size queries. PODS 2007: 253-262
c50		Edith Cohen, Haim Kaplan: Bottom-k sketches: better and more efficient estimation of aggregates. SIGMETRICS 2007: 353-354
	2006
j34		Edith Cohen, Balachander Krishnamurthy: A short walk in the Blogistan. Computer Networks 50(5): 615-630 (2006)
j33		Edith Cohen, Martin J. Strauss: Maintaining time-decaying stream aggregates. J. Algorithms 59(1): 19-36 (2006)
j32		David Applegate, Edith Cohen: Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans. Netw. 16(6): 1193-1206 (2006)
c49		Edith Cohen, Nadav Grossaug, Haim Kaplan: Processing top k queries from samples. CoNEXT 2006: 7
	2005
j31		Edith Cohen, Eran Halperin, Haim Kaplan: Performance aspects of distributed caches using TTL-based consistency. Theor. Comput. Sci. 331(1): 73-96 (2005)
c48		Edith Cohen, Carsten Lund: Packet classification in large ISPs: design and evaluation of decision tree classifiers. SIGMETRICS 2005: 73-84
	2004
j30		Edith Cohen, Venkatesan Guruswami: Guest Editors' foreword. J. Comput. Syst. Sci. 68(4): 701 (2004)
j29		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)
j28		Edith Cohen, Haim Kaplan: Balanced-Replication Algorithms for Distribution Trees. SIAM J. Comput. 34(1): 227-247 (2004)
c47		David Applegate, Lee Breslau, Edith Cohen: Coping with network failures: routing strategies for optimal demand oblivious restoration. SIGMETRICS 2004: 270-281
c46		Edith Cohen, Haim Kaplan: Spatially-decaying aggregation over a network: model and algorithms. SIGMOD Conference 2004: 707-718
c45		Edith Cohen, Haim Kaplan: Efficient estimation algorithms for neighborhood variance and other moments. SODA 2004: 157-166
	2003
j27		Edith Cohen, Amos Fiat, Haim Kaplan: A case for associative peer to peer overlays. Computer Communication Review 33(1): 95-100 (2003)
j26		Edith Cohen, Haim Kaplan: Proactive caching of DNS records: addressing a performance bottleneck. Computer Networks 41(6): 707-726 (2003)
j25		Edith Cohen, Haim Kaplan, Uri Zwick: Connection caching: model and algorithms. J. Comput. Syst. Sci. 67(1): 92-126 (2003)
j24		Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour: Predicting and bypassing end-to-end Internet service degradations. IEEE Journal on Selected Areas in Communications 21(6): 961-978 (2003)
j23		Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick: Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. 32(5): 1338-1355 (2003)
c44		Edith Cohen, Amos Fiat, Haim Kaplan: Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM 2003
c43		Edith Cohen, Martin Strauss: Maintaining time-decaying stream aggregates. PODS 2003: 223-233
c42		David Applegate, Edith Cohen: Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. SIGCOMM 2003: 313-324
c41		Edith Cohen, Amos Fiat, Haim Kaplan: Efficient sequences of trials. SODA 2003: 737-746
c40		Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke: Optimal oblivious routing in polynomial time. STOC 2003: 383-388
	2002
j22		Edith Cohen, Haim Kaplan: Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica 32(3): 459-466 (2002)
j21		Edith Cohen, Haim Kaplan: Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica 33(3): 300-334 (2002)
j20		Edith Cohen, Haim Kaplan, Uri Zwick: Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33(4): 511-516 (2002)
j19		Edith Cohen, Haim Kaplan: Refreshment policies for Web content caches. Computer Networks 38(6): 795-808 (2002)
j18		Edith Cohen, Haim Kaplan: Prefetching the means for document transfer: a new approach for reducing Web latency. Computer Networks 39(4): 437-455 (2002)
j17		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)
c39		Edith Cohen, Haim Kaplan: Balanced-Replication Algorithms for Distribution Trees. ESA 2002: 297-309
c38		Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker: Search and replication in unstructured peer-to-peer networks. ICS 2002: 84-95
c37		Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour: Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop 2002: 307-320
c36		Edith Cohen, Haim Kaplan, Tova Milo: Labeling Dynamic XML Trees. PODS 2002: 271-281
c35		Edith Cohen, Scott Shenker: Replication strategies in unstructured peer-to-peer networks. SIGCOMM 2002: 177-190
c34		Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker: Search and replication in unstructured peer-to-peer networks. SIGMETRICS 2002: 258-259
c33		Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick: Reachability and distance queries via 2-hop labels. SODA 2002: 937-946
	2001
j16		Edith Cohen, Uri Zwick: All-Pairs Small-Stretch Paths. J. Algorithms 38(2): 335-353 (2001)
j15		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)
c32		Edith Cohen, Eran Halperin, Haim Kaplan: Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001: 744-756
c31		Edith Cohen, Haim Kaplan: Refreshment Policies for Web Content Caches. INFOCOM 2001: 1398-1406
c30		Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001: 43-52
c29		Edith Cohen, Haim Kaplan: Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT 2001: 85-94
c28		Edith Cohen, Haim Kaplan: Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM 2001: 41-53
c27		Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001: 316-317
c26		Edith Cohen, Haim Kaplan: The Age Penalty and Its Effect on Cache Performance. USITS 2001: 73-84
c25		Edith Cohen, Haim Kaplan, Uri Zwick: Competitive Analysis of the LRFU Paging Algorithm. WADS 2001: 148-154
	2000
j14		Edith Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths. J. ACM 47(1): 132-166 (2000)
c24		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-500
c23		Edith Cohen, Haim Kaplan: Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM 2000: 854-863
c22		Edith Cohen, Haim Kaplan, Uri Zwick: Connection caching under vaious models of communication. SPAA 2000: 54-63
	1999
j13		Edith Cohen, Haim Kaplan, Jeffrey D. Oldham: Managing TCP Connections Under Persistent HTTP. Computer Networks 31(11-16): 1709-1723 (1999)
j12		Edith Cohen, David D. Lewis: Approximating Matrix Multiplication for Pattern Recognition Tasks. J. Algorithms 30(2): 211-252 (1999)
c21		Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford: Efficient Algorithms for Predicting Requests to Web Servers. INFOCOM 1999: 284-293
c20		Edith Cohen, Haim Kaplan: LP-based Analysis of Greedy-dual-size. SODA 1999: 879-880
c19		Edith Cohen, Haim Kaplan: Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC 1999: 109-118
c18		Edith Cohen, Haim Kaplan, Uri Zwick: Connection Caching. STOC 1999: 612-621
	1998
j11		Edith Cohen: Structure Prediction and Computation of Sparse Matrix Products. J. Comb. Optim. 2(4): 307-332 (1998)
j10		Edith Cohen: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. SIAM J. Comput. 28(1): 210-236 (1998)
c17		Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford: Evaluating Server-Assisted Cache Replacement in the Web. ESA 1998: 307-319
c16		Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford: Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters. SIGCOMM 1998: 241-253
	1997
j9		Edith Cohen: Using Selective Path-Doubling for Parallel Shortest-Path Computations. J. Algorithms 22(1): 30-56 (1997)
j8		Edith Cohen: Size-Estimation Framework with Applications to Transitive Closure and Reachability. J. Comput. Syst. Sci. 55(3): 441-453 (1997)
c15		Edith Cohen: Learning Noisy Perceptrons by a Perceptron in Polynomial Time. FOCS 1997: 514-523
c14		Edith Cohen, Uri Zwick: All-Pairs Small-Stretch Paths. SODA 1997: 93-102
c13		Edith Cohen, David D. Lewis: Approximating Matrix Multiplication for Pattern Recognition Tasks. SODA 1997: 682-691
	1996
j7		Edith Cohen: Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. J. Algorithms 21(2): 331-357 (1996)
c12		Edith Cohen: On Optimizing Multiplications of Sparse Matrices. IPCO 1996: 219-233
	1995
j6		Edith Cohen: Approximate Max-Flow on Small Depth Networks. SIAM J. Comput. 24(3): 579-597 (1995)
c11		Naser S. Barghouti, Eleftherios Koutsofios, Edith Cohen: Improvise: Interactive Multimedia Process Visualization Environment. ESEC 1995: 28-43
	1994
j5		Edith Cohen, Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica 11(3): 320-340 (1994)
j4		Edith Cohen, Nimrod Megiddo: New algorithms for generalized network flows. Math. Program. 64: 325-336 (1994)
j3		Edith Cohen, Nimrod Megiddo: Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. 23(6): 1313-1347 (1994)
c10		Edith Cohen: Estimating the Size of the Transitive Closure in Linear Time. FOCS 1994: 190-200
c9		Edith Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths. STOC 1994: 16-26
	1993
j2		Edith Cohen, Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. J. ACM 40(4): 791-830 (1993)
c8		Edith Cohen: Fast algorithms for constructing t-spanners and paths with stretch t. FOCS 1993: 648-658
c7		Edith Cohen: Using Selective Path-Doubling for Parallel Shortest-Path Computations. ISTCS 1993: 78-87
c6		Edith Cohen: Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. SPAA 1993: 57-67
	1992
c5		Edith Cohen: Approximate Max Flow on Small Depth Networks. FOCS 1992: 648-658
c4		Edith Cohen, Nimrod Megiddo: New Algorithms for Generalized Network Flows. ISTCS 1992: 103-114
	1991
j1		Edith Cohen, Michael Tarsi: NP-Completeness of graph decomposition problems. J. Complexity 7(2): 200-212 (1991)
c3		Edith Cohen, Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991: 120-130
c2		Edith Cohen, Nimrod Megiddo: Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract). STOC 1991: 145-155
	1989
c1		Edith Cohen, Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version). STOC 1989: 523-534

Coauthor Index

1	Yehuda Afek	[j17] [c30] [c27]
2	David Applegate	[j32] [c47] [c42]
3	Yossi Azar	[j29] [c40]
4	Naser S. Barghouti	[c11]
5	Anat Bremler-Barr	[j24] [j17] [c37] [c30] [c27]
6	Lee Breslau	[c47]
7	Pei Cao	[c38] [c34]
8	Graham Cormode	[i13] [c62] [j43] [c60] [i9]
9	Mayur Datar	[j15] [c24]
10	Nick G. Duffield	[i13] [c62] [j43] [j42] [c60] [i9] [j40] [c56] [c54] [i1] [c53] [c51]
11	Michal Feldman	[j44] [c59] [c58] [i7] [i6] [i3]
12	Amos Fiat	[j44] [c59] [c58] [i7] [i6] [i3] [j36] [j29] [j27] [c44] [c41] [c40]
13	Shinji Fujiwara	[j15] [c24]
14	Aristides Gionis	[j15] [c24]
15	Nadav Grossaug	[j38] [c49]
16	Venkatesan Guruswami	[j30]
17	Eran Halperin	[j31] [j23] [c33] [c32]
18	Avinatan Hassidim	[i14]
19	Piotr Indyk	[j15] [c24]
20	Haim Kaplan	[i14] [j44] [i12] [i11] [i10] [j42] [c61] [c59] [i8] [j41] [c58] [i7] [i6] [j40] [j39] [c57] [c56] [i5] [i4] [i3] [j38] [j37] [c55] [i2] [i1] [j36] [j35] [c53] [c52] [c51] [c50] [c49] [j31] [j29] [j28] [c46] [c45] [j27] [j26] [j25] [j24] [j23] [c44] [c41] [c40] [j22] [j21] [j20] [j19] [j18] [j17] [c39] [c37] [c36] [c33] [c32] [c31] [c30] [c29] [c28] [c27] [c26] [c25] [c23] [c22] [j13] [c20] [c19] [c18]
21	Eleftherios Koutsofios	[c11]
22	Balachander Krishnamurthy	[j34] [c21] [c17] [c16]
23	David D. Lewis	[j12] [c13]
24	Kai Li	[c38] [c34]
25	Carsten Lund	[i13] [j42] [j40] [c56] [c54] [i1] [c53] [c51] [c48]
26	Qin Lv	[c38] [c34]
27	Yishay Mansour	[i14] [j24] [c37]
28	Nimrod Megiddo	[j5] [j4] [j3] [j2] [c4] [c3] [c2] [c1]
29	Michael Merritt	[j17] [c30] [c27]
30	Tova Milo	[j41] [c36]
31	Rajeev Motwani	[j15] [c24]
32	Jeffrey D. Oldham	[j13]
33	Svetlana Olonetsky	[j44] [c59] [c58] [i7] [i6] [i3]
34	Danny Raz	[i14]
35	Jennifer Rexford	[c21] [c17] [c16]
36	Harald Räcke	[j29] [c40]
37	Subhabrata Sen	[j39] [i4]
38	Scott Shenker	[c38] [c35] [c34]
39	Martin Strauss (Martin J. Strauss)	[j33] [c43]
40	Michael Tarsi	[j1]
41	Mikkel Thorup	[j42] [j40] [c56] [c54] [i1] [c53] [c51]
42	Yoav Tzur	[i14]
43	Jeffrey D. Ullman	[j15] [c24]
44	Cheng Yang	[j15] [c24]
45	Uri Zwick	[j25] [j23] [j20] [c33] [j16] [c25] [c22] [c18] [c14]

Last update Tue May 21 07:33:52 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page