| 2026 | SODA | One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches. | Edith Cohen, Jelani Nelson, Tams Sarls, Mihir Singhal, Uri Stemmer |
| 2025 | ICML | Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries. | Edith Cohen, Mihir Singhal, Uri Stemmer |
| 2024 | COLT | Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. | Edith Cohen, Xin Lyu, Jelani Nelson, Tams Sarls, Uri Stemmer |
| 2024 | ICML | Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. | Sara Ahmadian, Edith Cohen |
| 2023 | AAAI | Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs. | Edith Cohen, Jelani Nelson, Tams Sarls, Uri Stemmer |
| 2023 | PODS | Sampling Big Ideas in Query Optimization. | Edith Cohen |
| 2023 | STOC | Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. | Edith Cohen, Xin Lyu, Jelani Nelson, Tams Sarls, Uri Stemmer |
| 2022 | ICML | On the Robustness of CountSketch to Adaptive Inputs. | Edith Cohen, Xin Lyu, Jelani Nelson, Tams Sarls, Moshe Shechner, Uri Stemmer |
| 2022 | ICML | FriendlyCore: Practical Differentially Private Aggregation. | Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer |
| 2021 | AISTATS | Differentially Private Weighted Sampling. | Edith Cohen, Ofir Geri, Tams Sarls, Uri Stemmer |
| 2021 | ICML | Differentially-Private Clustering of Easy Instances. | Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia |
| 2020 | ICML | Composable Sketches for Functions of Frequencies: Beyond the Worst Case. | Edith Cohen, Ofir Geri, Rasmus Pagh |
| 2020 | SIGMOD | Graph Learning with Loss-Guided Training. | Eliav Buchnik, Edith Cohen |
| 2019 | ICML | Self-similar Epochs: Value in arrangement. | Eliav Buchnik, Edith Cohen, Avinatan Hassidim, Yossi Matias |
| 2018 | AAAI | Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. | Edith Cohen, Shiri Chechik, Haim Kaplan |
| 2018 | SIGMETRICS | Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity. | Eliav Buchnik, Edith Cohen |
| 2017 | KDD | HyperLogLog Hyperextended: Sketches for Concave Sublinear Frequency Statistics. | Edith Cohen |
| 2016 | SIGMETRICS | Reverse Ranking by Graph Structure: Model and Scalable Algorithms. | Eliav Buchnik, Edith Cohen |
| 2015 | KDD | Stream Sampling for Frequency Cap Statistics. | Edith Cohen |
| 2014 | CIKM | Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. | Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck |
| 2014 | ICS | Author retrospective for search and replication in unstructured peer-to-peer networks. | Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker |
| 2014 | KDD | Distance queries from sampled data: accurate and efficient. | Edith Cohen |
| 2014 | PODC | Estimation for monotone sampling: competitiveness and customization. | Edith Cohen |
| 2014 | PODS | All-distances sketches, revisited: HIP estimators for massive graphs analysis. | Edith Cohen |
| 2012 | SIGMETRICS | Don't let the negatives bring you down: sampling from streams of signed updates. | Edith Cohen, Graham Cormode, Nick G. Duffield |
| 2011 | PODS | Get the most out of your sample: optimal unbiased estimators using partial information. | Edith Cohen, Haim Kaplan |
| 2011 | SIGMETRICS | Structure-aware sampling on data streams. | Edith Cohen, Graham Cormode, Nick G. Duffield |
| 2009 | SODA | Stream sampling for variance-optimal estimation of subset sums. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2009 | SIGMETRICS | Leveraging discarded samples for tighter estimation of multiple-set aggregates. | Edith Cohen, Haim Kaplan |
| 2008 | ICDM | Estimating Aggregates over Multiple Sets. | Edith Cohen, Haim Kaplan |
| 2008 | SIGMETRICS | Confident estimation for multistage measurement sampling and aggregation. | Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2007 | IMC | Algorithms and estimators for accurate summarization of internet traffic. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2007 | PODC | Summarizing data using bottom-k sketches. | Edith Cohen, Haim Kaplan |
| 2007 | PODS | Sketching unaggregated data streams for subpopulation-size queries. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2007 | SIGMETRICS | Bottom-k sketches: better and more efficient estimation of aggregates. | Edith Cohen, Haim Kaplan |
| 2006 | CoNEXT | Processing top k queries from samples. | Edith Cohen, Nadav Grossaug, Haim Kaplan |
| 2005 | SIGMETRICS | Packet classification in large ISPs: design and evaluation of decision tree classifiers. | Edith Cohen, Carsten Lund |
| 2004 | SIGMOD | Spatially-decaying aggregation over a network: model and algorithms. | Edith Cohen, Haim Kaplan |
| 2004 | SODA | Efficient estimation algorithms for neighborhood variance and other moments. | Edith Cohen, Haim Kaplan |
| 2004 | SIGMETRICS | Coping with network failures: routing strategies for optimal demand oblivious restoration. | David L. Applegate, Lee Breslau, Edith Cohen |
| 2003 | INFOCOM | Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. | Edith Cohen, Amos Fiat, Haim Kaplan |
| 2003 | PODS | Maintaining time-decaying stream aggregates. | Edith Cohen, Martin Strauss |
| 2003 | SODA | Efficient sequences of trials. | Edith Cohen, Amos Fiat, Haim Kaplan |
| 2003 | STOC | Optimal oblivious routing in polynomial time. | Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Rcke |
| 2003 | SIGCOMM | Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. | David L. Applegate, Edith Cohen |
| 2002 | ESA | Balanced-Replication Algorithms for Distribution Trees. | Edith Cohen, Haim Kaplan |
| 2002 | IMC | Predicting and bypassing end-to-end internet service degradations. | Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour |
| 2002 | ICS | Search and replication in unstructured peer-to-peer networks. | Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker |
| 2002 | PODS | Labeling Dynamic XML Trees. | Edith Cohen, Haim Kaplan, Tova Milo |
| 2002 | SODA | Reachability and distance queries via 2-hop labels. | Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick |
| 2002 | SIGCOMM | Replication strategies in unstructured peer-to-peer networks. | Edith Cohen, Scott Shenker |
| 2002 | SIGMETRICS | Search and replication in unstructured peer-to-peer networks. | Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker |
| 2001 | ICALP | Performance Aspects of Distributed Caches Using TTL-Based Consistency. | Edith Cohen, Eran Halperin, Haim Kaplan |
| 2001 | INFOCOM | Refreshment Policies for Web Content Caches. | Edith Cohen, Haim Kaplan |
| 2001 | PODC | Restoration by path concatenation: fast recovery of MPLS paths. | Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt |
| 2001 | SIGCOMM | Aging through cascaded caches: performance issues in the distribution of web content. | Edith Cohen, Haim Kaplan |
| 2001 | SIGMETRICS | Restoration path concatenation: fast recovery of MPLS paths. | Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt |
| 2001 | WADS | Competitive Analysis of the LRFU Paging Algorithm. | Edith Cohen, Haim Kaplan, Uri Zwick |
| 2000 | ICDE | Finding Interesting Associations without Support Pruning. | Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang |
| 2000 | INFOCOM | Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. | Edith Cohen, Haim Kaplan |
| 2000 | SPAA | Connection caching under vaious models of communication. | Edith Cohen, Haim Kaplan, Uri Zwick |
| 1999 | INFOCOM | Efficient Algorithms for Predicting Requests to Web Servers. | Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford |
| 1999 | SODA | LP-based Analysis of Greedy-dual-size. | Edith Cohen, Haim Kaplan |
| 1999 | STOC | Exploiting Regularities in Web Traffic Patterns for Cache Replacement. | Edith Cohen, Haim Kaplan |
| 1999 | STOC | Connection Caching. | Edith Cohen, Haim Kaplan, Uri Zwick |
| 1998 | ESA | Evaluating Server-Assisted Cache Replacement in the Web. | Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford |
| 1998 | SIGCOMM | Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters. | Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford |
| 1997 | FOCS | Learning Noisy Perceptrons by a Perceptron in Polynomial Time. | Edith Cohen |
| 1997 | SODA | Approximating Matrix Multiplication for Pattern Recognition Tasks. | Edith Cohen, David D. Lewis |
| 1997 | SODA | All-Pairs Small-Stretch Paths. | Edith Cohen, Uri Zwick |
| 1996 | IPCO | On Optimizing Multiplications of Sparse Matrices. | Edith Cohen |
| 1994 | FOCS | Estimating the Size of the Transitive Closure in Linear Time | Edith Cohen |
| 1994 | STOC | Polylog-time and near-linear work approximation scheme for undirected shortest paths. | Edith Cohen |
| 1993 | FOCS | Fast algorithms for constructing t-spanners and paths with stretch t | Edith Cohen |
| 1993 | SPAA | Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. | Edith Cohen |
| 1992 | FOCS | Approximate Max Flow on Small Depth Networks | Edith Cohen |
| 1991 | SODA | Algorithms and Complexity Analysis for Some Flow Problems. | Edith Cohen, Nimrod Megiddo |
| 1991 | STOC | Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) | Edith Cohen, Nimrod Megiddo |
| 1989 | STOC | Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version) | Edith Cohen, Nimrod Megiddo |