• Cohen E. Sampling Big Ideas in Query Optimization. Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. (361-371).

    https://doi.org/10.1145/3584372.3589935

  • Brown P, Dasu T, Kanza Y and Srivastava D. (2019). From Rocks to Pebbles. ACM Transactions on Spatial Algorithms and Systems. 5:3. (1-38). Online publication date: 30-Sep-2019.

    https://doi.org/10.1145/3329677

  • Buchnik E and Cohen E. (2018). Bootstrapped Graph Diffusions. ACM SIGMETRICS Performance Evaluation Review. 46:1. (8-10). Online publication date: 17-Jan-2019.

    https://doi.org/10.1145/3292040.3219621

  • Friedrichs S and Lenzen C. (2018). Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. Journal of the ACM. 65:6. (1-55). Online publication date: 26-Nov-2018.

    https://doi.org/10.1145/3231591

  • Buchnik E and Cohen E. Bootstrapped Graph Diffusions. Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems. (8-10).

    https://doi.org/10.1145/3219617.3219621

  • Eliav B and Cohen E. (2018). Bootstrapped Graph Diffusions. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2:1. (1-19). Online publication date: 3-Apr-2018.

    https://doi.org/10.1145/3179413

  • Brown P, Dasu T, Kanza Y and Srivastava D. Mind the Gaps (and Bumps). Proceedings of the 8th ACM SIGSPATIAL Workshop on GeoStreaming. (29-38).

    https://doi.org/10.1145/3148160.3148165

  • Friedrichs S and Lenzen C. Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. (455-466).

    https://doi.org/10.1145/2935764.2935777

  • Buchnik E and Cohen E. (2016). Reverse Ranking by Graph Structure. ACM SIGMETRICS Performance Evaluation Review. 44:1. (51-62). Online publication date: 30-Jun-2016.

    https://doi.org/10.1145/2964791.2901458

  • Buchnik E and Cohen E. Reverse Ranking by Graph Structure. Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science. (51-62).

    https://doi.org/10.1145/2896377.2901458

  • Cohen E. (2015). All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis. IEEE Transactions on Knowledge and Data Engineering. 27:9. (2320-2334). Online publication date: 1-Sep-2015.

    https://doi.org/10.1109/TKDE.2015.2411606

  • Cohen E, Delling D, Pajor T and Werneck R. Computing classic closeness centrality, at scale. Proceedings of the second ACM conference on Online social networks. (37-50).

    https://doi.org/10.1145/2660460.2660465

  • Cohen E. Estimation for monotone sampling. Proceedings of the 2014 ACM symposium on Principles of distributed computing. (124-133).

    https://doi.org/10.1145/2611462.2611485

  • Cohen E. All-distances sketches, revisited. Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (88-99).

    https://doi.org/10.1145/2594538.2594546

  • Jain P, Jain P and Kumaraguru P. Call me maybe. Proceedings of the first ACM conference on Online social networks. (101-106).

    https://doi.org/10.1145/2512938.2512959

  • Cohen E, Delling D, Fuchs F, Goldberg A, Goldszmidt M and Werneck R. Scalable similarity estimation in social networks. Proceedings of the first ACM conference on Online social networks. (131-142).

    https://doi.org/10.1145/2512938.2512944

  • Crescenzi P, Grossi R, Lanzi L and Marino A. A comparison of three algorithms for approximating the distance distribution in real-world graphs. Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems. (92-103).

    /doi/10.5555/1987334.1987345

  • Cohen E, Kaplan H and Sen S. (2009). Coordinated weighted sampling for estimating aggregates over multiple weight assignments. Proceedings of the VLDB Endowment. 2:1. (646-657). Online publication date: 1-Aug-2009.

    https://doi.org/10.14778/1687627.1687701

  • Cohen E and Kaplan H. (2009). Leveraging discarded samples for tighter estimation of multiple-set aggregates. ACM SIGMETRICS Performance Evaluation Review. 37:1. (251-262). Online publication date: 15-Jun-2009.

    https://doi.org/10.1145/2492101.1555379

  • Cohen E and Kaplan H. Leveraging discarded samples for tighter estimation of multiple-set aggregates. Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems. (251-262).

    https://doi.org/10.1145/1555349.1555379

  • Hua M, Pei J, Fu A, Lin X and Leung H. (2009). Top-k typicality queries and efficient query answering methods on large databases. The VLDB Journal — The International Journal on Very Large Data Bases. 18:3. (809-835). Online publication date: 1-Jun-2009.

    https://doi.org/10.1007/s00778-008-0128-8

  • Khan M, Kuhn F, Malkhi D, Pandurangan G and Talwar K. Efficient distributed approximation algorithms via probabilistic tree embeddings. Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing. (263-272).

    https://doi.org/10.1145/1400751.1400787

  • Cohen E and Kaplan H. (2008). Tighter estimation using bottom k sketches. Proceedings of the VLDB Endowment. 1:1. (213-224). Online publication date: 1-Aug-2008.

    https://doi.org/10.14778/1453856.1453884

  • Hua M, Pei J, Fu A, Lin X and Leung H. Efficiently answering top-k typicality queries on large databases. Proceedings of the 33rd international conference on Very large data bases. (890-901).

    /doi/10.5555/1325851.1325952

  • Cohen E and Kaplan H. Summarizing data using bottom-k sketches. Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing. (225-234).

    https://doi.org/10.1145/1281100.1281133

  • Cohen E and Kaplan H. (2007). Bottom-k sketches. ACM SIGMETRICS Performance Evaluation Review. 35:1. (353-354). Online publication date: 12-Jun-2007.

    https://doi.org/10.1145/1269899.1254926

  • Cohen E and Kaplan H. Bottom-k sketches. Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. (353-354).

    https://doi.org/10.1145/1254882.1254926

  • Cohen E, Duffield N, Kaplan H, Lund C and Thorup M. Sketching unaggregated data streams for subpopulation-size queries. Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (253-262).

    https://doi.org/10.1145/1265530.1265566