Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version) - Edith Cohen; Nimrod Megiddo (STOC, 1989)

Recognizing Properties of Periodic Graphs. - Edith Cohen; Nimrod Megiddo (Applied Geometry And Discrete Mathematics, 1990)

Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) - Edith Cohen; Nimrod Megiddo (STOC, 1991)

NP-Completeness of graph decomposition problems. - Edith Cohen; Michael Tarsi (J. Complex., 1991)

Combinatorial algorithms for optimization problems. - Edith Cohen (1991)

Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. - Edith Cohen; Nimrod Megiddo (J. ACM, 1993)

Estimating the Size of the Transitive Closure in Linear Time - Edith Cohen (FOCS, 1994)

Algorithms and Complexity Analysis for Some Flow Problems. - Edith Cohen; Nimrod Megiddo (Algorithmica, 1994)

New algorithms for generalized network flows. - Edith Cohen; Nimrod Megiddo (Math. Program., 1994)

Improved Algorithms for Linear Inequalities With Two Variables per Inequality. - Edith Cohen; Nimrod Megiddo (SIAM J. Comput., 1994)

Improvise: Interactive Multimedia Process Visualization Environment. - Naser S. Barghouti; Eleftherios Koutsofios; Edith Cohen (ESEC, 1995)

Approximate Max-Flow on Small Depth Networks. - Edith Cohen (SIAM J. Comput., 1995)

On Optimizing Multiplications of Sparse Matrices. - Edith Cohen (IPCO, 1996)

Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. - Edith Cohen (J. Algorithms, 1996)

Learning Noisy Perceptrons by a Perceptron in Polynomial Time. - Edith Cohen (FOCS, 1997)

Using Selective Path-Doubling for Parallel Shortest-Path Computations. - Edith Cohen (J. Algorithms, 1997)

Size-Estimation Framework with Applications to Transitive Closure and Reachability. - Edith Cohen (J. Comput. Syst. Sci., 1997)

Evaluating Server-Assisted Cache Replacement in the Web. - Edith Cohen; Balachander Krishnamurthy; Jennifer Rexford (ESA, 1998)

Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters. - Edith Cohen; Balachander Krishnamurthy; Jennifer Rexford (SIGCOMM, 1998)

Structure Prediction and Computation of Sparse Matrix Products. - Edith Cohen (J. Comb. Optim., 1998)

Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. - Edith Cohen (SIAM J. Comput., 1998)

Efficient Algorithms for Predicting Requests to Web Servers. - Edith Cohen; Balachander Krishnamurthy; Jennifer Rexford (INFOCOM, 1999)

LP-based Analysis of Greedy-dual-size. - Edith Cohen; Haim Kaplan (SODA, 1999)

Connection Caching. - Edith Cohen; Haim Kaplan; Uri Zwick (STOC, 1999)

Managing TCP Connections Under Persistent HTTP. - Edith Cohen; Haim Kaplan; Jeffrey D. Oldham (Comput. Networks, 1999)

Approximating Matrix Multiplication for Pattern Recognition Tasks. - Edith Cohen; David D. Lewis (J. Algorithms, 1999)

Connection caching under vaious models of communication. - Edith Cohen; Haim Kaplan; Uri Zwick (SPAA, 2000)

Polylog-time and near-linear work approximation scheme for undirected shortest paths. - Edith Cohen (J. ACM, 2000)

Aging through cascaded caches: performance issues in the distribution of web content. - Edith Cohen; Haim Kaplan (SIGCOMM, 2001)

Restoration path concatenation: fast recovery of MPLS paths. - Anat Bremler-Barr; Yehuda Afek; Haim Kaplan; Edith Cohen; Michael Merritt (SIGMETRICS/Performance, 2001)

The Age Penalty and Its Effect on Cache Performance. - Edith Cohen; Haim Kaplan (USITS, 2001)

All-Pairs Small-Stretch Paths. - Edith Cohen; Uri Zwick (J. Algorithms, 2001)

Finding Interesting Associations without Support Pruning. - Edith Cohen; Mayur Datar; Shinji Fujiwara; Aristides Gionis; Piotr Indyk; Rajeev Motwani 001; Jeffrey D. Ullman; Cheng Yang (IEEE Trans. Knowl. Data Eng., 2001)

