Ph.D. student positions in theoretical foundations of data storage and
analysis. The students will work in the group of assistant professor
Ioana-Oriana Bercea (https://ioanabercea.github.io/webpage/).
The research team develops algorithms and data structures with provable
guarantees, by leveraging theoretical insights to obtain state-of-the-art
practical algorithms. Currently, we have a focus on randomized algorithms
and probabilistic data structures such as data sketches, Bloom filters, and
hash functions. We are also interested in implementing and developing
efficient data structures for subroutines that appear in data science
algorithms. The positions have a strong mathematical flavor, and the
students will spend a big part of their work analyzing algorithms
theoretically. Several directions of the project are possible and will be
determined in collaboration with the Ph.D. candidate.
The application deadline for these positions is April 3rd, 2025. If you
have any questions do not hesitate to contact me at bercea@kth.se.
For more information on this position, see the official job opening:
https://www.kth.se/lediga-jobb/803006?l=en
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
