The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Edith Cohen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  87. Estimating Aggregates over Multiple Sets. [Citation Graph (, )][DBLP]


  88. Algorithms and estimators for accurate summarization of internet traffic. [Citation Graph (, )][DBLP]


  89. Envy-free makespan approximation: extended abstract. [Citation Graph (, )][DBLP]


  90. Confident estimation for multistage measurement sampling and aggregation. [Citation Graph (, )][DBLP]


  91. Leveraging discarded samples for tighter estimation of multiple-set aggregates. [Citation Graph (, )][DBLP]


  92. Stream sampling for variance-optimal estimation of subset sums. [Citation Graph (, )][DBLP]


  93. Processing top k queries from samples. [Citation Graph (, )][DBLP]


  94. Processing top-k queries from samples. [Citation Graph (, )][DBLP]


  95. Sketch-Based Estimation of Subpopulation-Weight [Citation Graph (, )][DBLP]


  96. Variance optimal sampling based estimation of subset sums [Citation Graph (, )][DBLP]


  97. Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates [Citation Graph (, )][DBLP]


  98. Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments [Citation Graph (, )][DBLP]


  99. Envy-Free Makespan Approximation [Citation Graph (, )][DBLP]


  100. Truth and Envy in Capacitated Allocation Games [Citation Graph (, )][DBLP]


  101. On the Interplay between Incentive Compatibility and Envy Freeness [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.605secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002