Search and replication in unstructured peer-to-peer networks. - Qin Lv; Pei Cao; Edith Cohen; Kai Li 001; Scott Shenker (ICS, 2002)

Replication strategies in unstructured peer-to-peer networks. - Edith Cohen; Scott Shenker (SIGCOMM, 2002)

Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. - Edith Cohen; Haim Kaplan (Algorithmica, 2002)

Exploiting Regularities in Web Traffic Patterns for Cache Replacement. - Edith Cohen; Haim Kaplan (Algorithmica, 2002)

Competitive Analysis of the LRFU Paging Algorithm. - Edith Cohen; Haim Kaplan; Uri Zwick (Algorithmica, 2002)

Refreshment policies for Web content caches. - Edith Cohen; Haim Kaplan (Comput. Networks, 2002)

Prefetching the means for document transfer: a new approach for reducing Web latency. - Edith Cohen; Haim Kaplan (Comput. Networks, 2002)

Restoration by path concatenation: fast recovery of MPLS paths. - Yehuda Afek; Anat Bremler-Barr; Haim Kaplan; Edith Cohen; Michael Merritt (Distributed Comput., 2002)

Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. - David L. Applegate; Edith Cohen (SIGCOMM, 2003)

Efficient sequences of trials. - Edith Cohen; Amos Fiat; Haim Kaplan (SODA, 2003)

A case for associative peer to peer overlays. - Edith Cohen; Amos Fiat; Haim Kaplan (Comput. Commun. Rev., 2003)

Proactive caching of DNS records: addressing a performance bottleneck. - Edith Cohen; Haim Kaplan (Comput. Networks, 2003)

Connection caching: model and algorithms. - Edith Cohen; Haim Kaplan; Uri Zwick (J. Comput. Syst. Sci., 2003)

Predicting and bypassing end-to-end Internet service degradations. - Anat Bremler-Barr; Edith Cohen; Haim Kaplan; Yishay Mansour (IEEE J. Sel. Areas Commun., 2003)

Reachability and Distance Queries via 2-Hop Labels. - Edith Cohen; Eran Halperin; Haim Kaplan; Uri Zwick (SIAM J. Comput., 2003)

Coping with network failures: routing strategies for optimal demand oblivious restoration. - David L. Applegate; Lee Breslau; Edith Cohen (SIGMETRICS, 2004)

Spatially-decaying aggregation over a network: model and algorithms. - Edith Cohen; Haim Kaplan (SIGMOD Conference, 2004)

Efficient estimation algorithms for neighborhood variance and other moments. - Edith Cohen; Haim Kaplan (SODA, 2004)

Optimal oblivious routing in polynomial time. - Yossi Azar; Edith Cohen; Amos Fiat; Haim Kaplan; Harald Räcke (J. Comput. Syst. Sci., 2004)

Guest Editors' foreword. - Edith Cohen; Venkatesan Guruswami (J. Comput. Syst. Sci., 2004)

Balanced-Replication Algorithms for Distribution Trees. - Edith Cohen; Haim Kaplan (SIAM J. Comput., 2004)

Packet classification in large ISPs: design and evaluation of decision tree classifiers. - Edith Cohen; Carsten Lund (SIGMETRICS, 2005)

Performance aspects of distributed caches using TTL-based consistency. - Edith Cohen; Eran Halperin; Haim Kaplan (Theor. Comput. Sci., 2005)

A short walk in the Blogistan. - Edith Cohen; Balachander Krishnamurthy (Comput. Networks, 2006)

Maintaining time-decaying stream aggregates. - Edith Cohen; Martin J. Strauss (J. Algorithms, 2006)

Making routing robust to changing traffic demands: algorithms and evaluation. - David L. Applegate; Edith Cohen (IEEE/ACM Trans. Netw., 2006)

Algorithms and estimators for accurate summarization of internet traffic. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (Internet Measurement Conference, 2007)

Summarizing data using bottom-k sketches. - Edith Cohen; Haim Kaplan (PODC, 2007)

Sketching unaggregated data streams for subpopulation-size queries. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (PODS, 2007)

Bottom-k sketches: better and more efficient estimation of aggregates. - Edith Cohen; Haim Kaplan (SIGMETRICS, 2007)

