default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdith Cohen
Person information
- affiliation: Google Research, Mountain View, CA, USA
- affiliation: Tel Aviv University, Israel
SPARQL queries 
🛈 Please note that only 69% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j55]Idan Attias, Edith Cohen, Moshe Shechner, Uri Stemmer:
A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators. Algorithmica 86(11): 3339-3394 (2024)- [c99]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. COLT 2024: 1200-1222 - [c98]Sara Ahmadian, Edith Cohen:
Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. ICML 2024 - [i50]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. CoRR abs/2403.00028 (2024) - [i49]Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia:
Data Reconstruction: When You See It and When You Don't. CoRR abs/2405.15753 (2024) - [i48]Sara Ahmadian, Edith Cohen:
Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. CoRR abs/2405.17780 (2024) - [i47]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. IACR Cryptol. ePrint Arch. 2024: 373 (2024) - 2023
- [c97]Edith Cohen, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs. AAAI 2023: 7235-7243 - [c96]Idan Attias, Edith Cohen, Moshe Shechner, Uri Stemmer:
A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators. ITCS 2023: 8:1-8:19 - [c95]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Generalized Private Selection and Testing with High Confidence. ITCS 2023: 39:1-39:23 - [c94]Edith Cohen, Xin Lyu:
The Target-Charging Technique for Privacy Analysis across Interactive Computations. NeurIPS 2023 - [c93]Edith Cohen
:
Sampling Big Ideas in Query Optimization. PODS 2023: 361-371 - [c92]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. STOC 2023: 472-482 - [i46]Edith Cohen, Xin Lyu:
The Target-Charging Technique for Privacy Accounting across Interactive Computations. CoRR abs/2302.11044 (2023) - [i45]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Hot PATE: Private Aggregation of Distributions for Diverse Task. CoRR abs/2312.02132 (2023) - 2022
- [j54]Niklas Carlsson, Edith Cohen, Philippe Robert:
POMACS V6, N1, March 2022 Editorial. Proc. ACM Meas. Anal. Comput. Syst. 6(1): 1:1 (2022) - [j53]Niklas Carlsson, Edith Cohen, Philippe Robert:
POMACS V6, N2, June 2022 Editorial. Proc. ACM Meas. Anal. Comput. Syst. 6(2): 24:1 (2022) - [c91]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Moshe Shechner, Uri Stemmer:
On the Robustness of CountSketch to Adaptive Inputs. ICML 2022: 4112-4140 - [c90]Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer:
FriendlyCore: Practical Differentially Private Aggregation. ICML 2022: 21828-21863 - [e2]D. Manjunath, Jayakrishnan Nair, Niklas Carlsson, Edith Cohen, Philippe Robert:
SIGMETRICS/PERFORMANCE '22: ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, Mumbai, India, June 6 - 10, 2022. ACM 2022, ISBN 978-1-4503-9141-2 [contents] - [i44]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Moshe Shechner, Uri Stemmer:
On the Robustness of CountSketch to Adaptive Inputs. CoRR abs/2202.13736 (2022) - [i43]Edith Cohen, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs. CoRR abs/2207.00956 (2022) - [i42]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Õptimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. CoRR abs/2211.06387 (2022) - [i41]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Generalized Private Selection and Testing with High Confidence. CoRR abs/2211.12063 (2022) - 2021
- [j52]Niklas Carlsson, Edith Cohen, Philippe Robert:
POMACS V5, N3, December 2021 Editorial. Proc. ACM Meas. Anal. Comput. Syst. 5(3): 29:1 (2021) - [j51]Edith Cohen:
Editorial. ACM Trans. Algorithms 17(3): 19e:1 (2021) - [c89]Edith Cohen, Ofir Geri, Tamás Sarlós, Uri Stemmer:
Differentially Private Weighted Sampling. AISTATS 2021: 2404-2412 - [c88]Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Differentially-Private Clustering of Easy Instances. ICML 2021: 2049-2059 - [i40]Idan Attias, Edith Cohen, Moshe Shechner, Uri Stemmer:
A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators. CoRR abs/2107.14527 (2021) - [i39]Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer:
FriendlyCore: Practical Differentially Private Aggregation. CoRR abs/2110.10132 (2021) - [i38]Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Differentially-Private Clustering of Easy Instances. CoRR abs/2112.14445 (2021) - 2020
- [c87]Edith Cohen, Ofir Geri, Rasmus Pagh:
Composable Sketches for Functions of Frequencies: Beyond the Worst Case. ICML 2020: 2057-2067 - [c86]Gal Sadeh, Edith Cohen, Haim Kaplan:
Sample Complexity Bounds for Influence Maximization. ITCS 2020: 29:1-29:36 - [c85]Edith Cohen, Rasmus Pagh, David P. Woodruff:
WOR and p's: Sketches for ℓp-Sampling Without Replacement. NeurIPS 2020 - [c84]Eliav Buchnik, Edith Cohen:
Graph Learning with Loss-Guided Training. GRADES-NDA@SIGMOD 2020: 7:1-7:13 - [i37]Edith Cohen, Ofir Geri, Rasmus Pagh:
Composable Sketches for Functions of Frequencies: Beyond the Worst Case. CoRR abs/2004.04772 (2020) - [i36]Eliav Buchnik, Edith Cohen:
Graph Learning with Loss-Guided Training. CoRR abs/2006.00460 (2020) - [i35]Edith Cohen, Rasmus Pagh, David P. Woodruff:
WOR and p's: Sketches for 𝓁p-Sampling Without Replacement. CoRR abs/2007.06744 (2020) - [i34]Edith Cohen, Ofir Geri, Tamás Sarlós, Uri Stemmer:
Differentially Private Weighted Sampling. CoRR abs/2010.13048 (2020)
2010 – 2019
- 2019
- [c83]Eliav Buchnik, Edith Cohen, Avinatan Hassidim, Yossi Matias:
Self-similar Epochs: Value in arrangement. ICML 2019: 841-850 - [c82]Edith Cohen, Ofir Geri:
Sampling Sketches for Concave Sublinear Functions of Frequencies. NeurIPS 2019: 1361-1371 - [e1]Moses Charikar, Edith Cohen:
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. ACM 2019, ISBN 978-1-4503-6705-9 [contents] - [i33]Edith Cohen, Ofir Geri:
Sampling Sketches for Concave Sublinear Functions of Frequencies. CoRR abs/1907.02218 (2019) - [i32]Gal Sadeh, Edith Cohen, Haim Kaplan:
Influence Maximization with Few Simulations. CoRR abs/1907.13301 (2019) - 2018
- [j50]Eliav Buchnik, Edith Cohen:
Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity. Proc. ACM Meas. Anal. Comput. Syst. 2(1): 10:1-10:19 (2018) - [j49]Edith Cohen:
Stream Sampling Framework and Application for Frequency Cap Statistics. ACM Trans. Algorithms 14(4): 52:1-52:40 (2018) - [c81]Edith Cohen, Shiri Chechik, Haim Kaplan:
Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. AAAI 2018: 2884-2891 - [c80]Eliav Buchnik, Edith Cohen:
Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity. SIGMETRICS (Abstracts) 2018: 8-10 - [r5]Edith Cohen:
Decay Models. Encyclopedia of Database Systems (2nd ed.) 2018 - [i31]Eliav Buchnik, Edith Cohen, Avinatan Hassidim, Yossi Matias:
LSH Microbatches for Stochastic Gradients: Value in Rearrangement. CoRR abs/1803.05389 (2018) - 2017
- [c79]Shir Landau Feibish, Yehuda Afek, Anat Bremler-Barr, Edith Cohen, Michal Shagam:
Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches. HotWeb 2017: 8:1-8:6 - [c78]Edith Cohen:
HyperLogLog Hyperextended: Sketches for Concave Sublinear Frequency Statistics. KDD 2017: 105-114 - [i30]Eliav Buchnik, Edith Cohen:
Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity. CoRR abs/1703.02618 (2017) - [i29]Edith Cohen, Shiri Chechik, Haim Kaplan:
Clustering over Multi-Objective Samples: The one2all Sample. CoRR abs/1706.03607 (2017) - 2016
- [j48]Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund:
On the Tradeoff between Stability and Fit. ACM Trans. Algorithms 13(1): 7:1-7:24 (2016) - [c77]Edith Cohen:
Greedy Maximization Framework for Graph-Based Influence Functions. HotWeb 2016: 29-35 - [c76]Eliav Buchnik, Edith Cohen:
Reverse Ranking by Graph Structure: Model and Scalable Algorithms. SIGMETRICS 2016: 51-62 - [r4]Edith Cohen:
All-Distances Sketches. Encyclopedia of Algorithms 2016: 59-64 - [r3]Edith Cohen:
Coordinated Sampling. Encyclopedia of Algorithms 2016: 449-454 - [r2]Edith Cohen:
Min-Hash Sketches. Encyclopedia of Algorithms 2016: 1282-1287 - [i28]Edith Cohen:
Semi-Supervised Learning for Asymmetric Graphs through Reach and Distance Diffusion. CoRR abs/1603.09064 (2016) - [i27]Edith Cohen:
Estimating Frequency Statistics through Distinct Count Measurements. CoRR abs/1607.06517 (2016) - [i26]Edith Cohen:
Greedy Maximization Framework for Graph-based Influence Functions. CoRR abs/1608.04036 (2016) - [i25]Yehuda Afek, Anat Bremler-Barr, Edith Cohen, Shir Landau Feibish, Michal Shagam:
Efficient Distinct Heavy Hitters for DNS DDoS Attack Detection. CoRR abs/1612.02636 (2016) - 2015
- [j47]Edith Cohen:
All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis. IEEE Trans. Knowl. Data Eng. 27(9): 2320-2334 (2015) - [c75]Shiri Chechik, Edith Cohen, Haim Kaplan:
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. APPROX-RANDOM 2015: 659-679 - [c74]Edith Cohen:
Multi-objective Weighted Sampling. HotWeb 2015: 13-18 - [c73]Edith Cohen:
Stream Sampling for Frequency Cap Statistics. KDD 2015: 159-168 - [i24]Edith Cohen:
Stream Sampling for Frequency Cap Statistics. CoRR abs/1502.05955 (2015) - [i23]Shiri Chechik, Edith Cohen, Haim Kaplan:
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. CoRR abs/1503.08528 (2015) - [i22]Eliav Buchnik, Edith Cohen:
Reverse Ranking by Graph Structure: Model and Scalable Algorithms. CoRR abs/1506.02386 (2015) - [i21]Edith Cohen:
Multi-Objective Weighted Sampling. CoRR abs/1509.07445 (2015) - 2014
- [j46]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Algorithms and estimators for summarization of unaggregated data streams. J. Comput. Syst. Sci. 80(7): 1214-1244 (2014) - [j45]Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur:
Probe scheduling for efficient detection of silent failures. Perform. Evaluation 79: 73-89 (2014) - [c72]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CIKM 2014: 629-638 - [c71]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing classic closeness centrality, at scale. COSN 2014: 37-50 - [c70]Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker:
Author retrospective for search and replication in unstructured peer-to-peer networks. ICS 25th Anniversary 2014: 64-82 - [c69]Edith Cohen:
Distance queries from sampled data: accurate and efficient. KDD 2014: 681-690 - [c68]Edith Cohen:
Estimation for monotone sampling: competitiveness and customization. PODC 2014: 124-133 - [c67]Edith Cohen:
All-distances sketches, revisited: HIP estimators for massive graphs analysis. PODS 2014: 88-99 - [i20]Edith Cohen:
Variance Competitiveness for Monotone Estimation: Tightening the Bounds. CoRR abs/1406.6490 (2014) - [i19]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CoRR abs/1408.6282 (2014) - [i18]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing Classic Closeness Centrality, at Scale. CoRR abs/1409.0035 (2014) - [i17]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Timed Influence: Computation and Maximization. CoRR abs/1410.6976 (2014) - 2013
- [c66]Edith Cohen, Haim Kaplan, Yishay Mansour:
Scheduling Subset Tests: One-Time, Continuous, and How They Relate. APPROX-RANDOM 2013: 81-95 - [c65]Edith Cohen, Haim Kaplan:
What You Can Do with Coordinated Samples. APPROX-RANDOM 2013: 452-467 - [c64]Edith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck:
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. COSN 2013: 131-142 - [i16]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) - [i15]Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund:
On the Tradeoff between Stability and Fit. CoRR abs/1302.2137 (2013) - [i14]Edith Cohen:
Scalable Neighborhood Sketching and Distance Distribution Estimation in Graph Datasets: Revisited, Unified, and Improved. CoRR abs/1306.3284 (2013) - [i13]Edith Cohen, Amos Fiat, Haim Kaplan, Liam Roditty:
A Labeling Approach to Incremental Cycle Detection. CoRR abs/1310.8381 (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) - [c63]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. Proc. VLDB Endow. 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) - [c62]Edith Cohen, Haim Kaplan:
Get the most out of your sample: optimal unbiased estimators using partial information. PODS 2011: 13-24 - [c61]Edith Cohen, Graham Cormode, Nick G. Duffield:
Structure-aware sampling on data streams. SIGMETRICS 2011: 197-208 - [c60]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) - [c59]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-free makespan approximation: extended abstract. EC 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)
2000 – 2009
- 2009
- [j40]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Proc. VLDB Endow. 2(1): 431-442 (2009) - [j39]Edith Cohen, Haim Kaplan, Subhabrata Sen:
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. Proc. VLDB Endow. 2(1): 646-657 (2009) - [c58]Edith Cohen, Haim Kaplan:
Leveraging discarded samples for tighter estimation of multiple-set aggregates. SIGMETRICS/Performance 2009: 251-262 - [c57]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. Comput. Networks 52(14): 2605-2622 (2008) - [j37]Edith Cohen, Haim Kaplan:
Tighter estimation using bottom k sketches. Proc. VLDB Endow. 1(1): 213-224 (2008) - [c56]Edith Cohen, Haim Kaplan:
Estimating Aggregates over Multiple Sets. ICDM 2008: 761-766 - [c55]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. Comput. 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) - [c54]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Conference 2007: 265-278 - [c53]Edith Cohen, Haim Kaplan:
Summarizing data using bottom-k sketches. PODC 2007: 225-234 - [c52]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Sketching unaggregated data streams for subpopulation-size queries. PODS 2007: 253-262 - [c51]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. Comput. 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 L. Applegate, Edith Cohen:
Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans. Netw. 14(6): 1193-1206 (2006) - [c50]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) - [c49]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) - [c48]David L. Applegate, Lee Breslau, Edith Cohen:
Coping with network failures: routing strategies for optimal demand oblivious restoration. SIGMETRICS 2004: 270-281 - [c47]Edith Cohen, Haim Kaplan:
Spatially-decaying aggregation over a network: model and algorithms. SIGMOD Conference 2004: 707-718 - [c46]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. Comput. Commun. Rev. 33(1): 95-100 (2003) - [j26]Edith Cohen, Haim Kaplan:
Proactive caching of DNS records: addressing a performance bottleneck. Comput. 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 J. Sel. Areas Commun. 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) - [c45]Edith Cohen, Amos Fiat, Haim Kaplan:
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM 2003: 1261-1271 - [c44]Edith Cohen, Martin Strauss:
Maintaining time-decaying stream aggregates. PODS 2003: 223-233 - [c43]David L. Applegate, Edith Cohen:
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. SIGCOMM 2003: 313-324 - [c42]Edith Cohen, Amos Fiat, Haim Kaplan:
Efficient sequences of trials. SODA 2003: 737-746 - [c41]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. Comput. Networks 38(6): 795-808 (2002) - [j18]Edith Cohen, Haim Kaplan:
Prefetching the means for document transfer: a new approach for reducing Web latency. Comput. 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 Comput. 15(4): 273-283 (2002) - [c40]Edith Cohen, Haim Kaplan:
Balanced-Replication Algorithms for Distribution Trees. ESA 2002: 297-309 - [c39]Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker:
Search and replication in unstructured peer-to-peer networks. ICS 2002: 84-95 - [c38]Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour:
Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop 2002: 307-320 - [c37]Edith Cohen, Haim Kaplan, Tova Milo:
Labeling Dynamic XML Trees. PODS 2002: 271-281 - [c36]Edith Cohen, Scott Shenker:
Replication strategies in unstructured peer-to-peer networks. SIGCOMM 2002: 177-190 - [c35]Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker:
Search and replication in unstructured peer-to-peer networks. SIGMETRICS 2002: 258-259 - [c34]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) - [c33]Edith Cohen, Eran Halperin, Haim Kaplan:
Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001: 744-756 - [c32]Edith Cohen, Haim Kaplan:
Refreshment Policies for Web Content Caches. INFOCOM 2001: 1398-1406 - [c31]Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt:
Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001: 43-52 - [c30]Edith Cohen, Haim Kaplan:
Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT 2001: 85-94 - [c29]Edith Cohen, Haim Kaplan:
Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM 2001: 41-53 - [c28]Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt:
Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001: 316-317 - [c27]Edith Cohen, Haim Kaplan:
The Age Penalty and Its Effect on Cache Performance. USITS 2001: 73-84 - [c26]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) - [c25]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 - [c24]Edith Cohen, Haim Kaplan:
Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM 2000: 854-863 - [c23]Edith Cohen, Haim Kaplan, Uri Zwick:
Connection caching under vaious models of communication. SPAA 2000: 54-63
1990 – 1999
- 1999
- [j13]Edith Cohen, Haim Kaplan, Jeffrey D. Oldham:
Managing TCP Connections Under Persistent HTTP. Comput. 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) - [c22]Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford:
Efficient Algorithms for Predicting Requests to Web Servers. INFOCOM 1999: 284-293 - [c21]Edith Cohen, Haim Kaplan:
LP-based Analysis of Greedy-dual-size. SODA 1999: 879-880 - [c20]Edith Cohen, Haim Kaplan:
Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC 1999: 109-118 - [c19]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) - [c18]Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford:
Evaluating Server-Assisted Cache Replacement in the Web. ESA 1998: 307-319 - [c17]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) - [c16]Edith Cohen:
Learning Noisy Perceptrons by a Perceptron in Polynomial Time. FOCS 1997: 514-523 - [c15]Edith Cohen, Uri Zwick:
All-Pairs Small-Stretch Paths. SODA 1997: 93-102 - [c14]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) - [c13]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) - [c12]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) - [c11]Edith Cohen:
Estimating the Size of the Transitive Closure in Linear Time. FOCS 1994: 190-200 - [c10]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) - [c9]Edith Cohen:
Fast algorithms for constructing t-spanners and paths with stretch t. FOCS 1993: 648-658 - [c8]Edith Cohen:
Using Selective Path-Doubling for Parallel Shortest-Path Computations. ISTCS 1993: 78-87 - [c7]Edith Cohen:
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. SPAA 1993: 57-67 - 1992
- [c6]Edith Cohen:
Approximate Max Flow on Small Depth Networks. FOCS 1992: 648-658 - [c5]Edith Cohen, Nimrod Megiddo:
New Algorithms for Generalized Network Flows. ISTCS 1992: 103-114 - 1991
- [b1]Edith Cohen:
Combinatorial algorithms for optimization problems. Stanford University, USA, 1991 - [j1]Edith Cohen, Michael Tarsi:
NP-Completeness of graph decomposition problems. J. Complex. 7(2): 200-212 (1991) - [c4]Edith Cohen, Nimrod Megiddo:
Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991: 120-130 - [c3]Edith Cohen, Nimrod Megiddo:
Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract). STOC 1991: 145-155 - 1990
- [c2]Edith Cohen, Nimrod Megiddo:
Recognizing Properties of Periodic Graphs. Applied Geometry And Discrete Mathematics 1990: 135-146
1980 – 1989
- 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
[i49] [c90] [c88] [i39] [i38] [c86] [i32] [c81] [i29] [c75] [i23] [j46] [j45] [c66] [c65] [i16] [i13] [j44] [i12] [i11] [i10] [j42] [c62] [c60] [i8] [j41] [c59] [i7] [i6] [j40] [j39] [c58] [c57] [i5] [i4] [i3] [j38] [j37] [c56] [i2] [i1] [j36] [j35] [c54] [c53] [c52] [c51] [c50] [j31] [j29] [j28] [c47] [c46] [j27] [j26] [j25] [j24] [j23] [c45] [c42] [c41] [j22] [j21] [j20] [j19] [j18] [j17] [c40] [c38] [c37] [c34] [c33] [c32] [c31] [c30] [c29] [c28] [c27] [c26] [c24] [c23] [j13] [c21] [c20] [c19]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
