Email: d.garcia.soriano (at) upf (dot) edu |

### About me

I am a postdoctoral researcher at Yahoo Labs Barcelona, in the Web Mining group headed by Francesco Bonchi. I received my PhD from the University of Amsterdam (2012), working under the supervision of Harry Buhrman in the Algorithms and Complexity group at CWI Amsterdam. Previously, I received my undergraduate degrees in Computer Science (2007) and Mathematics (2009) from the Complutense University of Madrid.

Since 2013 I also work as a part-time lecturer at Pompeu Fabra University (UPF).

I also have some industrial experience as a software engineer (worked for CERN, Google and Tuenti). See my LinkedIn profile for details.### Research

My area of research is theoretical computer science, including (but not limited to) algorithms, computational complexity, learning theory, probabilistic methods, and derandomization. I'm particulary interested in the theory of property testing and sublinear algorithms and the application of these techniques to large-scale problems in data mining and machine learning.### Teaching

2014: Operating Systems (2nd year course at UPF).

2013: Linear Algebra and Discrete Mathematics (1st year course at UPF).
2009: Quantum Computing (Master's-level course at UvA).

### Publications

List of publications (with author names in alphabetical order, except for those marked with an asterisk). You can also check my DBLP entry.The Minimum Wiener Connector Problem *. To appear in Proceedings of the
2015 ACM SIGMOD International Conference on Management of Data (SIGMOD). |
N. Ruchansky,
F. Bonchi F. Gullo N. Kourtellis |
||

The power of both choices: practical load balancing for distributed stream processing engines *. To appear in Proceedings of the 31th IEEE International Conference on Data Engineering, 2015. |
A. Nasir G. de Francisci Morales N. Kourtellis M. Serafini |
||

Graph Summarization with Quality Guarantees *. To appear in Proceedings of the 14th IEEE International Conference on Data Mining, 2014. |
F. Bonchi
M. Riondato |
||

Local Correlation Clustering.
Submitted. |
F. Bonchi
K. Kutzkov |
||

Triangle Counting in Streamed Graphs via Small Vertex Covers.
Proceedings of the 14th SIAM International Conference on Data Mining, 2014. |
K. Kutzkov | ||

The Non-Adaptive Complexity of Testing k-parities.
Chicago Journal of Theoretical Computer Science, 2013. |
H. Buhrman
A. Matsliah R. de Wolf |
||

Junto-Symmetric Functions, Hypergraph Isomorphism, and Crunching.
Proceedings of the 27th IEEE Conference on Computational Complexity (CCC), 2012. |
S. Chakraborty
E. Fischer A. Matsliah |
||

Efficient Sample Extractors for Juntas with Applications
Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), 2011. |
S. Chakraborty
A. Matsliah |
||

Cycle Detection, Order Finding and Discrete Log with Jumps
Proceedings of the second Symposium on Innovations in Theoretical Computer Science (ITCS), 2011. |
S. Chakraborty
A. Matsliah |
||

Nearly Tight Bounds for Testing Function Isomorphism
Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011. Journal version in SIAM Journal on Computing, 42(2):459–493, 2013. |
N. Alon
E. Blais
S. Chakraborty A. Matsliah |
||

Monotonicity Testing and Shortest-Path Routing on the Cube
Proceedings of the 14th International Workshop on Randomization and Computation (RANDOM), 2010 Journal version in Combinatorica, 32:1–19, 2012. |
S. Chakraborty
A. Matsliah |
||

Learning Parities in the Mistake-Bound Model
Information Processing Letters, 111(1):16–21, 2010. |
H. Buhrman
A. Matsliah |
||

Query-Efficient Computation in Property Testing and Learning Theory
PhD thesis, 2012. |
|||