Associative search in peer to peer networks: Harnessing latent semantics. - Edith Cohen; Amos Fiat; Haim Kaplan (Comput. Networks, 2007)

Spatially-decaying aggregation over a network. - Edith Cohen; Haim Kaplan (J. Comput. Syst. Sci., 2007)

Estimating Aggregates over Multiple Sets. - Edith Cohen; Haim Kaplan (ICDM, 2008)

Confident estimation for multistage measurement sampling and aggregation. - Edith Cohen; Nick G. Duffield; Carsten Lund; Mikkel Thorup (SIGMETRICS, 2008)

Processing top-k queries from samples. - Edith Cohen; Nadav Grossaug; Haim Kaplan (Comput. Networks, 2008)

Sketch-Based Estimation of Subpopulation-Weight - Edith Cohen; Haim Kaplan (CoRR, 2008)

Variance optimal sampling based estimation of subset sums - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (CoRR, 2008)

Tighter estimation using bottom k sketches. - Edith Cohen; Haim Kaplan (Proc. VLDB Endow., 2008)

Leveraging discarded samples for tighter estimation of multiple-set aggregates. - Edith Cohen; Haim Kaplan (SIGMETRICS/Performance, 2009)

Stream sampling for variance-optimal estimation of subset sums. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (SODA, 2009)

Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (Proc. VLDB Endow., 2009)

Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. - Edith Cohen; Haim Kaplan; Subhabrata Sen (Proc. VLDB Endow., 2009)

Decay Models. - Edith Cohen (Encyclopedia of Database Systems, 2009)

Envy-free makespan approximation: extended abstract. - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (EC, 2010)

Truth and Envy in Capacitated Allocation Games - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (CoRR, 2010)

On the Interplay between Incentive Compatibility and Envy Freeness - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (CoRR, 2010)

Labeling Dynamic XML Trees. - Edith Cohen; Haim Kaplan; Tova Milo (SIAM J. Comput., 2010)

Get the most out of your sample: optimal unbiased estimators using partial information. - Edith Cohen; Haim Kaplan (PODS, 2011)

Structure-aware sampling on data streams. - Edith Cohen; Graham Cormode; Nick G. Duffield (SIGMETRICS, 2011)

Truth, Envy, and Truthful Market Clearing Bundle Pricing. - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (WINE, 2011)

Structure-Aware Sampling: Flexible and Accurate Summarization. - Edith Cohen; Graham Cormode; Nick G. Duffield (Proc. VLDB Endow., 2011)

Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (SIAM J. Comput., 2011)

Don't let the negatives bring you down: sampling from streams of signed updates. - Edith Cohen; Graham Cormode; Nick G. Duffield (SIGMETRICS, 2012)

How to Estimate Change from Samples - Edith Cohen; Haim Kaplan (CoRR, 2012)

A Case for Customizing Estimators: Coordinated Samples - Edith Cohen; Haim Kaplan (CoRR, 2012)

Envy-Free Makespan Approximation. - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (SIAM J. Comput., 2012)

What You Can Do with Coordinated Samples. - Edith Cohen; Haim Kaplan (APPROX-RANDOM, 2013)

Scheduling Subset Tests: One-Time, Continuous, and How They Relate. - Edith Cohen; Haim Kaplan; Yishay Mansour (APPROX-RANDOM, 2013)

Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. - Edith Cohen; Daniel Delling; Fabian Fuchs; Andrew V. Goldberg; Moisés Goldszmidt; Renato F. Werneck (COSN, 2013)

Scalable Neighborhood Sketching and Distance Distribution Estimation in Graph Datasets: Revisited, Unified, and Improved. - Edith Cohen (CoRR, 2013)

A Labeling Approach to Incremental Cycle Detection. - Edith Cohen; Amos Fiat; Haim Kaplan; Liam Roditty (CoRR, 2013)

Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. - Edith Cohen; Daniel Delling; Thomas Pajor; Renato F. Werneck (CIKM, 2014)

Computing classic closeness centrality, at scale. - Edith Cohen; Daniel Delling; Thomas Pajor; Renato F. Werneck (COSN, 2014)

Author retrospective for search and replication in unstructured peer-to-peer networks. - Qin Lv; Pei Cao; Edith Cohen; Kai Li 001; Scott Shenker (ICS 25th Anniversary, 2014)

