technology with a focus on algorithmsand their applications in a broad sense. Its research ranges from fundamental topics (algorithmsandcomplexity, automation of logic) to a variety of application domains [...] of Warwick, UK. She joined the AlgorithmsandComplexity Department at the MPI for Informatics in September 2012. Her main research areas are approximation algorithms for combinatorial optimization problems [...] Saarbrücken for two years in the AlgorithmsandComplexity Department. Currently, Anke van Zuylen is an assistant professor in the Mathematics Department of the College of William and Mary, Williamsburg, VA, United
in Paris. In Kurt Mehlhorn's Group "Algorithms & Complexity" she will continue her studies on approximation algorithms, combinatorial optimization, and graph algorithms. Qianru Sun earned her PhD from Peking [...] an Associate Professor in 2013 and moved on to a position as Senior Research Scientist at the University of Siegen, Germany, in 2014. Her research topic is "3D Imaging and Inverse Rendering". Daria Stepanova [...] informatics from the department of Mathematics and Mechanics of St. Petersburg State University. She is going to spend her time with the Department 5: Databases and Information Systems under the supervision
in the Computer Science Department at Pohang University of Science and Technology. In March 2018 she joined the AlgorithmsandComplexity Group of Kurt Mehlhorn. Qiuhong Ke worked as a PhD student at The [...] scientific ideas without exertion of influence. It consists of a two-year tax-free research fellowship and business expenses. For the strech of the next two years, four young female researchers in computer [...] In May she joined the Computer Vision Group of Bernt Schiele with her topic "Activity Recognition and Prediction". Sophie Tourret completed her PhD at the Grenoble Informatics Laboratory (France) in March
Sciences, HBNI, Chennai, India. She joined the AlgorithmsandComplexity group from October 2020. Her area of research is Parameterized Complexity, Kernelization and Graph Theory. Lingjie Liu received her Ph [...] University of Rome. In May 2018 she joined the "Databases and Information Systems" group of Gerhard Weikum. Her topic is “Personalised Search and Knowledge Harvesting for Health Domain”. Jiangxin Dong received [...] Computing and AI Department) of Prof. Christian Theobalt at the Max-Planck-Institute for Informatics in Oct 2019. Her research interests include neural rendering, human performance capture and modeling
2023, she has been working in the Algorithms & Complexity group of Danupon Na Nongkai, and her research areas include “Computational Social Choice Theory” and “Algorithmic Game Theory”. Lise Meitner Awardees [...] University. In 2022 she joined parallel the "Computer Vision and Machine Learning" group of Bernt Schiele. Her topics are “image recoginition” and “incremental learning”. Jiang Li was a PhD at The Chinese [...] scientific ideas without exertion of influence. It consists of a two-year tax-free research fellowship and business expenses. For the strech of the next two years, up to four young female researchers in computer
Satisfiability Problem - Algorithmsand Analyses Lehmanns Verlag, 2013 Termination, well-founded orderings, confluence, unification Franz Baader and Tobias Nipkow: Term Rewriting and All That. Cambridge Univ [...] 1998 Further readings Leo Bachmair and Harald Ganzinger Resolution Theorem Proving, in "Handbook of Automated Reasoning", pages 19-99. Elsevier, 2001. Robert Nieuwenhuis and Albert Rubio Paramodulation-Based [...] Nonnengart and Christoph Weidenbach Computing small clause normal forms, in "Handbook of Automated Reasoning", pages 335-367. Elsevier, 2001. Christoph Weidenbach Combining Superposition, Sorts and Splitting
navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 Visual Computing and Artificial Intelligence [...] Satisfiability Problem - Algorithmsand Analyses Lehmanns Verlag, 2013 Termination, well-founded orderings, confluence, unification Franz Baader and Tobias Nipkow: Term Rewriting and All That. Cambridge Univ [...] 1998 Further readings Leo Bachmair and Harald Ganzinger Resolution Theorem Proving, in "Handbook of Automated Reasoning", pages 19-99. Elsevier, 2001. Robert Nieuwenhuis and Albert Rubio Paramodulation-Based
Satisfiability Problem - Algorithmsand Analyses. Lehmanns Verlag, 2013. Termination, well-founded orderings, confluence, unification Franz Baader and Tobias Nipkow: Term Rewriting and All That. Cambridge Univ [...] 1998 Further readings Leo Bachmair and Harald Ganzinger Resolution Theorem Proving, in "Handbook of Automated Reasoning", pages 19-99. Elsevier, 2001. Robert Nieuwenhuis and Albert Rubio Paramodulation-Based [...] Nonnengart and Christoph Weidenbach Computing small clause normal forms, in "Handbook of Automated Reasoning", pages 335-367. Elsevier, 2001. Christoph Weidenbach Combining Superposition, Sorts and Splitting
Satisfiability Problem - Algorithmsand Analyses Lehmanns Verlag, 2013 Termination, well-founded orderings, confluence, unification Franz Baader and Tobias Nipkow: Term Rewriting and All That. Cambridge Univ [...] 1998 Further readings Leo Bachmair and Harald Ganzinger Resolution Theorem Proving, in "Handbook of Automated Reasoning", pages 19-99. Elsevier, 2001. Robert Nieuwenhuis and Albert Rubio Paramodulation-Based [...] Nonnengart and Christoph Weidenbach Computing small clause normal forms, in "Handbook of Automated Reasoning", pages 335-367. Elsevier, 2001. Christoph Weidenbach Combining Superposition, Sorts and Splitting
Satisfiability Problem - Algorithmsand Analyses Lehmanns Verlag, 2013 Termination, well-founded orderings, confluence, unification Franz Baader and Tobias Nipkow: Term Rewriting and All That. Cambridge Univ [...] 1998 Further readings Leo Bachmair and Harald Ganzinger Resolution Theorem Proving, in "Handbook of Automated Reasoning", pages 19-99. Elsevier, 2001. Robert Nieuwenhuis and Albert Rubio Paramodulation-Based [...] Nonnengart and Christoph Weidenbach Computing small clause normal forms, in "Handbook of Automated Reasoning", pages 335-367. Elsevier, 2001. Christoph Weidenbach Combining Superposition, Sorts and Splitting