Edith Cohen - RankMe

224 papers A* 66A 13B 4Journal 113Unranked 21

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	A Simple and Robust Protocol for Distributed Counting. ITCS Edith Cohen, Moshe Shechner, Uri Stemmer
2026	J	`jnl`	Adaptively Robust Resettable Streaming. CoRR Edith Cohen, Elena Gribelyuk, Jelani Nelson, Uri Stemmer
2026	A*	`conf`	One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches. SODA Edith Cohen, Jelani Nelson, Tamás Sarlós, Mihir Singhal, Uri Stemmer
2025	J	`jnl`	A Simple and Robust Protocol for Distributed Counting. CoRR Edith Cohen, Moshe Shechner, Uri Stemmer
2025	A*	`conf`	Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries. ICML Edith Cohen, Mihir Singhal, Uri Stemmer
2025	J	`jnl`	Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries. CoRR Edith Cohen, Mihir Singhal, Uri Stemmer
2025	A	`conf`	Data Reconstruction: When You See It and When You Don't. ITCS Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
2025	J	`jnl`	Scaling Embedding Layers in Language Models. CoRR Da Yu, Edith Cohen, Badih Ghazi, Yangsibo Huang, Pritish Kamath, Ravi Kumar, Daogao Liu, Chiyuan Zhang
2025	J	`jnl`	The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for ℓ CoRR Sara Ahmadian, Edith Cohen, Uri Stemmer
2025	J	`jnl`	Tight Bounds for Answering Adaptively Chosen Concentrated Queries. CoRR Emma Rapoport, Edith Cohen, Uri Stemmer
2025	J	`jnl`	Urania: Differentially Private Insights into AI Use. CoRR Daogao Liu, Edith Cohen, Badih Ghazi, Peter Kairouz, Pritish Kamath, Alexander Knop, Ravi Kumar, Pasin Manurangsi, Adam Sealfon, Da Yu, Chiyuan Zhang
2024	J	`jnl`	A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators. Algorithmica Idan Attias, Edith Cohen, Moshe Shechner, Uri Stemmer
2024	J	`jnl`	Data Reconstruction: When You See It and When You Don't. CoRR Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
2024	A*	`conf`	Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. COLT Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2024	J	`jnl`	Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. CoRR Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2024	J	`jnl`	Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. IACR Cryptol. ePrint Arch. Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2024	J	`jnl`	One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches. CoRR Edith Cohen, Jelani Nelson, Tamás Sarlós, Mihir Singhal, Uri Stemmer
2024	A*	`conf`	Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. ICML Sara Ahmadian, Edith Cohen
2024	J	`jnl`	Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. CoRR Sara Ahmadian, Edith Cohen
2023	A	`conf`	A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators. ITCS Idan Attias, Edith Cohen, Moshe Shechner, Uri Stemmer
2023	A	`conf`	Generalized Private Selection and Testing with High Confidence. ITCS Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2023	J	`jnl`	Hot PATE: Private Aggregation of Distributions for Diverse Task. CoRR Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2023	A*	`conf`	Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. STOC Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2023	A*	`conf`	Sampling Big Ideas in Query Optimization. PODS Edith Cohen
2023	J	`jnl`	The Target-Charging Technique for Privacy Accounting across Interactive Computations. CoRR Edith Cohen, Xin Lyu
2023	A*	`conf`	The Target-Charging Technique for Privacy Analysis across Interactive Computations. NeurIPS Edith Cohen, Xin Lyu
2023	A*	`conf`	Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs. AAAI Edith Cohen, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2022	A*	`conf`	FriendlyCore: Practical Differentially Private Aggregation. ICML Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer
2022	J	`jnl`	Generalized Private Selection and Testing with High Confidence. CoRR Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2022	A*	`conf`	On the Robustness of CountSketch to Adaptive Inputs. ICML Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Moshe Shechner, Uri Stemmer
2022	J	`jnl`	On the Robustness of CountSketch to Adaptive Inputs. CoRR Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Moshe Shechner, Uri Stemmer
2022	J	`jnl`	POMACS V6, N1, March 2022 Editorial. Proc. ACM Meas. Anal. Comput. Syst. Niklas Carlsson, Edith Cohen, Philippe Robert
2022	J	`jnl`	POMACS V6, N2, June 2022 Editorial. Proc. ACM Meas. Anal. Comput. Syst. Niklas Carlsson, Edith Cohen, Philippe Robert
2022	—	`ed.`	SIGMETRICS/PERFORMANCE '22: ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, Mumbai, India, June 6 - 10, 2022 SIGMETRICS (Abstracts) D. Manjunath, Jayakrishnan Nair, Niklas Carlsson, Edith Cohen, Philippe Robert
2022	J	`jnl`	Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs. CoRR Edith Cohen, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2022	J	`jnl`	Õptimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. CoRR Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer
2021	J	`jnl`	A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators. CoRR Idan Attias, Edith Cohen, Moshe Shechner, Uri Stemmer
2021	A	`conf`	Differentially Private Weighted Sampling. AISTATS Edith Cohen, Ofir Geri, Tamás Sarlós, Uri Stemmer
2021	A*	`conf`	Differentially-Private Clustering of Easy Instances. ICML Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2021	J	`jnl`	Differentially-Private Clustering of Easy Instances. CoRR Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2021	J	`jnl`	Editorial. ACM Trans. Algorithms Edith Cohen
2021	J	`jnl`	FriendlyCore: Practical Differentially Private Aggregation. CoRR Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer
2021	J	`jnl`	POMACS V5, N3, December 2021 Editorial. Proc. ACM Meas. Anal. Comput. Syst. Niklas Carlsson, Edith Cohen, Philippe Robert
2020	A*	`conf`	Composable Sketches for Functions of Frequencies: Beyond the Worst Case. ICML Edith Cohen, Ofir Geri, Rasmus Pagh
2020	J	`jnl`	Composable Sketches for Functions of Frequencies: Beyond the Worst Case. CoRR Edith Cohen, Ofir Geri, Rasmus Pagh
2020	J	`jnl`	Differentially Private Weighted Sampling. CoRR Edith Cohen, Ofir Geri, Tamás Sarlós, Uri Stemmer
2020	—	`conf`	Graph Learning with Loss-Guided Training. GRADES-NDA@SIGMOD Eliav Buchnik, Edith Cohen
2020	J	`jnl`	Graph Learning with Loss-Guided Training. CoRR Eliav Buchnik, Edith Cohen
2020	A	`conf`	Sample Complexity Bounds for Influence Maximization. ITCS Gal Sadeh, Edith Cohen, Haim Kaplan
2020	A*	`conf`	WOR and NeurIPS Edith Cohen, Rasmus Pagh, David P. Woodruff
2020	J	`jnl`	WOR and p's: Sketches for 𝓁 CoRR Edith Cohen, Rasmus Pagh, David P. Woodruff
2019	J	`jnl`	Influence Maximization with Few Simulations. CoRR Gal Sadeh, Edith Cohen, Haim Kaplan
2019	A*	`ed.`	Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. STOC Moses Charikar, Edith Cohen
2019	A*	`conf`	Sampling Sketches for Concave Sublinear Functions of Frequencies. NeurIPS Edith Cohen, Ofir Geri
2019	J	`jnl`	Sampling Sketches for Concave Sublinear Functions of Frequencies. CoRR Edith Cohen, Ofir Geri
2019	A*	`conf`	Self-similar Epochs: Value in arrangement. ICML Eliav Buchnik, Edith Cohen, Avinatan Hassidim, Yossi Matias
2018	—	`conf`	Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity. SIGMETRICS (Abstracts) Eliav Buchnik, Edith Cohen
2018	J	`jnl`	Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity. Proc. ACM Meas. Anal. Comput. Syst. Eliav Buchnik, Edith Cohen
2018	A*	`conf`	Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. AAAI Edith Cohen, Shiri Chechik, Haim Kaplan
2018	—	`ch.`	Decay Models. Encyclopedia of Database Systems (2nd ed.) Edith Cohen
2018	J	`jnl`	LSH Microbatches for Stochastic Gradients: Value in Rearrangement. CoRR Eliav Buchnik, Edith Cohen, Avinatan Hassidim, Yossi Matias
2018	J	`jnl`	Stream Sampling Framework and Application for Frequency Cap Statistics. ACM Trans. Algorithms Edith Cohen
2017	J	`jnl`	Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity. CoRR Eliav Buchnik, Edith Cohen
2017	J	`jnl`	Clustering over Multi-Objective Samples: The one2all Sample. CoRR Edith Cohen, Shiri Chechik, Haim Kaplan
2017	A*	`conf`	HyperLogLog Hyperextended: Sketches for Concave Sublinear Frequency Statistics. KDD Edith Cohen
2017	—	`conf`	Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches. HotWeb Shir Landau Feibish, Yehuda Afek, Anat Bremler-Barr, Edith Cohen, Michal Shagam
2016	—	`ch.`	All-Distances Sketches. Encyclopedia of Algorithms Edith Cohen
2016	—	`ch.`	Coordinated Sampling. Encyclopedia of Algorithms Edith Cohen
2016	J	`jnl`	Efficient Distinct Heavy Hitters for DNS DDoS Attack Detection. CoRR Yehuda Afek, Anat Bremler-Barr, Edith Cohen, Shir Landau Feibish, Michal Shagam
2016	J	`jnl`	Estimating Frequency Statistics through Distinct Count Measurements. CoRR Edith Cohen
2016	—	`conf`	Greedy Maximization Framework for Graph-Based Influence Functions. HotWeb Edith Cohen
2016	J	`jnl`	Greedy Maximization Framework for Graph-based Influence Functions. CoRR Edith Cohen
2016	—	`ch.`	Min-Hash Sketches. Encyclopedia of Algorithms Edith Cohen
2016	J	`jnl`	On the Tradeoff between Stability and Fit. ACM Trans. Algorithms Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund
2016	A*	`conf`	Reverse Ranking by Graph Structure: Model and Scalable Algorithms. SIGMETRICS Eliav Buchnik, Edith Cohen
2016	J	`jnl`	Semi-Supervised Learning for Asymmetric Graphs through Reach and Distance Diffusion. CoRR Edith Cohen
2015	J	`jnl`	All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis. IEEE Trans. Knowl. Data Eng. Edith Cohen
2015	—	`conf`	Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. APPROX-RANDOM Shiri Chechik, Edith Cohen, Haim Kaplan
2015	J	`jnl`	Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. CoRR Shiri Chechik, Edith Cohen, Haim Kaplan
2015	J	`jnl`	Multi-Objective Weighted Sampling. CoRR Edith Cohen
2015	—	`conf`	Multi-objective Weighted Sampling. HotWeb Edith Cohen
2015	J	`jnl`	Reverse Ranking by Graph Structure: Model and Scalable Algorithms. CoRR Eliav Buchnik, Edith Cohen
2015	A*	`conf`	Stream Sampling for Frequency Cap Statistics. KDD Edith Cohen
2015	J	`jnl`	Stream Sampling for Frequency Cap Statistics. CoRR Edith Cohen
2014	J	`jnl`	Algorithms and estimators for summarization of unaggregated data streams. J. Comput. Syst. Sci. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2014	A*	`conf`	All-distances sketches, revisited: HIP estimators for massive graphs analysis. PODS Edith Cohen
2014	—	`conf`	Author retrospective for search and replication in unstructured peer-to-peer networks. ICS 25th Anniversary Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker
2014	J	`jnl`	Computing Classic Closeness Centrality, at Scale. CoRR Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014	—	`conf`	Computing classic closeness centrality, at scale. COSN Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014	A*	`conf`	Distance queries from sampled data: accurate and efficient. KDD Edith Cohen
2014	A*	`conf`	Estimation for monotone sampling: competitiveness and customization. PODC Edith Cohen
2014	J	`jnl`	Probe scheduling for efficient detection of silent failures. Perform. Evaluation Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur
2014	A	`conf`	Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CIKM Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014	J	`jnl`	Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CoRR Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014	J	`jnl`	Timed Influence: Computation and Maximization. CoRR Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014	J	`jnl`	Variance Competitiveness for Monotone Estimation: Tightening the Bounds. CoRR Edith Cohen
2013	J	`jnl`	A Labeling Approach to Incremental Cycle Detection. CoRR Edith Cohen, Amos Fiat, Haim Kaplan, Liam Roditty
2013	J	`jnl`	On the Tradeoff between Stability and Fit CoRR Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund
2013	J	`jnl`	Probe Scheduling for Efficient Detection of Silent Failures CoRR Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur
2013	J	`jnl`	Scalable Neighborhood Sketching and Distance Distribution Estimation in Graph Datasets: Revisited, Unified, and Improved. CoRR Edith Cohen
2013	—	`conf`	Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. COSN Edith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck
2013	—	`conf`	Scheduling Subset Tests: One-Time, Continuous, and How They Relate. APPROX-RANDOM Edith Cohen, Haim Kaplan, Yishay Mansour
2013	—	`conf`	What You Can Do with Coordinated Samples. APPROX-RANDOM Edith Cohen, Haim Kaplan
2012	J	`jnl`	A Case for Customizing Estimators: Coordinated Samples CoRR Edith Cohen, Haim Kaplan
2012	A*	`conf`	Don't let the negatives bring you down: sampling from streams of signed updates. SIGMETRICS Edith Cohen, Graham Cormode, Nick G. Duffield
2012	J	`jnl`	Envy-Free Makespan Approximation. SIAM J. Comput. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2012	J	`jnl`	How to Estimate Change from Samples CoRR Edith Cohen, Haim Kaplan
2012	J	`jnl`	What you can do with Coordinated Samples CoRR Edith Cohen, Haim Kaplan
2011	J	`jnl`	Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. SIAM J. Comput. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2011	J	`jnl`	Get the Most out of Your Sample: Optimal Unbiased Estimators using Partial Information CoRR Edith Cohen, Haim Kaplan
2011	A*	`conf`	Get the most out of your sample: optimal unbiased estimators using partial information. PODS Edith Cohen, Haim Kaplan
2011	J	`jnl`	Structure-Aware Sampling: Flexible and Accurate Summarization CoRR Edith Cohen, Graham Cormode, Nick G. Duffield
2011	J	`jnl`	Structure-Aware Sampling: Flexible and Accurate Summarization. Proc. VLDB Endow. Edith Cohen, Graham Cormode, Nick G. Duffield
2011	A*	`conf`	Structure-aware sampling on data streams. SIGMETRICS Edith Cohen, Graham Cormode, Nick G. Duffield
2011	—	`conf`	Truth, Envy, and Truthful Market Clearing Bundle Pricing. WINE Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2010	A*	`conf`	Envy-free makespan approximation: extended abstract. EC Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2010	J	`jnl`	Labeling Dynamic XML Trees. SIAM J. Comput. Edith Cohen, Haim Kaplan, Tova Milo
2010	J	`jnl`	On the Interplay between Incentive Compatibility and Envy Freeness CoRR Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2010	J	`jnl`	Truth and Envy in Capacitated Allocation Games CoRR Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2009	J	`jnl`	Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Proc. VLDB Endow. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2009	J	`jnl`	Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments CoRR Edith Cohen, Haim Kaplan, Subhabrata Sen
2009	J	`jnl`	Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. Proc. VLDB Endow. Edith Cohen, Haim Kaplan, Subhabrata Sen
2009	—	`ch.`	Decay Models. Encyclopedia of Database Systems Edith Cohen
2009	J	`jnl`	Envy-Free Makespan Approximation CoRR Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2009	J	`jnl`	Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates CoRR Edith Cohen, Haim Kaplan
2009	—	`conf`	Leveraging discarded samples for tighter estimation of multiple-set aggregates. SIGMETRICS/Performance Edith Cohen, Haim Kaplan
2009	A*	`conf`	Stream sampling for variance-optimal estimation of subset sums. SODA Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2008	A*	`conf`	Confident estimation for multistage measurement sampling and aggregation. SIGMETRICS Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup
2008	A*	`conf`	Estimating Aggregates over Multiple Sets. ICDM Edith Cohen, Haim Kaplan
2008	J	`jnl`	Processing top-k queries from samples. Comput. Networks Edith Cohen, Nadav Grossaug, Haim Kaplan
2008	J	`jnl`	Sketch-Based Estimation of Subpopulation-Weight CoRR Edith Cohen, Haim Kaplan
2008	J	`jnl`	Tighter estimation using bottom k sketches. Proc. VLDB Endow. Edith Cohen, Haim Kaplan
2008	J	`jnl`	Variance optimal sampling based estimation of subset sums CoRR Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	A	`conf`	Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Conference Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	J	`jnl`	Associative search in peer to peer networks: Harnessing latent semantics. Comput. Networks Edith Cohen, Amos Fiat, Haim Kaplan
2007	A*	`conf`	Bottom-k sketches: better and more efficient estimation of aggregates. SIGMETRICS Edith Cohen, Haim Kaplan
2007	A*	`conf`	Sketching unaggregated data streams for subpopulation-size queries. PODS Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	J	`jnl`	Spatially-decaying aggregation over a network. J. Comput. Syst. Sci. Edith Cohen, Haim Kaplan
2007	A*	`conf`	Summarizing data using bottom-k sketches. PODC Edith Cohen, Haim Kaplan
2006	J	`jnl`	A short walk in the Blogistan. Comput. Networks Edith Cohen, Balachander Krishnamurthy
2006	J	`jnl`	Maintaining time-decaying stream aggregates. J. Algorithms Edith Cohen, Martin J. Strauss
2006	J	`jnl`	Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans. Netw. David L. Applegate, Edith Cohen
2006	A	`conf`	Processing top k queries from samples. CoNEXT Edith Cohen, Nadav Grossaug, Haim Kaplan
2005	A*	`conf`	Packet classification in large ISPs: design and evaluation of decision tree classifiers. SIGMETRICS Edith Cohen, Carsten Lund
2005	J	`jnl`	Performance aspects of distributed caches using TTL-based consistency. Theor. Comput. Sci. Edith Cohen, Eran Halperin, Haim Kaplan
2004	J	`jnl`	Balanced-Replication Algorithms for Distribution Trees. SIAM J. Comput. Edith Cohen, Haim Kaplan
2004	A*	`conf`	Coping with network failures: routing strategies for optimal demand oblivious restoration. SIGMETRICS David L. Applegate, Lee Breslau, Edith Cohen
2004	A*	`conf`	Efficient estimation algorithms for neighborhood variance and other moments. SODA Edith Cohen, Haim Kaplan
2004	J	`jnl`	Guest Editors' foreword. J. Comput. Syst. Sci. Edith Cohen, Venkatesan Guruswami
2004	J	`jnl`	Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
2004	—	`conf`	Spatially-decaying aggregation over a network: model and algorithms. SIGMOD Conference Edith Cohen, Haim Kaplan
2003	J	`jnl`	A case for associative peer to peer overlays. Comput. Commun. Rev. Edith Cohen, Amos Fiat, Haim Kaplan
2003	A*	`conf`	Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM Edith Cohen, Amos Fiat, Haim Kaplan
2003	J	`jnl`	Connection caching: model and algorithms. J. Comput. Syst. Sci. Edith Cohen, Haim Kaplan, Uri Zwick
2003	A*	`conf`	Efficient sequences of trials. SODA Edith Cohen, Amos Fiat, Haim Kaplan
2003	A*	`conf`	Maintaining time-decaying stream aggregates. PODS Edith Cohen, Martin Strauss
2003	A*	`conf`	Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. SIGCOMM David L. Applegate, Edith Cohen
2003	A*	`conf`	Optimal oblivious routing in polynomial time. STOC Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
2003	J	`jnl`	Predicting and bypassing end-to-end Internet service degradations. IEEE J. Sel. Areas Commun. Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour
2003	J	`jnl`	Proactive caching of DNS records: addressing a performance bottleneck. Comput. Networks Edith Cohen, Haim Kaplan
2003	J	`jnl`	Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
2002	A	`conf`	Balanced-Replication Algorithms for Distribution Trees. ESA Edith Cohen, Haim Kaplan
2002	J	`jnl`	Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica Edith Cohen, Haim Kaplan
2002	J	`jnl`	Competitive Analysis of the LRFU Paging Algorithm. Algorithmica Edith Cohen, Haim Kaplan, Uri Zwick
2002	J	`jnl`	Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica Edith Cohen, Haim Kaplan
2002	A*	`conf`	Labeling Dynamic XML Trees. PODS Edith Cohen, Haim Kaplan, Tova Milo
2002	A	`conf`	Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour
2002	J	`jnl`	Prefetching the means for document transfer: a new approach for reducing Web latency. Comput. Networks Edith Cohen, Haim Kaplan
2002	A*	`conf`	Reachability and distance queries via 2-hop labels. SODA Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
2002	J	`jnl`	Refreshment policies for Web content caches. Comput. Networks Edith Cohen, Haim Kaplan
2002	A*	`conf`	Replication strategies in unstructured peer-to-peer networks. SIGCOMM Edith Cohen, Scott Shenker
2002	J	`jnl`	Restoration by path concatenation: fast recovery of MPLS paths. Distributed Comput. Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt
2002	A	`conf`	Search and replication in unstructured peer-to-peer networks. ICS Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker
2002	A*	`conf`	Search and replication in unstructured peer-to-peer networks. SIGMETRICS Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker
2001	A*	`conf`	Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM Edith Cohen, Haim Kaplan
2001	J	`jnl`	All-Pairs Small-Stretch Paths. J. Algorithms Edith Cohen, Uri Zwick
2001	B	`conf`	Competitive Analysis of the LRFU Paging Algorithm. WADS Edith Cohen, Haim Kaplan, Uri Zwick
2001	J	`jnl`	Finding Interesting Associations without Support Pruning. IEEE Trans. Knowl. Data Eng. Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang
2001	A*	`conf`	Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP Edith Cohen, Eran Halperin, Haim Kaplan
2001	—	`conf`	Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT Edith Cohen, Haim Kaplan
2001	A*	`conf`	Refreshment Policies for Web Content Caches. INFOCOM Edith Cohen, Haim Kaplan
2001	A*	`conf`	Restoration by path concatenation: fast recovery of MPLS paths. PODC Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
2001	—	`conf`	Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
2001	—	`conf`	The Age Penalty and Its Effect on Cache Performance. USITS Edith Cohen, Haim Kaplan
2000	B	`conf`	Connection caching under vaious models of communication. SPAA Edith Cohen, Haim Kaplan, Uri Zwick
2000	A*	`conf`	Finding Interesting Associations without Support Pruning. ICDE Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang
2000	J	`jnl`	Polylog-time and near-linear work approximation scheme for undirected shortest paths. J. ACM Edith Cohen
2000	A*	`conf`	Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM Edith Cohen, Haim Kaplan
1999	J	`jnl`	Approximating Matrix Multiplication for Pattern Recognition Tasks. J. Algorithms Edith Cohen, David D. Lewis
1999	A*	`conf`	Connection Caching. STOC Edith Cohen, Haim Kaplan, Uri Zwick
1999	A*	`conf`	Efficient Algorithms for Predicting Requests to Web Servers. INFOCOM Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford
1999	A*	`conf`	Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC Edith Cohen, Haim Kaplan
1999	A*	`conf`	LP-based Analysis of Greedy-dual-size. SODA Edith Cohen, Haim Kaplan
1999	J	`jnl`	Managing TCP Connections Under Persistent HTTP. Comput. Networks Edith Cohen, Haim Kaplan, Jeffrey D. Oldham
1998	A	`conf`	Evaluating Server-Assisted Cache Replacement in the Web. ESA Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford
1998	J	`jnl`	Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. SIAM J. Comput. Edith Cohen
1998	A*	`conf`	Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters. SIGCOMM Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford
1998	J	`jnl`	Structure Prediction and Computation of Sparse Matrix Products. J. Comb. Optim. Edith Cohen
1997	A*	`conf`	All-Pairs Small-Stretch Paths. SODA Edith Cohen, Uri Zwick
1997	A*	`conf`	Approximating Matrix Multiplication for Pattern Recognition Tasks. SODA Edith Cohen, David D. Lewis
1997	A*	`conf`	Learning Noisy Perceptrons by a Perceptron in Polynomial Time. FOCS Edith Cohen
1997	J	`jnl`	Size-Estimation Framework with Applications to Transitive Closure and Reachability. J. Comput. Syst. Sci. Edith Cohen
1997	J	`jnl`	Using Selective Path-Doubling for Parallel Shortest-Path Computations. J. Algorithms Edith Cohen
1996	J	`jnl`	Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. J. Algorithms Edith Cohen
1996	B	`conf`	On Optimizing Multiplications of Sparse Matrices. IPCO Edith Cohen
1995	J	`jnl`	Approximate Max-Flow on Small Depth Networks. SIAM J. Comput. Edith Cohen
1995	—	`conf`	Improvise: Interactive Multimedia Process Visualization Environment. ESEC Naser S. Barghouti, Eleftherios Koutsofios, Edith Cohen
1994	J	`jnl`	Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica Edith Cohen, Nimrod Megiddo
1994	A*	`conf`	Estimating the Size of the Transitive Closure in Linear Time FOCS Edith Cohen
1994	J	`jnl`	Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. Edith Cohen, Nimrod Megiddo
1994	J	`jnl`	New algorithms for generalized network flows. Math. Program. Edith Cohen, Nimrod Megiddo
1994	A*	`conf`	Polylog-time and near-linear work approximation scheme for undirected shortest paths. STOC Edith Cohen
1993	B	`conf`	Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. SPAA Edith Cohen
1993	A*	`conf`	Fast algorithms for constructing t-spanners and paths with stretch t FOCS Edith Cohen
1993	J	`jnl`	Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. J. ACM Edith Cohen, Nimrod Megiddo
1993	—	`conf`	Using Selective Path-Doubling for Parallel Shortest-Path Computations. ISTCS Edith Cohen
1992	A*	`conf`	Approximate Max Flow on Small Depth Networks FOCS Edith Cohen
1992	—	`conf`	New Algorithms for Generalized Network Flows. ISTCS Edith Cohen, Nimrod Megiddo
1991	A*	`conf`	Algorithms and Complexity Analysis for Some Flow Problems. SODA Edith Cohen, Nimrod Megiddo
1991	—	`—`	Combinatorial algorithms for optimization problems. Edith Cohen
1991	A*	`conf`	Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) STOC Edith Cohen, Nimrod Megiddo
1991	J	`jnl`	NP-Completeness of graph decomposition problems. J. Complex. Edith Cohen, Michael Tarsi
1990	—	`conf`	Recognizing Properties of Periodic Graphs. Applied Geometry And Discrete Mathematics Edith Cohen, Nimrod Megiddo
1989	A*	`conf`	Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version) STOC Edith Cohen, Nimrod Megiddo