Distance queries from sampled data: accurate and efficient. - Edith Cohen (KDD, 2014)

Estimation for monotone sampling: competitiveness and customization. - Edith Cohen (PODC, 2014)

Variance Competitiveness for Monotone Estimation: Tightening the Bounds. - Edith Cohen (CoRR, 2014)

Timed Influence: Computation and Maximization. - Edith Cohen; Daniel Delling; Thomas Pajor; Renato F. Werneck (CoRR, 2014)

Algorithms and estimators for summarization of unaggregated data streams. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (J. Comput. Syst. Sci., 2014)

Probe scheduling for efficient detection of silent failures. - Edith Cohen; Avinatan Hassidim; Haim Kaplan; Yishay Mansour; Danny Raz; Yoav Tzur (Perform. Evaluation, 2014)

Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. - Shiri Chechik; Edith Cohen; Haim Kaplan (APPROX-RANDOM, 2015)

Multi-objective Weighted Sampling. - Edith Cohen (HotWeb, 2015)

Stream Sampling for Frequency Cap Statistics. - Edith Cohen (KDD, 2015)

All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis. - Edith Cohen (IEEE Trans. Knowl. Data Eng., 2015)

Greedy Maximization Framework for Graph-Based Influence Functions. - Edith Cohen (HotWeb, 2016)

Reverse Ranking by Graph Structure: Model and Scalable Algorithms. - Eliav Buchnik; Edith Cohen (SIGMETRICS, 2016)

Efficient Distinct Heavy Hitters for DNS DDoS Attack Detection. - Yehuda Afek; Anat Bremler-Barr; Edith Cohen; Shir Landau Feibish; Michal Shagam (CoRR, 2016)

Semi-Supervised Learning for Asymmetric Graphs through Reach and Distance Diffusion. - Edith Cohen (CoRR, 2016)

Estimating Frequency Statistics through Distinct Count Measurements. - Edith Cohen (CoRR, 2016)

On the Tradeoff between Stability and Fit. - Edith Cohen; Graham Cormode; Nick G. Duffield; Carsten Lund (ACM Trans. Algorithms, 2016)

All-Distances Sketches. - Edith Cohen (Encyclopedia of Algorithms, 2016)

Coordinated Sampling. - Edith Cohen (Encyclopedia of Algorithms, 2016)

Min-Hash Sketches. - Edith Cohen (Encyclopedia of Algorithms, 2016)

Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches. - Shir Landau Feibish; Yehuda Afek; Anat Bremler-Barr; Edith Cohen; Michal Shagam (HotWeb, 2017)

HyperLogLog Hyperextended: Sketches for Concave Sublinear Frequency Statistics. - Edith Cohen (KDD, 2017)

Clustering over Multi-Objective Samples: The one2all Sample. - Edith Cohen; Shiri Chechik; Haim Kaplan (CoRR, 2017)

Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. - Edith Cohen; Shiri Chechik; Haim Kaplan (AAAI, 2018)

LSH Microbatches for Stochastic Gradients: Value in Rearrangement. - Eliav Buchnik; Edith Cohen; Avinatan Hassidim; Yossi Matias (CoRR, 2018)

Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity. - Eliav Buchnik; Edith Cohen (Proc. ACM Meas. Anal. Comput. Syst., 2018)

Stream Sampling Framework and Application for Frequency Cap Statistics. - Edith Cohen (ACM Trans. Algorithms, 2018)

Decay Models. - Edith Cohen (Encyclopedia of Database Systems (2nd ed.), 2018)

Self-similar Epochs: Value in arrangement. - Eliav Buchnik; Edith Cohen; Avinatan Hassidim; Yossi Matias (ICML, 2019)

Sampling Sketches for Concave Sublinear Functions of Frequencies. - Edith Cohen; Ofir Geri (NeurIPS, 2019)

Influence Maximization with Few Simulations. - Gal Sadeh; Edith Cohen; Haim Kaplan (CoRR, 2019)

Composable Sketches for Functions of Frequencies: Beyond the Worst Case. - Edith Cohen; Ofir Geri; Rasmus Pagh (ICML, 2020)

Sample Complexity Bounds for Influence Maximization. - Gal Sadeh; Edith Cohen; Haim Kaplan (ITCS, 2020)

