Volgen
David García-Soriano
David García-Soriano
Universitat Politècnica de Catalunya - BarcelonaTech
Geverifieerd e-mailadres voor upc.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
2102015
Graph summarization with quality guarantees
M Riondato, D García-Soriano, F Bonchi
Data mining and knowledge discovery 31, 314-349, 2017
1412017
Information matching and match validation
E Bax, J Mehta, N Barbieri, DG Soriano
US Patent 9,947,060, 2018
1122018
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
782012
Correlation clustering: from theory to practice.
F Bonchi, D Garcia-Soriano, E Liberty
KDD, 1972, 2014
452014
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
422021
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
392013
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
342011
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
332015
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
332011
Fair-by-design matching
D García-Soriano, F Bonchi
Data Mining and Knowledge Discovery 34, 1291-1335, 2020
272020
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
262012
Query-efficient correlation clustering
D García-Soriano, K Kutzkov, F Bonchi, C Tsourakakis
Proceedings of The Web Conference 2020, 1468-1478, 2020
24*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
232016
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
192017
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
192013
Finding densest k-connected subgraphs
F Bonchi, D García-Soriano, A Miyauchi, CE Tsourakakis
Discrete Applied Mathematics 305, 34-47, 2021
182021
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
112014
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
102017
Learning parities in the mistake-bound model
H Buhrman, D García-Soriano, A Matsliah
Information processing letters 111 (1), 16-21, 2010
102010
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20