Dear all,

We are looking for a highly motivated and bright PhD student with a strong expertise and interest in graph and network algorithms in particular, and in theoretical computer science in general, to join our team around the ERC project AdjustNet.

The goal of our research is to lay the theoretical foundations of self-adjusting networks: networks (“graphs”) whose topology adapts toward the workload it currently serves, in a demand-aware and online manner. Self-adjusting networks are motivated, e.g., by distributed machine learning applications whose traffic pattern features specific structure and can hence be exploited and optimized for. Our vision of self-adjusting networks is enabled by emerging optical technologies which allow us to adjust the topology within milliseconds or even microseconds.

The vision of self-adjusting networks is similar to the vision of self-adjusting datastructures such as splay trees, which self-optimize themselves towards the key distribution. It is also similar to information-theoretical concepts such as dynamic Huffman coding: codes which adjust themselves over time.

The optimization problems underlying self-adjusting networks include topics from online algorithms, graph spanner problems, expanders and information theory to name a few. For a more concrete idea of the project, see also the related papers below or our project website: https://self-adjusting.net/.

The position is at the University of Vienna, Austria, and comes with the possibility to collaborate with the Ben Gurion University in Israel (Prof Chen Avin), who is a project partner. If the candidate likes, it is also possible to have a longer research stay in Israel, but this is not mandatory.

To apply, please send your CV, motivation letter and reference letters to me by email, or use the online portal at  https://univis.univie.ac.at/ausschreibungstellensuche/flow/bew_ausschreibung-flow?_flowExecutionKey=_cFE6CEC8A-0545-5B47-C0BA-D64D31642552_k8B4F950C-D19E-E81B-36BB-AFAF69FC377A&tid=78399.28 . 

Please do not hesitate to contact me if you have any questions.

Stefan


Some related papers:

On the Complexity of Traffic Traces and Implications
Chen Avin, Manya Ghobadi, Chen Griner, and Stefan Schmid.
ACM SIGMETRICS, Boston, Massachusetts, USA, June 2020.
https://www.univie.ac.at/ct/stefan/sigmetrics20complexity.pdf  

Demand-Aware Network Design with Minimal Congestion and Route Lengths
Chen Avin, Kaushik Mondal, and Stefan Schmid.
38th IEEE Conference on Computer Communications (INFOCOM), Paris, France, April 2019.
https://www.univie.ac.at/ct/stefan/infocom2019a.pdf  

Toward Demand-Aware Networking: A Theory for Self-Adjusting Networks (Editorial)
Chen Avin and Stefan Schmid.
ACM SIGCOMM Computer Communication Review (CCR), October 2018.
https://www.univie.ac.at/ct/stefan/ccr18san.pdf  

Demand-Aware Network Designs of Bounded Degree
Chen Avin, Kaushik Mondal, and Stefan Schmid.
31st International Symposium on Distributed Computing (DISC), Vienna, Austria, October 2017.
https://www.univie.ac.at/ct/stefan/disc17.pdf 
 
Online Balanced Repartitioning
Chen Avin, Andreas Loukas, Maciej Pacut, and Stefan Schmid.
30th International Symposium on Distributed Computing (DISC), Paris, France, September 2016.
https://www.univie.ac.at/ct/stefan/disc16repartition.pdf  

Virus-free. www.avast.com