Find Academic Supervisors

Christian ScheidelerView profile

Professor

• Distributed Algorithms
• Data Structures
• Security in Distributed Systems
• +4 more

Christian Scheideler is a Professor at the Institute for Computer Science (Theory of Distributed Systems) within the Faculty of Electrical Engineering, Computer Science, and Mathematics at the University of Paderborn. He serves as institute director, advisory committee member of SPAA, and associate editor for Journal of the ACM and Journal of Computer and System Sciences . His editorial and leadership roles extend to managing Journal of Interconnection Networks and steering committees for conferences like DISC, SIROCCO, and ALGOSENSORS. Director, Institute for Computer Science Advisory Committee, SPAA Associate Editor, Journal of the ACM and Journal of Computer and System Sciences Managing Editor, Journal of Interconnection Networks Steering Committee member for DISC, SIROCCO, ALGOSENSORS His research focuses on distributed algorithms, data structures, security in distributed systems, randomized algorithms, stochastic processes, network theory, and discrete mathematics . Notably, he investigates hybrid programmable matter systems, self-stabilizing overlay networks, and robust distributed protocols under adversarial conditions. Recent publications (2021-2025) highlight work on 3D programmable matter shape formation , low-diameter graph decompositions , reconfigurable circuits in amoebot models , and blockchain lightweight state replication . Topics span distributed computing, computational geometry, and network security. Scientific awards include the 2022 Edsger W. Dijkstra Prize in Distributed Computing for foundational work in self-stabilization and overlay networks. He has served as PC Chair (DISC 2022) and organized numerous conferences (SPAA, SSS, SIROCCO).

• Numerical Analysis
• Computational Mathematics
• Sparse Signal Processing
• +4 more

Dr. Toni Volkmer is a researcher affiliated with the Faculty of Mathematics at Chemnitz University of Technology. His work focuses on computational mathematics and signal processing, particularly in high-dimensional data analysis and sparse Fourier transforms. His research intersects numerical analysis, approximation theory, and algorithm design for efficient data processing. Key research areas include Sparse spectral estimation Rank-1 lattice sampling Multivariate function approximation High-dimensional data analysis Fast matrix-vector operations Graph Laplacian computations His publications demonstrate expertise in developing sublinear-time algorithms for harmonic analysis and creating efficient numerical methods applicable to modern data science challenges. While no formal awards are listed, his contributions to scientific computing have been documented in multiple peer-reviewed publications since 2012.

• Distributed Computing
• Communication Complexity
• Quantum Computing
• +4 more

Rotem Oshman is affiliated with Tel-Aviv University, Israel , where he contributes to research in theoretical computer science, focusing on distributed computing, communication complexity, and quantum algorithms. His work addresses fundamental challenges in network protocols, concurrent data structures, and cryptographic verification.

Yann StrozeckiView profile

Associate Professor

• Enumeration Complexity
• Algorithmic Game Theory
• Simple Stochastic Games
• +7 more

Yann Strozecki is an Associate Professor (Maître de Conférences HDR) at the University of Versailles Saint-Quentin, where he is based in the DAVID Laboratory and leads the ALMOST research team focused on algorithms and stochastic models. He is currently on a part-time assignment at LIGM, Gustave Eiffel University, and has previously held positions at LIP6 (RO team), Paris-Sud University (ALGO team), and completed a postdoctoral fellowship at the University of Toronto's Theory Group. He earned his PhD from Paris Diderot (Paris 7) under Arnaud Durand. His research lies at the intersection of theoretical computer science and discrete mathematics, with core interests in: Enumeration complexity, especially delay and space constraints Algorithmic game theory, particularly simple stochastic games (SSGs) Graph and matroid algorithms Cheminformatics and molecular structure generation Sparse polynomials and algebraic complexity Analysis of his recent publications reveals a strong trend in developing efficient enumeration algorithms with provable delay and space bounds, advancing the theoretical foundations of output-sensitive computation. He also contributes to practical algorithms for Cloud RAN scheduling and cheminformatics, often combining theoretical rigor with real-world applications. His work on geometric amortization and strategy improvement in SSGs demonstrates innovation in algorithm design. Notable scientific contributions include: Generic strategy improvement methods for SSGs Polynomial-delay enumeration via closure operations Efficient deterministic scheduling for low-latency networks Tools for molecular cage generation in chemistry Yann Strozecki actively supervises PhD and master’s students, including Noé Demange, Maël Guiraud, and Xavier Badin de Montjoye. He co-organizes the ALMOST team seminar and has advised numerous interns in algorithmics and game theory. His research has been supported through collaborations with Nokia Bell Labs (CIFRE thesis) and interdisciplinary projects in cheminformatics and networking.