WOR and p's: Sketches for ℓp-Sampling Without Replacement. - Edith Cohen; Rasmus Pagh; David P. Woodruff (NeurIPS, 2020)

Graph Learning with Loss-Guided Training. - Eliav Buchnik; Edith Cohen (GRADES-NDA@SIGMOD, 2020)

WOR and p's: Sketches for 𝓁p-Sampling Without Replacement. - Edith Cohen; Rasmus Pagh; David P. Woodruff (CoRR, 2020)

Differentially Private Weighted Sampling. - Edith Cohen; Ofir Geri; Tamás Sarlós; Uri Stemmer (AISTATS, 2021)

Differentially-Private Clustering of Easy Instances. - Edith Cohen; Haim Kaplan; Yishay Mansour; Uri Stemmer; Eliad Tsfadia (ICML, 2021)

POMACS V5, N3, December 2021 Editorial. - Niklas Carlsson; Edith Cohen; Philippe Robert (Proc. ACM Meas. Anal. Comput. Syst., 2021)

Editorial. - Edith Cohen (ACM Trans. Algorithms, 2021)

On the Robustness of CountSketch to Adaptive Inputs. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Moshe Shechner; Uri Stemmer (ICML, 2022)

FriendlyCore: Practical Differentially Private Aggregation. - Eliad Tsfadia; Edith Cohen; Haim Kaplan; Yishay Mansour; Uri Stemmer (ICML, 2022)

POMACS V6, N1, March 2022 Editorial. - Niklas Carlsson; Edith Cohen; Philippe Robert (Proc. ACM Meas. Anal. Comput. Syst., 2022)

POMACS V6, N2, June 2022 Editorial. - Niklas Carlsson; Edith Cohen; Philippe Robert (Proc. ACM Meas. Anal. Comput. Syst., 2022)

Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs. - Edith Cohen; Jelani Nelson; Tamás Sarlós; Uri Stemmer (AAAI, 2023)

Generalized Private Selection and Testing with High Confidence. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Uri Stemmer (ITCS, 2023)

The Target-Charging Technique for Privacy Analysis across Interactive Computations. - Edith Cohen; Xin Lyu 002 (NeurIPS, 2023)

Sampling Big Ideas in Query Optimization. - Edith Cohen (PODS, 2023)

Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Uri Stemmer (STOC, 2023)

The Target-Charging Technique for Privacy Accounting across Interactive Computations. - Edith Cohen; Xin Lyu 002 (CoRR, 2023)

Hot PATE: Private Aggregation of Distributions for Diverse Task. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Uri Stemmer (CoRR, 2023)

Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. - Sara Ahmadian; Edith Cohen (ICML, 2024)

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches. - Edith Cohen; Jelani Nelson; Tamás Sarlós; Mihir Singhal; Uri Stemmer (CoRR, 2024)

Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Uri Stemmer (IACR Cryptol. ePrint Arch., 2024)

A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators. - Idan Attias; Edith Cohen; Moshe Shechner; Uri Stemmer (Algorithmica, 2024)

Data Reconstruction: When You See It and When You Don't. - Edith Cohen; Haim Kaplan; Yishay Mansour; Shay Moran; Kobbi Nissim; Uri Stemmer; Eliad Tsfadia (ITCS, 2025)

Scaling Embedding Layers in Language Models. - Da Yu; Edith Cohen; Badih Ghazi; Yangsibo Huang; Pritish Kamath; Ravi Kumar 001; Daogao Liu; Chiyuan Zhang (CoRR, 2025)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries. - Edith Cohen; Mihir Singhal; Uri Stemmer (CoRR, 2025)

Urania: Differentially Private Insights into AI Use. - Daogao Liu; Edith Cohen; Badih Ghazi; Peter Kairouz; Pritish Kamath; Alexander Knop; Ravi Kumar 001; Pasin Manurangsi; Adam Sealfon; Da Yu; Chiyuan Zhang (CoRR, 2025)

Tight Bounds for Answering Adaptively Chosen Concentrated Queries. - Emma Rapoport; Edith Cohen; Uri Stemmer (CoRR, 2025)

The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for ℓ2 Norm Estimation. - Sara Ahmadian; Edith Cohen; Uri Stemmer (CoRR, 2025)