Postdoc Position at ETH Zurich
Karl Bringmann via dmanet <[email protected]>
| Newsgroups | gmane.science.mathematics.discrete |
|---|---|
| Organization | Saarland University |
| Message-ID | <[email protected]> |
ETH Zurich POSTDOC POSITION IN FINE-GRAINED ALGORITHMS AND COMPLEXITY A full-time postdoc position is available in the research group Fine-Grained Algorithms & Complexity, led by Professor Karl Bringmann, which will be established at ETH Zurich in January 2026. The group develops fine-grained complexity theory, the area of theoretical computer science that proves conditional lower bounds based on conjectures such as the Strong Exponential Time Hypothesis, and designs efficient algorithms matching these lower bounds. With this combination of algorithm design and conditional lower bounds we aim to achieve (near-)optimal algorithms for problems from various application areas such as: discrete optimization, computational geometry, sublinear algorithms, graph algorithms, database theory, and string algorithms. More recently, the group is also exploring algorithm design for novel realistic machine models. The group is part of the Institute for Theoretical Computer Science at ETH Zurich, a vibrant research environment hosting several leading algorithms researchers, including Rasmus Kyng, David Steurer, and Vera Traub. We invite applications for postdoctoral positions from candidates who either have experience in fine-grained complexity theory, or have expertise in any of the application areas listed above and are interested in exploring fine-grained approaches within their domain. We also welcome applicants with a strong background in designing and implementing algorithms for realistic machine models. The 1-year position has a flexible starting date in 2026, and can potentially be extended. For full consideration, please send your application by December 7 to <myfirstname>.<mylastname>@inf.ethz.ch Late applications may also be considered. Your application should include a CV with a list of publications, a paragraph describing possible connections to the research group, names of potential recommendation letter writers, and if possible a research statement. See also https://people.mpi-inf.mpg.de/~kbringma/jobopenings.html Karl Bringmann ********************************************************** * * Contributions to be spread via DMANET are submitted to * * [email protected] * * 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/ * **********************************************************