Search

We found 527 hits for your search of 'Algorithms and Complexity'.
  1. Algorithms with Predictions

    /departments/algorithms-complexity/seminars/algorithms-with-predictions

    Research Departments Algorithms and Complexity Seminars Algorithms with Predictions Algorithms with Predictions Schedule Date Speaker Title November 5 Nicole Megow Non-Clairvoyant Scheduling with Predictions [...] online algorithm that yields enhanced performance when these predictions are sufficiently accurate, and (ii) a classical online algorithm that disregards predictions. Our learning augmented algorithm ass [...] in the popular framework of Algorithms with Predictions, which integrates such error-prone predictions into online algorithm design. We examine various prediction models and error measures, showcasing

  2. Robust Learning

    /departments/algorithms-complexity/research/robust-learning

    IMPRS, ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] Research Departments Algorithms and Complexity Research Robust Learning Robust Learning Machine learning algorithms have many applications. Can we theoretically prove they are consistent and helpful? We focus [...] focus on two paradigms: algorithmic stability and algorithms with predictions. Stable algorithms, which can tolerate changes in their inputs, can inherit many desirable properties such as generalization,

  3. Computer scientist Danupon Nanongkai appointed Scientific Member of Max Planck Society

    /news/detail?tx_news_pi1%5Baction%5D=detail&tx_news_pi1%5Bcontroller%5D=News&tx_news_pi1%5Bnews%5D=434&cHash=b4491a4c081b89cd1cf950a4dfbaaf75

    frontier of algorithms and complexity theory. Professor Nanongkai and his group are well-known for answering many long-standing fundamental questions in the theory of graph (network) algorithms, with a particular [...] technology (algorithms and complexity, logic of programming) as well as developing new algorithms for various application areas such as computer graphics, geometry, program verification, databases and information [...] efficient algorithms in decades for fundamental graph problems such as finding paths, cuts, and matchings. Danupon Nanongkai grew up in Thailand and received a Bachelor's in Computer Engineering from Kasetsart

  4. Kinesthetic Displays – how vibrotactile feedback creates and changes how we experience the moving body

    /news/detail/kinesthetic-displays-how-vibrotactile-feedback-creates-and-changes-how-we-experience-the-moving-body

    areas of algorithms and complexity, as well as in logic of programming. At the same time researchers at the Institute have developed new algorithms for various application areas such as databases and information [...] create rich virtual and augmented environments for our eyes. A sense almost no one is even talking about is kinesthesia-our awareness of the position and movement of body parts. And even though this sense [...] n, and bioinformatics. Basic research in visual computing is also an important focus of the Institute, i.e. computer graphics and computer vision, at the intersection of artificial intelligence and machine

  5. News

    /departments/algorithms-complexity/news

    Research Departments Algorithms and Complexity News News ADFOCS 2024 The goal of this year's ADFOCS is to educate people with a TCS background on Algorithmic Game Theory. Details on the summer school can

  6. Zahra Parsaeian

    /departments/algorithms-complexity/people/current-members/zahra-parsaeian

    Research Interests Algorithm design and Theoretical Computer Science Graph Algorithms Distributed Algorithms Computational Geometry Algorithmic Game Theory Parameterized Algorithms Publications Towards [...] Research Departments Algorithms and Complexity People Zahra Parsaeian Zahra Parsaeian Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 [...] al Geometry (SoCG 2022). List of all publications Teaching Winter 2021 Tutor for Parameterized Algorithms (CS6190)​ at Indian Institute of Technology Madras, Chennai Several tutoring experiences at Isfahan

  7. Daniel Neuen

    /departments/algorithms-complexity/people/current-members/daniel-neuen

    Research Departments Algorithms and Complexity People Daniel Neuen Dr. Daniel Neuen Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - [...] dneuen@mpi-inf.mpg.de Research Interests parameterized complexity graph isomorphism problem and symmetry detection computational group theory graph similarity and graph motifs Publications A list of publications [...] 2023. DOI . Martin Grohe and Daniel Neuen. Canonisation and definability for graphs of bounded rank width. ACM Trans. Comput. Log., 24(1):6:1–6:31, 2023. DOI . Daniel Neuen and Pascal Schweitzer. An exponential

  8. Michelle Sweering

    /departments/algorithms-complexity/people/current-members/michelle-sweering

    Research Departments Algorithms and Complexity People Michelle Sweering Michelle Sweering Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1

  9. Xinkai Shu

    /departments/algorithms-complexity/people/current-members/xinkai-shu

    Research Departments Algorithms and Complexity People Xinkai Shu Xinkai Shu Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - 316 Phone

  10. Rex Lei

    /departments/algorithms-complexity/people/current-members/rex-lei

    Information I am a Postdoctoral Researcher in the Algorithms and Complexity Department (D1). I primarily research replicability for machine learning algorithms , from a theoretical perspective. I joined the [...] Research Departments Algorithms and Complexity People Rex Lei Rex Lei Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - 317 Phone +49 [...] Reading it does not require a mathematical background, and it explains the overall goals of my research. Research Interests Learning Theory Complexity Theory Publications Note: In the theoretical computer