I hold a postdoc position at Saarland University and Max Planck Institute for Informatics, generously funded by Karl Bringmann's ERC starting grant
. Before that, I obtained by Ph.D. from Harvard University, advised by Prof. Jelani Nelson
. Even before that, I completed my undergraduate studies at the National Technical University of Athens. You can contact me at vnakos AT mpi-inf DOT mpg DOT de if you have interest or questions in any of my papers.
I primarily work on modern aspects of algorithm design, mostly under sparsity assumptions, for example compressed sesing/sparse recovery. The need for such algorithms arises across all science and engineering, for example in Machine Learning, Data Science and Signal Processing to name a few. We are organizing ADFOCS 2021 in MPII on convex optimization, see the website.
For general audience: In the theory of Algorithms and Computer Science, the most important venues are conferences and not
journals. The most widely recognized and prestigious conferences in the field are FOCS (Foundations of Computer Science) and STOC (Symposium on the Theory of Computation), while the next most important conference is SODA.