The power of both choices: Practical load balancing for distributed stream processing engines MAU Nasir, GDF Morales, D Garcia-Soriano, N Kourtellis, M Serafini 2015 IEEE 31st International Conference on Data Engineering, 137-148, 2015 | 209 | 2015 |
Graph summarization with quality guarantees M Riondato, D García-Soriano, F Bonchi Data mining and knowledge discovery 31, 314-349, 2017 | 136 | 2017 |
Information matching and match validation E Bax, J Mehta, N Barbieri, DG Soriano US Patent 9,947,060, 2018 | 109 | 2018 |
Monotonicity testing and shortest-path routing on the cube J Briët, S Chakraborty, D García-Soriano, A Matsliah Combinatorica 32 (1), 35-53, 2012 | 78 | 2012 |
Correlation clustering: from theory to practice. F Bonchi, D Garcia-Soriano, E Liberty KDD, 1972, 2014 | 45 | 2014 |
The non-adaptive query complexity of testing k-parities H Buhrman, D García-Soriano, A Matsliah, R de Wolf Chicago Journal of Theoretical Computer Science 6, 1-11, 2013 | 39 | 2013 |
Maxmin-fair ranking: individual fairness under group-fairness constraints D García-Soriano, F Bonchi Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021 | 38 | 2021 |
Efficient sample extractors for juntas with applications S Chakraborty, D García-Soriano, A Matsliah International Colloquium on Automata, Languages, and Programming, 545-556, 2011 | 34 | 2011 |
The minimum Wiener connector problem N Ruchansky, F Bonchi, D García-Soriano, F Gullo, N Kourtellis Proceedings of the 2015 ACM SIGMOD International Conference on Management of …, 2015 | 33 | 2015 |
Nearly tight bounds for testing function isomorphism S Chakraborty, D García-Soriano, A Matsliah Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 33 | 2011 |
Junto-symmetric functions, hypergraph isomorphism and crunching S Chakraborty, E Fischer, D GacíaSoriano, A Matsliah 2012 IEEE 27th Conference on Computational Complexity, 148-158, 2012 | 26 | 2012 |
Fair-by-design matching D García-Soriano, F Bonchi Data Mining and Knowledge Discovery 34, 1291-1335, 2020 | 25 | 2020 |
Query-efficient correlation clustering D García-Soriano, K Kutzkov, F Bonchi, C Tsourakakis Proceedings of The Web Conference 2020, 1468-1478, 2020 | 23* | 2020 |
Spheres of influence for more effective viral marketing Y Mehmood, F Bonchi, D García-Soriano Proceedings of the 2016 International Conference on Management of Data, 711-726, 2016 | 22 | 2016 |
Nearly tight bounds for testing function isomorphism N Alon, E Blais, S Chakraborty, D García-Soriano, A Matsliah SIAM Journal on Computing 42 (2), 459-493, 2013 | 19 | 2013 |
To be connected, or not to be connected: That is the minimum inefficiency subgraph problem N Ruchansky, F Bonchi, D García-Soriano, F Gullo, N Kourtellis Proceedings of the 2017 ACM on Conference on Information and Knowledge …, 2017 | 18 | 2017 |
Finding densest k-connected subgraphs F Bonchi, D García-Soriano, A Miyauchi, CE Tsourakakis Discrete Applied Mathematics 305, 34-47, 2021 | 17 | 2021 |
Triangle counting in streamed graphs via small vertex covers D Garcıa-Soriano, K Kutzkov Proceedings of the 2014 SIAM International Conference on Data Mining, 2014 | 11 | 2014 |
Secure centrality computation over multiple networks G Asharov, F Bonchi, D García-Soriano, T Tassa Proceedings of the 26th International Conference on World Wide Web, 957-966, 2017 | 10 | 2017 |
Learning parities in the mistake-bound model H Buhrman, D García-Soriano, A Matsliah Information processing letters 111 (1), 16-21, 2010 | 10 | 2010 |