WiSe 25/26  
Mathematics and...  
Master's progra...  
Course

Computer Science

Master's programme in Computer Science (2014 study regulations)

0089c_MA120
  • Pattern Recognition

    0089cA1.12
    • 19304201 Lecture
      Machine Learning (Paul Hagemann)
      Schedule: Mi 12:00-14:00, Do 14:00-16:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-15)
      Location: T9/Gr. Hörsaal (Takustr. 9)

      Additional information / Pre-requisites

      Prerequisites: Basic knowledge  in Mathematics and Algorithms and Data structures.

      Comments

      Contents: Bayesian methods of pattern recognition, clustering, expectation maximization, neuronal networks and learning algorithms, associate networks, recurrent networks. Computer-vision with neuronal networks, applications in Robotics.

      Suggested reading

      wird noch bekannt gegeben

    • 19304202 Practice seminar
      Practice seminar for Pattern recognition / Machine Learning (Manuel Heurich)
      Schedule: Mo 14:00-16:00 (Class starts on: 2025-10-20)
      Location: T9/SR 005 Übungsraum (Takustr. 9)
  • Software Processes

    0089cA1.18
    • 19306101 Lecture
      Software Processes (Lutz Prechelt)
      Schedule: Mo 14:00-16:00 (Class starts on: 2025-10-13)
      Location: T9/049 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      The course language is German, but the actual slides and practice sheets are in English.

      The exam will be formulated in German, but answers may be given in English, too.

      Comments

      This course teaches the content of various software development process models, but in particular the power of judgment for deciding which elements of a process may be appropriate or not appropriate and why.

      We discriminate the "classical view" of software engineering (which originates from positivist thinking and the engineering ideals of industrial production) on the one hand and the "modern view" (which originates in humanist thinking and humbler expectations about what engineering should expect to achieve) on the other. We use this discrimination as a litmus test for tracking down cultural undercurrents in software processes that damage a process when and where they are inappropriate for the given task and team.

      For details see the website:https://www.inf.fu-berlin.de/w/SE/VorlesungSoftwareprozesse2025

      Suggested reading

      See the slides

    • 19306102 Practice seminar
      Practice seminar for Software Processes (Lutz Prechelt, Linus Ververs)
      Schedule: Di 14:00-16:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: T9/049 Seminarraum (Takustr. 9)

      Comments

      Siehe Vorlesung

  • Software Project: Applied Computer Science A

    0089cA1.23
    • 19309212 Project Seminar
      SWP: Smart Home Demo Lab (Jochen Schiller, Marius Max Wawerek)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/K63 Hardwarepraktikum (Takustr. 9)

      Additional information / Pre-requisites

      In this course you will be expected to write code. The outcome of your software project should be a concrete contribution to the RIOT code base, and take the shape of one or more pull request(s) to the RIOT github (https://github.com/RIOT-OS/RIOT). Before you start coding, refer to the starting guide

      https://github.com/RIOT-OS/RIOT/wiki#wiki-start-the-riot

      Comments

      Softwareproject Smart Home Demo Lab

      In this course, students will work on topics related to the Smart Home Demo Lab of the Computer Systems & Telematics working group.

      The topics include:

      • Creation of a Smart Home ecosystem
      • Machine Learning (ML) based analysis of Smart Home datasets
      • Experiments with and Improvements of existing ML models
      • Design of Smart Home Usage scenarios
      • Development of your own (virtual) IoT device

      Participants will work in smaller groups (3-5 students), where each group will focus on a specific topic.

      Regarding Organization: The software project will take course throughout the whole lecture period. First a kick off meeting with all participants will be held. There all the different topics will be presented. Afterwards each student will hand in a list of topic priorities.

      The actual work on the topics will occur in multiple two week sprints. Finally at the end of the lecture period one overall final presentation will be held showing the results of all topics.

      Depending on the needs of the students the software project can be held in either German or English.

      Suggested reading

      • A. S. Tanenbaum, Modern Operating Systems, 3rd ed. Upper Saddle River, NJ, USA: Prentice Hall Press, 2007.
      • Shelby, Zach, and Carsten Bormann. 6LoWPAN: The wireless embedded Internet. Vol. 43. Wiley. com, 2011.
      • A. Dunkels, B. Gronvall, and T. Voigt, "Contiki - a lightweight and flexible operating system for tiny networked sensors." in LCN. IEEE Computer Society, 2004, pp. 455-462.
      • P. Levis, S. Madden, J. Polastre, R. Szewczyk, K. Whitehouse, A. Woo, D. Gay, J. Hill, M. Welsh, E. Brewer, and D. Culler, "TinyOS: An Operating System for Sensor Networks," in Ambient Intelligence, W. Weber, J. M. Rabaey, and E. Aarts, Eds. Berlin/Heidelberg: Springer-Verlag, 2005, ch. 7, pp. 115-148.
      • Oliver Hahm, Emmanuel Baccelli, Mesut Günes, Matthias Wählisch, Thomas C. Schmidt, "RIOT OS: Towards an OS for the Internet of Things," in Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), Poster Session, April 2013.
      • M.R. Palattella, N. Accettura, X. Vilajosana, T. Watteyne, L.A. Grieco, G. Boggia and M. Dohler, "Standardized Protocol Stack For The Internet Of (Important) Things", IEEE Communications Surveys and Tutorials, December 2012.
      • J. Wiegelmann, Softwareentwicklung in C für Mikroprozessoren und Mikrocontroller, Hüthig, 2009

    • 19314012 Project Seminar
      Software Project: Semantic Technologies (Adrian Paschke)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A3/SR 115 (Arnimallee 3-5)

      Comments

      Mixed groups of master and bachelor students will either implement an independent project or are part of a larger project in the area of semantic technologies. They will gain in-depth programming knowledge about applications of semantic technologies and artificial intelligence techniques in the Corporate Semantic Web. They will practice teamwork and best practices in software development of large distributed systems and Semantic Web applications. The software project can be done in collaboration with an external partner from industry or standardization. It is possible to continue the project as bachelor or master thesis.

    • 19323612 Project Seminar
      The AMOS Project (Lutz Prechelt, Dirk Riehle)
      Schedule: -
      Location: keine Angabe

      Additional information / Pre-requisites

      Educational objectives and competencies

      • Students learn about software products and software development in an industry context
      • Students learn about agile methods, in particular Scrum and Extreme Programming
      • Students learn about open source software development and its underlying principles
      • Students gain practical hands-on experience with a Scrum process and XP technical practices

      Target group

      Students of computer science (and related fields). If you want to play the software developer role, you should have had practical programming experience. This is not a course to learn programming.

      Language

      English (lectures in English, team meeting German or English by choice of student team)

      Grading

      • Software developer
        • 10% of grade: 5 class quizzes, each consisting of 5 questions at 2 points each
        • 90% of grade: Weekly project work

      Other

      • SWS: 4 SWS (2 SWS lecture, 2 SWS team meeting)
      • Semester: Every semester
      • Modality: Online, across multiple universities
      • Tags: Scrum

       

      Comments

      This course teaches agile methods (Scrum and XP) and open source tools using a single semester-long project. It takes place online and across multiple universities. Topics covered are:

      • Agile methods and related software development processes
      • Scrum roles, process practices, including product and engineering management
      • Technical practices like refactoring, continuous integration, and test-driven development
      • Principles and best practices of open source software development

      The project is a software development project in which each student team works with an industry partner who provides the idea for the project. This is a practical hands-on experience.

      Students play the role of a software developer. In this role, students estimate the effort for requirements and implement them. Students must have prior software development experience.

      Students will be organized into teams of 7-9 people, combining one Scrum master with two product owners with six software developers.

      An industry partner will provide requirements to be worked out in detail by the product owners and to be realized by the software developers. The available projects will be presented in the run-up to the course.

      Class consists of a 90 min. lecture followed by a 90 min. team meeting. Rooms and times for team meetings are assigned at the beginning of the semester. You must be able to regularly participate in the team meetings. If you can't, do not sign up for this course.

      Attention: this course is organized externally and additional sign-up steps are required. Please join the Moodle course at https://uni1.de/amos/system, read up on the available projects or join the project partner pitches, and fill out the course entry survey by Friday the week before teaching starts.

      Suggested reading

      http://goo.gl/5Wqnr7

    • 19329912 Project Seminar
      Softwareprojekt: Secure Identity (Volker Roth)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: , T9/SR 006 Seminarraum
    • 19332512 Project Seminar
      Softwareprojekt: Applying LLMs in Healthcare (Malte Heiser)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: , Virtueller Raum 35

      Additional information / Pre-requisites

      The seminar will take place at Königin-Luise-Straße 24/26, room 111.

      Link to the software project on the HCC-Website: https://www.mi.fu-berlin.de/en/inf/groups/hcc/teaching/winter_term_2025_26/swp_applying_llms_in_healthcare.html

      Comments

      In this software project, students collaboratively develop an application based on a Large Language Model (LLM) for patients in the context of an emergency department. The core focus is on enabling patients to feel emotionally informed while they wait, with the goal of empower them to reflect on their symptoms independently.   This real-world problem is used as a foundation to build a functional LLM-based application while fostering interdisciplinary thinking, technical creativity, and the ability to work effectively in agile teams. The project is structured around the Scrum framework and offers students the opportunity to gain practical development experience. Students apply agile principles to organize the development process iteratively and collaboratively — from requirements analysis through planning and implementation to final reflection.   This allows them to strengthen their communication skills, tackle problems and tasks in a complex environment, and advance their technical competencies. Weekly sessions throughout the semester provide a space for students to shape the process and discuss their progress. We are available as advisors and mentors to support them and provide all necessary methods and competencies as needed.

      Suggested reading

      Literature, materials and equipment will be provided during the event.

    • 19334212 Project Seminar
      Software Project: Machine Learning for data from the life sciences (Pascal Iversen, Katharina Baum)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      In this software project, we will work with various ML-based methods for predictions for specific questions from biology, such as predicting the effect of drugs or the development of infection numbers. The focus of the project is explicitly on the development, implementation and evaluation of the methodological framework and less on the preparation of the data.

      The programming language is Python, and we plan to use modern Python modules for ML such as PyTorch or possibly JAX. Good knowledge of Python is a prerequisite. The software project takes place during the semester and can also be carried out in English.

    • 19334412 Project Seminar
      SWP: Future Security Lab (Leonie Terfurth)
      Schedule: Mo 10:00-12:00 (Class starts on: 2025-10-13)
      Location: T9/K63 Hardwarepraktikum (Takustr. 9)

      Comments

      Weather and climate shape our daily lives, yet the information surrounding them is often complex and difficult to interpret. This is especially true for extreme weather events, where the communication of warnings highlights how crucial it is to present meteorological information in a way that people can intuitively use in their decision-making. The effectiveness of weather communication depends not only on the availability and quality of data, but also on the clarity and design of how that information is conveyed (DWD RainBoW; Leschzyk et al., 2025).
      The quality and accessibility of extended reality (XR) technologies—particularly augmented reality (AR)—have improved significantly in recent years. As part of the Future Security Lab software project in the winter semester of 2025, students will work in small groups to develop proof-of-concept prototypes that explore the potential of AR for communicating weather and climate data. The project focuses not only on technical implementation but also on issues of comprehensibility, user orientation, and feasibility.
      Two relevant concepts are central to this approach:
      •    Immersive analytics – the use of XR technologies to transform complex data for decision-making into spatial, interactive environments. By enabling users to actively explore and manipulate data, it becomes more tangible (Chandler et al., 2015).
      •    Data visceralization – the translation of data into intuitive forms that foster an understanding of physical quantities and magnitudes, making the data directly experiential (Lee et al., 2020).


      This software project runs throughout the entire lecture time. Approximately every two weeks, there will be a face-to-face meeting in which all group members report on the current status. In addition to brief updates at the face-to-face meetings, there will be three presentations: an idea pitch, an interim presentation, and a final presentation.
      At the beginning of the course (October 13), the organizational details and background information on the project idea will be presented in detail, along with the various concepts. In addition, there will be a lecture on “User-Oriented Weather Warnings” as inspiration for potential applications.

       

  • Software Project: Applied Computer Science B

    0089cA1.24
    • 19309212 Project Seminar
      SWP: Smart Home Demo Lab (Jochen Schiller, Marius Max Wawerek)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/K63 Hardwarepraktikum (Takustr. 9)

      Additional information / Pre-requisites

      In this course you will be expected to write code. The outcome of your software project should be a concrete contribution to the RIOT code base, and take the shape of one or more pull request(s) to the RIOT github (https://github.com/RIOT-OS/RIOT). Before you start coding, refer to the starting guide

      https://github.com/RIOT-OS/RIOT/wiki#wiki-start-the-riot

      Comments

      Softwareproject Smart Home Demo Lab

      In this course, students will work on topics related to the Smart Home Demo Lab of the Computer Systems & Telematics working group.

      The topics include:

      • Creation of a Smart Home ecosystem
      • Machine Learning (ML) based analysis of Smart Home datasets
      • Experiments with and Improvements of existing ML models
      • Design of Smart Home Usage scenarios
      • Development of your own (virtual) IoT device

      Participants will work in smaller groups (3-5 students), where each group will focus on a specific topic.

      Regarding Organization: The software project will take course throughout the whole lecture period. First a kick off meeting with all participants will be held. There all the different topics will be presented. Afterwards each student will hand in a list of topic priorities.

      The actual work on the topics will occur in multiple two week sprints. Finally at the end of the lecture period one overall final presentation will be held showing the results of all topics.

      Depending on the needs of the students the software project can be held in either German or English.

      Suggested reading

      • A. S. Tanenbaum, Modern Operating Systems, 3rd ed. Upper Saddle River, NJ, USA: Prentice Hall Press, 2007.
      • Shelby, Zach, and Carsten Bormann. 6LoWPAN: The wireless embedded Internet. Vol. 43. Wiley. com, 2011.
      • A. Dunkels, B. Gronvall, and T. Voigt, "Contiki - a lightweight and flexible operating system for tiny networked sensors." in LCN. IEEE Computer Society, 2004, pp. 455-462.
      • P. Levis, S. Madden, J. Polastre, R. Szewczyk, K. Whitehouse, A. Woo, D. Gay, J. Hill, M. Welsh, E. Brewer, and D. Culler, "TinyOS: An Operating System for Sensor Networks," in Ambient Intelligence, W. Weber, J. M. Rabaey, and E. Aarts, Eds. Berlin/Heidelberg: Springer-Verlag, 2005, ch. 7, pp. 115-148.
      • Oliver Hahm, Emmanuel Baccelli, Mesut Günes, Matthias Wählisch, Thomas C. Schmidt, "RIOT OS: Towards an OS for the Internet of Things," in Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), Poster Session, April 2013.
      • M.R. Palattella, N. Accettura, X. Vilajosana, T. Watteyne, L.A. Grieco, G. Boggia and M. Dohler, "Standardized Protocol Stack For The Internet Of (Important) Things", IEEE Communications Surveys and Tutorials, December 2012.
      • J. Wiegelmann, Softwareentwicklung in C für Mikroprozessoren und Mikrocontroller, Hüthig, 2009

    • 19314012 Project Seminar
      Software Project: Semantic Technologies (Adrian Paschke)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A3/SR 115 (Arnimallee 3-5)

      Comments

      Mixed groups of master and bachelor students will either implement an independent project or are part of a larger project in the area of semantic technologies. They will gain in-depth programming knowledge about applications of semantic technologies and artificial intelligence techniques in the Corporate Semantic Web. They will practice teamwork and best practices in software development of large distributed systems and Semantic Web applications. The software project can be done in collaboration with an external partner from industry or standardization. It is possible to continue the project as bachelor or master thesis.

    • 19323612 Project Seminar
      The AMOS Project (Lutz Prechelt, Dirk Riehle)
      Schedule: -
      Location: keine Angabe

      Additional information / Pre-requisites

      Educational objectives and competencies

      • Students learn about software products and software development in an industry context
      • Students learn about agile methods, in particular Scrum and Extreme Programming
      • Students learn about open source software development and its underlying principles
      • Students gain practical hands-on experience with a Scrum process and XP technical practices

      Target group

      Students of computer science (and related fields). If you want to play the software developer role, you should have had practical programming experience. This is not a course to learn programming.

      Language

      English (lectures in English, team meeting German or English by choice of student team)

      Grading

      • Software developer
        • 10% of grade: 5 class quizzes, each consisting of 5 questions at 2 points each
        • 90% of grade: Weekly project work

      Other

      • SWS: 4 SWS (2 SWS lecture, 2 SWS team meeting)
      • Semester: Every semester
      • Modality: Online, across multiple universities
      • Tags: Scrum

       

      Comments

      This course teaches agile methods (Scrum and XP) and open source tools using a single semester-long project. It takes place online and across multiple universities. Topics covered are:

      • Agile methods and related software development processes
      • Scrum roles, process practices, including product and engineering management
      • Technical practices like refactoring, continuous integration, and test-driven development
      • Principles and best practices of open source software development

      The project is a software development project in which each student team works with an industry partner who provides the idea for the project. This is a practical hands-on experience.

      Students play the role of a software developer. In this role, students estimate the effort for requirements and implement them. Students must have prior software development experience.

      Students will be organized into teams of 7-9 people, combining one Scrum master with two product owners with six software developers.

      An industry partner will provide requirements to be worked out in detail by the product owners and to be realized by the software developers. The available projects will be presented in the run-up to the course.

      Class consists of a 90 min. lecture followed by a 90 min. team meeting. Rooms and times for team meetings are assigned at the beginning of the semester. You must be able to regularly participate in the team meetings. If you can't, do not sign up for this course.

      Attention: this course is organized externally and additional sign-up steps are required. Please join the Moodle course at https://uni1.de/amos/system, read up on the available projects or join the project partner pitches, and fill out the course entry survey by Friday the week before teaching starts.

      Suggested reading

      http://goo.gl/5Wqnr7

    • 19329912 Project Seminar
      Softwareprojekt: Secure Identity (Volker Roth)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: , T9/SR 006 Seminarraum
    • 19332512 Project Seminar
      Softwareprojekt: Applying LLMs in Healthcare (Malte Heiser)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: , Virtueller Raum 35

      Additional information / Pre-requisites

      The seminar will take place at Königin-Luise-Straße 24/26, room 111.

      Link to the software project on the HCC-Website: https://www.mi.fu-berlin.de/en/inf/groups/hcc/teaching/winter_term_2025_26/swp_applying_llms_in_healthcare.html

      Comments

      In this software project, students collaboratively develop an application based on a Large Language Model (LLM) for patients in the context of an emergency department. The core focus is on enabling patients to feel emotionally informed while they wait, with the goal of empower them to reflect on their symptoms independently.   This real-world problem is used as a foundation to build a functional LLM-based application while fostering interdisciplinary thinking, technical creativity, and the ability to work effectively in agile teams. The project is structured around the Scrum framework and offers students the opportunity to gain practical development experience. Students apply agile principles to organize the development process iteratively and collaboratively — from requirements analysis through planning and implementation to final reflection.   This allows them to strengthen their communication skills, tackle problems and tasks in a complex environment, and advance their technical competencies. Weekly sessions throughout the semester provide a space for students to shape the process and discuss their progress. We are available as advisors and mentors to support them and provide all necessary methods and competencies as needed.

      Suggested reading

      Literature, materials and equipment will be provided during the event.

    • 19334212 Project Seminar
      Software Project: Machine Learning for data from the life sciences (Pascal Iversen, Katharina Baum)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      In this software project, we will work with various ML-based methods for predictions for specific questions from biology, such as predicting the effect of drugs or the development of infection numbers. The focus of the project is explicitly on the development, implementation and evaluation of the methodological framework and less on the preparation of the data.

      The programming language is Python, and we plan to use modern Python modules for ML such as PyTorch or possibly JAX. Good knowledge of Python is a prerequisite. The software project takes place during the semester and can also be carried out in English.

    • 19334412 Project Seminar
      SWP: Future Security Lab (Leonie Terfurth)
      Schedule: Mo 10:00-12:00 (Class starts on: 2025-10-13)
      Location: T9/K63 Hardwarepraktikum (Takustr. 9)

      Comments

      Weather and climate shape our daily lives, yet the information surrounding them is often complex and difficult to interpret. This is especially true for extreme weather events, where the communication of warnings highlights how crucial it is to present meteorological information in a way that people can intuitively use in their decision-making. The effectiveness of weather communication depends not only on the availability and quality of data, but also on the clarity and design of how that information is conveyed (DWD RainBoW; Leschzyk et al., 2025).
      The quality and accessibility of extended reality (XR) technologies—particularly augmented reality (AR)—have improved significantly in recent years. As part of the Future Security Lab software project in the winter semester of 2025, students will work in small groups to develop proof-of-concept prototypes that explore the potential of AR for communicating weather and climate data. The project focuses not only on technical implementation but also on issues of comprehensibility, user orientation, and feasibility.
      Two relevant concepts are central to this approach:
      •    Immersive analytics – the use of XR technologies to transform complex data for decision-making into spatial, interactive environments. By enabling users to actively explore and manipulate data, it becomes more tangible (Chandler et al., 2015).
      •    Data visceralization – the translation of data into intuitive forms that foster an understanding of physical quantities and magnitudes, making the data directly experiential (Lee et al., 2020).


      This software project runs throughout the entire lecture time. Approximately every two weeks, there will be a face-to-face meeting in which all group members report on the current status. In addition to brief updates at the face-to-face meetings, there will be three presentations: an idea pitch, an interim presentation, and a final presentation.
      At the beginning of the course (October 13), the organizational details and background information on the project idea will be presented in detail, along with the various concepts. In addition, there will be a lecture on “User-Oriented Weather Warnings” as inspiration for potential applications.

       

  • Academic Work in Applied Computer Science A

    0089cA1.25
    • 19303811 Seminar
      Project seminar: Computer science and archaeology (Agnès Voisard)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: T9/046 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Requirement

      ALP I-III, Foundations of Datenbase Systems, good programming knowledge.

      Comments

      Research Seminar: Computer Science and Archaeology

      Course Description

      This research seminar brings together students of Informatics and Ancient Studies to explore the application of computational methods to archaeological questions. The research seminar will be a hands-on approach to digital cultural heritage methods, such as spatial analysis, 3D reconstruction, data mining and the digital processing of archaeological artefacts. Examples of datasets will include, but not be limited to, pottery, stone tools, inscriptions, clay tablets, and landscapes.

      A central goal of the seminar is to encourage interdisciplinary collaboration, with students working in pairs — ideally combining a Computer Science student with an Ancient Studies student. Each team will develop and carry out a small research project that combines technical tools with archaeological data, methods, or research questions.

      Topics include, but not limited to:

      – 3D analysis of archaeological artifacts and architecture
      – Geographic Information Systems (GIS) and spatial data analysis
      - Machine learning and computer vision for artifact classification
      – Usage of databases and digital documentation of excavation data
      – OCR/HTR for script in 3D like inscriptions or clay tablets

      Students from Informatics will gain experience applying computational techniques in a humanities context, while students from Ancient Studies will be introduced to digital tools and approaches that support archaeological research.

      No prior coding experience is required for Ancient Studies students, and no background in archaeology is assumed for Computer Science students.

      The seminar is jointly supervised by the Institute of Computer Science and the Archaeoinformatics group of the Institute of Computational Ancient Studies (CompAS) at Freie Universität Berlin, ensuring balanced guidance across disciplines.

      Learning Objectives

      – Understand interdisciplinary challenges and opportunities in digital archaeology

      – Learn to apply and assess computational tools for cultural heritage data

      – Develop and present a collaborative, project-based research outcome

      – Gain insights into current digital humanities and digital archaeology practices

       

       

       

       

      Suggested reading

      Literature and Data Sources:
       

      Open Access if not stated otherwise:


      – ACM Journal on Computing and Cultural Heritage
                https://dl.acm.org/journal/jocch
      – De Gruyter Brill on Open Archaeology (OPAR)
                https://www.degruyterbrill.com/journal/key/opar/html
      – Elsevir Journal of Archaeological Science (JAS)
                https://www.sciencedirect.com/journal/journal-of-archaeological-science

      – Journal of Computer Applications in Archaeology (JCAA)
                 https://journal.caa-international.org/
      – Journal of Open Archaeological Data (JOAD)
                 https://openarchaeologydata.metajnl.com/
      – Journal of Open Humanities Data (JOHD)
                 https://openhumanitiesdata.metajnl.com/


      Survey articles and Books:

      – Advances in digital pottery analysis
                https://doi.org/10.1515/itit-2022-0006
      – Digital Assyriology—Advances in Visual Cuneiform Analysis
                https://doi.org/10.1145/3491239
      – Machine Learning for Ancient Languages: A Survey

                https://doi.org/10.1162/coli_a_00481
      – Airborne laser scanning raster data visualization. A Guide to Good Practice
                https://doi.org/10.3986/9789612549848
      – Digital Humanities, Eine Einführung (German, no Open Acces)
                https://link.springer.com/book/9783476047687
      – New Technologies for Archaeology, Multidisciplinary Investigations in Palpa and Nasca,   Peru (no Open Acces) https://doi.org/10.1007/978-3-540-87438-6
      – Digging in documents: using text mining to access the hidden knowledge in Dutch archaeological excavation reports https://hdl.handle.net/1887/3274287

      Databases (related to research partners):

       

      – Heidelberg Objekt- und Multimediadatenbank (HeidICON)
                https://heidicon.ub.uni-heidelberg.de
      – Kooperative Erschließung und Nutzung der Objektdaten von Münzsammlungen
                https://www.kenom.de/
      – Art Institute of Chicago (API)
                https://api.artic.edu/docs/
      – FactGrid, a database for historical research
                https://database.factgrid.de/wiki/Main_Page
      – Research infrastructures of the German Archaeological Institute (DAI), multiple DBs:
                https://idai.world
      – Heidelberg Accession Index (HAI): Zugangsbücher und Bestandsverzeichnisse     deutscher Sammlungen und Museen           https://digi.ub.uni-heidelberg.de/de/hai/index.html

      – Bilddatenbank des Kunsthistorische Instituts (GeschKult, FU)
                https://www.geschkult.fu-berlin.de/e/khi/ressourcen/diathek/digitale_diathek/index.html
      – Epigraphic Database Heidelberg
                https://edh.ub.uni-heidelberg.de/

      – Ubi Erat Lupa  – Bilddatenbank zu antiken Steindenkmälern
                https://lupa.at/
      – Hethitologie-Portal Mainz
                https://hethport.uni-wuerzburg.de
      – Altägyptische Kursivschriften und Digitale Paläographie (AKU-PAL)
                https://aku-pal.uni-mainz.de/graphemes
      – Text Database and Dictionary of Classic Mayan (German and Spanish)
                https://www.classicmayan.org

    • 19305811 Seminar
      Seminar: Contributions to Software Engineering (Lutz Prechelt)
      Schedule: Do 16:00-18:00 (Class starts on: 2025-10-23)
      Location: T9/049 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Target group

      Students of Computer Science (also Minor).

      In case you are interested, please contact an adecuate group member with a topic suggestion or request.

      As this lecture is offered continuously, attendance may also start any time during the semester.

      Requirements

      Any computer science student having attended the lecture Software Engineering (Softwaretechnik).

      It may become necessary to deal with materials from the lecture Empirical Evaluation in Informatics (Empirische Bewertung in der Informatik).

      Homepage

      http://www.inf.fu-berlin.de/w/SE/SeminarBeitraegeZumSE

      Comments

      Content

      This is a reseach seminar: normally the presentations are supposed to advance current research projects. Thus, there are, generally speaking, three possible types of topics:

      • published or current research projects from one of the areas in which our software engineering group works
      • especially good specific research projects (or other knowledge) from other areas of software engineering or adjacent areas of computer science
      • basis topics from important areas of software engineering or adjacent disciplines such as psychology, sociology, pedagogics, economics as well as their methods.

      There is no exact restriction of topics though; almost anything is possible.

      Suggested reading

      Je nach Wahl des Vortragsthemas

    • 19320811 Seminar
      Seminar: PQC - Selected Subjects of IT Security (Marian Margraf)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: T9/SR 006 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Unverbindliche Liste von Themenideen zur Orientierung (wird voraussichtlich bis Semesterbeginn noch überarbeitet):

      • Verfahren
      • NIST-Selected:
      • ML-KEM/CRYSTALS-Kyber (Lattice-based KEM)
      • Sphincs+ (Hash-based Signatures)
      • CRYSTALS-Dilithium (Lattice-based Signatures)
      • FALCON (Lattice-based Signatures)
      • HQC (Code-based KEM)
      • NIST-Finalists:
      • Classic McEliece (Code-based KEM)
      • Broken Schemes:
      • Rainbow (Mulivariate Signatures)
      • SIKE (Isogeny-based KEM)

      jeweils:

      • Funktionsweise
      • zugrundeliegende Probleme
      • Sicherheitsbeweise
      • Hybride Verfahren
      • Transformationen

       

      Grober Ablaufplan (Änderungen möglich)

      • Themenvorstellung und -Vergabe in den ersten drei Wochen
      • Ende November Präsentation des Zwischenstands
      • Dezember / Januar Vorträge
      • Anfang Februar Abgabe Ausarbeitung

      Comments

      Selected subjects of IT security

      In summer 2018 the seminar will deal with quantum computer resistant cryptanalytics. In particular we will discuss selected chapters from "Post-Quantum Cryptography" by Daniel J. Bernstein, Johannes Buchmann and Erik Dahmen (Eds). Contents of the seminar are:

      • Abilities of quantum computers
      • Quantum algorithms
      • Cryptographic hash systems
      • Grid-based cryptography
      • Multivariate cryptography
      • Code-based cryptography
      • Cryptoanalysis of quantum computer resistant procedures

      Knowledge in the areas of IT security and cryptography is obligatory.

      Suggested reading

      Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (Eds.): Post-Quantum Cryptography.

    • 19328217 Seminar / Undergraduate Course
      Seminar/Proseminar: New Trends in Information Systems (Agnès Voisard)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/053 Seminarraum (Takustr. 9)

      Comments

      This seminar aims at studying recent trends in data management. Among others, we will look at two emerging topics, namely Location-Based Services (LBS) and Event-Based Services (EBS).

      Event-based Systems (EBS) are part of many current applications such as business activity monitoring, stock tickers, facility management, data streaming, or security. In the past years, the topic has gained increasing attention from both the industrial and the academic community. Current research concentrates of diverse aspects that range from event capture (incoming data) to response triggering. This seminar aims at studying some of the current trends in Event-based Systems with a strong focus on models and design. Location-based services are now often part of every day's life through applications such as navigation assistants in the public or private transportation domain. The underlying technology deals with many different aspects, such as location detection, information retrieval, or privacy. More recently, aspects such as user context and preferences were considered in order to send users more personalized information.

      A solid background in databases is required, typically a database course at a bachelor level.

      Suggested reading

      Wird bekannt gegeben.

    • 19334617 Seminar / Undergraduate Course
      Seminar/Proseminar: Beyond LLMs: Recent Breakthroughs in AI (Tim Landgraf)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/049 Seminarraum (Takustr. 9)
    • 19335011 Seminar
      Seminar: Networks, dynamic models and ML for data integration in the life sciences (Katharina Baum)
      Schedule: Di 14:00-15:30, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: T9/051 Seminarraum (Takustr. 9)

      Comments

      Research seminar of the group Data Integration in the Life Sciences (DILiS). Also open for seminar participation in the Master's program, online participation possible. Please refer to the current schedule on the whiteboard!

      The seminar offers space for the discussion of advanced and integrative data analysis techniques, in particular presentations and discussion of ongoing or planned research projects, news from conferences, review and discussion of current literature and discussion of possible future teaching formats and content, and presentations, as well as final presentations on theses or project seminars. The seminar language is mostly English. Interested students are welcome to attend and drop in without obligation or present a topic of their own choice of interest to the working group as in a usual seminar. Please note: Individual dates may be canceled or postponed. Please contact me in case of questions (katharina.baum@fu-berlin.de)!

  • Academic Work in Applied Computer Science B

    0089cA1.26
    • 19303811 Seminar
      Project seminar: Computer science and archaeology (Agnès Voisard)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: T9/046 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Requirement

      ALP I-III, Foundations of Datenbase Systems, good programming knowledge.

      Comments

      Research Seminar: Computer Science and Archaeology

      Course Description

      This research seminar brings together students of Informatics and Ancient Studies to explore the application of computational methods to archaeological questions. The research seminar will be a hands-on approach to digital cultural heritage methods, such as spatial analysis, 3D reconstruction, data mining and the digital processing of archaeological artefacts. Examples of datasets will include, but not be limited to, pottery, stone tools, inscriptions, clay tablets, and landscapes.

      A central goal of the seminar is to encourage interdisciplinary collaboration, with students working in pairs — ideally combining a Computer Science student with an Ancient Studies student. Each team will develop and carry out a small research project that combines technical tools with archaeological data, methods, or research questions.

      Topics include, but not limited to:

      – 3D analysis of archaeological artifacts and architecture
      – Geographic Information Systems (GIS) and spatial data analysis
      - Machine learning and computer vision for artifact classification
      – Usage of databases and digital documentation of excavation data
      – OCR/HTR for script in 3D like inscriptions or clay tablets

      Students from Informatics will gain experience applying computational techniques in a humanities context, while students from Ancient Studies will be introduced to digital tools and approaches that support archaeological research.

      No prior coding experience is required for Ancient Studies students, and no background in archaeology is assumed for Computer Science students.

      The seminar is jointly supervised by the Institute of Computer Science and the Archaeoinformatics group of the Institute of Computational Ancient Studies (CompAS) at Freie Universität Berlin, ensuring balanced guidance across disciplines.

      Learning Objectives

      – Understand interdisciplinary challenges and opportunities in digital archaeology

      – Learn to apply and assess computational tools for cultural heritage data

      – Develop and present a collaborative, project-based research outcome

      – Gain insights into current digital humanities and digital archaeology practices

       

       

       

       

      Suggested reading

      Literature and Data Sources:
       

      Open Access if not stated otherwise:


      – ACM Journal on Computing and Cultural Heritage
                https://dl.acm.org/journal/jocch
      – De Gruyter Brill on Open Archaeology (OPAR)
                https://www.degruyterbrill.com/journal/key/opar/html
      – Elsevir Journal of Archaeological Science (JAS)
                https://www.sciencedirect.com/journal/journal-of-archaeological-science

      – Journal of Computer Applications in Archaeology (JCAA)
                 https://journal.caa-international.org/
      – Journal of Open Archaeological Data (JOAD)
                 https://openarchaeologydata.metajnl.com/
      – Journal of Open Humanities Data (JOHD)
                 https://openhumanitiesdata.metajnl.com/


      Survey articles and Books:

      – Advances in digital pottery analysis
                https://doi.org/10.1515/itit-2022-0006
      – Digital Assyriology—Advances in Visual Cuneiform Analysis
                https://doi.org/10.1145/3491239
      – Machine Learning for Ancient Languages: A Survey

                https://doi.org/10.1162/coli_a_00481
      – Airborne laser scanning raster data visualization. A Guide to Good Practice
                https://doi.org/10.3986/9789612549848
      – Digital Humanities, Eine Einführung (German, no Open Acces)
                https://link.springer.com/book/9783476047687
      – New Technologies for Archaeology, Multidisciplinary Investigations in Palpa and Nasca,   Peru (no Open Acces) https://doi.org/10.1007/978-3-540-87438-6
      – Digging in documents: using text mining to access the hidden knowledge in Dutch archaeological excavation reports https://hdl.handle.net/1887/3274287

      Databases (related to research partners):

       

      – Heidelberg Objekt- und Multimediadatenbank (HeidICON)
                https://heidicon.ub.uni-heidelberg.de
      – Kooperative Erschließung und Nutzung der Objektdaten von Münzsammlungen
                https://www.kenom.de/
      – Art Institute of Chicago (API)
                https://api.artic.edu/docs/
      – FactGrid, a database for historical research
                https://database.factgrid.de/wiki/Main_Page
      – Research infrastructures of the German Archaeological Institute (DAI), multiple DBs:
                https://idai.world
      – Heidelberg Accession Index (HAI): Zugangsbücher und Bestandsverzeichnisse     deutscher Sammlungen und Museen           https://digi.ub.uni-heidelberg.de/de/hai/index.html

      – Bilddatenbank des Kunsthistorische Instituts (GeschKult, FU)
                https://www.geschkult.fu-berlin.de/e/khi/ressourcen/diathek/digitale_diathek/index.html
      – Epigraphic Database Heidelberg
                https://edh.ub.uni-heidelberg.de/

      – Ubi Erat Lupa  – Bilddatenbank zu antiken Steindenkmälern
                https://lupa.at/
      – Hethitologie-Portal Mainz
                https://hethport.uni-wuerzburg.de
      – Altägyptische Kursivschriften und Digitale Paläographie (AKU-PAL)
                https://aku-pal.uni-mainz.de/graphemes
      – Text Database and Dictionary of Classic Mayan (German and Spanish)
                https://www.classicmayan.org

    • 19305811 Seminar
      Seminar: Contributions to Software Engineering (Lutz Prechelt)
      Schedule: Do 16:00-18:00 (Class starts on: 2025-10-23)
      Location: T9/049 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Target group

      Students of Computer Science (also Minor).

      In case you are interested, please contact an adecuate group member with a topic suggestion or request.

      As this lecture is offered continuously, attendance may also start any time during the semester.

      Requirements

      Any computer science student having attended the lecture Software Engineering (Softwaretechnik).

      It may become necessary to deal with materials from the lecture Empirical Evaluation in Informatics (Empirische Bewertung in der Informatik).

      Homepage

      http://www.inf.fu-berlin.de/w/SE/SeminarBeitraegeZumSE

      Comments

      Content

      This is a reseach seminar: normally the presentations are supposed to advance current research projects. Thus, there are, generally speaking, three possible types of topics:

      • published or current research projects from one of the areas in which our software engineering group works
      • especially good specific research projects (or other knowledge) from other areas of software engineering or adjacent areas of computer science
      • basis topics from important areas of software engineering or adjacent disciplines such as psychology, sociology, pedagogics, economics as well as their methods.

      There is no exact restriction of topics though; almost anything is possible.

      Suggested reading

      Je nach Wahl des Vortragsthemas

    • 19320811 Seminar
      Seminar: PQC - Selected Subjects of IT Security (Marian Margraf)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: T9/SR 006 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Unverbindliche Liste von Themenideen zur Orientierung (wird voraussichtlich bis Semesterbeginn noch überarbeitet):

      • Verfahren
      • NIST-Selected:
      • ML-KEM/CRYSTALS-Kyber (Lattice-based KEM)
      • Sphincs+ (Hash-based Signatures)
      • CRYSTALS-Dilithium (Lattice-based Signatures)
      • FALCON (Lattice-based Signatures)
      • HQC (Code-based KEM)
      • NIST-Finalists:
      • Classic McEliece (Code-based KEM)
      • Broken Schemes:
      • Rainbow (Mulivariate Signatures)
      • SIKE (Isogeny-based KEM)

      jeweils:

      • Funktionsweise
      • zugrundeliegende Probleme
      • Sicherheitsbeweise
      • Hybride Verfahren
      • Transformationen

       

      Grober Ablaufplan (Änderungen möglich)

      • Themenvorstellung und -Vergabe in den ersten drei Wochen
      • Ende November Präsentation des Zwischenstands
      • Dezember / Januar Vorträge
      • Anfang Februar Abgabe Ausarbeitung

      Comments

      Selected subjects of IT security

      In summer 2018 the seminar will deal with quantum computer resistant cryptanalytics. In particular we will discuss selected chapters from "Post-Quantum Cryptography" by Daniel J. Bernstein, Johannes Buchmann and Erik Dahmen (Eds). Contents of the seminar are:

      • Abilities of quantum computers
      • Quantum algorithms
      • Cryptographic hash systems
      • Grid-based cryptography
      • Multivariate cryptography
      • Code-based cryptography
      • Cryptoanalysis of quantum computer resistant procedures

      Knowledge in the areas of IT security and cryptography is obligatory.

      Suggested reading

      Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (Eds.): Post-Quantum Cryptography.

    • 19328217 Seminar / Undergraduate Course
      Seminar/Proseminar: New Trends in Information Systems (Agnès Voisard)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/053 Seminarraum (Takustr. 9)

      Comments

      This seminar aims at studying recent trends in data management. Among others, we will look at two emerging topics, namely Location-Based Services (LBS) and Event-Based Services (EBS).

      Event-based Systems (EBS) are part of many current applications such as business activity monitoring, stock tickers, facility management, data streaming, or security. In the past years, the topic has gained increasing attention from both the industrial and the academic community. Current research concentrates of diverse aspects that range from event capture (incoming data) to response triggering. This seminar aims at studying some of the current trends in Event-based Systems with a strong focus on models and design. Location-based services are now often part of every day's life through applications such as navigation assistants in the public or private transportation domain. The underlying technology deals with many different aspects, such as location detection, information retrieval, or privacy. More recently, aspects such as user context and preferences were considered in order to send users more personalized information.

      A solid background in databases is required, typically a database course at a bachelor level.

      Suggested reading

      Wird bekannt gegeben.

    • 19334617 Seminar / Undergraduate Course
      Seminar/Proseminar: Beyond LLMs: Recent Breakthroughs in AI (Tim Landgraf)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/049 Seminarraum (Takustr. 9)
    • 19335011 Seminar
      Seminar: Networks, dynamic models and ML for data integration in the life sciences (Katharina Baum)
      Schedule: Di 14:00-15:30, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: T9/051 Seminarraum (Takustr. 9)

      Comments

      Research seminar of the group Data Integration in the Life Sciences (DILiS). Also open for seminar participation in the Master's program, online participation possible. Please refer to the current schedule on the whiteboard!

      The seminar offers space for the discussion of advanced and integrative data analysis techniques, in particular presentations and discussion of ongoing or planned research projects, news from conferences, review and discussion of current literature and discussion of possible future teaching formats and content, and presentations, as well as final presentations on theses or project seminars. The seminar language is mostly English. Interested students are welcome to attend and drop in without obligation or present a topic of their own choice of interest to the working group as in a usual seminar. Please note: Individual dates may be canceled or postponed. Please contact me in case of questions (katharina.baum@fu-berlin.de)!

  • Current research topics in Applied Computer Science

    0089cA1.27
    • 19320701 Lecture
      Secure Software Engineering (Jörn Eichler)
      Schedule: Fr 10:00-12:00 (Class starts on: 2025-10-17)
      Location: T9/SR 005 Übungsraum (Takustr. 9)

      Additional information / Pre-requisites

      The goal of this lecture is to teach principles, methods and tools for the development of secure software applications. To this end, basic concepts are first introduced. This is followed by process models for developing secure software and evaluating the maturity of development processes. Along the phases or process groups of software development, central principles, methods and tools are then introduced and explained. Special attention is given to threat and risk analysis, security requirements, principles and patterns for designing secure software applications, secure and insecure software implementations, security tests and evaluation of the security properties of software applications.

      Comments

      Secure software engineering joins two important fields: Software engineering and information security. software engineering is the systematic use of principles, methods and tools to develop and deploy software. information security covers topics like confidentiality, integrity and availability of informations and data.

      Suggested reading

      - Claudia Eckert: IT-Sicherheit, 11. Auflage, De Gruyter Oldenbourg, 2023; - Ross Anderson: Security Engineering, 3. Auflage, Wiley, 2021. Weitere Literaturhinweise werden zu den einzelnen Themenblöcken bereitgestellt.

    • 19327201 Lecture
      Data compression (Heiko Schwarz)
      Schedule: Mo 14:00-16:00 (Class starts on: 2025-10-13)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      Data compression is a technology, which only enables a variety of applications in our information age. Even though the underlying technology is often hidden from the end user, we use data compression every day when we hear music, watch images and videos, or use applications on our smartphone.

      In this course, the fundamental and most often used approaches for data compression are introduced.  We discuss theoretical foundations as well as methods used in practice.

      The first part of the course deals with lossless compression, in which the original data can be reconstructed exactly. This part includes the following topics:

      • Unique decodability and prefix codes
      • Entropy and entropy rate as theoretical limits of lossless compression
      • Optimal codes, Huffman codes
      • Arithmetic coding
      • Lempel-Ziv coding
      • Linear prediction
      • Examples from text, image and audio compression

      In the second part of the course, we consider lossy compression, by which only an approximation of the original data can be reconstructed. This type of compression enables much higher compression rates and is the dominant form of compression for audio, image and video data. The second part of the course includes the following topics:

      • Scalar quantization, optimal scalar quantization
      • Theoretical limits of lossy compression: Rate distortion functions
      • Vector quantization
      • Predictive quantization
      • Transform coding
      • Examples from audio, image, and video compression

      Suggested reading

      • Sayood, K. (2018), “Introduction to Data Compression,” Morgan Kaufmann, Cambridge, MA.
      • Cover, T. M. and Thomas, J. A. (2006), “Elements of Information Theory,” John Wiley & Sons, New York.
      • Gersho, A. and Gray, R. M. (1992), “Vector Quantization and Signal Compression,” Kluwer Academic Publishers, Boston, Dordrecht, London.
      • Jayant, N. S. and Noll, P. (1994), “Digital Coding of Waveforms,” Prentice-Hall, Englewood Cliffs, NJ, USA.
      • Wiegand, T. and Schwarz, H. (2010), “Source Coding: Part I of Fundamentals of Source and Video Coding,” Foundations and Trends in Signal Processing, vol. 4, no. 1-2.

    • 19328301 Lecture
      Data Visualization (Claudia Müller-Birn)
      Schedule: Di 12:00-14:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: T9/SR 005 Übungsraum (Takustr. 9)

      Additional information / Pre-requisites

      Link to the course on the HCC-Website: https://www.mi.fu-berlin.de/en/inf/groups/hcc/teaching/winter_term_2025_26/course_data_visualization.html

      Comments

      The current rapid technological development requires the processing of large amounts of data of various kinds to make them usable by humans. This challenge affects many areas of life today, such as research, business, and politics. In these contexts, decision-makers use data visualizations to explain information and its relationships through graphical representations of data. This course aims to familiarize students with the principles, techniques, and methods in data visualization and provide practical skills for designing and implementing data visualizations.

      This course gives students a solid introduction to the fundamentals of data visualization with current insights from research and practice. By the end of the course, students will

      1. Be able to select and apply methods for designing visualizations based on a problem,
      2. know essential theoretical basics of visualization for graphical perception and cognition,
      3. know and be able to select visualization approaches and their advantages and disadvantages,
      4. be able to evaluate visualization solutions critically, and
      5. have acquired practical skills for implementing visualizations.

      This course is intended for students interested in using data visualization in their work and students who want to develop visualization software. Basic knowledge of programming (HTML, CSS, Javascript, Python) and data analysis (e.g., R) is helpful.

      In addition to participating in class discussions, students will complete several programming and data analysis assignments. In a mini-project, students work on a given problem. Finally, we expect students to document and present their assignments and mini-project in a reproducible manner.

      Please note that the course will focus on how data is visually coded and presented for analysis after the data structure and its content are known. We do not cover exploratory analysis methods for discovering insights in data are not the focus of the course.

      Suggested reading

      Textbook

      Munzner, Tamara. Visualization analysis and design. AK Peters/CRC Press, 2014.

      Additional Literature

      Kirk, Andy: Data visualisation: A handbook for data driven design. Sage. 2016.

      Yau, Nathan: Visualize This: The FlowingData Guide to Design, Visualization, and Statistics. Wiley Publishing, Inc. 2011.

      Spence, Robert: Information Visualization: Design for Interaction. Pearson. 2007.

    • 19328601 Lecture
      Cryptocurrencies and Blockchain (Katinka Wolter)
      Schedule: Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: , T9/051 Seminarraum

      Comments

      We will study the history, technology and applications of cryptocurrencies and blockchain.

      Suggested reading

      Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction, by Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, Steven Goldfeder

    • 19334301 Lecture
      Advanced Robotics (Daniel Göhring)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      The lecture "Advanced Robotics" complements the lecture "Introduction to Robotics" and is for students who are familiar with basic concepts of robotics and the robot operating system ROS. Algorithms will be implemented in ROS using real data from autonomous vehicles and via written examples.

      The following topics will be covered (variations are possible):

      • Coordinate Systems, Representations, Kinematic Chains
      • Denavit Hartenberg 
      • Jacobian Matrix and Inverse Kinematics
      • Particle Filters
      • Simultaneous localization and mapping
      • Splines
      • Hierarchical Planning
      • ARA, D*, probabilistic planners
      • Reinforcement Learning
      • Model Predictive Control
      • Stereo Matching with SIFT-Features and Ransac 
      • Semi-global Matching
      • Visual Odometry / Optical Flow

    • 19320702 Practice seminar
      Practice seminar for Secure Software Engineering (Jörn Eichler)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: T9/SR 005 Übungsraum (Takustr. 9)
    • 19327202 Practice seminar
      Practice seminar for Data Compression (Heiko Schwarz)
      Schedule: Mo 12:00-14:00 (Class starts on: 2025-10-13)
      Location: T9/046 Seminarraum (Takustr. 9)
    • 19328302 Practice seminar
      Data Visualization (Malte Heiser)
      Schedule: Do 08:00-10:00, Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: T9/SR 005 Übungsraum (Takustr. 9)
    • 19328602 Practice seminar
      Practice Session on Cryptocurrencies (Justus Purat)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: T9/051 Seminarraum (Takustr. 9)
    • 19334302 Practice seminar
      Practice Seminar for Advanced Robotics (Daniel Göhring)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
  • Special Aspects of Applied Computer Science

    0089cA1.28
    • 19320701 Lecture
      Secure Software Engineering (Jörn Eichler)
      Schedule: Fr 10:00-12:00 (Class starts on: 2025-10-17)
      Location: T9/SR 005 Übungsraum (Takustr. 9)

      Additional information / Pre-requisites

      The goal of this lecture is to teach principles, methods and tools for the development of secure software applications. To this end, basic concepts are first introduced. This is followed by process models for developing secure software and evaluating the maturity of development processes. Along the phases or process groups of software development, central principles, methods and tools are then introduced and explained. Special attention is given to threat and risk analysis, security requirements, principles and patterns for designing secure software applications, secure and insecure software implementations, security tests and evaluation of the security properties of software applications.

      Comments

      Secure software engineering joins two important fields: Software engineering and information security. software engineering is the systematic use of principles, methods and tools to develop and deploy software. information security covers topics like confidentiality, integrity and availability of informations and data.

      Suggested reading

      - Claudia Eckert: IT-Sicherheit, 11. Auflage, De Gruyter Oldenbourg, 2023; - Ross Anderson: Security Engineering, 3. Auflage, Wiley, 2021. Weitere Literaturhinweise werden zu den einzelnen Themenblöcken bereitgestellt.

    • 19327201 Lecture
      Data compression (Heiko Schwarz)
      Schedule: Mo 14:00-16:00 (Class starts on: 2025-10-13)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      Data compression is a technology, which only enables a variety of applications in our information age. Even though the underlying technology is often hidden from the end user, we use data compression every day when we hear music, watch images and videos, or use applications on our smartphone.

      In this course, the fundamental and most often used approaches for data compression are introduced.  We discuss theoretical foundations as well as methods used in practice.

      The first part of the course deals with lossless compression, in which the original data can be reconstructed exactly. This part includes the following topics:

      • Unique decodability and prefix codes
      • Entropy and entropy rate as theoretical limits of lossless compression
      • Optimal codes, Huffman codes
      • Arithmetic coding
      • Lempel-Ziv coding
      • Linear prediction
      • Examples from text, image and audio compression

      In the second part of the course, we consider lossy compression, by which only an approximation of the original data can be reconstructed. This type of compression enables much higher compression rates and is the dominant form of compression for audio, image and video data. The second part of the course includes the following topics:

      • Scalar quantization, optimal scalar quantization
      • Theoretical limits of lossy compression: Rate distortion functions
      • Vector quantization
      • Predictive quantization
      • Transform coding
      • Examples from audio, image, and video compression

      Suggested reading

      • Sayood, K. (2018), “Introduction to Data Compression,” Morgan Kaufmann, Cambridge, MA.
      • Cover, T. M. and Thomas, J. A. (2006), “Elements of Information Theory,” John Wiley & Sons, New York.
      • Gersho, A. and Gray, R. M. (1992), “Vector Quantization and Signal Compression,” Kluwer Academic Publishers, Boston, Dordrecht, London.
      • Jayant, N. S. and Noll, P. (1994), “Digital Coding of Waveforms,” Prentice-Hall, Englewood Cliffs, NJ, USA.
      • Wiegand, T. and Schwarz, H. (2010), “Source Coding: Part I of Fundamentals of Source and Video Coding,” Foundations and Trends in Signal Processing, vol. 4, no. 1-2.

    • 19328301 Lecture
      Data Visualization (Claudia Müller-Birn)
      Schedule: Di 12:00-14:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: T9/SR 005 Übungsraum (Takustr. 9)

      Additional information / Pre-requisites

      Link to the course on the HCC-Website: https://www.mi.fu-berlin.de/en/inf/groups/hcc/teaching/winter_term_2025_26/course_data_visualization.html

      Comments

      The current rapid technological development requires the processing of large amounts of data of various kinds to make them usable by humans. This challenge affects many areas of life today, such as research, business, and politics. In these contexts, decision-makers use data visualizations to explain information and its relationships through graphical representations of data. This course aims to familiarize students with the principles, techniques, and methods in data visualization and provide practical skills for designing and implementing data visualizations.

      This course gives students a solid introduction to the fundamentals of data visualization with current insights from research and practice. By the end of the course, students will

      1. Be able to select and apply methods for designing visualizations based on a problem,
      2. know essential theoretical basics of visualization for graphical perception and cognition,
      3. know and be able to select visualization approaches and their advantages and disadvantages,
      4. be able to evaluate visualization solutions critically, and
      5. have acquired practical skills for implementing visualizations.

      This course is intended for students interested in using data visualization in their work and students who want to develop visualization software. Basic knowledge of programming (HTML, CSS, Javascript, Python) and data analysis (e.g., R) is helpful.

      In addition to participating in class discussions, students will complete several programming and data analysis assignments. In a mini-project, students work on a given problem. Finally, we expect students to document and present their assignments and mini-project in a reproducible manner.

      Please note that the course will focus on how data is visually coded and presented for analysis after the data structure and its content are known. We do not cover exploratory analysis methods for discovering insights in data are not the focus of the course.

      Suggested reading

      Textbook

      Munzner, Tamara. Visualization analysis and design. AK Peters/CRC Press, 2014.

      Additional Literature

      Kirk, Andy: Data visualisation: A handbook for data driven design. Sage. 2016.

      Yau, Nathan: Visualize This: The FlowingData Guide to Design, Visualization, and Statistics. Wiley Publishing, Inc. 2011.

      Spence, Robert: Information Visualization: Design for Interaction. Pearson. 2007.

    • 19328601 Lecture
      Cryptocurrencies and Blockchain (Katinka Wolter)
      Schedule: Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: , T9/051 Seminarraum

      Comments

      We will study the history, technology and applications of cryptocurrencies and blockchain.

      Suggested reading

      Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction, by Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, Steven Goldfeder

    • 19334301 Lecture
      Advanced Robotics (Daniel Göhring)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      The lecture "Advanced Robotics" complements the lecture "Introduction to Robotics" and is for students who are familiar with basic concepts of robotics and the robot operating system ROS. Algorithms will be implemented in ROS using real data from autonomous vehicles and via written examples.

      The following topics will be covered (variations are possible):

      • Coordinate Systems, Representations, Kinematic Chains
      • Denavit Hartenberg 
      • Jacobian Matrix and Inverse Kinematics
      • Particle Filters
      • Simultaneous localization and mapping
      • Splines
      • Hierarchical Planning
      • ARA, D*, probabilistic planners
      • Reinforcement Learning
      • Model Predictive Control
      • Stereo Matching with SIFT-Features and Ransac 
      • Semi-global Matching
      • Visual Odometry / Optical Flow

    • 19320702 Practice seminar
      Practice seminar for Secure Software Engineering (Jörn Eichler)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: T9/SR 005 Übungsraum (Takustr. 9)
    • 19327202 Practice seminar
      Practice seminar for Data Compression (Heiko Schwarz)
      Schedule: Mo 12:00-14:00 (Class starts on: 2025-10-13)
      Location: T9/046 Seminarraum (Takustr. 9)
    • 19328302 Practice seminar
      Data Visualization (Malte Heiser)
      Schedule: Do 08:00-10:00, Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: T9/SR 005 Übungsraum (Takustr. 9)
    • 19328602 Practice seminar
      Practice Session on Cryptocurrencies (Justus Purat)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: T9/051 Seminarraum (Takustr. 9)
    • 19334302 Practice seminar
      Practice Seminar for Advanced Robotics (Daniel Göhring)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
  • Advanced Topics in Data Management

    0089cA1.29
    • 19304801 Lecture
      Geospatial Databases (Agnès Voisard)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: T9/046 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Zielgruppe:

      Studierende im Masterstudiengang Voraussetzungen: Vorlesung: Einf. in Datenbanksysteme

      Comments

      The goal of this course is to acquire the background of spatial databases, the kernel of Geographic Systems. The major aspects that will be handled are: modeling and querying geospatial information, spatial access methods (SAMs), data representation, basic operations (mostly from computational geometry), and optimization. Insights into current applications such as location-based services (e.g., navigation systems) will also be given. Knowledge in databases is necessary. This course encompasses: formal lectures, exercises, as well as a practical project with PostGIS.
       

      Suggested reading

      Handouts are enough to understand the course.

      The following book will be mostly used: P. Rigaux, M. Scholl, A. Voisard.Spatial Databases - With Application to GIS. Morgan Kaufmann, May 2001. 432 p. (copies in the main library)

    • 19304802 Practice seminar
      Practice seminar for Geospatial Databases (Agnès Voisard)
      Schedule: Do 14:00-16:00 (Class starts on: 2025-10-16)
      Location: A7/SR 031 (Arnimallee 7)
  • Special Aspects of Software Development

    0089cA1.30
    • 19320701 Lecture
      Secure Software Engineering (Jörn Eichler)
      Schedule: Fr 10:00-12:00 (Class starts on: 2025-10-17)
      Location: T9/SR 005 Übungsraum (Takustr. 9)

      Additional information / Pre-requisites

      The goal of this lecture is to teach principles, methods and tools for the development of secure software applications. To this end, basic concepts are first introduced. This is followed by process models for developing secure software and evaluating the maturity of development processes. Along the phases or process groups of software development, central principles, methods and tools are then introduced and explained. Special attention is given to threat and risk analysis, security requirements, principles and patterns for designing secure software applications, secure and insecure software implementations, security tests and evaluation of the security properties of software applications.

      Comments

      Secure software engineering joins two important fields: Software engineering and information security. software engineering is the systematic use of principles, methods and tools to develop and deploy software. information security covers topics like confidentiality, integrity and availability of informations and data.

      Suggested reading

      - Claudia Eckert: IT-Sicherheit, 11. Auflage, De Gruyter Oldenbourg, 2023; - Ross Anderson: Security Engineering, 3. Auflage, Wiley, 2021. Weitere Literaturhinweise werden zu den einzelnen Themenblöcken bereitgestellt.

    • 19335201 Lecture
      Cybersecurity and AI III (Gerhard Wunder)
      Schedule: Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: T9/053 Seminarraum (Takustr. 9)
    • 19320702 Practice seminar
      Practice seminar for Secure Software Engineering (Jörn Eichler)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: T9/SR 005 Übungsraum (Takustr. 9)
    • 19335202 Practice seminar
      Practice seminar for Cybersecurity and AI III (Gerhard Wunder)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: A7/SR 031 (Arnimallee 7)
  • Fundamentals of IT Project Management

    0159cA2.6
    • 19334806 Seminar-style instruction
      Project management in agile environments part 1 (Matthias Horn)
      Schedule: Mo 08:00-10:00, Fr 16:00-18:00 (Class starts on: 2025-10-13)
      Location: T9/SR 006 Seminarraum (Takustr. 9)

      Comments

      Goals: The students understand several different models of scaled agile software development, that is, agile development encompassing multiple cooperating teams. They understand basic and intermediate methods of hybrid, predictive, and adaptive project management in such agile environments and are able to apply them. They can design a project plan and validate it with suitable methods. They can participate in the project management team of such a hybrid effort and take responsibility for substantial parts of the project management, including managing staff. They can lead a simple project alone.

  • Advanced Algorithms

    0089cA2.1
    • 19303501 Lecture
      Advanced Algorithms (Helmut Alt)
      Schedule: Mo 10:00-12:00, Fr 10:00-12:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-13)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Additional information / Pre-requisites

      Target audience

      All Master and Bachelor students who are interested in algorithms.

      Prerequisites

      Basic familiarity with the design and analysis of algorithms.

      Comments

      The class focuses on topics such as

      • general principles of algorithm design,
      • network flows,
      • number-theoretic algorithms (including the RSA crypto system),
      • string matching,
      • NP-completeness,
      • approximation algorithms for hard problems,
      • arithmetic algorithms and circuits, fast fourier transform.

      Suggested reading

      • Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, 2nd Ed. McGraw-Hill 2001
      • Kleinberg, Tardos: Algorithm Design Addison-Wesley 2005.

    • 19303502 Practice seminar
      Practice seminar for Advanced Algorithms (Helmut Alt)
      Schedule: Mi 08:00-10:00, Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: T9/046 Seminarraum (Takustr. 9)
  • Software Project: Theoretical Computer Science A

    0089cA2.10
    • 19308312 Project Seminar
      Implementation Project: Applications of Algorithms (Günther Rothe)
      Schedule: Di 08:00-10:00 (Class starts on: 2025-10-14)
      Location: T9/SR 006 Seminarraum (Takustr. 9)

      Comments

      Contents

      We choose a typical application area of algorithms, usually for geometric problems, and develop software solutions for it, e.g., computer graphics (representation of objects in a computer, projections, hidden edge and surface removal, lighting, raytracing), computer vision (image processing, filtering, projections, camera calibration, stereo-vision) or pattern recognition (classification, searching).

      Prerequsitions

      Basic knowledge in design and anaylsis of algorithms.

      Suggested reading

      je nach Anwendungsgebiet

  • Software Project: Theoretical Computer Science B

    0089cA2.11
    • 19308312 Project Seminar
      Implementation Project: Applications of Algorithms (Günther Rothe)
      Schedule: Di 08:00-10:00 (Class starts on: 2025-10-14)
      Location: T9/SR 006 Seminarraum (Takustr. 9)

      Comments

      Contents

      We choose a typical application area of algorithms, usually for geometric problems, and develop software solutions for it, e.g., computer graphics (representation of objects in a computer, projections, hidden edge and surface removal, lighting, raytracing), computer vision (image processing, filtering, projections, camera calibration, stereo-vision) or pattern recognition (classification, searching).

      Prerequsitions

      Basic knowledge in design and anaylsis of algorithms.

      Suggested reading

      je nach Anwendungsgebiet

  • Academic Work in Theoretical Computer Science A

    0089cA2.12
    • 19320811 Seminar
      Seminar: PQC - Selected Subjects of IT Security (Marian Margraf)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: T9/SR 006 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Unverbindliche Liste von Themenideen zur Orientierung (wird voraussichtlich bis Semesterbeginn noch überarbeitet):

      • Verfahren
      • NIST-Selected:
      • ML-KEM/CRYSTALS-Kyber (Lattice-based KEM)
      • Sphincs+ (Hash-based Signatures)
      • CRYSTALS-Dilithium (Lattice-based Signatures)
      • FALCON (Lattice-based Signatures)
      • HQC (Code-based KEM)
      • NIST-Finalists:
      • Classic McEliece (Code-based KEM)
      • Broken Schemes:
      • Rainbow (Mulivariate Signatures)
      • SIKE (Isogeny-based KEM)

      jeweils:

      • Funktionsweise
      • zugrundeliegende Probleme
      • Sicherheitsbeweise
      • Hybride Verfahren
      • Transformationen

       

      Grober Ablaufplan (Änderungen möglich)

      • Themenvorstellung und -Vergabe in den ersten drei Wochen
      • Ende November Präsentation des Zwischenstands
      • Dezember / Januar Vorträge
      • Anfang Februar Abgabe Ausarbeitung

      Comments

      Selected subjects of IT security

      In summer 2018 the seminar will deal with quantum computer resistant cryptanalytics. In particular we will discuss selected chapters from "Post-Quantum Cryptography" by Daniel J. Bernstein, Johannes Buchmann and Erik Dahmen (Eds). Contents of the seminar are:

      • Abilities of quantum computers
      • Quantum algorithms
      • Cryptographic hash systems
      • Grid-based cryptography
      • Multivariate cryptography
      • Code-based cryptography
      • Cryptoanalysis of quantum computer resistant procedures

      Knowledge in the areas of IT security and cryptography is obligatory.

      Suggested reading

      Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (Eds.): Post-Quantum Cryptography.

    • 19335011 Seminar
      Seminar: Networks, dynamic models and ML for data integration in the life sciences (Katharina Baum)
      Schedule: Di 14:00-15:30, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: T9/051 Seminarraum (Takustr. 9)

      Comments

      Research seminar of the group Data Integration in the Life Sciences (DILiS). Also open for seminar participation in the Master's program, online participation possible. Please refer to the current schedule on the whiteboard!

      The seminar offers space for the discussion of advanced and integrative data analysis techniques, in particular presentations and discussion of ongoing or planned research projects, news from conferences, review and discussion of current literature and discussion of possible future teaching formats and content, and presentations, as well as final presentations on theses or project seminars. The seminar language is mostly English. Interested students are welcome to attend and drop in without obligation or present a topic of their own choice of interest to the working group as in a usual seminar. Please note: Individual dates may be canceled or postponed. Please contact me in case of questions (katharina.baum@fu-berlin.de)!

  • Academic Work in Theoretical Computer Science B

    0089cA2.13
    • 19320811 Seminar
      Seminar: PQC - Selected Subjects of IT Security (Marian Margraf)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: T9/SR 006 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Unverbindliche Liste von Themenideen zur Orientierung (wird voraussichtlich bis Semesterbeginn noch überarbeitet):

      • Verfahren
      • NIST-Selected:
      • ML-KEM/CRYSTALS-Kyber (Lattice-based KEM)
      • Sphincs+ (Hash-based Signatures)
      • CRYSTALS-Dilithium (Lattice-based Signatures)
      • FALCON (Lattice-based Signatures)
      • HQC (Code-based KEM)
      • NIST-Finalists:
      • Classic McEliece (Code-based KEM)
      • Broken Schemes:
      • Rainbow (Mulivariate Signatures)
      • SIKE (Isogeny-based KEM)

      jeweils:

      • Funktionsweise
      • zugrundeliegende Probleme
      • Sicherheitsbeweise
      • Hybride Verfahren
      • Transformationen

       

      Grober Ablaufplan (Änderungen möglich)

      • Themenvorstellung und -Vergabe in den ersten drei Wochen
      • Ende November Präsentation des Zwischenstands
      • Dezember / Januar Vorträge
      • Anfang Februar Abgabe Ausarbeitung

      Comments

      Selected subjects of IT security

      In summer 2018 the seminar will deal with quantum computer resistant cryptanalytics. In particular we will discuss selected chapters from "Post-Quantum Cryptography" by Daniel J. Bernstein, Johannes Buchmann and Erik Dahmen (Eds). Contents of the seminar are:

      • Abilities of quantum computers
      • Quantum algorithms
      • Cryptographic hash systems
      • Grid-based cryptography
      • Multivariate cryptography
      • Code-based cryptography
      • Cryptoanalysis of quantum computer resistant procedures

      Knowledge in the areas of IT security and cryptography is obligatory.

      Suggested reading

      Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (Eds.): Post-Quantum Cryptography.

    • 19335011 Seminar
      Seminar: Networks, dynamic models and ML for data integration in the life sciences (Katharina Baum)
      Schedule: Di 14:00-15:30, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: T9/051 Seminarraum (Takustr. 9)

      Comments

      Research seminar of the group Data Integration in the Life Sciences (DILiS). Also open for seminar participation in the Master's program, online participation possible. Please refer to the current schedule on the whiteboard!

      The seminar offers space for the discussion of advanced and integrative data analysis techniques, in particular presentations and discussion of ongoing or planned research projects, news from conferences, review and discussion of current literature and discussion of possible future teaching formats and content, and presentations, as well as final presentations on theses or project seminars. The seminar language is mostly English. Interested students are welcome to attend and drop in without obligation or present a topic of their own choice of interest to the working group as in a usual seminar. Please note: Individual dates may be canceled or postponed. Please contact me in case of questions (katharina.baum@fu-berlin.de)!

  • Current Research Topics in Theoretical Computer Science

    0089cA2.3
    • 19320501 Lecture
      Quantenalgorithm and Cryptanalysis (Marian Margraf)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Comments

      The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

    • 19321101 Lecture
      Sorting (Wolfgang Mulzer)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-02-23)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Comments

      Sorting is a well-studied and fundmamental topic in computer science. We will study various perspectives on sorting, old and new.

      Suggested reading

      TBA

    • 19337401 Lecture
      Post Quantum Cryptography - the NIST algorithms (N.N.)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/SR 005 Übungsraum (Takustr. 9)

      Comments

      Post Quantum Cryptography - the NIST algorithms

      Course description:
      This course provides an in-depth study of the post-quantum cryptographic algorithms selected and evaluated by NIST. Students will explore the foundational mathematics, security assumptions, algorithmic designs, and practical implementation issues of cryptographic systems believed to be secure against quantum adversaries. Emphasis is placed on NIST's selected algorithms: KYBER (KEM), DILITHIUM (signatures), and SPHINCS+(stateless signatures), as well as alternate schemes such as Classic McEliece, BIKE, HQC, and Falcon.

      Learning Objectives:
      By the end of this course, students will be able to:

      • Describe the threat quantum computing poses to classical cryptography.
      • Explain the design principles of hash-based, code-based, multivariate, and lattice-based cryptography.
      • Analyze the security assumptions behind each NIST PQC algorithm family.
      • Compare performance and implementation trade-offs among leading PQC schemes.
      • Evaluate real-world deployment strategies and limitations for PQC.

       

    • 19320502 Practice seminar
      Practice seminar for Cryptanalysis (Marian Margraf)
      Schedule: Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: T9/055 Seminarraum (Takustr. 9)
    • 19321102 Practice seminar
      Practice seminar for Sorting (Wolfgang Mulzer)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-02-23)
      Location: A7/SR 031 (Arnimallee 7)

      Comments

      Übungen

    • 19337402 Practice seminar
      Tutorials for Post Quantum Cryptography - the NIST algorithms (N.N.)
      Schedule: Fr 08:00-10:00 (Class starts on: 2025-10-17)
      Location: T9/051 Seminarraum (Takustr. 9)
  • Special aspects of Theoretical Computer Science

    0089cA2.7
    • 19320501 Lecture
      Quantenalgorithm and Cryptanalysis (Marian Margraf)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Comments

      The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

    • 19321101 Lecture
      Sorting (Wolfgang Mulzer)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-02-23)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Comments

      Sorting is a well-studied and fundmamental topic in computer science. We will study various perspectives on sorting, old and new.

      Suggested reading

      TBA

    • 19327201 Lecture
      Data compression (Heiko Schwarz)
      Schedule: Mo 14:00-16:00 (Class starts on: 2025-10-13)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      Data compression is a technology, which only enables a variety of applications in our information age. Even though the underlying technology is often hidden from the end user, we use data compression every day when we hear music, watch images and videos, or use applications on our smartphone.

      In this course, the fundamental and most often used approaches for data compression are introduced.  We discuss theoretical foundations as well as methods used in practice.

      The first part of the course deals with lossless compression, in which the original data can be reconstructed exactly. This part includes the following topics:

      • Unique decodability and prefix codes
      • Entropy and entropy rate as theoretical limits of lossless compression
      • Optimal codes, Huffman codes
      • Arithmetic coding
      • Lempel-Ziv coding
      • Linear prediction
      • Examples from text, image and audio compression

      In the second part of the course, we consider lossy compression, by which only an approximation of the original data can be reconstructed. This type of compression enables much higher compression rates and is the dominant form of compression for audio, image and video data. The second part of the course includes the following topics:

      • Scalar quantization, optimal scalar quantization
      • Theoretical limits of lossy compression: Rate distortion functions
      • Vector quantization
      • Predictive quantization
      • Transform coding
      • Examples from audio, image, and video compression

      Suggested reading

      • Sayood, K. (2018), “Introduction to Data Compression,” Morgan Kaufmann, Cambridge, MA.
      • Cover, T. M. and Thomas, J. A. (2006), “Elements of Information Theory,” John Wiley & Sons, New York.
      • Gersho, A. and Gray, R. M. (1992), “Vector Quantization and Signal Compression,” Kluwer Academic Publishers, Boston, Dordrecht, London.
      • Jayant, N. S. and Noll, P. (1994), “Digital Coding of Waveforms,” Prentice-Hall, Englewood Cliffs, NJ, USA.
      • Wiegand, T. and Schwarz, H. (2010), “Source Coding: Part I of Fundamentals of Source and Video Coding,” Foundations and Trends in Signal Processing, vol. 4, no. 1-2.

    • 19335201 Lecture
      Cybersecurity and AI III (Gerhard Wunder)
      Schedule: Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: T9/053 Seminarraum (Takustr. 9)
    • 19337401 Lecture
      Post Quantum Cryptography - the NIST algorithms (N.N.)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/SR 005 Übungsraum (Takustr. 9)

      Comments

      Post Quantum Cryptography - the NIST algorithms

      Course description:
      This course provides an in-depth study of the post-quantum cryptographic algorithms selected and evaluated by NIST. Students will explore the foundational mathematics, security assumptions, algorithmic designs, and practical implementation issues of cryptographic systems believed to be secure against quantum adversaries. Emphasis is placed on NIST's selected algorithms: KYBER (KEM), DILITHIUM (signatures), and SPHINCS+(stateless signatures), as well as alternate schemes such as Classic McEliece, BIKE, HQC, and Falcon.

      Learning Objectives:
      By the end of this course, students will be able to:

      • Describe the threat quantum computing poses to classical cryptography.
      • Explain the design principles of hash-based, code-based, multivariate, and lattice-based cryptography.
      • Analyze the security assumptions behind each NIST PQC algorithm family.
      • Compare performance and implementation trade-offs among leading PQC schemes.
      • Evaluate real-world deployment strategies and limitations for PQC.

       

    • 19320502 Practice seminar
      Practice seminar for Cryptanalysis (Marian Margraf)
      Schedule: Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: T9/055 Seminarraum (Takustr. 9)
    • 19321102 Practice seminar
      Practice seminar for Sorting (Wolfgang Mulzer)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-02-23)
      Location: A7/SR 031 (Arnimallee 7)

      Comments

      Übungen

    • 19327202 Practice seminar
      Practice seminar for Data Compression (Heiko Schwarz)
      Schedule: Mo 12:00-14:00 (Class starts on: 2025-10-13)
      Location: T9/046 Seminarraum (Takustr. 9)
    • 19335202 Practice seminar
      Practice seminar for Cybersecurity and AI III (Gerhard Wunder)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: A7/SR 031 (Arnimallee 7)
    • 19337402 Practice seminar
      Tutorials for Post Quantum Cryptography - the NIST algorithms (N.N.)
      Schedule: Fr 08:00-10:00 (Class starts on: 2025-10-17)
      Location: T9/051 Seminarraum (Takustr. 9)
  • Cryptography and Security in Distributed Systems

    0089cA2.8
    • 19303601 Lecture
      Cryptography and Security in Distributed Systems (Volker Roth)
      Schedule: Mi 14:00-16:00, Do 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/SR 006 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Requirements: Participants must have a good mathematical understanding and good knowledge of computer security and networking.

      Comments

      This course gives an introduction to cryptography and cryptographic key management, as well as an introduction to cryptographic protocols and their application in the field of security in distributed systems. Relevant mathematical tools will be developed accordingly. In addition, the lecture addresses the importance of implementation details in the context of IT system security.

      Suggested reading

      • Jonathan Katz and Yehuda Lindell, Introduction to Modern Cryptography, 2008
      • Lindsay N. Childs, A Concrete Introduction to Higher Algebra. Springer Verlag, 1995.
      • Johannes Buchmann, Einfuehrung in die Kryptographie. Springer Verlag, 1999.

      Weitere noch zu bestimmende Literatur und Primärquellen.

    • 19303602 Practice seminar
      Übung zu Kryptographie und Sicherheit in Verteilten Systemen (Volker Roth)
      Schedule: Do 14:00-16:00 (Class starts on: 2025-10-16)
      Location: , T9/049 Seminarraum
  • Operating Systems

    0089cA3.1
    • 19312101 Lecture
      Systems Software (Barry Linnert)
      Schedule: Di 12:00-14:00, Mi 12:00-14:00, Do 10:00-12:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A7/SR 031 (Arnimallee 7)

      Additional information / Pre-requisites

      Language

      The course language is German as is the oral presentation of the lecturer, but the slides and all written material is available in English. You can always ask questions in English. The practice sheets and final exam are formulated in German as well as in English.

      Homepage

      https://www.inf.fu-berlin.de/w/SE/VorlesungBetriebssysteme2025

      Comments

      Operating systems tie together the execution of applications, user experience and usability with the management of computer hardware. Starting with the tasks an operating system has to perform and the requirements it has to meet, the most important aspects of design and development of modern operating systems will be introduced:

      • Structure and design of an operating system including historical summary, structures and philosophies of OS design and resources and resource management
      • Threads and processes including thread management
      • Scheduling including real-time scheduling
      • Process interaction and inter-process communication
      • Resource management including device operation, driver development, management and operation of input- and output devices
      • Memory management including address spaces and virtual memory
      • File system including management and operation of discs and memory hierarchy
      • Distributed operating systems including distributed architectures for resource management
      • Performance evaluation and modeling including overload detection and handling

      Modern operating systems provide examples for different aspects and current research will be introduced. The tutorials serve to reflect the topics dealt with in the lecture and to acquire experience by developing a small operating system.

      Suggested reading

      • A.S. Tanenbaum: Modern Operating Systems, 2nd Ed. Prentice-Hall, 2001
      • A. Silberschatz et al.: Operating Systems Concepts with Java, 6th Ed. Wiley, 2004

    • 19312102 Practice seminar
      Practice seminar for Systems Software (Barry Linnert)
      Schedule: Do 14:00-16:00 (Class starts on: 2025-10-16)
      Location: T9/046 Seminarraum (Takustr. 9)
  • Current Research Topics in Computer Systems

    0089cA3.10
    • 19328601 Lecture
      Cryptocurrencies and Blockchain (Katinka Wolter)
      Schedule: Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: , T9/051 Seminarraum

      Comments

      We will study the history, technology and applications of cryptocurrencies and blockchain.

      Suggested reading

      Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction, by Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, Steven Goldfeder

    • 19334301 Lecture
      Advanced Robotics (Daniel Göhring)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      The lecture "Advanced Robotics" complements the lecture "Introduction to Robotics" and is for students who are familiar with basic concepts of robotics and the robot operating system ROS. Algorithms will be implemented in ROS using real data from autonomous vehicles and via written examples.

      The following topics will be covered (variations are possible):

      • Coordinate Systems, Representations, Kinematic Chains
      • Denavit Hartenberg 
      • Jacobian Matrix and Inverse Kinematics
      • Particle Filters
      • Simultaneous localization and mapping
      • Splines
      • Hierarchical Planning
      • ARA, D*, probabilistic planners
      • Reinforcement Learning
      • Model Predictive Control
      • Stereo Matching with SIFT-Features and Ransac 
      • Semi-global Matching
      • Visual Odometry / Optical Flow

    • 19335201 Lecture
      Cybersecurity and AI III (Gerhard Wunder)
      Schedule: Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: T9/053 Seminarraum (Takustr. 9)
    • 19328602 Practice seminar
      Practice Session on Cryptocurrencies (Justus Purat)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: T9/051 Seminarraum (Takustr. 9)
    • 19334302 Practice seminar
      Practice Seminar for Advanced Robotics (Daniel Göhring)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
    • 19335202 Practice seminar
      Practice seminar for Cybersecurity and AI III (Gerhard Wunder)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: A7/SR 031 (Arnimallee 7)
  • Special Aspects of Computer Systems

    0089cA3.11
    • 19327201 Lecture
      Data compression (Heiko Schwarz)
      Schedule: Mo 14:00-16:00 (Class starts on: 2025-10-13)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      Data compression is a technology, which only enables a variety of applications in our information age. Even though the underlying technology is often hidden from the end user, we use data compression every day when we hear music, watch images and videos, or use applications on our smartphone.

      In this course, the fundamental and most often used approaches for data compression are introduced.  We discuss theoretical foundations as well as methods used in practice.

      The first part of the course deals with lossless compression, in which the original data can be reconstructed exactly. This part includes the following topics:

      • Unique decodability and prefix codes
      • Entropy and entropy rate as theoretical limits of lossless compression
      • Optimal codes, Huffman codes
      • Arithmetic coding
      • Lempel-Ziv coding
      • Linear prediction
      • Examples from text, image and audio compression

      In the second part of the course, we consider lossy compression, by which only an approximation of the original data can be reconstructed. This type of compression enables much higher compression rates and is the dominant form of compression for audio, image and video data. The second part of the course includes the following topics:

      • Scalar quantization, optimal scalar quantization
      • Theoretical limits of lossy compression: Rate distortion functions
      • Vector quantization
      • Predictive quantization
      • Transform coding
      • Examples from audio, image, and video compression

      Suggested reading

      • Sayood, K. (2018), “Introduction to Data Compression,” Morgan Kaufmann, Cambridge, MA.
      • Cover, T. M. and Thomas, J. A. (2006), “Elements of Information Theory,” John Wiley & Sons, New York.
      • Gersho, A. and Gray, R. M. (1992), “Vector Quantization and Signal Compression,” Kluwer Academic Publishers, Boston, Dordrecht, London.
      • Jayant, N. S. and Noll, P. (1994), “Digital Coding of Waveforms,” Prentice-Hall, Englewood Cliffs, NJ, USA.
      • Wiegand, T. and Schwarz, H. (2010), “Source Coding: Part I of Fundamentals of Source and Video Coding,” Foundations and Trends in Signal Processing, vol. 4, no. 1-2.

    • 19328601 Lecture
      Cryptocurrencies and Blockchain (Katinka Wolter)
      Schedule: Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: , T9/051 Seminarraum

      Comments

      We will study the history, technology and applications of cryptocurrencies and blockchain.

      Suggested reading

      Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction, by Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, Steven Goldfeder

    • 19334301 Lecture
      Advanced Robotics (Daniel Göhring)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/046 Seminarraum (Takustr. 9)

      Comments

      The lecture "Advanced Robotics" complements the lecture "Introduction to Robotics" and is for students who are familiar with basic concepts of robotics and the robot operating system ROS. Algorithms will be implemented in ROS using real data from autonomous vehicles and via written examples.

      The following topics will be covered (variations are possible):

      • Coordinate Systems, Representations, Kinematic Chains
      • Denavit Hartenberg 
      • Jacobian Matrix and Inverse Kinematics
      • Particle Filters
      • Simultaneous localization and mapping
      • Splines
      • Hierarchical Planning
      • ARA, D*, probabilistic planners
      • Reinforcement Learning
      • Model Predictive Control
      • Stereo Matching with SIFT-Features and Ransac 
      • Semi-global Matching
      • Visual Odometry / Optical Flow

    • 19335201 Lecture
      Cybersecurity and AI III (Gerhard Wunder)
      Schedule: Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: T9/053 Seminarraum (Takustr. 9)
    • 19327202 Practice seminar
      Practice seminar for Data Compression (Heiko Schwarz)
      Schedule: Mo 12:00-14:00 (Class starts on: 2025-10-13)
      Location: T9/046 Seminarraum (Takustr. 9)
    • 19328602 Practice seminar
      Practice Session on Cryptocurrencies (Justus Purat)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: T9/051 Seminarraum (Takustr. 9)
    • 19334302 Practice seminar
      Practice Seminar for Advanced Robotics (Daniel Göhring)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
    • 19335202 Practice seminar
      Practice seminar for Cybersecurity and AI III (Gerhard Wunder)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: A7/SR 031 (Arnimallee 7)
  • Microprocessor Lab

    0089cA3.2
    • 19310030 Internship
      Practical Project: Microprocessors (Marius Max Wawerek)
      Schedule: Di 14:00-16:00, Mi 12:00-14:00, Fr 14:00-16:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: T9/K63 Hardwarepraktikum (Takustr. 9)

      Additional information / Pre-requisites

      Important information about the course:
      The microprocessor practical course will be offered this semester with a joint theory session on Fridays, 2-4 p.m., and two independent practical exercise sessions:

      • Group A, Tuesdays, 2-4 p.m. Takustraße 9, Room K63
      • Group B, Wednesdays, 12-2 p.m. Takustraße 9, Room K63

      One of these practice dates must be chosen.

      Comments

      ATTENTION: Contrary to the schedule in the course catalog, this course does not have 3 mandatory dates, but only 2! See below for further information!

      The overwhelming majority of future computer systems will be characterized by communicating, embedded systems. These are found in machine controls, household appliances, motor vehicles, airplanes, intelligent buildings, etc. and will in future be increasingly integrated into networks such as the Internet.

      The internship will address the architecture of embedded systems and demonstrate the differences to traditional PC architectures (e.g., real-time capability, interaction with the environment) with practical examples. The internship is based on 16- and 32-bit microcontroller systems.

      The main focus of the internship is the following:

      •     register structures
      •     memory organization
      •     Hardware assembler and high-language programming
      •     I / O system and timer programming
      •     Interrupt system
      •     Watchdog logic
      •     Analog interface
      •     Bus system connection of components
      •     Communication (serial, CAN bus, Ethernet, radio and USB)
      •     Control of models and use of different sensors

      Suggested reading

      • Brian W. Kernighan, Dennis M. Ritchie: The C Programming Language, Second Edition, Prentice Hall, 1988.

  • Telematics

    0089cA3.5
    • 19305101 Lecture
      Telematics (Jochen Schiller)
      Schedule: Mo 14:00-16:00, Fr 14:00-16:00 (Class starts on: 2025-10-13)
      Location: T9/051 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Requirements: Basic understanding of computer networks, e.g., TI-III

       

      Comments

      Content

      Telematics = telecommunications + informatics (often also called computer networks) covers a wide spectrum of topics - from communication engineering to the WWW and advanced applications.

      The lecture addresses topics such as:

      • Basic background: protocols, services, models, communication standards;
      • Principles of communication engineering: signals, coding, modulation, media;
      • Data link layer: media access etc.;
      • Local networks: IEEE-Standards, Ethernet, bridges;
      • Network layer: routing and forwarding, Internet protocols (IPv4, IPv6);
      • Transport layer: quality of service, flow control, congestion control, TCP;
      • Internet: TCP/IP protocol suite;
      • Applications: WWW, security, network management;
      • New network concepts (QUIC etc.).

      At the End of this course, you should...

      • know how networks in general are organized
      • know what the Internet could be or is
      • understand how wired/wireless (see Mobile Communications) networks work
      • understand why/how protocols and layers are used
      • understand how e-mails, videos get to where you are
      • understand how operators operate real, big networks
      • understand the cooperation of web browsers with web servers
      • be aware of security issues when you use the network
      • be familiar with acronyms like: ALOHA, ARP, ATM, BGP, CDMA, CDN, CIDR, CSMA, DCCP, DHCP, ETSI, FDM, FDMA, FTP, HDLC, HTTP, ICMP, ICN, IEEE, IETF, IP, IMAP, ISP, ITU, ISO/OSI, LAN, LTE, MAC, MAN, MPLS, MTU, NAT, NTP, PCM, POTS, PPP, PSTN, P2P, QUIC, RARP, SCTP, SMTP, SNMP, TCP, TDM, TDMA, UDP, UMTS, VPN, WAN, ...

      Literature

      • A. Tanenbaum & D. Wetherall: Computer Networks (5th edition)
      • J. Kurose & K. Ross: Computer Networking (6th edition)
      • S. Keshav: Mathematical Foundations of Computer Networking (2012)
      • W. Stallings book, W. Goralski book 
      • IETF drafts and RFCs
      • IEEE 802 LAN/MAN standards

      Prerequisites

      As this is a Master Course you have to know the basics of computer networks already (e.g. from the OS&CN BSc course or any other basic networking course). That means you know what protocol stacks are, know the basic ideas behind TCP/IP, know layering principles, got a rough understanding of how the Internet works. This course will recap the basics but then proceed to the more advanced stuff.

      Resources & Organization

      The course comprises about 30 "lectures", 90 minutes each, following the inverted or flipped classroom principle. I.e. you will be able to access a video of the lecture before we discuss the content in class. To be able to discuss you have to watch the video BEFORE we meet! This is your main assignment - go through the video, prepare questions if something is not clear. During the meetings there will be a recap of the main ideas plus enough time to discuss each topic if necessary.

      Suggested reading

      • Larry Peterson, Bruce S. Davie: Computernetze - Ein modernes Lehrbuch, dpunkt Verlag, Heidelberg, 2000
      • Krüger, G., Reschke, D.: Lehr- und Übungsbuch Telematik, Fachbuchverlag Leipzig, 2000
      • Kurose, J. F., Ross, K. W.: Computer Networking: A Top-Down Approach Featuring the Internet, Addi-son-Wesley Publishing Company, Wokingham, England, 2001
      • Siegmund, G.: Technik der Netze, 4. Auflage, Hüthig Verlag, Heidelberg, 1999
      • Halsall, F.: Data Communi-cations, Computer Networks and Open Systems 4. Auflage, Addison-Wesley Publishing Company, Wokingham, England, 1996
      • Tanenbaum, A. S.: Computer Networks, 3. Auflage, Prentice Hall, Inc., New Jersey, 1996

    • 19305102 Practice seminar
      Practice seminar for Telematics (Jochen Schiller, Marius Max Wawerek)
      Schedule: Mo 16:00-18:00 (Class starts on: 2025-10-20)
      Location: T9/055 Seminarraum (Takustr. 9)
  • Software Project: Computer Systems A

    0089cA3.6
    • 19309212 Project Seminar
      SWP: Smart Home Demo Lab (Jochen Schiller, Marius Max Wawerek)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/K63 Hardwarepraktikum (Takustr. 9)

      Additional information / Pre-requisites

      In this course you will be expected to write code. The outcome of your software project should be a concrete contribution to the RIOT code base, and take the shape of one or more pull request(s) to the RIOT github (https://github.com/RIOT-OS/RIOT). Before you start coding, refer to the starting guide

      https://github.com/RIOT-OS/RIOT/wiki#wiki-start-the-riot

      Comments

      Softwareproject Smart Home Demo Lab

      In this course, students will work on topics related to the Smart Home Demo Lab of the Computer Systems & Telematics working group.

      The topics include:

      • Creation of a Smart Home ecosystem
      • Machine Learning (ML) based analysis of Smart Home datasets
      • Experiments with and Improvements of existing ML models
      • Design of Smart Home Usage scenarios
      • Development of your own (virtual) IoT device

      Participants will work in smaller groups (3-5 students), where each group will focus on a specific topic.

      Regarding Organization: The software project will take course throughout the whole lecture period. First a kick off meeting with all participants will be held. There all the different topics will be presented. Afterwards each student will hand in a list of topic priorities.

      The actual work on the topics will occur in multiple two week sprints. Finally at the end of the lecture period one overall final presentation will be held showing the results of all topics.

      Depending on the needs of the students the software project can be held in either German or English.

      Suggested reading

      • A. S. Tanenbaum, Modern Operating Systems, 3rd ed. Upper Saddle River, NJ, USA: Prentice Hall Press, 2007.
      • Shelby, Zach, and Carsten Bormann. 6LoWPAN: The wireless embedded Internet. Vol. 43. Wiley. com, 2011.
      • A. Dunkels, B. Gronvall, and T. Voigt, "Contiki - a lightweight and flexible operating system for tiny networked sensors." in LCN. IEEE Computer Society, 2004, pp. 455-462.
      • P. Levis, S. Madden, J. Polastre, R. Szewczyk, K. Whitehouse, A. Woo, D. Gay, J. Hill, M. Welsh, E. Brewer, and D. Culler, "TinyOS: An Operating System for Sensor Networks," in Ambient Intelligence, W. Weber, J. M. Rabaey, and E. Aarts, Eds. Berlin/Heidelberg: Springer-Verlag, 2005, ch. 7, pp. 115-148.
      • Oliver Hahm, Emmanuel Baccelli, Mesut Günes, Matthias Wählisch, Thomas C. Schmidt, "RIOT OS: Towards an OS for the Internet of Things," in Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), Poster Session, April 2013.
      • M.R. Palattella, N. Accettura, X. Vilajosana, T. Watteyne, L.A. Grieco, G. Boggia and M. Dohler, "Standardized Protocol Stack For The Internet Of (Important) Things", IEEE Communications Surveys and Tutorials, December 2012.
      • J. Wiegelmann, Softwareentwicklung in C für Mikroprozessoren und Mikrocontroller, Hüthig, 2009

    • 19315312 Project Seminar
      Software Project: Distributed Systems (Justus Purat)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A7/SR 031 (Arnimallee 7)

      Comments

      The "Software Project: Distributed Systems" contains a range of topics from the research area of the working group: Dependable Distributed Systems. Goal of the course is to  completed a given project in a team through design, implementation and testing. 

      The software project is recognized in different modules. Please inform in advance if you are allowed to take the course in a module from your degree program.

      Topics this semester include likely:

      • Forest screening (in cooperation with the Geosciences Department of the Free University of Berlin)
        • Development of a dashboard to represent the data collection
        • Hardware revision of the transmission of sensor data from the forest via LoRa to a database
      • Implementation of a distributed ledger technology based on directed acyclic graphs
        • Development of an OMNeT++ simulation
        • Development of a Raspberry Pi simulation
      • Further development of an ad hoc network to deploy various web applications
        • In particular, the completion of a demonstrator (server-side) that shows the user interface for managing the ad hoc network
        • or the completion of a sample application that can be deployed in the ad hoc network
      • Load modeling and forecasting of the power consumption of AI data centers
        • Further information to follow

      (All topics mentioned are subject to further adjustments. Further details can be found in the introduction presentation in the resources section shortly.)

      Details will be discussed in the first session. The software project: distributed systems will be held in German or English, depending on the student requirements. The assignments and presentations can be submitted in either German or English.

    • 19334412 Project Seminar
      SWP: Future Security Lab (Leonie Terfurth)
      Schedule: Mo 10:00-12:00 (Class starts on: 2025-10-13)
      Location: T9/K63 Hardwarepraktikum (Takustr. 9)

      Comments

      Weather and climate shape our daily lives, yet the information surrounding them is often complex and difficult to interpret. This is especially true for extreme weather events, where the communication of warnings highlights how crucial it is to present meteorological information in a way that people can intuitively use in their decision-making. The effectiveness of weather communication depends not only on the availability and quality of data, but also on the clarity and design of how that information is conveyed (DWD RainBoW; Leschzyk et al., 2025).
      The quality and accessibility of extended reality (XR) technologies—particularly augmented reality (AR)—have improved significantly in recent years. As part of the Future Security Lab software project in the winter semester of 2025, students will work in small groups to develop proof-of-concept prototypes that explore the potential of AR for communicating weather and climate data. The project focuses not only on technical implementation but also on issues of comprehensibility, user orientation, and feasibility.
      Two relevant concepts are central to this approach:
      •    Immersive analytics – the use of XR technologies to transform complex data for decision-making into spatial, interactive environments. By enabling users to actively explore and manipulate data, it becomes more tangible (Chandler et al., 2015).
      •    Data visceralization – the translation of data into intuitive forms that foster an understanding of physical quantities and magnitudes, making the data directly experiential (Lee et al., 2020).


      This software project runs throughout the entire lecture time. Approximately every two weeks, there will be a face-to-face meeting in which all group members report on the current status. In addition to brief updates at the face-to-face meetings, there will be three presentations: an idea pitch, an interim presentation, and a final presentation.
      At the beginning of the course (October 13), the organizational details and background information on the project idea will be presented in detail, along with the various concepts. In addition, there will be a lecture on “User-Oriented Weather Warnings” as inspiration for potential applications.

       

  • Software Project: Computer Systems B

    0089cA3.7
    • 19309212 Project Seminar
      SWP: Smart Home Demo Lab (Jochen Schiller, Marius Max Wawerek)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/K63 Hardwarepraktikum (Takustr. 9)

      Additional information / Pre-requisites

      In this course you will be expected to write code. The outcome of your software project should be a concrete contribution to the RIOT code base, and take the shape of one or more pull request(s) to the RIOT github (https://github.com/RIOT-OS/RIOT). Before you start coding, refer to the starting guide

      https://github.com/RIOT-OS/RIOT/wiki#wiki-start-the-riot

      Comments

      Softwareproject Smart Home Demo Lab

      In this course, students will work on topics related to the Smart Home Demo Lab of the Computer Systems & Telematics working group.

      The topics include:

      • Creation of a Smart Home ecosystem
      • Machine Learning (ML) based analysis of Smart Home datasets
      • Experiments with and Improvements of existing ML models
      • Design of Smart Home Usage scenarios
      • Development of your own (virtual) IoT device

      Participants will work in smaller groups (3-5 students), where each group will focus on a specific topic.

      Regarding Organization: The software project will take course throughout the whole lecture period. First a kick off meeting with all participants will be held. There all the different topics will be presented. Afterwards each student will hand in a list of topic priorities.

      The actual work on the topics will occur in multiple two week sprints. Finally at the end of the lecture period one overall final presentation will be held showing the results of all topics.

      Depending on the needs of the students the software project can be held in either German or English.

      Suggested reading

      • A. S. Tanenbaum, Modern Operating Systems, 3rd ed. Upper Saddle River, NJ, USA: Prentice Hall Press, 2007.
      • Shelby, Zach, and Carsten Bormann. 6LoWPAN: The wireless embedded Internet. Vol. 43. Wiley. com, 2011.
      • A. Dunkels, B. Gronvall, and T. Voigt, "Contiki - a lightweight and flexible operating system for tiny networked sensors." in LCN. IEEE Computer Society, 2004, pp. 455-462.
      • P. Levis, S. Madden, J. Polastre, R. Szewczyk, K. Whitehouse, A. Woo, D. Gay, J. Hill, M. Welsh, E. Brewer, and D. Culler, "TinyOS: An Operating System for Sensor Networks," in Ambient Intelligence, W. Weber, J. M. Rabaey, and E. Aarts, Eds. Berlin/Heidelberg: Springer-Verlag, 2005, ch. 7, pp. 115-148.
      • Oliver Hahm, Emmanuel Baccelli, Mesut Günes, Matthias Wählisch, Thomas C. Schmidt, "RIOT OS: Towards an OS for the Internet of Things," in Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), Poster Session, April 2013.
      • M.R. Palattella, N. Accettura, X. Vilajosana, T. Watteyne, L.A. Grieco, G. Boggia and M. Dohler, "Standardized Protocol Stack For The Internet Of (Important) Things", IEEE Communications Surveys and Tutorials, December 2012.
      • J. Wiegelmann, Softwareentwicklung in C für Mikroprozessoren und Mikrocontroller, Hüthig, 2009

    • 19315312 Project Seminar
      Software Project: Distributed Systems (Justus Purat)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A7/SR 031 (Arnimallee 7)

      Comments

      The "Software Project: Distributed Systems" contains a range of topics from the research area of the working group: Dependable Distributed Systems. Goal of the course is to  completed a given project in a team through design, implementation and testing. 

      The software project is recognized in different modules. Please inform in advance if you are allowed to take the course in a module from your degree program.

      Topics this semester include likely:

      • Forest screening (in cooperation with the Geosciences Department of the Free University of Berlin)
        • Development of a dashboard to represent the data collection
        • Hardware revision of the transmission of sensor data from the forest via LoRa to a database
      • Implementation of a distributed ledger technology based on directed acyclic graphs
        • Development of an OMNeT++ simulation
        • Development of a Raspberry Pi simulation
      • Further development of an ad hoc network to deploy various web applications
        • In particular, the completion of a demonstrator (server-side) that shows the user interface for managing the ad hoc network
        • or the completion of a sample application that can be deployed in the ad hoc network
      • Load modeling and forecasting of the power consumption of AI data centers
        • Further information to follow

      (All topics mentioned are subject to further adjustments. Further details can be found in the introduction presentation in the resources section shortly.)

      Details will be discussed in the first session. The software project: distributed systems will be held in German or English, depending on the student requirements. The assignments and presentations can be submitted in either German or English.

    • 19334412 Project Seminar
      SWP: Future Security Lab (Leonie Terfurth)
      Schedule: Mo 10:00-12:00 (Class starts on: 2025-10-13)
      Location: T9/K63 Hardwarepraktikum (Takustr. 9)

      Comments

      Weather and climate shape our daily lives, yet the information surrounding them is often complex and difficult to interpret. This is especially true for extreme weather events, where the communication of warnings highlights how crucial it is to present meteorological information in a way that people can intuitively use in their decision-making. The effectiveness of weather communication depends not only on the availability and quality of data, but also on the clarity and design of how that information is conveyed (DWD RainBoW; Leschzyk et al., 2025).
      The quality and accessibility of extended reality (XR) technologies—particularly augmented reality (AR)—have improved significantly in recent years. As part of the Future Security Lab software project in the winter semester of 2025, students will work in small groups to develop proof-of-concept prototypes that explore the potential of AR for communicating weather and climate data. The project focuses not only on technical implementation but also on issues of comprehensibility, user orientation, and feasibility.
      Two relevant concepts are central to this approach:
      •    Immersive analytics – the use of XR technologies to transform complex data for decision-making into spatial, interactive environments. By enabling users to actively explore and manipulate data, it becomes more tangible (Chandler et al., 2015).
      •    Data visceralization – the translation of data into intuitive forms that foster an understanding of physical quantities and magnitudes, making the data directly experiential (Lee et al., 2020).


      This software project runs throughout the entire lecture time. Approximately every two weeks, there will be a face-to-face meeting in which all group members report on the current status. In addition to brief updates at the face-to-face meetings, there will be three presentations: an idea pitch, an interim presentation, and a final presentation.
      At the beginning of the course (October 13), the organizational details and background information on the project idea will be presented in detail, along with the various concepts. In addition, there will be a lecture on “User-Oriented Weather Warnings” as inspiration for potential applications.

       

  • Academic Work in Computer Systems A

    0089cA3.8
    • 19310817 Seminar / Undergraduate Course
      Seminar/Proseminar: Internet of Things & Security (Computer Systems & Telematics) (Emmanuel Baccelli)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/K40 Multimediaraum (Takustr. 9)

      Comments

      Seminar Technische Informatik on Internet of Things & Security

      NOTE WELL: This seminar is research-oriented, in english, and primarily aimed at Masters students. You will learn how to survey and present academic work in written and oral form. Down the line, it may prepare you for a thesis on the topic you survey during the seminar.

      WARNING: This seminar is demanding. The schedule is tight, and you will have to put substantial work into surveying related work (breadth coverage), studying a specific technique (depth coverage) and structuring the written and oral presentation of your survey (tending towards an acceptable academic research level).

      SYNOPSIS: In large part, the deep edge (aka the Internet of Things, or IoT) consists of distributed systems including low-end devices with very small memory capacity (a few kBytes) and limited energy consumption (1000 times less than a RaspberryPi). Deep edge capabilities promise a new world of applications, but also bring up specific challenges in terms of programmability, energy efficiency, networking and security. After an introductory session at the start of the term, MSc students will pick a topic related to current technologies in the field of low-power deep edge computing, Internet of Things and security, and write a report (IEEE LaTeX template, approx. 12 pages including figures and references, A4, double column, 1.5 spacing, 11-point font) discussing corresponding questions. At the end of the term, the participants present their results in the form of a short talk (15 minutes + 5 minutes Q&A) in a meeting, which will also include cross-reviewing of student's presentations. During the term, there will be deadlines for status reports, but no weekly meetings of the complete seminar group.

      Attendance is mandatory only for the introductory session, a mid-term presentation, and the final presentation at the end of the term.

      SCHEDULE

      Mid-October: introductory session (presence mandatory)
      After 1 week: topic selection
      After 4 weeks: preliminary presentation & deadline to submit tentative outline for the report
      After 8 weeks: deadline to submit alpha version of the report
      After 10 weeks: deadline to submit beta version of the report & assignment for cross-reviewing of reports
      End of semester: deadline to submit final version of the report & presentation session (including Q&A and oral cross-review).

      Suggested reading

      The typical bibliography and online resources that will be in scope to survey for this seminar includes:
      - reviewing academic publications, e.g. papers from IEEE, ACM conferences/journals (available onscholar.google.com);
      - reviewing network protocol open standard specifications, e.g. IETF drafts and Request For Comments (RFC);
      - reviewing open source implementations (e.g. available on GitHub).

    • 19329617 Seminar / Undergraduate Course
      Seminar/Proseminar: Telematics (Jochen Schiller)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-02-09)
      Location: T9/049 Seminarraum (Takustr. 9)

      Comments

      This seminar focuses on several aspects of technical Computer Science. At the start of the seminar you will receive a list of suggested topics. You are also very welcome to suggest your own research topic that is closely related to technical Computer Science. You can work on your topic exclusively or in a small group of 2-3 students. But then, it has to be apparent who contributed what part to the seminar paper.

       

       

  • Academic Work in Computer Systems B

    0089cA3.9
    • 19310817 Seminar / Undergraduate Course
      Seminar/Proseminar: Internet of Things & Security (Computer Systems & Telematics) (Emmanuel Baccelli)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/K40 Multimediaraum (Takustr. 9)

      Comments

      Seminar Technische Informatik on Internet of Things & Security

      NOTE WELL: This seminar is research-oriented, in english, and primarily aimed at Masters students. You will learn how to survey and present academic work in written and oral form. Down the line, it may prepare you for a thesis on the topic you survey during the seminar.

      WARNING: This seminar is demanding. The schedule is tight, and you will have to put substantial work into surveying related work (breadth coverage), studying a specific technique (depth coverage) and structuring the written and oral presentation of your survey (tending towards an acceptable academic research level).

      SYNOPSIS: In large part, the deep edge (aka the Internet of Things, or IoT) consists of distributed systems including low-end devices with very small memory capacity (a few kBytes) and limited energy consumption (1000 times less than a RaspberryPi). Deep edge capabilities promise a new world of applications, but also bring up specific challenges in terms of programmability, energy efficiency, networking and security. After an introductory session at the start of the term, MSc students will pick a topic related to current technologies in the field of low-power deep edge computing, Internet of Things and security, and write a report (IEEE LaTeX template, approx. 12 pages including figures and references, A4, double column, 1.5 spacing, 11-point font) discussing corresponding questions. At the end of the term, the participants present their results in the form of a short talk (15 minutes + 5 minutes Q&A) in a meeting, which will also include cross-reviewing of student's presentations. During the term, there will be deadlines for status reports, but no weekly meetings of the complete seminar group.

      Attendance is mandatory only for the introductory session, a mid-term presentation, and the final presentation at the end of the term.

      SCHEDULE

      Mid-October: introductory session (presence mandatory)
      After 1 week: topic selection
      After 4 weeks: preliminary presentation & deadline to submit tentative outline for the report
      After 8 weeks: deadline to submit alpha version of the report
      After 10 weeks: deadline to submit beta version of the report & assignment for cross-reviewing of reports
      End of semester: deadline to submit final version of the report & presentation session (including Q&A and oral cross-review).

      Suggested reading

      The typical bibliography and online resources that will be in scope to survey for this seminar includes:
      - reviewing academic publications, e.g. papers from IEEE, ACM conferences/journals (available onscholar.google.com);
      - reviewing network protocol open standard specifications, e.g. IETF drafts and Request For Comments (RFC);
      - reviewing open source implementations (e.g. available on GitHub).

    • 19329617 Seminar / Undergraduate Course
      Seminar/Proseminar: Telematics (Jochen Schiller)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-02-09)
      Location: T9/049 Seminarraum (Takustr. 9)

      Comments

      This seminar focuses on several aspects of technical Computer Science. At the start of the seminar you will receive a list of suggested topics. You are also very welcome to suggest your own research topic that is closely related to technical Computer Science. You can work on your topic exclusively or in a small group of 2-3 students. But then, it has to be apparent who contributed what part to the seminar paper.

       

       

  • Analysis II

    0084dA1.2
    • 19211601 Lecture
      Analysis II (Pavle Blagojevic)
      Schedule: Di 10:00-12:00, Do 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Comments

      Content

      1. Additions to Analysis I. Non-authentic integrals
      2. Uniform convergence of function sequences. Power series. Sentence of Taylor.
      3. Elements of topology. Standardized and metric spaces. Open quantities. Convergence. Completed quantities. Consistency. Compactness
      4. Differential calculus of several variables. Partial, total and continuous differentiability. Block via the inverse function. Block of implicit functions.
      5. Iterated integrals.
      6. Ordinary differential equations. Basic terms, elementary solvable differential equations, existential and unambiguous results for systems.

      Suggested reading

      • O. Forster: Analysis 1 und 2. Vieweg/Springer.
      • Königsberger, K: Analysis 1,2, Springer.
      • E. Behrends: Analysis Band 1 und 2, Vieweg/Springer.
      • H. Heuser: Lehrbuch der Analysis 1 und 2, Teubner/Springer.

  • Analysis III

    0084dA1.3
    • 19201301 Lecture
      Analysis III (Marita Thomas)
      Schedule: Di 10:00-12:00, Mi 12:00-14:00, Do 10:00-12:00 (Class starts on: 2025-10-14)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Comments

      Contents

      The lecture Analysis III is the final lecture of the cycle Analysis I-III.

      • ODEs
      • Differentiation and integration in Rn,
      • extremes with and without constraints,
      • integration on surfaces,
      • the integrals of Gauss and Stokes and much more are discussed.

      These basics are indispensable for a successful study of mathematics.

      Suggested reading

      Literatur

      • H. Amann, J. Escher: Analysis 2, Birkhäuser Verlag, 2008.
      • H. Amann, J. Escher: Analysis 3, Birkhäuser Verlag, 2008.
      • O. Forster: Analysis 2, Springer Verlag, 2012.
      • O. Forster: Analysis 3, Vieweg+Teubner, 2012.
      • H. Heuser: Lehrbuch der Analysis 2, Vieweg+Teubner, 2012.
      • S. Hildebrandt: Analysis 2, Springer Verlag, 2003.
      • J. Jost: Postmodern Analysis, Springer Verlag, 2008.
      • K. Königsberger: Analysis 2, Springer Verlag, 2004.
      • W. Rudin: Principles of Mathematical Analysis, International Series in Pure & Applied Mathematics, 1976.

      und für geschichtlich Interessierte:

      • O. Becker: Grundlagen der Mathematik, Verlag Karl Alber, Freiburg, 1964.
      • E. Hairer, G. Wanner: Analysis by its History, Springer, 2000.
      • V.J. Katz: A History of Mathematics, Harper Collins, New York, 1993.

    • 19201302 Practice seminar
      Practice seminar for Analysis III (Marita Thomas, Sven Tornquist)
      Schedule: Di 14:00-16:00, Mi 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A6/SR 007/008 Seminarraum (Arnimallee 6)
  • Linear Algebra II

    0084dA1.5
    • 19211701 Lecture
      Linear Algebra II (Marcus Weber)
      Schedule: Mo 08:00-10:00, Do 14:00-16:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-16)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Additional information / Pre-requisites

      See http://page.mi.fu-berlin.de/werner99/.

      Comments

      Contents:

      • Determinants
      • Eigenvalues and eigenvectors: diagonalizability, trigonalizability, set of Cayley-Hamilton, Jordanian normal form
      • Bilinear forms
      • Vectorräume with scalar product: Euclidean, unitary vectorräume, orthogonal projection, isometries, self-adjusted images, Gram-Schmidt orthonormalization methods, major axis transformation

      Prerequisites:
      Linear Algebra I
      Literature:

      Will be mentioned in the lecture.

    • 19211702 Practice seminar
      Practice seminar for Linear Algebra II (Marcus Weber)
      Schedule: Di 08:00-10:00, Di 14:00-16:00, Mi 12:00-14:00, Do 16:00-18:00, Fr 08:00-10:00 (Class starts on: 2025-10-14)
      Location: A3/019 Seminarraum (Arnimallee 3-5)
  • Computer-Oriented Mathematics I

    0084dA1.6
    • 19200501 Lecture
      Computerorientated Mathematics I (5 LP) (Claudia Schillings)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: T9/Gr. Hörsaal (Takustr. 9)

      Comments

      Contents:
      Computers play an important role in (almost) all situations in life today. Computer-oriented mathematics provides basic knowledge in dealing with computers for solving mathematical problems and an introduction to algorithmic thinking. At the same time, typical mathematical software such as Matlab and Mathematica will be introduced. The motivation for the questions under consideration is provided by simple application examples from the aforementioned areas. The content of the first part includes fundamental terms of numerical calculation: number representation and rounding errors, condition, efficiency and stability.

      Homepage: All current information on lectures and lectures

      Suggested reading

      Literatur: R. Kornhuber, C. Schuette, A. Fest: Mit Zahlen Rechnen (Skript zur Vorlesung)

    • 19200502 Practice seminar
      Practice seminar for Computerorientated Mathematics I (5 LP) (N.N.)
      Schedule: Mo 12:00-14:00, Mo 14:00-16:00, Di 08:00-10:00, Di 16:00-18:00, Mi 10:00-12:00, Do 14:00-16:00, Fr 08:00-10:00 (Class starts on: 2025-10-13)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Numerical Mathematics I

    0084dA1.9
    • 19212001 Lecture
      Numerics I (Volker John)
      Schedule: Mo 10:00-12:00, Mi 10:00-12:00 (Class starts on: 2025-10-13)
      Location: A7/SR 031 (Arnimallee 7)

      Comments

      Numerical methods for: iterative solution of nonlinear systems of equations (fixpoint and Newton methods), curve fitting, interpolation, numerical quadrature, and numerics for initial value problems and two point boundary value problems with ODEs. The course is taught in German.

      Suggested reading

      Stoer, Josef und Roland Bulirsch: Numerische Mathematik - eine Einführung, Band 1. Springer, Berlin, 2005.

      Aus dem FU-Netz auch online verfügbar.

      Es wird ein Vorlesungsskript geben.

      Link

    • 19212002 Practice seminar
      Practice seminar for Numerics I (N.N.)
      Schedule: Di 08:00-10:00, Di 10:00-12:00, Fr 08:00-10:00 (Class starts on: 2025-10-14)
      Location: A3/019 Seminarraum (Arnimallee 3-5)
  • Academic Work in Mathematics

    0084dB1.1
    • 19208111 Seminar
      Masterseminar Stochastics "Mathematical Reinforcement Learning for AI" (Guilherme de Lima Feltes)
      Schedule: Do 16:00-18:00 (Class starts on: 2025-10-16)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Additional information / Pre-requisites

      Prerequisites: Stochastics I and II. Desirable: Stochastics III.
      Target Group: BMS Students, Master students of Mathematics and advanced Bachelor students of Mathematics.

      Comments

      Content: The seminar covers advanced topics of stochastics.

      Detailed Information can be found on the Homepage of the seminar.

      Reinforcement learning lies at the core of many state-of-the-art artificial intelligence algorithms, enabling agents to solve complex optimal control tasks in robotics, finance, physical AI, drug discovery, computer games and many other applications.
      This seminar offers a rigorous treatment of reinforcement learning, focusing on the mathematical principles that make reinforcement learning algorithms work. We will develop a mathematically sound understanding of Markov decision processes, value function based methods and their connections to stochastic optimal control, policy gradient methods, emphasizing convergence properties of classical reinforcement learning algorithms through stochastic approximation and stochastic gradient descent. We will also explore continuous time reinforcement learning in the framework of stochastic differential equations.
      The seminar aims to provide a rigorous foundational perspective for students interested in current research related to reinforcement learning and artificial intelligence. Participants should have a strong background in mathematics specifically in probability theory.

      Suggested reading

      Literatur wird in der Vorbesprechung bekanntgegeben.

      Literature will be announced in the preliminary discussion

    • 19212211 Seminar
      Seminar on topic in Geometric Analysis and Differential Geometry (Elena Mäder-Baumdicker)
      Schedule: Mi 15.10. 12:00-14:00, Mi 05.11. 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Ana I bis III, lineare Algebra I und II sowie mindestens einer der beiden Vorlesungen Differentialgeometrie I oder Differentialgleichungen I.

      Comments

      This seminar is intended for Bachelor's and Master's students with an interest in topics related to Geometric Analysis and Differential Geometry. Each semester, the seminar focuses on a different theme — examples include geometric variational problems, geometric flows, and geometric measure theory.

      In the first meeting of the semester, students can express their interest in participating. In the second meeting, each participant selects a topic from a curated list. The presentations themselves will take place during a dedicated seminar week at the end of the term.

       

    • 19226511 Seminar
      Seminar Multiscale Methods in Molecular Simulations (Luigi Delle Site)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: Seminarraum in der Arnimallee 9

      Additional information / Pre-requisites

      Audience: At least 6th semester with a background in statistical and quantum mechanics, Master students and PhD students (even postdocs) are welcome.

      Comments

      Content: The seminar will concern the discussion of state-of-art techniques in molecular simulation which allow for a simulation of several space (especially) and time scale within one computational approach.

      The discussion will concerns both, specific computational coding and conceptual developments.

      Suggested reading

      Related Basic Literature:

      (1) M.Praprotnik, L.Delle Site and K.Kremer, Ann.Rev.Phys.Chem.59, 545-571 (2008)

      (2) C.Peter, L.Delle Site and K.Kremer, Soft Matter 4, 859-869 (2008).

      (3) M.Praprotnik and L.Delle Site, in "Biomolecular Simulations: Methods and Protocols" L.Monticelli and E.Salonen Eds. Vol.924, 567-583 (2012) Methods Mol. Biol. Springer-Science

    • 19240317 Seminar / Undergraduate Course
      Advancing mathematics with AI (Georg Loho)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A3/SR 120 (Arnimallee 3-5)

      Comments

      The course will probably be held in German. 

    • 19247111 Seminar
      Ordinary Differential Equations (Marita Thomas)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Ordinary differential equations arise in many applications from physics, chemistry, biology or economics. This seminar extends the topics that were covered in the Analysis III course, e.g., eigenvalue problems and stability theory will be addressed. 

  • Special topics in Mathematics

    0084dB2.11
    • 19202001 Lecture
      Discrete Geometrie I (Christian Haase)
      Schedule: Di 10:00-12:00, Mi 12:00-14:00 (Class starts on: 2025-10-14)
      Location: A3/SR 120 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Solid background in linear algebra. Knowledge in combinatorics and geometry is advantageous.

      Comments

      Physical presence in the exercises on Wednesdays is mandatory.

      This is the first in a series of three courses on discrete geometry. The aim of the course is a skillful handling of discrete geometric structures including analysis and proof techniques. The material will be a selection of the following topics:
      Basic structures in discrete geometry

      • polyhedra and polyhedral complexes
      • configurations of points, hyperplanes, subspaces
      • Subdivisions and triangulations (including Delaunay and Voronoi)
      • Polytope theory
      • Representations and the theorem of Minkowski-Weyl
      • polarity, simple/simplicial polytopes, shellability
      • shellability, face lattices, f-vectors, Euler- and Dehn-Sommerville
      • graphs, diameters, Hirsch (ex-)conjecture
      • Geometry of linear programming
      • linear programs, simplex algorithm, LP-duality
      • Combinatorial geometry / Geometric combinatorics
      • Arrangements of points and lines, Sylvester-Gallai, Erdos-Szekeres
      • Arrangements, zonotopes, zonotopal tilings, oriented matroids
      • Examples, examples, examples
      • regular polytopes, centrally symmetric polytopes
      • extremal polytopes, cyclic/neighborly polytopes, stacked polytopes
      • combinatorial optimization and 0/1-polytopes

       

      For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding for discrete-geometric structures appearing in differential geometry, topology, combinatorics, and algebraic geometry.

       

       

       

       

       

       

       

       

       

      Suggested reading

      • G.M. Ziegler "Lectures in Polytopes"
      • J. Matousek "Lectures on Discrete Geometry"
      • Further literature will be announced in class.

    • 19202002 Practice seminar
      Practice seminar for Discrete Geometrie I (Sofia Garzón Mora, Christian Haase)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Special topics in Pure Mathematics

    0084dB2.12
    • 19236101 Lecture
      Mathematisches Panorama (Anina Mischau, Sarah Wolf)
      Schedule: Mi 12:00-14:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-15)
      Location: T9/SR 005 Übungsraum (Takustr. 9)

      Comments

      This is for a course in German - Short explanation in English:

      Mathematical Panorama is a two-hour overview course for First-Semester students of Mathematics (in particular, but not only, for teacher students) that presents the wide field of modern Mathematics - its history, its topics, its problems, its methods, some basic concepts, applications, etc.

       

      Suggested reading

      • Günter M. Ziegler und Andreas Loos: Panorama der Mathematik, Springer-Spektrum 2018, in Vorbereitung (wird in Auszügen zur Verfügung gestellt)
      • Hans Wußing, 6000 Jahre Mathematik: Eine kulturgeschichtliche Zeitreise, Springer 2009
        • Band 1: Von den Anfängen bis Leibniz und Newton
        • Band 2: Von Euler bis zur Gegenwart
      • Heinz-Wilhelm Alten et al., 4000 Jahre Algebra, Springer 2008
      • Christoph J. Scriba, 5000 Jahre Geometrie, Springer 2009
      • Heinz Niels Jahnke, Geschichte der Analysis: Texte zur Didaktik der Mathematik, Spektrum 1999
      • Richard Courant und Herbert Robbins, What is Mathematics?, Oxford UP 1941 (deutsch: Springer 2010)
      • Phillip J. Davis, Reuben Hersh, The Mathematical Experience, Mariner Books 1999

    • 19236102 Practice seminar
      Übung zu: Mathematisches Panorama (Anina Mischau)
      Schedule: Mo 14:00-16:00, Do 14:00-16:00, Do 16:00-18:00, Fr 12:00-14:00 (Class starts on: 2025-10-20)
      Location: A6/SR 007/008 Seminarraum (Arnimallee 6)
  • Functional Analysis

    0084dB2.2
    • 19201901 Lecture
      Functional Analysis (Dirk Werner)
      Schedule: Di 10:00-12:00, Do 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A3/019 Seminarraum (Arnimallee 3-5)

      Comments

      Content:
      Functional analysis is the branch of mathematics dealing with the study of normed (or general topological) vector spaces and continuous mappings between them. Thus, analysis, topology and algebra are linked.
      The course deals with Banach and Hilbert spaces, linear operators and functionals as well as spectral theory of compact operators.

      Target group: Students from the 3rd/4th semester on.

      Requirements: Good command of the material of the courses Analysis I/II and Linear Algebra I/II.

      Suggested reading

      Literatur:

      • Dirk Werner: Funktionalanalysis, 8. Auflage, Springer-Verlag 2018

    • 19201902 Practice seminar
      Tutorial: Functional Analysis (Piotr Pawel Wozniak)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Comments

      Inhalt:
      Die Funktionalanalysis ist der Zweig der Mathematik, der sich mit der Untersuchung von normierten (oder allgemeiner topologischen) Vektorräumen und stetigen Abbildungen zwischen ihnen befasst. Hierbei werden Analysis, Topologie und Algebra verknüpft.
      Die Vorlesung behandelt Banach- und Hilberträume, lineare Operatoren und Funktionale sowie Spektraltheorie kompakter Operatoren.

      Zielgruppe: Studierende vom 4. Semester an.

      Voraussetzungen: Sicheres Beherrschen des Stoffs der Vorlesungen Analysis I/II und Lineare Algebra I/II.

      Literatur:

       

      • Dirk Werner: Funktionalanalysis, 6. Auflage, Springer-Verlag 2007, ISBN 978-3-540-72533-6
      • Hans Wilhelm Alt: Lineare Funktionalanalysis : eine anwendungsorientierte Einführung. 5. Auflage. Springer-Verlag, 2006, ISBN 3-540-34186-2
      • Harro Heuser: Funktionalanalysis: Theorie und Anwendung. 3. Auflage. Teubner-Verlag, 1992, ISBN 3-519-22206-X

       

  • Probability and Statistics II

    0084dB2.4
    • 19212901 Lecture
      Stochastics II (Felix Höfling)
      Schedule: Di 12:00-14:00, Do 08:00-10:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisite: Stochastics I  and  Analysis I — III.

      Comments

      Contents:

      • Basics: conditional expectation, characteristic function, convergence types, uniform integrability;
      • Construction of stochastic processes and examples: Gaussian processes, Lévy processes, Brownian motion;
      • martingales in discrete time: convergence, stopping theorems, inequalities;
      • Markov chains in discrete and continuous time: recurrence and transience, invariant measures.

      Suggested reading

      • Klenke: Wahrscheinlichkeitstheorie
      • Durrett: Probability. Theory and Examples.

      Weitere Literatur wird im Lauf der Vorlesung bekannt gegeben.
      Further literature will be given during the lecture.

    • 19212902 Practice seminar
      Practice seminar for Stochastics II (Felix Höfling)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)

      Comments

      Inhalt

       

       

      • This course is the sequel of the course of Stochastics I. The main objective is to go beyond the first principles in probability theory by introducing the general language of measure theory, and the application of this framework in a wide variety of probabilistic scenarios.
        More precisely, the course will cover the following aspects of probability theory:
      • Measure theory and the Lebesgue integral
      • Convergence of random variables and 0-1 laws
      • Generating functions: branching processes and characteristic functions
      • Markov chains
      • Introduction to martingales

       

       

  • Algebra and Number Theroy

    0084dB2.5
    • 19200701 Lecture
      Algebra and Theory of Numbers (Alexander Schmitt)
      Schedule: Mo 08:00-10:00, Mi 08:00-10:00 (Class starts on: 2025-10-15)
      Location: T9/Gr. Hörsaal (Takustr. 9)

      Comments

      Subject matter:
      Selected topics from:

          Divisibility into rings (especially Z- and polynomial rings); residual classes and congruencies; modules and ideals
          Euclidean, principal ideal and factorial rings
          The quadratic law of reciprocity
          Primality tests and cryptography
          The structure of abel groups (or modules about main ideal rings)
          Symmetric function set
          Body extensions, Galois correspondence; constructions with compasses and rulers
          Non-Label groups (set of Lagrange, normal dividers, dissolvability, sylow groups)

    • 19200702 Practice seminar
      Practice seminar for Algebra and Theory of Numbers (Alexander Schmitt)
      Schedule: Mi 14:00-16:00, Do 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
  • Discrete Mathematics I

    0084dB3.2
    • 19202001 Lecture
      Discrete Geometrie I (Christian Haase)
      Schedule: Di 10:00-12:00, Mi 12:00-14:00 (Class starts on: 2025-10-14)
      Location: A3/SR 120 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Solid background in linear algebra. Knowledge in combinatorics and geometry is advantageous.

      Comments

      Physical presence in the exercises on Wednesdays is mandatory.

      This is the first in a series of three courses on discrete geometry. The aim of the course is a skillful handling of discrete geometric structures including analysis and proof techniques. The material will be a selection of the following topics:
      Basic structures in discrete geometry

      • polyhedra and polyhedral complexes
      • configurations of points, hyperplanes, subspaces
      • Subdivisions and triangulations (including Delaunay and Voronoi)
      • Polytope theory
      • Representations and the theorem of Minkowski-Weyl
      • polarity, simple/simplicial polytopes, shellability
      • shellability, face lattices, f-vectors, Euler- and Dehn-Sommerville
      • graphs, diameters, Hirsch (ex-)conjecture
      • Geometry of linear programming
      • linear programs, simplex algorithm, LP-duality
      • Combinatorial geometry / Geometric combinatorics
      • Arrangements of points and lines, Sylvester-Gallai, Erdos-Szekeres
      • Arrangements, zonotopes, zonotopal tilings, oriented matroids
      • Examples, examples, examples
      • regular polytopes, centrally symmetric polytopes
      • extremal polytopes, cyclic/neighborly polytopes, stacked polytopes
      • combinatorial optimization and 0/1-polytopes

       

      For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding for discrete-geometric structures appearing in differential geometry, topology, combinatorics, and algebraic geometry.

       

       

       

       

       

       

       

       

       

      Suggested reading

      • G.M. Ziegler "Lectures in Polytopes"
      • J. Matousek "Lectures on Discrete Geometry"
      • Further literature will be announced in class.

    • 19202002 Practice seminar
      Practice seminar for Discrete Geometrie I (Sofia Garzón Mora, Christian Haase)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Numerical Mathematics II

    0084dB3.4
    • 19202101 Lecture
      Basic Module: Numeric II (Robert Gruhlke)
      Schedule: Mo 12:00-14:00, Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Comments

      Description: Extending basic knowledge on odes from Numerik I, we first concentrate on one-step methods for stiff and differential-algebraic systems and then discuss Hamiltonian systems. In the second part of the lecture we consider the iterative solution of large linear systems.

      Target Audience: Students of Bachelor and Master courses in Mathematics and of BMS

      Prerequisites: Basics of calculus (Analysis I, II) linear algebra (Lineare Algebra I, II) and numerical analysis (Numerik I)

    • 19202102 Practice seminar
      Practice seminar for Basic Module: Numeric II (André-Alexander Zepernick)
      Schedule: Mi 10:00-12:00, Fr 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
  • Differential Geometry I

    0084dB3.5
    • 19202601 Lecture
      Differential Geometry I (Konrad Polthier)
      Schedule: Mo 10:00-12:00, Mi 10:00-12:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-15)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Additional information / Pre-requisites

      For further information, see Lecture Homepage.

      Comments

      Topics of the lecture will be:

      • curves and surfaces in Euclidean space,
      • metrics and (Riemannian) manifolds,
      • surface tension, notions of curvature,
      • vector fields, tensors, covariant derivative
      • geodesic curves, exponential map,
      • Gauß-Bonnet theorem, topology,
      • connection to discrete differential geometry.

      This course is a BMS course and will be held in English on request.

      Prerequisits:

      Analysis I, II, III and Linear Algebra I, II

       

       

      Suggested reading

      Literature

      • W. Kühnel: Differentialgeometrie:Kurven - Flächen - Mannigfaltigkeiten, Springer, 2012
      • M. P. do Carmo, Differential Geometry of Curves and Surfaces, Prentice Hall
      • J.-H. Eschenburg, J. Jost: Differentialgeometrie und Minimalflächen, Springer, 2014
      • C. Bär: Elementare Differentialgeometrie, de Gruyter, 2001

    • 19202602 Practice seminar
      Practice seminar for Differential Geometry I (Tillmann Kleiner, Konrad Polthier)
      Schedule: Mo 08:00-10:00, Mi 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Advanced and Applied Algorithms

    0084dB3.7
    • 19303501 Lecture
      Advanced Algorithms (Helmut Alt)
      Schedule: Mo 10:00-12:00, Fr 10:00-12:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-13)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Additional information / Pre-requisites

      Target audience

      All Master and Bachelor students who are interested in algorithms.

      Prerequisites

      Basic familiarity with the design and analysis of algorithms.

      Comments

      The class focuses on topics such as

      • general principles of algorithm design,
      • network flows,
      • number-theoretic algorithms (including the RSA crypto system),
      • string matching,
      • NP-completeness,
      • approximation algorithms for hard problems,
      • arithmetic algorithms and circuits, fast fourier transform.

      Suggested reading

      • Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, 2nd Ed. McGraw-Hill 2001
      • Kleinberg, Tardos: Algorithm Design Addison-Wesley 2005.

    • 19303502 Practice seminar
      Practice seminar for Advanced Algorithms (Helmut Alt)
      Schedule: Mi 08:00-10:00, Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: T9/046 Seminarraum (Takustr. 9)
  • Communicating about Mathematics

    0162bA1.1
    • 19201510 Proseminar Cancelled
      Undergraduate Seminar: Linar Algebra (Alexander Schmitt)
      Schedule: Mo 14:00-16:00 (Class starts on: 2025-10-13)
      Location: A3/SR 119 (Arnimallee 3-5)

      Comments


       

    • 19214010 Proseminar
      Undergraduate Seminar "Magic Tricks with Mathematical Background" (Ehrhard Behrends)
      Schedule: Mo 14:00-16:00 (Class starts on: 2025-10-20)
      Location: A3/ 024 Seminarraum (Arnimallee 3-5)

      Comments

      Magic tricks with a mathematical background will be analyzed.

      Suggested reading

      Literatur: Mein 2017 bei Springer Spektrum erschienenes Buch "Zaubern und Mathematik" sowie einige Originalarbeiten zum Thema.

    • 19214210 Proseminar Cancelled
      Proseminar "Mathematik für die Öffentlichkeit“ (Anna Maria Hartkopf)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-03-25)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
    • 19240317 Seminar / Undergraduate Course
      Advancing mathematics with AI (Georg Loho)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A3/SR 120 (Arnimallee 3-5)

      Comments

      The course will probably be held in German. 

    • 19241710 Proseminar Cancelled
      Proseminar Mathematics Panorama (Anna Maria Hartkopf)
      Schedule: Mo 14:00-16:00 (Class starts on: 2025-10-20)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Suggested reading

      1. Hans Wußing, 6000 Jahre Mathematik: Eine kulturgeschichtliche Zeitreise;
      2. Band 1: Von den Anfängen bis Leibniz und Newton, Band 2: Von Euler bis zur Gegenwart, Springer 2009
      3. Heinz-Wilhelm Alten et al., 4000 Jahre Algebra, Springer 2008
      4. Christoph J. Scriba, 5000 Jahre Geometrie, Springer 2009
      5. Heinz-Niels Jahnke, Geschichte der Analysis: Texte zur Didaktik der Mathematik, Spektrum 1999
      6. Richard Courant und Herbert Robbins, Was ist Mathematik?, Springer 2010
      7. Phillip J. Davis, Reuben Hersh, The Mathematical Experience, Mariner Books 1999
      8. Knoebel, Arthur; Laubenbacher, Reinhard; Lodder, Jerry; Pengelley, David
      9. Mathematical masterpieces, Springer 2007
      10. Laubenbacher, Reinhard; Pengelley, David, Mathematical expeditions. Chronicles by the explorers, Springer 1999
      11. sowie abhängig vom Thema

    • 19245910 Proseminar
      Undergraduate Seminar: Good mathematical teaching at university level (Jan-Hendrik de Wiljes, Benedikt Weygandt)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A3/019 Seminarraum (Arnimallee 3-5)

      Comments

      Undergraduate seminar “Good Mathematical Teaching at University”

      What actually happens when students reflect on university teaching and redesign it to promote learning?

      It is always easy to criticize existing concepts—but that alone does not change anything! That's why we want to take the frequently demanded student participation literally and give you the opportunity to contribute your experiences, expertise, and perspective as learners to the further development of good university teaching.

      Let's engage in a thought experiment—perhaps a crazy one?

      • What would happen if students designed a math lecture that was meaningful and useful to them? Or even an entire module?
      • What kind of tutorials do you think are useful? What activities (thinking, calculating, discussing...) should take place in the respective courses (lectures, exercises, central exercises...) and in what format (frontal, individual, group...)?
      • And what about the teaching materials: What should exercises look like? Lecture notes? Exams?

      Procedure

      After a short general introduction, we will devote three weeks to each topic (designing lectures, (central) exercises, lecture notes, exercise sheets, exams), gather inspiration, and then work out our “good” approaches in pairs.

      At the end of the semester, we want to discuss and try out the ideas, approaches, and concepts you have developed with university lecturers!

       

      Requirements

      It is essential that you already have some experience with university teaching! You should have attended at least 2‒3 introductory lectures in mathematics. The focus will not so much be on the content taught there, but rather on becoming familiar with mathematical work at the university. More important than the individual subject content is a basic understanding of mathematical thinking and working methods—and, in particular, an interest in contemporary teaching.    

      Note: It is not planned to write a bachelor's thesis based on this proseminar. If you would like to write a thesis on a topic related to your proseminar, we recommend one of the other courses offered.

    • 19247111 Seminar
      Ordinary Differential Equations (Marita Thomas)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Ordinary differential equations arise in many applications from physics, chemistry, biology or economics. This seminar extends the topics that were covered in the Analysis III course, e.g., eigenvalue problems and stability theory will be addressed. 

  • Computer Algebra

    0162bA1.2
    • 19207219 Seminar with practice
      Formal Proof Vetification (Christoph Spiegel, Silas Rathke)
      Schedule: -
      Location: keine Angabe

      Comments

      This two-week block course at Freie Universität Berlin offers a hands-on introduction to formal proof verification with the Lean theorem prover. Lectures take place at the Zuse Institute Berlin (ZIB); tutorial rooms at FU will be assigned once enrollment is known. The course is open to all (including guest auditors), with tutorial priority for FU students taking it toward ABV requirements. Please bring a laptop for in-class exercises. A solid grasp of Analysis I and Linear Algebra I is expected; no programming background is required, though technical curiosity helps. The teaching language is English (German contributions are welcome). Full details and materials—including modules on logic, set theory, natural numbers, the infinitude of primes, and basic graph theory—are available on the course GitHub.

      For Master’s credit, the course adds differentiated exercises and advanced assessment. Exercises are tiered into foundational tasks (with human-readable proof templates), Master’s-level problems, and optional stretch challenges, with guidance and informal progress checks during sessions. The final assessment is a written exam that tests both conceptual understanding and practical Lean skills. In addition, Master’s students complete a Lean formalization project (individually or in pairs) and present it in an oral-exam-style session one to two weeks after the block course; M.Sc. grades are based on both the exam and the project.

  • Introductory Module: Differential Geometry I

    0280bA1.1
    • 19202601 Lecture
      Differential Geometry I (Konrad Polthier)
      Schedule: Mo 10:00-12:00, Mi 10:00-12:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-15)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Additional information / Pre-requisites

      For further information, see Lecture Homepage.

      Comments

      Topics of the lecture will be:

      • curves and surfaces in Euclidean space,
      • metrics and (Riemannian) manifolds,
      • surface tension, notions of curvature,
      • vector fields, tensors, covariant derivative
      • geodesic curves, exponential map,
      • Gauß-Bonnet theorem, topology,
      • connection to discrete differential geometry.

      This course is a BMS course and will be held in English on request.

      Prerequisits:

      Analysis I, II, III and Linear Algebra I, II

       

       

      Suggested reading

      Literature

      • W. Kühnel: Differentialgeometrie:Kurven - Flächen - Mannigfaltigkeiten, Springer, 2012
      • M. P. do Carmo, Differential Geometry of Curves and Surfaces, Prentice Hall
      • J.-H. Eschenburg, J. Jost: Differentialgeometrie und Minimalflächen, Springer, 2014
      • C. Bär: Elementare Differentialgeometrie, de Gruyter, 2001

    • 19202602 Practice seminar
      Practice seminar for Differential Geometry I (Tillmann Kleiner, Konrad Polthier)
      Schedule: Mo 08:00-10:00, Mi 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Research Module: Differential Geometry

    0280bA1.4
    • 19214411 Seminar
      Research Module: Differential Geometrie (Konrad Polthier, Tillmann Kleiner)
      Schedule: Di 16:00-18:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 007/008 Seminarraum (Arnimallee 6)

      Comments

      In this seminar, differential geometric topics will be independently developed based on current research and presented in the form of a talk.

      Particular emphasis is placed on the concrete implementation of differential geometric concepts in application scenarios and the questions of discretization and implementation.

      Learning objectives are a deeper understanding of differential geometry concepts, as well as problems and solution strategies in their practical use.

      Previous knowledge: Differential geometry I

  • Advanced Module: Algebra III

    0280bA2.3
    • 19222301 Lecture
      Advanced Module: Algebra III (Holger Reich)
      Schedule: Mo 12:00-14:00 (Class starts on: 2025-11-03)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Course contents: a selection of the following topics

      • properties of morphisms (proper, projective, smooth)
      • divisors
      • (quasi-)coherent sheaves
      • cohomology
      • Hilbert functions

      further properties of morphisms (proper, integral, regular, smooth, étale, ...)

      • Grothendieck topologies
      • cohomology (Čech, étale, ...)

      Suggested reading

      For example: Introduction to Schemes, Geir Ellingsrud and John Christian Otten

    • 19222302 Practice seminar
      Practice seminar for Advanced Module: Algebra III (Holger Reich)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-29)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
  • Introductory Module: Discrete Mathematics II

    0280bA3.2
    • 19234401 Lecture
      Discrete Mathematics II - Optimization (Ralf Borndörfer)
      Schedule: Mo 14:00-16:00, Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: Mo A6/SR 032 Seminarraum (Arnimallee 6), Do A7/SR 031 (Arnimallee 7)

      Additional information / Pre-requisites

      Credit This course can be chosen as Discrete Mathematics II (DM II). If Discrete Mathematics II - Extreme Combinatorics is taken at the same time, one of the two courses can be chosen as DM II and the other as a supplementary module. Language This lecture is in English.

      Exam

      The exam takes place at the last lecture. The 2nd exam takes place in the last week of the summer holidays before the lectures resume.

      Comments

      This lecture starts the optimization branch of discrete mathematics. It deals with algorithmic graph theory and linear optimization.

      Contents

      Complexity: complexity measures, run time of algorithms, the classes P and NP, NP-completeness
      Matroids and Independence Systems: independence systems, matroids, trees, forests, oracles, optimization over independence systems
      Shortest Paths: nonnegative weights, general weights, all pairs
      Network Flows: Max-Flow-Min-Cut Theorem, augmenting paths, minimum cost flows, transport and allocation problems
      Polyhedra: faces, dimension formula, projections of polyhedra, transformation, polarity, representation theorems
      Foundations of linear optimization: Farkas Lemma, Duality Theorem
      Simplex algorithm: basis, degeneration, basis exchange, revised simplex algorithm, bounds, dual simplex algorithm, post-optimization, numerics
      Interior point and ellipsoid method: basics

      Audience

      This course is aimed at mathematics students with knowledge of discrete mathematics I, linear algebra and analysis. Some exercises require the use of a computer.

      Suggested reading

      M. Grötschel, Lineare Optimierung, eines der Vorlesungsskripte

      V. Chvátal, Linear Programming, Freeman 1983

      Additional

      Garey & Johnson, Computers and Intractability,  1979 (Complexity Theory)

      Bertsimas & Tsitsiklis, Introduction to Linear Optimization, 97 (Linear Programming)

      Korte & Vygen, Combinatorial Optimization, 2006 (Flows, Shortest Paths, Matchings)

    • 19234402 Practice seminar
      Practice seminar for Discrete Mathematics II - Optimization (N.N.)
      Schedule: Mo 16:00-18:00 (Class starts on: 2025-10-20)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Introductory Module: Discrete Geometry I

    0280bA3.3
    • 19202001 Lecture
      Discrete Geometrie I (Christian Haase)
      Schedule: Di 10:00-12:00, Mi 12:00-14:00 (Class starts on: 2025-10-14)
      Location: A3/SR 120 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Solid background in linear algebra. Knowledge in combinatorics and geometry is advantageous.

      Comments

      Physical presence in the exercises on Wednesdays is mandatory.

      This is the first in a series of three courses on discrete geometry. The aim of the course is a skillful handling of discrete geometric structures including analysis and proof techniques. The material will be a selection of the following topics:
      Basic structures in discrete geometry

      • polyhedra and polyhedral complexes
      • configurations of points, hyperplanes, subspaces
      • Subdivisions and triangulations (including Delaunay and Voronoi)
      • Polytope theory
      • Representations and the theorem of Minkowski-Weyl
      • polarity, simple/simplicial polytopes, shellability
      • shellability, face lattices, f-vectors, Euler- and Dehn-Sommerville
      • graphs, diameters, Hirsch (ex-)conjecture
      • Geometry of linear programming
      • linear programs, simplex algorithm, LP-duality
      • Combinatorial geometry / Geometric combinatorics
      • Arrangements of points and lines, Sylvester-Gallai, Erdos-Szekeres
      • Arrangements, zonotopes, zonotopal tilings, oriented matroids
      • Examples, examples, examples
      • regular polytopes, centrally symmetric polytopes
      • extremal polytopes, cyclic/neighborly polytopes, stacked polytopes
      • combinatorial optimization and 0/1-polytopes

       

      For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding for discrete-geometric structures appearing in differential geometry, topology, combinatorics, and algebraic geometry.

       

       

       

       

       

       

       

       

       

      Suggested reading

      • G.M. Ziegler "Lectures in Polytopes"
      • J. Matousek "Lectures on Discrete Geometry"
      • Further literature will be announced in class.

    • 19202002 Practice seminar
      Practice seminar for Discrete Geometrie I (Sofia Garzón Mora, Christian Haase)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Advanced Module: Discrete Geometry III

    0280bA3.6
    • 19205901 Lecture
      Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      The target audience are students with a solid background in discrete geometry and/or convex geometry (en par with Discrete Geometry I & II). The topic of this course is a state-of-art of advanced topics in discrete geometry that find applications and incarnations in differential geometry, topology, combinatorics, and algebraic geometry.

      Requirements: Preferably Discrete Geometry I and II.

      Comments

      This is the third in a series of three courses on discrete geometry. This advanced course will cover a selection of the following topics (depending on the interests of the audience):   1. Oriented Matroids along the lines of the book Oriented Matroids by Björner, Las Vergnas, Sturmfels, White, and Ziegler; and/or   2. Triangulations along the lines of the book Triangulations by de Loera, Rambau, and Santos; and/or   3. Discriminants and tropical geometry along the lines of the book Discriminants, Resultants, and multidimensional determinants by Gelfand, Kapranov, and Zelevinsky; and/or   4. Combinatorics and commutative algebra along the lines of the book Combinatorics and commutative algebra by Stanley.

      Suggested reading

      Will be announced in class.

    • 19205902 Practice seminar
      Practice seminar for Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A3/SR 120 (Arnimallee 3-5)
  • Research Module: Discrete Geometry

    0280bA3.8
    • 19206111 Seminar
      Research Module: Discrete Geometry (Giulia Codenotti)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-01-26)
      Location: keine Angabe

      Additional information / Pre-requisites

      Pre-Meeting: see KVV

      Comments

      This seminar will look at remarkable polytopes — among them regular polytopes, cyclic/neighborly polytopes, hypersimplices, 2simple-2simplicial polytopes, cut polytopes, etc. We discuss the examples, their construction and their most interesting properties. Some of these examples were designed or used in order to solve problems, refute conjectures, or to support conjectures. Some of these have unexplored or unexplainable properties, and those of course we want to look at as well.

      “It is not unusual that a single example or a very few shape an entire mathematical discipline. Examples are the Petersen graph, cyclic polytopes, the Fano plane, the prisoner dilemma, the real n-dimensional projective space and the group of two by two nonsingular matrices. And it seems that overall, we are short of examples. The methods for coming up with useful examples in mathematics (or counterexamples for commonly believed conjectures) are even less clear than the methods for proving mathematical statements.” — Gil Kalai (2000)

      Suggested reading

      Themenvergabe und speziellere Literaturangaben in der Vorbesprechung zum Seminar.

  • Introductory Module: Topology II

    0280bA4.2
    • 19206201 Lecture
      Basic Module: Topology II (Pavle Blagojevic)
      Schedule: Di 14:00-16:00, Do 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content: Homology, cohomology and applications, CW-complexes, basic notions of homotopy theory

      Suggested reading

      Literatur

      • Hatcher, Allen: Algebraic Topology; Cambridge University Press.
      • http://www.math.cornell.edu/~hatcher/AT/ATpage.html
      • Lück, Wolfgang: Algebraische Topologie, Homologie und Mannigfaltigkeiten; Vieweg.

    • 19206202 Practice seminar
      Ex.: Basic Module: Topology II (Katarina Krivokuca)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
  • Research Module: Topology

    0280bA4.5
    • 19223811 Seminar
      Master Seminar Topology "L^2-Betti numbers" (N.N.)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisites: Basic knowledge of topology and group theory is required.

      Comments

      The Euler characteristic of finite CW-complexes is multiplicative under finite-sheeted coverings and it is homotopy invariant. These properties can be deduced from different descriptions:
      1. As the alternating sum of the numbers of cells, which are multiplicative but not homotopy invariant.
      2. As the alternating sum of Betti numbers, which are homotopy invariant but not multiplicative. The $n$-th Betti number of $X$ is the $\mathbb{Q}$-dimension of the homology $H_n(X;\mathbb{Q})$ with rational coefficients.
      3. As the alternating sum of $L^2$-Betti numbers, which enjoy the best features from both worlds: they are multiplicative and homotopy invariant. The $n$-th $L^2$-Betti number of $X$ is the von Neumann-dimension of the homology $H_n(X; \mathcal{N}\pi_1(X))$ with suitable coefficients.

      $L^2$-Betti numbers are meaningful topological invariants, as they obstruct the structures of mapping tori and $S^1$-actions. They also have applications to group theory by considering the $L^2$-Betti numbers of classifying spaces. Moreover, $L^2$-Betti numbers are related to famous open problems, such as the Hopf and Singer conjectures on the Euler characteristic of manifolds, and the Kaplansky conjecture on zero divisors in group rings.

      Detailed Information can be found on the Homepage of the seminar.

      Suggested reading

      This seminar will be an introduction to $L^2$-Betti numbers, following mostly
      the book by Holger Kammeyer.

  • Introductory Module: Numerical Analysis II

    0280bA5.1
    • 19202101 Lecture
      Basic Module: Numeric II (Robert Gruhlke)
      Schedule: Mo 12:00-14:00, Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Comments

      Description: Extending basic knowledge on odes from Numerik I, we first concentrate on one-step methods for stiff and differential-algebraic systems and then discuss Hamiltonian systems. In the second part of the lecture we consider the iterative solution of large linear systems.

      Target Audience: Students of Bachelor and Master courses in Mathematics and of BMS

      Prerequisites: Basics of calculus (Analysis I, II) linear algebra (Lineare Algebra I, II) and numerical analysis (Numerik I)

    • 19202102 Practice seminar
      Practice seminar for Basic Module: Numeric II (André-Alexander Zepernick)
      Schedule: Mi 10:00-12:00, Fr 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
  • Advanced Module: Numerical Mathematics IV

    0280bA5.3
    • 19206401 Lecture
      Numerics IV: Coevolution of Complex Systems: Interactions Between Social, Health and Climate Dynamics (Christof Schütte)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: keine Angabe

      Comments

      This lecture explores how complex systems evolve together, with examples as the interplay between social opinion dynamics and infectious disease spread, or the feedback loops between climate change and economic behavior. Using established models for systems from the respective fields, we will examine how coupling between the systems can lead to unexpected outcomes or emergent behavior, and discuss related policy challenges for managing real-world crises.

    • 19206402 Practice seminar
      Practice seminar for Advanced Module: Numerics IV (Christof Schütte)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: keine Angabe
  • Introductory Module: Differential Equations II

    0280bA6.2
    • 19242001 Lecture
      Partial Differential Equations II (Erica Ipocoana)
      Schedule: Di 08:00-10:00, Do 10:00-12:00 (Class starts on: 2025-10-14)
      Location: Di A6/SR 031 Seminarraum (Arnimallee 6), Do A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      This course builds on the material of the course Partial Differential Equations I as taught in the previous summer term. Methods for linear partial differential equations will be deepened and extended to nonlinear partial differential equations. A central topic of the course is the theory of monotone and maximal monotone operators. 

       

    • 19242002 Practice seminar
      Tutorial Partial Differential Equations II (Erica Ipocoana)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
  • Complementary Module: Selected Topics

    0280bA7.1
    • 19225101 Lecture
      Soft Matter: Mathematical Aspects, Physical Modeling and Computer Simulation (Luigi Delle Site)
      Schedule: Mo 12:00-14:00, Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: Die Veranstaltung findet im Seminarraum der Arnimallee 9 statt.

      Additional information / Pre-requisites

      Audience: Master students of Mathematics and Physics interested in mathematical theory and computational modeling of Soft Matter Systems.

      Requirements: Basic Knowledge of statistical physics and of dynamics, computer programming

      Comments

      Program

      Polymer Physics: Structure and Dynamics

      • (a) Theoretical/analytic approaches
      • (b) Physical and chemical Modeling
      • (c) Simulation

      Biological Membranes

      • (a) Theoretical/analytic approaches
      • (b) Physical and chemical Modeling
      • (c) Simulation

      Introduction to Colloids and Liquid Crystals

      • Theory and Simulation

      Introduction to Hydrodynamic scale for large Biological Systems:

      • Examples are e.g. Cellular processes, Red Blood Cells in Capillary Flow, etc. (Theory and Simulation)

      Suggested reading

      Basic Literature:

      1. Introduction to Polymer Physics by M. Doi
      2. Soft Matter Physics by M. Doi
      3. Biomembrane Frontiers: Nanostructures, Models, and the Design of Life (Handbook of Modern Biophysics) by von Thomas Jue, Subhash H. Risbud, Marjorie L. Longo, Roland Faller (Editors)

    • 19234401 Lecture
      Discrete Mathematics II - Optimization (Ralf Borndörfer)
      Schedule: Mo 14:00-16:00, Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: Mo A6/SR 032 Seminarraum (Arnimallee 6), Do A7/SR 031 (Arnimallee 7)

      Additional information / Pre-requisites

      Credit This course can be chosen as Discrete Mathematics II (DM II). If Discrete Mathematics II - Extreme Combinatorics is taken at the same time, one of the two courses can be chosen as DM II and the other as a supplementary module. Language This lecture is in English.

      Exam

      The exam takes place at the last lecture. The 2nd exam takes place in the last week of the summer holidays before the lectures resume.

      Comments

      This lecture starts the optimization branch of discrete mathematics. It deals with algorithmic graph theory and linear optimization.

      Contents

      Complexity: complexity measures, run time of algorithms, the classes P and NP, NP-completeness
      Matroids and Independence Systems: independence systems, matroids, trees, forests, oracles, optimization over independence systems
      Shortest Paths: nonnegative weights, general weights, all pairs
      Network Flows: Max-Flow-Min-Cut Theorem, augmenting paths, minimum cost flows, transport and allocation problems
      Polyhedra: faces, dimension formula, projections of polyhedra, transformation, polarity, representation theorems
      Foundations of linear optimization: Farkas Lemma, Duality Theorem
      Simplex algorithm: basis, degeneration, basis exchange, revised simplex algorithm, bounds, dual simplex algorithm, post-optimization, numerics
      Interior point and ellipsoid method: basics

      Audience

      This course is aimed at mathematics students with knowledge of discrete mathematics I, linear algebra and analysis. Some exercises require the use of a computer.

      Suggested reading

      M. Grötschel, Lineare Optimierung, eines der Vorlesungsskripte

      V. Chvátal, Linear Programming, Freeman 1983

      Additional

      Garey & Johnson, Computers and Intractability,  1979 (Complexity Theory)

      Bertsimas & Tsitsiklis, Introduction to Linear Optimization, 97 (Linear Programming)

      Korte & Vygen, Combinatorial Optimization, 2006 (Flows, Shortest Paths, Matchings)

    • 19303601 Lecture
      Cryptography and Security in Distributed Systems (Volker Roth)
      Schedule: Mi 14:00-16:00, Do 10:00-12:00 (Class starts on: 2025-10-15)
      Location: T9/SR 006 Seminarraum (Takustr. 9)

      Additional information / Pre-requisites

      Requirements: Participants must have a good mathematical understanding and good knowledge of computer security and networking.

      Comments

      This course gives an introduction to cryptography and cryptographic key management, as well as an introduction to cryptographic protocols and their application in the field of security in distributed systems. Relevant mathematical tools will be developed accordingly. In addition, the lecture addresses the importance of implementation details in the context of IT system security.

      Suggested reading

      • Jonathan Katz and Yehuda Lindell, Introduction to Modern Cryptography, 2008
      • Lindsay N. Childs, A Concrete Introduction to Higher Algebra. Springer Verlag, 1995.
      • Johannes Buchmann, Einfuehrung in die Kryptographie. Springer Verlag, 1999.

      Weitere noch zu bestimmende Literatur und Primärquellen.

    • 19225102 Practice seminar
      Practice seminar for Soft Matter: Mathematical Aspects, Physical Modeling and Computer Simulation (Luigi Delle Site)
      Schedule: Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: SR A9
    • 19234402 Practice seminar
      Practice seminar for Discrete Mathematics II - Optimization (N.N.)
      Schedule: Mo 16:00-18:00 (Class starts on: 2025-10-20)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19303602 Practice seminar
      Übung zu Kryptographie und Sicherheit in Verteilten Systemen (Volker Roth)
      Schedule: Do 14:00-16:00 (Class starts on: 2025-10-16)
      Location: , T9/049 Seminarraum
  • Complementary Module: Selected Research Topics

    0280bA7.2
    • 19207101 Lecture
      Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content:

      Many problems in the sciences are determined by processes on several scales. Such problems are denoted as multi-scale problems. One example for a multi-scale problem is the partial differential equations (PDEs), which govern geophysical fluid flows. Averaging methods can be used for the analytical description of the slow scales. These descriptions are beneficial for numerical time-stepping schemes, as they allow for taking bigger time-steps than the unaveraged problem. The focus of this course will be on averaging methods for PDEs describing fluid flows and the design of parallelisable numerical time stepping methods, which are versions of the Parareal method and incorporate averaging techniques.

      Requirements: basic courses in analysis, basic course numerical mathematics

       

      Literature:

      Wingate, B.A.; Rosemeier, J.; Haut, T., Mean Flow from Phase Averages in the 2D Boussinesq Equations. Atmosphere 2023, 14, 1523.

      https://doi.org/10.3390/atmos14101523

      T. Haut, B. Wingate,  An asymptotic parallel-in-time method for highly oscillatory pde's, SIAM Journal on Scientific Computing, 36 (2014), pp.

      A693-A713

      J.-L. Lions, G. Turinici, A "parareal" in time discretization of PDE's, Comptes Rendus de l'Academie des Sciences - Series I - Mathematics, 332 (2001), pp. 661-668 Sanders, F. Verhulst, J. Murdock,  Averaging Methods in Nonlinear Dynamical Systems, Springer New York, NY, 2ed., 2000

       

       

    • 19235101 Lecture
      Function and distribution spaces (Willem Van Zuijlen)
      Schedule: Di 14:00-16:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      Prerequisits: Analysis I — III, Linear Algebra I, II. 
      Recommended: Functional Analysis.

      Comments

      In this course we consider function spaces and spaces of distributions, also called generalised functions. Distributions play an important role in the theory of partial differential equations, as in contrast to functions, they are always differentiable. Hence, during the course we motivate the context via PDEs here and there. We will discuss: 

      Distribution spaces and their notion of convergence (on general domains)
      Sobolev spaces (on general domains)
      Tempered distributions and the Fourier transform (on R^d)
      Besov spaces (on R^d)
      Bony's para- and resonance products
       

      Suggested reading

      There will be lecture notes.

    • 19320501 Lecture
      Quantenalgorithm and Cryptanalysis (Marian Margraf)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Comments

      The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

    • 19207102 Practice seminar
      Tutorials for Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
    • 19235102 Practice seminar
      Exercise: Function and distribution spaces (N.N.)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A3/ 024 Seminarraum (Arnimallee 3-5)
    • 19320502 Practice seminar
      Practice seminar for Cryptanalysis (Marian Margraf)
      Schedule: Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: T9/055 Seminarraum (Takustr. 9)
  • Complementary Module: Research Seminar

    0280bA7.5
    • 19206111 Seminar
      Research Module: Discrete Geometry (Giulia Codenotti)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-01-26)
      Location: keine Angabe

      Additional information / Pre-requisites

      Pre-Meeting: see KVV

      Comments

      This seminar will look at remarkable polytopes — among them regular polytopes, cyclic/neighborly polytopes, hypersimplices, 2simple-2simplicial polytopes, cut polytopes, etc. We discuss the examples, their construction and their most interesting properties. Some of these examples were designed or used in order to solve problems, refute conjectures, or to support conjectures. Some of these have unexplored or unexplainable properties, and those of course we want to look at as well.

      “It is not unusual that a single example or a very few shape an entire mathematical discipline. Examples are the Petersen graph, cyclic polytopes, the Fano plane, the prisoner dilemma, the real n-dimensional projective space and the group of two by two nonsingular matrices. And it seems that overall, we are short of examples. The methods for coming up with useful examples in mathematics (or counterexamples for commonly believed conjectures) are even less clear than the methods for proving mathematical statements.” — Gil Kalai (2000)

      Suggested reading

      Themenvergabe und speziellere Literaturangaben in der Vorbesprechung zum Seminar.

    • 19214411 Seminar
      Research Module: Differential Geometrie (Konrad Polthier, Tillmann Kleiner)
      Schedule: Di 16:00-18:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 007/008 Seminarraum (Arnimallee 6)

      Comments

      In this seminar, differential geometric topics will be independently developed based on current research and presented in the form of a talk.

      Particular emphasis is placed on the concrete implementation of differential geometric concepts in application scenarios and the questions of discretization and implementation.

      Learning objectives are a deeper understanding of differential geometry concepts, as well as problems and solution strategies in their practical use.

      Previous knowledge: Differential geometry I

    • 19223811 Seminar
      Master Seminar Topology "L^2-Betti numbers" (N.N.)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisites: Basic knowledge of topology and group theory is required.

      Comments

      The Euler characteristic of finite CW-complexes is multiplicative under finite-sheeted coverings and it is homotopy invariant. These properties can be deduced from different descriptions:
      1. As the alternating sum of the numbers of cells, which are multiplicative but not homotopy invariant.
      2. As the alternating sum of Betti numbers, which are homotopy invariant but not multiplicative. The $n$-th Betti number of $X$ is the $\mathbb{Q}$-dimension of the homology $H_n(X;\mathbb{Q})$ with rational coefficients.
      3. As the alternating sum of $L^2$-Betti numbers, which enjoy the best features from both worlds: they are multiplicative and homotopy invariant. The $n$-th $L^2$-Betti number of $X$ is the von Neumann-dimension of the homology $H_n(X; \mathcal{N}\pi_1(X))$ with suitable coefficients.

      $L^2$-Betti numbers are meaningful topological invariants, as they obstruct the structures of mapping tori and $S^1$-actions. They also have applications to group theory by considering the $L^2$-Betti numbers of classifying spaces. Moreover, $L^2$-Betti numbers are related to famous open problems, such as the Hopf and Singer conjectures on the Euler characteristic of manifolds, and the Kaplansky conjecture on zero divisors in group rings.

      Detailed Information can be found on the Homepage of the seminar.

      Suggested reading

      This seminar will be an introduction to $L^2$-Betti numbers, following mostly
      the book by Holger Kammeyer.

    • 19226511 Seminar
      Seminar Multiscale Methods in Molecular Simulations (Luigi Delle Site)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: Seminarraum in der Arnimallee 9

      Additional information / Pre-requisites

      Audience: At least 6th semester with a background in statistical and quantum mechanics, Master students and PhD students (even postdocs) are welcome.

      Comments

      Content: The seminar will concern the discussion of state-of-art techniques in molecular simulation which allow for a simulation of several space (especially) and time scale within one computational approach.

      The discussion will concerns both, specific computational coding and conceptual developments.

      Suggested reading

      Related Basic Literature:

      (1) M.Praprotnik, L.Delle Site and K.Kremer, Ann.Rev.Phys.Chem.59, 545-571 (2008)

      (2) C.Peter, L.Delle Site and K.Kremer, Soft Matter 4, 859-869 (2008).

      (3) M.Praprotnik and L.Delle Site, in "Biomolecular Simulations: Methods and Protocols" L.Monticelli and E.Salonen Eds. Vol.924, 567-583 (2012) Methods Mol. Biol. Springer-Science

  • Complementary Module: Probability and Statistics II

    0280bA7.7
    • 19212901 Lecture
      Stochastics II (Felix Höfling)
      Schedule: Di 12:00-14:00, Do 08:00-10:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisite: Stochastics I  and  Analysis I — III.

      Comments

      Contents:

      • Basics: conditional expectation, characteristic function, convergence types, uniform integrability;
      • Construction of stochastic processes and examples: Gaussian processes, Lévy processes, Brownian motion;
      • martingales in discrete time: convergence, stopping theorems, inequalities;
      • Markov chains in discrete and continuous time: recurrence and transience, invariant measures.

      Suggested reading

      • Klenke: Wahrscheinlichkeitstheorie
      • Durrett: Probability. Theory and Examples.

      Weitere Literatur wird im Lauf der Vorlesung bekannt gegeben.
      Further literature will be given during the lecture.

    • 19212902 Practice seminar
      Practice seminar for Stochastics II (Felix Höfling)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)

      Comments

      Inhalt

       

       

      • This course is the sequel of the course of Stochastics I. The main objective is to go beyond the first principles in probability theory by introducing the general language of measure theory, and the application of this framework in a wide variety of probabilistic scenarios.
        More precisely, the course will cover the following aspects of probability theory:
      • Measure theory and the Lebesgue integral
      • Convergence of random variables and 0-1 laws
      • Generating functions: branching processes and characteristic functions
      • Markov chains
      • Introduction to martingales

       

       

  • Complementary Module: BMS Fridays

    0280bA7.8
    • 19223111 Seminar
      BMS Fridays (Holger Reich)
      Schedule: Fr 12.12. 14:00-18:00, Fr 30.01. 14:00-18:00 (Class starts on: 2025-12-12)
      Location: T9/Gr. Hörsaal (Takustr. 9)

      Comments

      The Friday colloquia of BMS represent a common meeting point for Berlin mathematics at Urania Berlin: a colloquium with broad emanation that permits an overview of large-scale connections and insights. In thematic series, the conversation is about “mathematics as a whole,” and we hope to be able to witness some breakthroughs.

      Typically, there is a BMS colloquium every other Friday afternoon in the BMS Loft at Urania during term time. BMS Friday colloquia usually start at 2:15 pm. Tea and cookies are served before each talk at 1:00 pm.

      More details: https://www.math-berlin.de/academics/bms-fridays

  • Complementary Module: What is…?

    0280bA7.9
    • 19217311 Seminar
      PhD Seminar "What is...?" (Holger Reich)
      Schedule: Termine siehe LV-Details (Class starts on: 2025-10-17)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      The "What is ...?" seminars are usually held before the BMS Friday seminar to complement the topic of the talk.

      Audience: Anybody interested in mathematics is invited to attend the "What is ...?" seminars. This includes Bachelors, Masters, Diplom, and PhD students from any field, as well as researchers like Post-Docs.
      Requirements: The speakers assume that the audience has at least a general knowledge of graduate-level mathematics.

      Comments

      Content: The "What is ...?" seminar is a 30-minute weekly seminar that concisely introduces terms and ideas that are fundamental to certain fields of mathematics but may not be familiar in others.
      The vast mathematical landscape in Berlin welcomes mathematicians with diverse backgrounds to work side by side, yet their paths often only cross within their individual research groups. To encourage interdisciplinary cooperation and collaboration, the "What is ...?" seminar attempts to initiate contact by introducing essential vocabulary and foundational concepts of the numerous fields represented in Berlin. The casual atmosphere of the seminar invites the audience to ask many questions and the speakers to experiment with their presentation styles.
      The location of the seminar rotates among the Urania, FU, TU, and HU. On the weeks when a BMS Friday takes place, the "What is ...?" seminar topic is arranged to coincide with the Friday talk acting as an introductory talk for the BMS Friday Colloquium. For a schedule of the talks and their locations, check the website. The website is updated frequently throughout the semester.

      Talks and more detailed information can be found here
      Homepage: http://www.math.fu-berlin.de/w/Math/WhatIsSeminar

  • Introductory Module: Numerical Mathematics II

    0280cA1.11
    • 19202101 Lecture
      Basic Module: Numeric II (Robert Gruhlke)
      Schedule: Mo 12:00-14:00, Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Comments

      Description: Extending basic knowledge on odes from Numerik I, we first concentrate on one-step methods for stiff and differential-algebraic systems and then discuss Hamiltonian systems. In the second part of the lecture we consider the iterative solution of large linear systems.

      Target Audience: Students of Bachelor and Master courses in Mathematics and of BMS

      Prerequisites: Basics of calculus (Analysis I, II) linear algebra (Lineare Algebra I, II) and numerical analysis (Numerik I)

    • 19202102 Practice seminar
      Practice seminar for Basic Module: Numeric II (André-Alexander Zepernick)
      Schedule: Mi 10:00-12:00, Fr 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
  • Introductory Module: Partial Differential Equations II

    0280cA1.14
    • 19242001 Lecture
      Partial Differential Equations II (Erica Ipocoana)
      Schedule: Di 08:00-10:00, Do 10:00-12:00 (Class starts on: 2025-10-14)
      Location: Di A6/SR 031 Seminarraum (Arnimallee 6), Do A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      This course builds on the material of the course Partial Differential Equations I as taught in the previous summer term. Methods for linear partial differential equations will be deepened and extended to nonlinear partial differential equations. A central topic of the course is the theory of monotone and maximal monotone operators. 

       

    • 19242002 Practice seminar
      Tutorial Partial Differential Equations II (Erica Ipocoana)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
  • Introductory Module: Probability and Statistics II

    0280cA1.15
    • 19212901 Lecture
      Stochastics II (Felix Höfling)
      Schedule: Di 12:00-14:00, Do 08:00-10:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisite: Stochastics I  and  Analysis I — III.

      Comments

      Contents:

      • Basics: conditional expectation, characteristic function, convergence types, uniform integrability;
      • Construction of stochastic processes and examples: Gaussian processes, Lévy processes, Brownian motion;
      • martingales in discrete time: convergence, stopping theorems, inequalities;
      • Markov chains in discrete and continuous time: recurrence and transience, invariant measures.

      Suggested reading

      • Klenke: Wahrscheinlichkeitstheorie
      • Durrett: Probability. Theory and Examples.

      Weitere Literatur wird im Lauf der Vorlesung bekannt gegeben.
      Further literature will be given during the lecture.

    • 19212902 Practice seminar
      Practice seminar for Stochastics II (Felix Höfling)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)

      Comments

      Inhalt

       

       

      • This course is the sequel of the course of Stochastics I. The main objective is to go beyond the first principles in probability theory by introducing the general language of measure theory, and the application of this framework in a wide variety of probabilistic scenarios.
        More precisely, the course will cover the following aspects of probability theory:
      • Measure theory and the Lebesgue integral
      • Convergence of random variables and 0-1 laws
      • Generating functions: branching processes and characteristic functions
      • Markov chains
      • Introduction to martingales

       

       

  • Introductory Module: Topology II

    0280cA1.18
    • 19206201 Lecture
      Basic Module: Topology II (Pavle Blagojevic)
      Schedule: Di 14:00-16:00, Do 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content: Homology, cohomology and applications, CW-complexes, basic notions of homotopy theory

      Suggested reading

      Literatur

      • Hatcher, Allen: Algebraic Topology; Cambridge University Press.
      • http://www.math.cornell.edu/~hatcher/AT/ATpage.html
      • Lück, Wolfgang: Algebraische Topologie, Homologie und Mannigfaltigkeiten; Vieweg.

    • 19206202 Practice seminar
      Ex.: Basic Module: Topology II (Katarina Krivokuca)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
  • Introductory Module: Differential Geometry I

    0280cA1.3
    • 19202601 Lecture
      Differential Geometry I (Konrad Polthier)
      Schedule: Mo 10:00-12:00, Mi 10:00-12:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-15)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Additional information / Pre-requisites

      For further information, see Lecture Homepage.

      Comments

      Topics of the lecture will be:

      • curves and surfaces in Euclidean space,
      • metrics and (Riemannian) manifolds,
      • surface tension, notions of curvature,
      • vector fields, tensors, covariant derivative
      • geodesic curves, exponential map,
      • Gauß-Bonnet theorem, topology,
      • connection to discrete differential geometry.

      This course is a BMS course and will be held in English on request.

      Prerequisits:

      Analysis I, II, III and Linear Algebra I, II

       

       

      Suggested reading

      Literature

      • W. Kühnel: Differentialgeometrie:Kurven - Flächen - Mannigfaltigkeiten, Springer, 2012
      • M. P. do Carmo, Differential Geometry of Curves and Surfaces, Prentice Hall
      • J.-H. Eschenburg, J. Jost: Differentialgeometrie und Minimalflächen, Springer, 2014
      • C. Bär: Elementare Differentialgeometrie, de Gruyter, 2001

    • 19202602 Practice seminar
      Practice seminar for Differential Geometry I (Tillmann Kleiner, Konrad Polthier)
      Schedule: Mo 08:00-10:00, Mi 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Introductory Module: Discrete Geometry I

    0280cA1.5
    • 19202001 Lecture
      Discrete Geometrie I (Christian Haase)
      Schedule: Di 10:00-12:00, Mi 12:00-14:00 (Class starts on: 2025-10-14)
      Location: A3/SR 120 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Solid background in linear algebra. Knowledge in combinatorics and geometry is advantageous.

      Comments

      Physical presence in the exercises on Wednesdays is mandatory.

      This is the first in a series of three courses on discrete geometry. The aim of the course is a skillful handling of discrete geometric structures including analysis and proof techniques. The material will be a selection of the following topics:
      Basic structures in discrete geometry

      • polyhedra and polyhedral complexes
      • configurations of points, hyperplanes, subspaces
      • Subdivisions and triangulations (including Delaunay and Voronoi)
      • Polytope theory
      • Representations and the theorem of Minkowski-Weyl
      • polarity, simple/simplicial polytopes, shellability
      • shellability, face lattices, f-vectors, Euler- and Dehn-Sommerville
      • graphs, diameters, Hirsch (ex-)conjecture
      • Geometry of linear programming
      • linear programs, simplex algorithm, LP-duality
      • Combinatorial geometry / Geometric combinatorics
      • Arrangements of points and lines, Sylvester-Gallai, Erdos-Szekeres
      • Arrangements, zonotopes, zonotopal tilings, oriented matroids
      • Examples, examples, examples
      • regular polytopes, centrally symmetric polytopes
      • extremal polytopes, cyclic/neighborly polytopes, stacked polytopes
      • combinatorial optimization and 0/1-polytopes

       

      For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding for discrete-geometric structures appearing in differential geometry, topology, combinatorics, and algebraic geometry.

       

       

       

       

       

       

       

       

       

      Suggested reading

      • G.M. Ziegler "Lectures in Polytopes"
      • J. Matousek "Lectures on Discrete Geometry"
      • Further literature will be announced in class.

    • 19202002 Practice seminar
      Practice seminar for Discrete Geometrie I (Sofia Garzón Mora, Christian Haase)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Introductory Module: Discrete Mathematics II

    0280cA1.8
    • 19234401 Lecture
      Discrete Mathematics II - Optimization (Ralf Borndörfer)
      Schedule: Mo 14:00-16:00, Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: Mo A6/SR 032 Seminarraum (Arnimallee 6), Do A7/SR 031 (Arnimallee 7)

      Additional information / Pre-requisites

      Credit This course can be chosen as Discrete Mathematics II (DM II). If Discrete Mathematics II - Extreme Combinatorics is taken at the same time, one of the two courses can be chosen as DM II and the other as a supplementary module. Language This lecture is in English.

      Exam

      The exam takes place at the last lecture. The 2nd exam takes place in the last week of the summer holidays before the lectures resume.

      Comments

      This lecture starts the optimization branch of discrete mathematics. It deals with algorithmic graph theory and linear optimization.

      Contents

      Complexity: complexity measures, run time of algorithms, the classes P and NP, NP-completeness
      Matroids and Independence Systems: independence systems, matroids, trees, forests, oracles, optimization over independence systems
      Shortest Paths: nonnegative weights, general weights, all pairs
      Network Flows: Max-Flow-Min-Cut Theorem, augmenting paths, minimum cost flows, transport and allocation problems
      Polyhedra: faces, dimension formula, projections of polyhedra, transformation, polarity, representation theorems
      Foundations of linear optimization: Farkas Lemma, Duality Theorem
      Simplex algorithm: basis, degeneration, basis exchange, revised simplex algorithm, bounds, dual simplex algorithm, post-optimization, numerics
      Interior point and ellipsoid method: basics

      Audience

      This course is aimed at mathematics students with knowledge of discrete mathematics I, linear algebra and analysis. Some exercises require the use of a computer.

      Suggested reading

      M. Grötschel, Lineare Optimierung, eines der Vorlesungsskripte

      V. Chvátal, Linear Programming, Freeman 1983

      Additional

      Garey & Johnson, Computers and Intractability,  1979 (Complexity Theory)

      Bertsimas & Tsitsiklis, Introduction to Linear Optimization, 97 (Linear Programming)

      Korte & Vygen, Combinatorial Optimization, 2006 (Flows, Shortest Paths, Matchings)

    • 19234402 Practice seminar
      Practice seminar for Discrete Mathematics II - Optimization (N.N.)
      Schedule: Mo 16:00-18:00 (Class starts on: 2025-10-20)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
  • Advanced Module: Algebra III

    0280cA2.1
    • 19222301 Lecture
      Advanced Module: Algebra III (Holger Reich)
      Schedule: Mo 12:00-14:00 (Class starts on: 2025-11-03)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Course contents: a selection of the following topics

      • properties of morphisms (proper, projective, smooth)
      • divisors
      • (quasi-)coherent sheaves
      • cohomology
      • Hilbert functions

      further properties of morphisms (proper, integral, regular, smooth, étale, ...)

      • Grothendieck topologies
      • cohomology (Čech, étale, ...)

      Suggested reading

      For example: Introduction to Schemes, Geir Ellingsrud and John Christian Otten

    • 19222302 Practice seminar
      Practice seminar for Advanced Module: Algebra III (Holger Reich)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-29)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
  • Advanced Module: Discrete Geometry III

    0280cA2.3
    • 19205901 Lecture
      Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      The target audience are students with a solid background in discrete geometry and/or convex geometry (en par with Discrete Geometry I & II). The topic of this course is a state-of-art of advanced topics in discrete geometry that find applications and incarnations in differential geometry, topology, combinatorics, and algebraic geometry.

      Requirements: Preferably Discrete Geometry I and II.

      Comments

      This is the third in a series of three courses on discrete geometry. This advanced course will cover a selection of the following topics (depending on the interests of the audience):   1. Oriented Matroids along the lines of the book Oriented Matroids by Björner, Las Vergnas, Sturmfels, White, and Ziegler; and/or   2. Triangulations along the lines of the book Triangulations by de Loera, Rambau, and Santos; and/or   3. Discriminants and tropical geometry along the lines of the book Discriminants, Resultants, and multidimensional determinants by Gelfand, Kapranov, and Zelevinsky; and/or   4. Combinatorics and commutative algebra along the lines of the book Combinatorics and commutative algebra by Stanley.

      Suggested reading

      Will be announced in class.

    • 19205902 Practice seminar
      Practice seminar for Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A3/SR 120 (Arnimallee 3-5)
  • Advanced Module: Numerical Mathematics IV

    0280cA2.6
    • 19206401 Lecture
      Numerics IV: Coevolution of Complex Systems: Interactions Between Social, Health and Climate Dynamics (Christof Schütte)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: keine Angabe

      Comments

      This lecture explores how complex systems evolve together, with examples as the interplay between social opinion dynamics and infectious disease spread, or the feedback loops between climate change and economic behavior. Using established models for systems from the respective fields, we will examine how coupling between the systems can lead to unexpected outcomes or emergent behavior, and discuss related policy challenges for managing real-world crises.

    • 19207101 Lecture
      Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content:

      Many problems in the sciences are determined by processes on several scales. Such problems are denoted as multi-scale problems. One example for a multi-scale problem is the partial differential equations (PDEs), which govern geophysical fluid flows. Averaging methods can be used for the analytical description of the slow scales. These descriptions are beneficial for numerical time-stepping schemes, as they allow for taking bigger time-steps than the unaveraged problem. The focus of this course will be on averaging methods for PDEs describing fluid flows and the design of parallelisable numerical time stepping methods, which are versions of the Parareal method and incorporate averaging techniques.

      Requirements: basic courses in analysis, basic course numerical mathematics

       

      Literature:

      Wingate, B.A.; Rosemeier, J.; Haut, T., Mean Flow from Phase Averages in the 2D Boussinesq Equations. Atmosphere 2023, 14, 1523.

      https://doi.org/10.3390/atmos14101523

      T. Haut, B. Wingate,  An asymptotic parallel-in-time method for highly oscillatory pde's, SIAM Journal on Scientific Computing, 36 (2014), pp.

      A693-A713

      J.-L. Lions, G. Turinici, A "parareal" in time discretization of PDE's, Comptes Rendus de l'Academie des Sciences - Series I - Mathematics, 332 (2001), pp. 661-668 Sanders, F. Verhulst, J. Murdock,  Averaging Methods in Nonlinear Dynamical Systems, Springer New York, NY, 2ed., 2000

       

       

    • 19206402 Practice seminar
      Practice seminar for Advanced Module: Numerics IV (Christof Schütte)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: keine Angabe
    • 19207102 Practice seminar
      Tutorials for Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
  • Specialization Module: Master's Seminar on Differential Geometry

    0280cA3.2
    • 19212211 Seminar
      Seminar on topic in Geometric Analysis and Differential Geometry (Elena Mäder-Baumdicker)
      Schedule: Mi 15.10. 12:00-14:00, Mi 05.11. 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Ana I bis III, lineare Algebra I und II sowie mindestens einer der beiden Vorlesungen Differentialgeometrie I oder Differentialgleichungen I.

      Comments

      This seminar is intended for Bachelor's and Master's students with an interest in topics related to Geometric Analysis and Differential Geometry. Each semester, the seminar focuses on a different theme — examples include geometric variational problems, geometric flows, and geometric measure theory.

      In the first meeting of the semester, students can express their interest in participating. In the second meeting, each participant selects a topic from a curated list. The presentations themselves will take place during a dedicated seminar week at the end of the term.

       

    • 19214411 Seminar
      Research Module: Differential Geometrie (Konrad Polthier, Tillmann Kleiner)
      Schedule: Di 16:00-18:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 007/008 Seminarraum (Arnimallee 6)

      Comments

      In this seminar, differential geometric topics will be independently developed based on current research and presented in the form of a talk.

      Particular emphasis is placed on the concrete implementation of differential geometric concepts in application scenarios and the questions of discretization and implementation.

      Learning objectives are a deeper understanding of differential geometry concepts, as well as problems and solution strategies in their practical use.

      Previous knowledge: Differential geometry I

  • Specialization Module: Master's Seminar on Discrete Geometry

    0280cA3.3
    • 19206111 Seminar
      Research Module: Discrete Geometry (Giulia Codenotti)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-01-26)
      Location: keine Angabe

      Additional information / Pre-requisites

      Pre-Meeting: see KVV

      Comments

      This seminar will look at remarkable polytopes — among them regular polytopes, cyclic/neighborly polytopes, hypersimplices, 2simple-2simplicial polytopes, cut polytopes, etc. We discuss the examples, their construction and their most interesting properties. Some of these examples were designed or used in order to solve problems, refute conjectures, or to support conjectures. Some of these have unexplored or unexplainable properties, and those of course we want to look at as well.

      “It is not unusual that a single example or a very few shape an entire mathematical discipline. Examples are the Petersen graph, cyclic polytopes, the Fano plane, the prisoner dilemma, the real n-dimensional projective space and the group of two by two nonsingular matrices. And it seems that overall, we are short of examples. The methods for coming up with useful examples in mathematics (or counterexamples for commonly believed conjectures) are even less clear than the methods for proving mathematical statements.” — Gil Kalai (2000)

      Suggested reading

      Themenvergabe und speziellere Literaturangaben in der Vorbesprechung zum Seminar.

  • Specialization Module: Master’s Seminar on Numerical Mathematics

    0280cA3.6
    • 19208111 Seminar
      Masterseminar Stochastics "Mathematical Reinforcement Learning for AI" (Guilherme de Lima Feltes)
      Schedule: Do 16:00-18:00 (Class starts on: 2025-10-16)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Additional information / Pre-requisites

      Prerequisites: Stochastics I and II. Desirable: Stochastics III.
      Target Group: BMS Students, Master students of Mathematics and advanced Bachelor students of Mathematics.

      Comments

      Content: The seminar covers advanced topics of stochastics.

      Detailed Information can be found on the Homepage of the seminar.

      Reinforcement learning lies at the core of many state-of-the-art artificial intelligence algorithms, enabling agents to solve complex optimal control tasks in robotics, finance, physical AI, drug discovery, computer games and many other applications.
      This seminar offers a rigorous treatment of reinforcement learning, focusing on the mathematical principles that make reinforcement learning algorithms work. We will develop a mathematically sound understanding of Markov decision processes, value function based methods and their connections to stochastic optimal control, policy gradient methods, emphasizing convergence properties of classical reinforcement learning algorithms through stochastic approximation and stochastic gradient descent. We will also explore continuous time reinforcement learning in the framework of stochastic differential equations.
      The seminar aims to provide a rigorous foundational perspective for students interested in current research related to reinforcement learning and artificial intelligence. Participants should have a strong background in mathematics specifically in probability theory.

      Suggested reading

      Literatur wird in der Vorbesprechung bekanntgegeben.

      Literature will be announced in the preliminary discussion

    • 19226511 Seminar
      Seminar Multiscale Methods in Molecular Simulations (Luigi Delle Site)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: Seminarraum in der Arnimallee 9

      Additional information / Pre-requisites

      Audience: At least 6th semester with a background in statistical and quantum mechanics, Master students and PhD students (even postdocs) are welcome.

      Comments

      Content: The seminar will concern the discussion of state-of-art techniques in molecular simulation which allow for a simulation of several space (especially) and time scale within one computational approach.

      The discussion will concerns both, specific computational coding and conceptual developments.

      Suggested reading

      Related Basic Literature:

      (1) M.Praprotnik, L.Delle Site and K.Kremer, Ann.Rev.Phys.Chem.59, 545-571 (2008)

      (2) C.Peter, L.Delle Site and K.Kremer, Soft Matter 4, 859-869 (2008).

      (3) M.Praprotnik and L.Delle Site, in "Biomolecular Simulations: Methods and Protocols" L.Monticelli and E.Salonen Eds. Vol.924, 567-583 (2012) Methods Mol. Biol. Springer-Science

  • Specialization Module: Master's Seminar on Partial Differential Equations

    0280cA3.7
    • 19247111 Seminar
      Ordinary Differential Equations (Marita Thomas)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Ordinary differential equations arise in many applications from physics, chemistry, biology or economics. This seminar extends the topics that were covered in the Analysis III course, e.g., eigenvalue problems and stability theory will be addressed. 

  • Specialization Module: Master’s Seminar on Probability and Statistics

    0280cA3.8
    • 19208111 Seminar
      Masterseminar Stochastics "Mathematical Reinforcement Learning for AI" (Guilherme de Lima Feltes)
      Schedule: Do 16:00-18:00 (Class starts on: 2025-10-16)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Additional information / Pre-requisites

      Prerequisites: Stochastics I and II. Desirable: Stochastics III.
      Target Group: BMS Students, Master students of Mathematics and advanced Bachelor students of Mathematics.

      Comments

      Content: The seminar covers advanced topics of stochastics.

      Detailed Information can be found on the Homepage of the seminar.

      Reinforcement learning lies at the core of many state-of-the-art artificial intelligence algorithms, enabling agents to solve complex optimal control tasks in robotics, finance, physical AI, drug discovery, computer games and many other applications.
      This seminar offers a rigorous treatment of reinforcement learning, focusing on the mathematical principles that make reinforcement learning algorithms work. We will develop a mathematically sound understanding of Markov decision processes, value function based methods and their connections to stochastic optimal control, policy gradient methods, emphasizing convergence properties of classical reinforcement learning algorithms through stochastic approximation and stochastic gradient descent. We will also explore continuous time reinforcement learning in the framework of stochastic differential equations.
      The seminar aims to provide a rigorous foundational perspective for students interested in current research related to reinforcement learning and artificial intelligence. Participants should have a strong background in mathematics specifically in probability theory.

      Suggested reading

      Literatur wird in der Vorbesprechung bekanntgegeben.

      Literature will be announced in the preliminary discussion

  • Specialization Module: Master’s Seminar on Topology

    0280cA3.9
    • 19223811 Seminar
      Master Seminar Topology "L^2-Betti numbers" (N.N.)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisites: Basic knowledge of topology and group theory is required.

      Comments

      The Euler characteristic of finite CW-complexes is multiplicative under finite-sheeted coverings and it is homotopy invariant. These properties can be deduced from different descriptions:
      1. As the alternating sum of the numbers of cells, which are multiplicative but not homotopy invariant.
      2. As the alternating sum of Betti numbers, which are homotopy invariant but not multiplicative. The $n$-th Betti number of $X$ is the $\mathbb{Q}$-dimension of the homology $H_n(X;\mathbb{Q})$ with rational coefficients.
      3. As the alternating sum of $L^2$-Betti numbers, which enjoy the best features from both worlds: they are multiplicative and homotopy invariant. The $n$-th $L^2$-Betti number of $X$ is the von Neumann-dimension of the homology $H_n(X; \mathcal{N}\pi_1(X))$ with suitable coefficients.

      $L^2$-Betti numbers are meaningful topological invariants, as they obstruct the structures of mapping tori and $S^1$-actions. They also have applications to group theory by considering the $L^2$-Betti numbers of classifying spaces. Moreover, $L^2$-Betti numbers are related to famous open problems, such as the Hopf and Singer conjectures on the Euler characteristic of manifolds, and the Kaplansky conjecture on zero divisors in group rings.

      Detailed Information can be found on the Homepage of the seminar.

      Suggested reading

      This seminar will be an introduction to $L^2$-Betti numbers, following mostly
      the book by Holger Kammeyer.

  • Complementary Module: Selected Topics A

    0280cA4.1
    • 19202001 Lecture
      Discrete Geometrie I (Christian Haase)
      Schedule: Di 10:00-12:00, Mi 12:00-14:00 (Class starts on: 2025-10-14)
      Location: A3/SR 120 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Solid background in linear algebra. Knowledge in combinatorics and geometry is advantageous.

      Comments

      Physical presence in the exercises on Wednesdays is mandatory.

      This is the first in a series of three courses on discrete geometry. The aim of the course is a skillful handling of discrete geometric structures including analysis and proof techniques. The material will be a selection of the following topics:
      Basic structures in discrete geometry

      • polyhedra and polyhedral complexes
      • configurations of points, hyperplanes, subspaces
      • Subdivisions and triangulations (including Delaunay and Voronoi)
      • Polytope theory
      • Representations and the theorem of Minkowski-Weyl
      • polarity, simple/simplicial polytopes, shellability
      • shellability, face lattices, f-vectors, Euler- and Dehn-Sommerville
      • graphs, diameters, Hirsch (ex-)conjecture
      • Geometry of linear programming
      • linear programs, simplex algorithm, LP-duality
      • Combinatorial geometry / Geometric combinatorics
      • Arrangements of points and lines, Sylvester-Gallai, Erdos-Szekeres
      • Arrangements, zonotopes, zonotopal tilings, oriented matroids
      • Examples, examples, examples
      • regular polytopes, centrally symmetric polytopes
      • extremal polytopes, cyclic/neighborly polytopes, stacked polytopes
      • combinatorial optimization and 0/1-polytopes

       

      For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding for discrete-geometric structures appearing in differential geometry, topology, combinatorics, and algebraic geometry.

       

       

       

       

       

       

       

       

       

      Suggested reading

      • G.M. Ziegler "Lectures in Polytopes"
      • J. Matousek "Lectures on Discrete Geometry"
      • Further literature will be announced in class.

    • 19202101 Lecture
      Basic Module: Numeric II (Robert Gruhlke)
      Schedule: Mo 12:00-14:00, Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Comments

      Description: Extending basic knowledge on odes from Numerik I, we first concentrate on one-step methods for stiff and differential-algebraic systems and then discuss Hamiltonian systems. In the second part of the lecture we consider the iterative solution of large linear systems.

      Target Audience: Students of Bachelor and Master courses in Mathematics and of BMS

      Prerequisites: Basics of calculus (Analysis I, II) linear algebra (Lineare Algebra I, II) and numerical analysis (Numerik I)

    • 19202601 Lecture
      Differential Geometry I (Konrad Polthier)
      Schedule: Mo 10:00-12:00, Mi 10:00-12:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-15)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Additional information / Pre-requisites

      For further information, see Lecture Homepage.

      Comments

      Topics of the lecture will be:

      • curves and surfaces in Euclidean space,
      • metrics and (Riemannian) manifolds,
      • surface tension, notions of curvature,
      • vector fields, tensors, covariant derivative
      • geodesic curves, exponential map,
      • Gauß-Bonnet theorem, topology,
      • connection to discrete differential geometry.

      This course is a BMS course and will be held in English on request.

      Prerequisits:

      Analysis I, II, III and Linear Algebra I, II

       

       

      Suggested reading

      Literature

      • W. Kühnel: Differentialgeometrie:Kurven - Flächen - Mannigfaltigkeiten, Springer, 2012
      • M. P. do Carmo, Differential Geometry of Curves and Surfaces, Prentice Hall
      • J.-H. Eschenburg, J. Jost: Differentialgeometrie und Minimalflächen, Springer, 2014
      • C. Bär: Elementare Differentialgeometrie, de Gruyter, 2001

    • 19206201 Lecture
      Basic Module: Topology II (Pavle Blagojevic)
      Schedule: Di 14:00-16:00, Do 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content: Homology, cohomology and applications, CW-complexes, basic notions of homotopy theory

      Suggested reading

      Literatur

      • Hatcher, Allen: Algebraic Topology; Cambridge University Press.
      • http://www.math.cornell.edu/~hatcher/AT/ATpage.html
      • Lück, Wolfgang: Algebraische Topologie, Homologie und Mannigfaltigkeiten; Vieweg.

    • 19212901 Lecture
      Stochastics II (Felix Höfling)
      Schedule: Di 12:00-14:00, Do 08:00-10:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisite: Stochastics I  and  Analysis I — III.

      Comments

      Contents:

      • Basics: conditional expectation, characteristic function, convergence types, uniform integrability;
      • Construction of stochastic processes and examples: Gaussian processes, Lévy processes, Brownian motion;
      • martingales in discrete time: convergence, stopping theorems, inequalities;
      • Markov chains in discrete and continuous time: recurrence and transience, invariant measures.

      Suggested reading

      • Klenke: Wahrscheinlichkeitstheorie
      • Durrett: Probability. Theory and Examples.

      Weitere Literatur wird im Lauf der Vorlesung bekannt gegeben.
      Further literature will be given during the lecture.

    • 19225101 Lecture
      Soft Matter: Mathematical Aspects, Physical Modeling and Computer Simulation (Luigi Delle Site)
      Schedule: Mo 12:00-14:00, Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: Die Veranstaltung findet im Seminarraum der Arnimallee 9 statt.

      Additional information / Pre-requisites

      Audience: Master students of Mathematics and Physics interested in mathematical theory and computational modeling of Soft Matter Systems.

      Requirements: Basic Knowledge of statistical physics and of dynamics, computer programming

      Comments

      Program

      Polymer Physics: Structure and Dynamics

      • (a) Theoretical/analytic approaches
      • (b) Physical and chemical Modeling
      • (c) Simulation

      Biological Membranes

      • (a) Theoretical/analytic approaches
      • (b) Physical and chemical Modeling
      • (c) Simulation

      Introduction to Colloids and Liquid Crystals

      • Theory and Simulation

      Introduction to Hydrodynamic scale for large Biological Systems:

      • Examples are e.g. Cellular processes, Red Blood Cells in Capillary Flow, etc. (Theory and Simulation)

      Suggested reading

      Basic Literature:

      1. Introduction to Polymer Physics by M. Doi
      2. Soft Matter Physics by M. Doi
      3. Biomembrane Frontiers: Nanostructures, Models, and the Design of Life (Handbook of Modern Biophysics) by von Thomas Jue, Subhash H. Risbud, Marjorie L. Longo, Roland Faller (Editors)

    • 19234401 Lecture
      Discrete Mathematics II - Optimization (Ralf Borndörfer)
      Schedule: Mo 14:00-16:00, Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: Mo A6/SR 032 Seminarraum (Arnimallee 6), Do A7/SR 031 (Arnimallee 7)

      Additional information / Pre-requisites

      Credit This course can be chosen as Discrete Mathematics II (DM II). If Discrete Mathematics II - Extreme Combinatorics is taken at the same time, one of the two courses can be chosen as DM II and the other as a supplementary module. Language This lecture is in English.

      Exam

      The exam takes place at the last lecture. The 2nd exam takes place in the last week of the summer holidays before the lectures resume.

      Comments

      This lecture starts the optimization branch of discrete mathematics. It deals with algorithmic graph theory and linear optimization.

      Contents

      Complexity: complexity measures, run time of algorithms, the classes P and NP, NP-completeness
      Matroids and Independence Systems: independence systems, matroids, trees, forests, oracles, optimization over independence systems
      Shortest Paths: nonnegative weights, general weights, all pairs
      Network Flows: Max-Flow-Min-Cut Theorem, augmenting paths, minimum cost flows, transport and allocation problems
      Polyhedra: faces, dimension formula, projections of polyhedra, transformation, polarity, representation theorems
      Foundations of linear optimization: Farkas Lemma, Duality Theorem
      Simplex algorithm: basis, degeneration, basis exchange, revised simplex algorithm, bounds, dual simplex algorithm, post-optimization, numerics
      Interior point and ellipsoid method: basics

      Audience

      This course is aimed at mathematics students with knowledge of discrete mathematics I, linear algebra and analysis. Some exercises require the use of a computer.

      Suggested reading

      M. Grötschel, Lineare Optimierung, eines der Vorlesungsskripte

      V. Chvátal, Linear Programming, Freeman 1983

      Additional

      Garey & Johnson, Computers and Intractability,  1979 (Complexity Theory)

      Bertsimas & Tsitsiklis, Introduction to Linear Optimization, 97 (Linear Programming)

      Korte & Vygen, Combinatorial Optimization, 2006 (Flows, Shortest Paths, Matchings)

    • 19242001 Lecture
      Partial Differential Equations II (Erica Ipocoana)
      Schedule: Di 08:00-10:00, Do 10:00-12:00 (Class starts on: 2025-10-14)
      Location: Di A6/SR 031 Seminarraum (Arnimallee 6), Do A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      This course builds on the material of the course Partial Differential Equations I as taught in the previous summer term. Methods for linear partial differential equations will be deepened and extended to nonlinear partial differential equations. A central topic of the course is the theory of monotone and maximal monotone operators. 

       

    • 19202002 Practice seminar
      Practice seminar for Discrete Geometrie I (Sofia Garzón Mora, Christian Haase)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19202102 Practice seminar
      Practice seminar for Basic Module: Numeric II (André-Alexander Zepernick)
      Schedule: Mi 10:00-12:00, Fr 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
    • 19202602 Practice seminar
      Practice seminar for Differential Geometry I (Tillmann Kleiner, Konrad Polthier)
      Schedule: Mo 08:00-10:00, Mi 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19206202 Practice seminar
      Ex.: Basic Module: Topology II (Katarina Krivokuca)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
    • 19212902 Practice seminar
      Practice seminar for Stochastics II (Felix Höfling)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)

      Comments

      Inhalt

       

       

      • This course is the sequel of the course of Stochastics I. The main objective is to go beyond the first principles in probability theory by introducing the general language of measure theory, and the application of this framework in a wide variety of probabilistic scenarios.
        More precisely, the course will cover the following aspects of probability theory:
      • Measure theory and the Lebesgue integral
      • Convergence of random variables and 0-1 laws
      • Generating functions: branching processes and characteristic functions
      • Markov chains
      • Introduction to martingales

       

       

    • 19225102 Practice seminar
      Practice seminar for Soft Matter: Mathematical Aspects, Physical Modeling and Computer Simulation (Luigi Delle Site)
      Schedule: Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: SR A9
    • 19234402 Practice seminar
      Practice seminar for Discrete Mathematics II - Optimization (N.N.)
      Schedule: Mo 16:00-18:00 (Class starts on: 2025-10-20)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19242002 Practice seminar
      Tutorial Partial Differential Equations II (Erica Ipocoana)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
  • Complementary Module: Selected Topics B

    0280cA4.2
    • 19202001 Lecture
      Discrete Geometrie I (Christian Haase)
      Schedule: Di 10:00-12:00, Mi 12:00-14:00 (Class starts on: 2025-10-14)
      Location: A3/SR 120 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Solid background in linear algebra. Knowledge in combinatorics and geometry is advantageous.

      Comments

      Physical presence in the exercises on Wednesdays is mandatory.

      This is the first in a series of three courses on discrete geometry. The aim of the course is a skillful handling of discrete geometric structures including analysis and proof techniques. The material will be a selection of the following topics:
      Basic structures in discrete geometry

      • polyhedra and polyhedral complexes
      • configurations of points, hyperplanes, subspaces
      • Subdivisions and triangulations (including Delaunay and Voronoi)
      • Polytope theory
      • Representations and the theorem of Minkowski-Weyl
      • polarity, simple/simplicial polytopes, shellability
      • shellability, face lattices, f-vectors, Euler- and Dehn-Sommerville
      • graphs, diameters, Hirsch (ex-)conjecture
      • Geometry of linear programming
      • linear programs, simplex algorithm, LP-duality
      • Combinatorial geometry / Geometric combinatorics
      • Arrangements of points and lines, Sylvester-Gallai, Erdos-Szekeres
      • Arrangements, zonotopes, zonotopal tilings, oriented matroids
      • Examples, examples, examples
      • regular polytopes, centrally symmetric polytopes
      • extremal polytopes, cyclic/neighborly polytopes, stacked polytopes
      • combinatorial optimization and 0/1-polytopes

       

      For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding for discrete-geometric structures appearing in differential geometry, topology, combinatorics, and algebraic geometry.

       

       

       

       

       

       

       

       

       

      Suggested reading

      • G.M. Ziegler "Lectures in Polytopes"
      • J. Matousek "Lectures on Discrete Geometry"
      • Further literature will be announced in class.

    • 19202101 Lecture
      Basic Module: Numeric II (Robert Gruhlke)
      Schedule: Mo 12:00-14:00, Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Comments

      Description: Extending basic knowledge on odes from Numerik I, we first concentrate on one-step methods for stiff and differential-algebraic systems and then discuss Hamiltonian systems. In the second part of the lecture we consider the iterative solution of large linear systems.

      Target Audience: Students of Bachelor and Master courses in Mathematics and of BMS

      Prerequisites: Basics of calculus (Analysis I, II) linear algebra (Lineare Algebra I, II) and numerical analysis (Numerik I)

    • 19202601 Lecture
      Differential Geometry I (Konrad Polthier)
      Schedule: Mo 10:00-12:00, Mi 10:00-12:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-15)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Additional information / Pre-requisites

      For further information, see Lecture Homepage.

      Comments

      Topics of the lecture will be:

      • curves and surfaces in Euclidean space,
      • metrics and (Riemannian) manifolds,
      • surface tension, notions of curvature,
      • vector fields, tensors, covariant derivative
      • geodesic curves, exponential map,
      • Gauß-Bonnet theorem, topology,
      • connection to discrete differential geometry.

      This course is a BMS course and will be held in English on request.

      Prerequisits:

      Analysis I, II, III and Linear Algebra I, II

       

       

      Suggested reading

      Literature

      • W. Kühnel: Differentialgeometrie:Kurven - Flächen - Mannigfaltigkeiten, Springer, 2012
      • M. P. do Carmo, Differential Geometry of Curves and Surfaces, Prentice Hall
      • J.-H. Eschenburg, J. Jost: Differentialgeometrie und Minimalflächen, Springer, 2014
      • C. Bär: Elementare Differentialgeometrie, de Gruyter, 2001

    • 19206201 Lecture
      Basic Module: Topology II (Pavle Blagojevic)
      Schedule: Di 14:00-16:00, Do 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content: Homology, cohomology and applications, CW-complexes, basic notions of homotopy theory

      Suggested reading

      Literatur

      • Hatcher, Allen: Algebraic Topology; Cambridge University Press.
      • http://www.math.cornell.edu/~hatcher/AT/ATpage.html
      • Lück, Wolfgang: Algebraische Topologie, Homologie und Mannigfaltigkeiten; Vieweg.

    • 19212901 Lecture
      Stochastics II (Felix Höfling)
      Schedule: Di 12:00-14:00, Do 08:00-10:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisite: Stochastics I  and  Analysis I — III.

      Comments

      Contents:

      • Basics: conditional expectation, characteristic function, convergence types, uniform integrability;
      • Construction of stochastic processes and examples: Gaussian processes, Lévy processes, Brownian motion;
      • martingales in discrete time: convergence, stopping theorems, inequalities;
      • Markov chains in discrete and continuous time: recurrence and transience, invariant measures.

      Suggested reading

      • Klenke: Wahrscheinlichkeitstheorie
      • Durrett: Probability. Theory and Examples.

      Weitere Literatur wird im Lauf der Vorlesung bekannt gegeben.
      Further literature will be given during the lecture.

    • 19225101 Lecture
      Soft Matter: Mathematical Aspects, Physical Modeling and Computer Simulation (Luigi Delle Site)
      Schedule: Mo 12:00-14:00, Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: Die Veranstaltung findet im Seminarraum der Arnimallee 9 statt.

      Additional information / Pre-requisites

      Audience: Master students of Mathematics and Physics interested in mathematical theory and computational modeling of Soft Matter Systems.

      Requirements: Basic Knowledge of statistical physics and of dynamics, computer programming

      Comments

      Program

      Polymer Physics: Structure and Dynamics

      • (a) Theoretical/analytic approaches
      • (b) Physical and chemical Modeling
      • (c) Simulation

      Biological Membranes

      • (a) Theoretical/analytic approaches
      • (b) Physical and chemical Modeling
      • (c) Simulation

      Introduction to Colloids and Liquid Crystals

      • Theory and Simulation

      Introduction to Hydrodynamic scale for large Biological Systems:

      • Examples are e.g. Cellular processes, Red Blood Cells in Capillary Flow, etc. (Theory and Simulation)

      Suggested reading

      Basic Literature:

      1. Introduction to Polymer Physics by M. Doi
      2. Soft Matter Physics by M. Doi
      3. Biomembrane Frontiers: Nanostructures, Models, and the Design of Life (Handbook of Modern Biophysics) by von Thomas Jue, Subhash H. Risbud, Marjorie L. Longo, Roland Faller (Editors)

    • 19234401 Lecture
      Discrete Mathematics II - Optimization (Ralf Borndörfer)
      Schedule: Mo 14:00-16:00, Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: Mo A6/SR 032 Seminarraum (Arnimallee 6), Do A7/SR 031 (Arnimallee 7)

      Additional information / Pre-requisites

      Credit This course can be chosen as Discrete Mathematics II (DM II). If Discrete Mathematics II - Extreme Combinatorics is taken at the same time, one of the two courses can be chosen as DM II and the other as a supplementary module. Language This lecture is in English.

      Exam

      The exam takes place at the last lecture. The 2nd exam takes place in the last week of the summer holidays before the lectures resume.

      Comments

      This lecture starts the optimization branch of discrete mathematics. It deals with algorithmic graph theory and linear optimization.

      Contents

      Complexity: complexity measures, run time of algorithms, the classes P and NP, NP-completeness
      Matroids and Independence Systems: independence systems, matroids, trees, forests, oracles, optimization over independence systems
      Shortest Paths: nonnegative weights, general weights, all pairs
      Network Flows: Max-Flow-Min-Cut Theorem, augmenting paths, minimum cost flows, transport and allocation problems
      Polyhedra: faces, dimension formula, projections of polyhedra, transformation, polarity, representation theorems
      Foundations of linear optimization: Farkas Lemma, Duality Theorem
      Simplex algorithm: basis, degeneration, basis exchange, revised simplex algorithm, bounds, dual simplex algorithm, post-optimization, numerics
      Interior point and ellipsoid method: basics

      Audience

      This course is aimed at mathematics students with knowledge of discrete mathematics I, linear algebra and analysis. Some exercises require the use of a computer.

      Suggested reading

      M. Grötschel, Lineare Optimierung, eines der Vorlesungsskripte

      V. Chvátal, Linear Programming, Freeman 1983

      Additional

      Garey & Johnson, Computers and Intractability,  1979 (Complexity Theory)

      Bertsimas & Tsitsiklis, Introduction to Linear Optimization, 97 (Linear Programming)

      Korte & Vygen, Combinatorial Optimization, 2006 (Flows, Shortest Paths, Matchings)

    • 19242001 Lecture
      Partial Differential Equations II (Erica Ipocoana)
      Schedule: Di 08:00-10:00, Do 10:00-12:00 (Class starts on: 2025-10-14)
      Location: Di A6/SR 031 Seminarraum (Arnimallee 6), Do A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      This course builds on the material of the course Partial Differential Equations I as taught in the previous summer term. Methods for linear partial differential equations will be deepened and extended to nonlinear partial differential equations. A central topic of the course is the theory of monotone and maximal monotone operators. 

       

    • 19202002 Practice seminar
      Practice seminar for Discrete Geometrie I (Sofia Garzón Mora, Christian Haase)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19202102 Practice seminar
      Practice seminar for Basic Module: Numeric II (André-Alexander Zepernick)
      Schedule: Mi 10:00-12:00, Fr 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
    • 19202602 Practice seminar
      Practice seminar for Differential Geometry I (Tillmann Kleiner, Konrad Polthier)
      Schedule: Mo 08:00-10:00, Mi 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19206202 Practice seminar
      Ex.: Basic Module: Topology II (Katarina Krivokuca)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
    • 19212902 Practice seminar
      Practice seminar for Stochastics II (Felix Höfling)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)

      Comments

      Inhalt

       

       

      • This course is the sequel of the course of Stochastics I. The main objective is to go beyond the first principles in probability theory by introducing the general language of measure theory, and the application of this framework in a wide variety of probabilistic scenarios.
        More precisely, the course will cover the following aspects of probability theory:
      • Measure theory and the Lebesgue integral
      • Convergence of random variables and 0-1 laws
      • Generating functions: branching processes and characteristic functions
      • Markov chains
      • Introduction to martingales

       

       

    • 19225102 Practice seminar
      Practice seminar for Soft Matter: Mathematical Aspects, Physical Modeling and Computer Simulation (Luigi Delle Site)
      Schedule: Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: SR A9
    • 19234402 Practice seminar
      Practice seminar for Discrete Mathematics II - Optimization (N.N.)
      Schedule: Mo 16:00-18:00 (Class starts on: 2025-10-20)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19242002 Practice seminar
      Tutorial Partial Differential Equations II (Erica Ipocoana)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
  • Complementary Module: Selected Topics C

    0280cA4.3
    • 19202001 Lecture
      Discrete Geometrie I (Christian Haase)
      Schedule: Di 10:00-12:00, Mi 12:00-14:00 (Class starts on: 2025-10-14)
      Location: A3/SR 120 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Solid background in linear algebra. Knowledge in combinatorics and geometry is advantageous.

      Comments

      Physical presence in the exercises on Wednesdays is mandatory.

      This is the first in a series of three courses on discrete geometry. The aim of the course is a skillful handling of discrete geometric structures including analysis and proof techniques. The material will be a selection of the following topics:
      Basic structures in discrete geometry

      • polyhedra and polyhedral complexes
      • configurations of points, hyperplanes, subspaces
      • Subdivisions and triangulations (including Delaunay and Voronoi)
      • Polytope theory
      • Representations and the theorem of Minkowski-Weyl
      • polarity, simple/simplicial polytopes, shellability
      • shellability, face lattices, f-vectors, Euler- and Dehn-Sommerville
      • graphs, diameters, Hirsch (ex-)conjecture
      • Geometry of linear programming
      • linear programs, simplex algorithm, LP-duality
      • Combinatorial geometry / Geometric combinatorics
      • Arrangements of points and lines, Sylvester-Gallai, Erdos-Szekeres
      • Arrangements, zonotopes, zonotopal tilings, oriented matroids
      • Examples, examples, examples
      • regular polytopes, centrally symmetric polytopes
      • extremal polytopes, cyclic/neighborly polytopes, stacked polytopes
      • combinatorial optimization and 0/1-polytopes

       

      For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding for discrete-geometric structures appearing in differential geometry, topology, combinatorics, and algebraic geometry.

       

       

       

       

       

       

       

       

       

      Suggested reading

      • G.M. Ziegler "Lectures in Polytopes"
      • J. Matousek "Lectures on Discrete Geometry"
      • Further literature will be announced in class.

    • 19202101 Lecture
      Basic Module: Numeric II (Robert Gruhlke)
      Schedule: Mo 12:00-14:00, Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Comments

      Description: Extending basic knowledge on odes from Numerik I, we first concentrate on one-step methods for stiff and differential-algebraic systems and then discuss Hamiltonian systems. In the second part of the lecture we consider the iterative solution of large linear systems.

      Target Audience: Students of Bachelor and Master courses in Mathematics and of BMS

      Prerequisites: Basics of calculus (Analysis I, II) linear algebra (Lineare Algebra I, II) and numerical analysis (Numerik I)

    • 19202601 Lecture
      Differential Geometry I (Konrad Polthier)
      Schedule: Mo 10:00-12:00, Mi 10:00-12:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-15)
      Location: KöLu24-26/SR 006 Neuro/Mathe (Königin-Luise-Str. 24 / 26)

      Additional information / Pre-requisites

      For further information, see Lecture Homepage.

      Comments

      Topics of the lecture will be:

      • curves and surfaces in Euclidean space,
      • metrics and (Riemannian) manifolds,
      • surface tension, notions of curvature,
      • vector fields, tensors, covariant derivative
      • geodesic curves, exponential map,
      • Gauß-Bonnet theorem, topology,
      • connection to discrete differential geometry.

      This course is a BMS course and will be held in English on request.

      Prerequisits:

      Analysis I, II, III and Linear Algebra I, II

       

       

      Suggested reading

      Literature

      • W. Kühnel: Differentialgeometrie:Kurven - Flächen - Mannigfaltigkeiten, Springer, 2012
      • M. P. do Carmo, Differential Geometry of Curves and Surfaces, Prentice Hall
      • J.-H. Eschenburg, J. Jost: Differentialgeometrie und Minimalflächen, Springer, 2014
      • C. Bär: Elementare Differentialgeometrie, de Gruyter, 2001

    • 19206201 Lecture
      Basic Module: Topology II (Pavle Blagojevic)
      Schedule: Di 14:00-16:00, Do 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content: Homology, cohomology and applications, CW-complexes, basic notions of homotopy theory

      Suggested reading

      Literatur

      • Hatcher, Allen: Algebraic Topology; Cambridge University Press.
      • http://www.math.cornell.edu/~hatcher/AT/ATpage.html
      • Lück, Wolfgang: Algebraische Topologie, Homologie und Mannigfaltigkeiten; Vieweg.

    • 19212901 Lecture
      Stochastics II (Felix Höfling)
      Schedule: Di 12:00-14:00, Do 08:00-10:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A3/Hs 001 Hörsaal (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisite: Stochastics I  and  Analysis I — III.

      Comments

      Contents:

      • Basics: conditional expectation, characteristic function, convergence types, uniform integrability;
      • Construction of stochastic processes and examples: Gaussian processes, Lévy processes, Brownian motion;
      • martingales in discrete time: convergence, stopping theorems, inequalities;
      • Markov chains in discrete and continuous time: recurrence and transience, invariant measures.

      Suggested reading

      • Klenke: Wahrscheinlichkeitstheorie
      • Durrett: Probability. Theory and Examples.

      Weitere Literatur wird im Lauf der Vorlesung bekannt gegeben.
      Further literature will be given during the lecture.

    • 19225101 Lecture
      Soft Matter: Mathematical Aspects, Physical Modeling and Computer Simulation (Luigi Delle Site)
      Schedule: Mo 12:00-14:00, Di 12:00-14:00 (Class starts on: 2025-10-14)
      Location: Die Veranstaltung findet im Seminarraum der Arnimallee 9 statt.

      Additional information / Pre-requisites

      Audience: Master students of Mathematics and Physics interested in mathematical theory and computational modeling of Soft Matter Systems.

      Requirements: Basic Knowledge of statistical physics and of dynamics, computer programming

      Comments

      Program

      Polymer Physics: Structure and Dynamics

      • (a) Theoretical/analytic approaches
      • (b) Physical and chemical Modeling
      • (c) Simulation

      Biological Membranes

      • (a) Theoretical/analytic approaches
      • (b) Physical and chemical Modeling
      • (c) Simulation

      Introduction to Colloids and Liquid Crystals

      • Theory and Simulation

      Introduction to Hydrodynamic scale for large Biological Systems:

      • Examples are e.g. Cellular processes, Red Blood Cells in Capillary Flow, etc. (Theory and Simulation)

      Suggested reading

      Basic Literature:

      1. Introduction to Polymer Physics by M. Doi
      2. Soft Matter Physics by M. Doi
      3. Biomembrane Frontiers: Nanostructures, Models, and the Design of Life (Handbook of Modern Biophysics) by von Thomas Jue, Subhash H. Risbud, Marjorie L. Longo, Roland Faller (Editors)

    • 19234401 Lecture
      Discrete Mathematics II - Optimization (Ralf Borndörfer)
      Schedule: Mo 14:00-16:00, Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: Mo A6/SR 032 Seminarraum (Arnimallee 6), Do A7/SR 031 (Arnimallee 7)

      Additional information / Pre-requisites

      Credit This course can be chosen as Discrete Mathematics II (DM II). If Discrete Mathematics II - Extreme Combinatorics is taken at the same time, one of the two courses can be chosen as DM II and the other as a supplementary module. Language This lecture is in English.

      Exam

      The exam takes place at the last lecture. The 2nd exam takes place in the last week of the summer holidays before the lectures resume.

      Comments

      This lecture starts the optimization branch of discrete mathematics. It deals with algorithmic graph theory and linear optimization.

      Contents

      Complexity: complexity measures, run time of algorithms, the classes P and NP, NP-completeness
      Matroids and Independence Systems: independence systems, matroids, trees, forests, oracles, optimization over independence systems
      Shortest Paths: nonnegative weights, general weights, all pairs
      Network Flows: Max-Flow-Min-Cut Theorem, augmenting paths, minimum cost flows, transport and allocation problems
      Polyhedra: faces, dimension formula, projections of polyhedra, transformation, polarity, representation theorems
      Foundations of linear optimization: Farkas Lemma, Duality Theorem
      Simplex algorithm: basis, degeneration, basis exchange, revised simplex algorithm, bounds, dual simplex algorithm, post-optimization, numerics
      Interior point and ellipsoid method: basics

      Audience

      This course is aimed at mathematics students with knowledge of discrete mathematics I, linear algebra and analysis. Some exercises require the use of a computer.

      Suggested reading

      M. Grötschel, Lineare Optimierung, eines der Vorlesungsskripte

      V. Chvátal, Linear Programming, Freeman 1983

      Additional

      Garey & Johnson, Computers and Intractability,  1979 (Complexity Theory)

      Bertsimas & Tsitsiklis, Introduction to Linear Optimization, 97 (Linear Programming)

      Korte & Vygen, Combinatorial Optimization, 2006 (Flows, Shortest Paths, Matchings)

    • 19242001 Lecture
      Partial Differential Equations II (Erica Ipocoana)
      Schedule: Di 08:00-10:00, Do 10:00-12:00 (Class starts on: 2025-10-14)
      Location: Di A6/SR 031 Seminarraum (Arnimallee 6), Do A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      This course builds on the material of the course Partial Differential Equations I as taught in the previous summer term. Methods for linear partial differential equations will be deepened and extended to nonlinear partial differential equations. A central topic of the course is the theory of monotone and maximal monotone operators. 

       

    • 19202002 Practice seminar
      Practice seminar for Discrete Geometrie I (Sofia Garzón Mora, Christian Haase)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19202102 Practice seminar
      Practice seminar for Basic Module: Numeric II (André-Alexander Zepernick)
      Schedule: Mi 10:00-12:00, Fr 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)
    • 19202602 Practice seminar
      Practice seminar for Differential Geometry I (Tillmann Kleiner, Konrad Polthier)
      Schedule: Mo 08:00-10:00, Mi 08:00-10:00 (Class starts on: 2025-10-15)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19206202 Practice seminar
      Ex.: Basic Module: Topology II (Katarina Krivokuca)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
    • 19212902 Practice seminar
      Practice seminar for Stochastics II (Felix Höfling)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)

      Comments

      Inhalt

       

       

      • This course is the sequel of the course of Stochastics I. The main objective is to go beyond the first principles in probability theory by introducing the general language of measure theory, and the application of this framework in a wide variety of probabilistic scenarios.
        More precisely, the course will cover the following aspects of probability theory:
      • Measure theory and the Lebesgue integral
      • Convergence of random variables and 0-1 laws
      • Generating functions: branching processes and characteristic functions
      • Markov chains
      • Introduction to martingales

       

       

    • 19225102 Practice seminar
      Practice seminar for Soft Matter: Mathematical Aspects, Physical Modeling and Computer Simulation (Luigi Delle Site)
      Schedule: Mi 12:00-14:00 (Class starts on: 2025-10-15)
      Location: SR A9
    • 19234402 Practice seminar
      Practice seminar for Discrete Mathematics II - Optimization (N.N.)
      Schedule: Mo 16:00-18:00 (Class starts on: 2025-10-20)
      Location: A6/SR 031 Seminarraum (Arnimallee 6)
    • 19242002 Practice seminar
      Tutorial Partial Differential Equations II (Erica Ipocoana)
      Schedule: Do 12:00-14:00 (Class starts on: 2025-10-16)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)
  • Complementary Module: Specific Aspects A

    0280cA4.4
    • 19205901 Lecture
      Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      The target audience are students with a solid background in discrete geometry and/or convex geometry (en par with Discrete Geometry I & II). The topic of this course is a state-of-art of advanced topics in discrete geometry that find applications and incarnations in differential geometry, topology, combinatorics, and algebraic geometry.

      Requirements: Preferably Discrete Geometry I and II.

      Comments

      This is the third in a series of three courses on discrete geometry. This advanced course will cover a selection of the following topics (depending on the interests of the audience):   1. Oriented Matroids along the lines of the book Oriented Matroids by Björner, Las Vergnas, Sturmfels, White, and Ziegler; and/or   2. Triangulations along the lines of the book Triangulations by de Loera, Rambau, and Santos; and/or   3. Discriminants and tropical geometry along the lines of the book Discriminants, Resultants, and multidimensional determinants by Gelfand, Kapranov, and Zelevinsky; and/or   4. Combinatorics and commutative algebra along the lines of the book Combinatorics and commutative algebra by Stanley.

      Suggested reading

      Will be announced in class.

    • 19206401 Lecture
      Numerics IV: Coevolution of Complex Systems: Interactions Between Social, Health and Climate Dynamics (Christof Schütte)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: keine Angabe

      Comments

      This lecture explores how complex systems evolve together, with examples as the interplay between social opinion dynamics and infectious disease spread, or the feedback loops between climate change and economic behavior. Using established models for systems from the respective fields, we will examine how coupling between the systems can lead to unexpected outcomes or emergent behavior, and discuss related policy challenges for managing real-world crises.

    • 19207101 Lecture
      Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content:

      Many problems in the sciences are determined by processes on several scales. Such problems are denoted as multi-scale problems. One example for a multi-scale problem is the partial differential equations (PDEs), which govern geophysical fluid flows. Averaging methods can be used for the analytical description of the slow scales. These descriptions are beneficial for numerical time-stepping schemes, as they allow for taking bigger time-steps than the unaveraged problem. The focus of this course will be on averaging methods for PDEs describing fluid flows and the design of parallelisable numerical time stepping methods, which are versions of the Parareal method and incorporate averaging techniques.

      Requirements: basic courses in analysis, basic course numerical mathematics

       

      Literature:

      Wingate, B.A.; Rosemeier, J.; Haut, T., Mean Flow from Phase Averages in the 2D Boussinesq Equations. Atmosphere 2023, 14, 1523.

      https://doi.org/10.3390/atmos14101523

      T. Haut, B. Wingate,  An asymptotic parallel-in-time method for highly oscillatory pde's, SIAM Journal on Scientific Computing, 36 (2014), pp.

      A693-A713

      J.-L. Lions, G. Turinici, A "parareal" in time discretization of PDE's, Comptes Rendus de l'Academie des Sciences - Series I - Mathematics, 332 (2001), pp. 661-668 Sanders, F. Verhulst, J. Murdock,  Averaging Methods in Nonlinear Dynamical Systems, Springer New York, NY, 2ed., 2000

       

       

    • 19222301 Lecture
      Advanced Module: Algebra III (Holger Reich)
      Schedule: Mo 12:00-14:00 (Class starts on: 2025-11-03)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Course contents: a selection of the following topics

      • properties of morphisms (proper, projective, smooth)
      • divisors
      • (quasi-)coherent sheaves
      • cohomology
      • Hilbert functions

      further properties of morphisms (proper, integral, regular, smooth, étale, ...)

      • Grothendieck topologies
      • cohomology (Čech, étale, ...)

      Suggested reading

      For example: Introduction to Schemes, Geir Ellingsrud and John Christian Otten

    • 19235101 Lecture
      Function and distribution spaces (Willem Van Zuijlen)
      Schedule: Di 14:00-16:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      Prerequisits: Analysis I — III, Linear Algebra I, II. 
      Recommended: Functional Analysis.

      Comments

      In this course we consider function spaces and spaces of distributions, also called generalised functions. Distributions play an important role in the theory of partial differential equations, as in contrast to functions, they are always differentiable. Hence, during the course we motivate the context via PDEs here and there. We will discuss: 

      Distribution spaces and their notion of convergence (on general domains)
      Sobolev spaces (on general domains)
      Tempered distributions and the Fourier transform (on R^d)
      Besov spaces (on R^d)
      Bony's para- and resonance products
       

      Suggested reading

      There will be lecture notes.

    • 19205902 Practice seminar
      Practice seminar for Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A3/SR 120 (Arnimallee 3-5)
    • 19206402 Practice seminar
      Practice seminar for Advanced Module: Numerics IV (Christof Schütte)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: keine Angabe
    • 19207102 Practice seminar
      Tutorials for Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
    • 19222302 Practice seminar
      Practice seminar for Advanced Module: Algebra III (Holger Reich)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-29)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
    • 19235102 Practice seminar
      Exercise: Function and distribution spaces (N.N.)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A3/ 024 Seminarraum (Arnimallee 3-5)
  • Complementary Module: Specific Aspects B

    0280cA4.5
    • 19205901 Lecture
      Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      The target audience are students with a solid background in discrete geometry and/or convex geometry (en par with Discrete Geometry I & II). The topic of this course is a state-of-art of advanced topics in discrete geometry that find applications and incarnations in differential geometry, topology, combinatorics, and algebraic geometry.

      Requirements: Preferably Discrete Geometry I and II.

      Comments

      This is the third in a series of three courses on discrete geometry. This advanced course will cover a selection of the following topics (depending on the interests of the audience):   1. Oriented Matroids along the lines of the book Oriented Matroids by Björner, Las Vergnas, Sturmfels, White, and Ziegler; and/or   2. Triangulations along the lines of the book Triangulations by de Loera, Rambau, and Santos; and/or   3. Discriminants and tropical geometry along the lines of the book Discriminants, Resultants, and multidimensional determinants by Gelfand, Kapranov, and Zelevinsky; and/or   4. Combinatorics and commutative algebra along the lines of the book Combinatorics and commutative algebra by Stanley.

      Suggested reading

      Will be announced in class.

    • 19206401 Lecture
      Numerics IV: Coevolution of Complex Systems: Interactions Between Social, Health and Climate Dynamics (Christof Schütte)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: keine Angabe

      Comments

      This lecture explores how complex systems evolve together, with examples as the interplay between social opinion dynamics and infectious disease spread, or the feedback loops between climate change and economic behavior. Using established models for systems from the respective fields, we will examine how coupling between the systems can lead to unexpected outcomes or emergent behavior, and discuss related policy challenges for managing real-world crises.

    • 19207101 Lecture
      Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content:

      Many problems in the sciences are determined by processes on several scales. Such problems are denoted as multi-scale problems. One example for a multi-scale problem is the partial differential equations (PDEs), which govern geophysical fluid flows. Averaging methods can be used for the analytical description of the slow scales. These descriptions are beneficial for numerical time-stepping schemes, as they allow for taking bigger time-steps than the unaveraged problem. The focus of this course will be on averaging methods for PDEs describing fluid flows and the design of parallelisable numerical time stepping methods, which are versions of the Parareal method and incorporate averaging techniques.

      Requirements: basic courses in analysis, basic course numerical mathematics

       

      Literature:

      Wingate, B.A.; Rosemeier, J.; Haut, T., Mean Flow from Phase Averages in the 2D Boussinesq Equations. Atmosphere 2023, 14, 1523.

      https://doi.org/10.3390/atmos14101523

      T. Haut, B. Wingate,  An asymptotic parallel-in-time method for highly oscillatory pde's, SIAM Journal on Scientific Computing, 36 (2014), pp.

      A693-A713

      J.-L. Lions, G. Turinici, A "parareal" in time discretization of PDE's, Comptes Rendus de l'Academie des Sciences - Series I - Mathematics, 332 (2001), pp. 661-668 Sanders, F. Verhulst, J. Murdock,  Averaging Methods in Nonlinear Dynamical Systems, Springer New York, NY, 2ed., 2000

       

       

    • 19222301 Lecture
      Advanced Module: Algebra III (Holger Reich)
      Schedule: Mo 12:00-14:00 (Class starts on: 2025-11-03)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Course contents: a selection of the following topics

      • properties of morphisms (proper, projective, smooth)
      • divisors
      • (quasi-)coherent sheaves
      • cohomology
      • Hilbert functions

      further properties of morphisms (proper, integral, regular, smooth, étale, ...)

      • Grothendieck topologies
      • cohomology (Čech, étale, ...)

      Suggested reading

      For example: Introduction to Schemes, Geir Ellingsrud and John Christian Otten

    • 19235101 Lecture
      Function and distribution spaces (Willem Van Zuijlen)
      Schedule: Di 14:00-16:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      Prerequisits: Analysis I — III, Linear Algebra I, II. 
      Recommended: Functional Analysis.

      Comments

      In this course we consider function spaces and spaces of distributions, also called generalised functions. Distributions play an important role in the theory of partial differential equations, as in contrast to functions, they are always differentiable. Hence, during the course we motivate the context via PDEs here and there. We will discuss: 

      Distribution spaces and their notion of convergence (on general domains)
      Sobolev spaces (on general domains)
      Tempered distributions and the Fourier transform (on R^d)
      Besov spaces (on R^d)
      Bony's para- and resonance products
       

      Suggested reading

      There will be lecture notes.

    • 19205902 Practice seminar
      Practice seminar for Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A3/SR 120 (Arnimallee 3-5)
    • 19206402 Practice seminar
      Practice seminar for Advanced Module: Numerics IV (Christof Schütte)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: keine Angabe
    • 19207102 Practice seminar
      Tutorials for Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
    • 19222302 Practice seminar
      Practice seminar for Advanced Module: Algebra III (Holger Reich)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-29)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
    • 19235102 Practice seminar
      Exercise: Function and distribution spaces (N.N.)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A3/ 024 Seminarraum (Arnimallee 3-5)
  • Complementary Module: Specific Aspects C

    0280cA4.6
    • 19205901 Lecture
      Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Di 10:00-12:00 (Class starts on: 2025-10-14)
      Location: A6/SR 025/026 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      The target audience are students with a solid background in discrete geometry and/or convex geometry (en par with Discrete Geometry I & II). The topic of this course is a state-of-art of advanced topics in discrete geometry that find applications and incarnations in differential geometry, topology, combinatorics, and algebraic geometry.

      Requirements: Preferably Discrete Geometry I and II.

      Comments

      This is the third in a series of three courses on discrete geometry. This advanced course will cover a selection of the following topics (depending on the interests of the audience):   1. Oriented Matroids along the lines of the book Oriented Matroids by Björner, Las Vergnas, Sturmfels, White, and Ziegler; and/or   2. Triangulations along the lines of the book Triangulations by de Loera, Rambau, and Santos; and/or   3. Discriminants and tropical geometry along the lines of the book Discriminants, Resultants, and multidimensional determinants by Gelfand, Kapranov, and Zelevinsky; and/or   4. Combinatorics and commutative algebra along the lines of the book Combinatorics and commutative algebra by Stanley.

      Suggested reading

      Will be announced in class.

    • 19206401 Lecture
      Numerics IV: Coevolution of Complex Systems: Interactions Between Social, Health and Climate Dynamics (Christof Schütte)
      Schedule: Di 14:00-16:00 (Class starts on: 2025-10-14)
      Location: keine Angabe

      Comments

      This lecture explores how complex systems evolve together, with examples as the interplay between social opinion dynamics and infectious disease spread, or the feedback loops between climate change and economic behavior. Using established models for systems from the respective fields, we will examine how coupling between the systems can lead to unexpected outcomes or emergent behavior, and discuss related policy challenges for managing real-world crises.

    • 19207101 Lecture
      Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-15)
      Location: A6/SR 032 Seminarraum (Arnimallee 6)

      Comments

      Content:

      Many problems in the sciences are determined by processes on several scales. Such problems are denoted as multi-scale problems. One example for a multi-scale problem is the partial differential equations (PDEs), which govern geophysical fluid flows. Averaging methods can be used for the analytical description of the slow scales. These descriptions are beneficial for numerical time-stepping schemes, as they allow for taking bigger time-steps than the unaveraged problem. The focus of this course will be on averaging methods for PDEs describing fluid flows and the design of parallelisable numerical time stepping methods, which are versions of the Parareal method and incorporate averaging techniques.

      Requirements: basic courses in analysis, basic course numerical mathematics

       

      Literature:

      Wingate, B.A.; Rosemeier, J.; Haut, T., Mean Flow from Phase Averages in the 2D Boussinesq Equations. Atmosphere 2023, 14, 1523.

      https://doi.org/10.3390/atmos14101523

      T. Haut, B. Wingate,  An asymptotic parallel-in-time method for highly oscillatory pde's, SIAM Journal on Scientific Computing, 36 (2014), pp.

      A693-A713

      J.-L. Lions, G. Turinici, A "parareal" in time discretization of PDE's, Comptes Rendus de l'Academie des Sciences - Series I - Mathematics, 332 (2001), pp. 661-668 Sanders, F. Verhulst, J. Murdock,  Averaging Methods in Nonlinear Dynamical Systems, Springer New York, NY, 2ed., 2000

       

       

    • 19222301 Lecture
      Advanced Module: Algebra III (Holger Reich)
      Schedule: Mo 12:00-14:00 (Class starts on: 2025-11-03)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Course contents: a selection of the following topics

      • properties of morphisms (proper, projective, smooth)
      • divisors
      • (quasi-)coherent sheaves
      • cohomology
      • Hilbert functions

      further properties of morphisms (proper, integral, regular, smooth, étale, ...)

      • Grothendieck topologies
      • cohomology (Čech, étale, ...)

      Suggested reading

      For example: Introduction to Schemes, Geir Ellingsrud and John Christian Otten

    • 19235101 Lecture
      Function and distribution spaces (Willem Van Zuijlen)
      Schedule: Di 14:00-16:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Additional information / Pre-requisites

      Prerequisits: Analysis I — III, Linear Algebra I, II. 
      Recommended: Functional Analysis.

      Comments

      In this course we consider function spaces and spaces of distributions, also called generalised functions. Distributions play an important role in the theory of partial differential equations, as in contrast to functions, they are always differentiable. Hence, during the course we motivate the context via PDEs here and there. We will discuss: 

      Distribution spaces and their notion of convergence (on general domains)
      Sobolev spaces (on general domains)
      Tempered distributions and the Fourier transform (on R^d)
      Besov spaces (on R^d)
      Bony's para- and resonance products
       

      Suggested reading

      There will be lecture notes.

    • 19205902 Practice seminar
      Practice seminar for Advanced Module: Discrete Geometry III (Ansgar Freyer)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A3/SR 120 (Arnimallee 3-5)
    • 19206402 Practice seminar
      Practice seminar for Advanced Module: Numerics IV (Christof Schütte)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: keine Angabe
    • 19207102 Practice seminar
      Tutorials for Partial differential equations with multiple scales: Theory and computation (Juliane Rosemeier)
      Schedule: Mi 14:00-16:00 (Class starts on: 2025-10-15)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
    • 19222302 Practice seminar
      Practice seminar for Advanced Module: Algebra III (Holger Reich)
      Schedule: Mi 10:00-12:00 (Class starts on: 2025-10-29)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)
    • 19235102 Practice seminar
      Exercise: Function and distribution spaces (N.N.)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A3/ 024 Seminarraum (Arnimallee 3-5)
  • Complementary Module: Current Research Topics A

    0280cA4.7
    • 19206111 Seminar
      Research Module: Discrete Geometry (Giulia Codenotti)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-01-26)
      Location: keine Angabe

      Additional information / Pre-requisites

      Pre-Meeting: see KVV

      Comments

      This seminar will look at remarkable polytopes — among them regular polytopes, cyclic/neighborly polytopes, hypersimplices, 2simple-2simplicial polytopes, cut polytopes, etc. We discuss the examples, their construction and their most interesting properties. Some of these examples were designed or used in order to solve problems, refute conjectures, or to support conjectures. Some of these have unexplored or unexplainable properties, and those of course we want to look at as well.

      “It is not unusual that a single example or a very few shape an entire mathematical discipline. Examples are the Petersen graph, cyclic polytopes, the Fano plane, the prisoner dilemma, the real n-dimensional projective space and the group of two by two nonsingular matrices. And it seems that overall, we are short of examples. The methods for coming up with useful examples in mathematics (or counterexamples for commonly believed conjectures) are even less clear than the methods for proving mathematical statements.” — Gil Kalai (2000)

      Suggested reading

      Themenvergabe und speziellere Literaturangaben in der Vorbesprechung zum Seminar.

    • 19207219 Seminar with practice
      Formal Proof Vetification (Christoph Spiegel, Silas Rathke)
      Schedule: -
      Location: keine Angabe

      Comments

      This two-week block course at Freie Universität Berlin offers a hands-on introduction to formal proof verification with the Lean theorem prover. Lectures take place at the Zuse Institute Berlin (ZIB); tutorial rooms at FU will be assigned once enrollment is known. The course is open to all (including guest auditors), with tutorial priority for FU students taking it toward ABV requirements. Please bring a laptop for in-class exercises. A solid grasp of Analysis I and Linear Algebra I is expected; no programming background is required, though technical curiosity helps. The teaching language is English (German contributions are welcome). Full details and materials—including modules on logic, set theory, natural numbers, the infinitude of primes, and basic graph theory—are available on the course GitHub.

      For Master’s credit, the course adds differentiated exercises and advanced assessment. Exercises are tiered into foundational tasks (with human-readable proof templates), Master’s-level problems, and optional stretch challenges, with guidance and informal progress checks during sessions. The final assessment is a written exam that tests both conceptual understanding and practical Lean skills. In addition, Master’s students complete a Lean formalization project (individually or in pairs) and present it in an oral-exam-style session one to two weeks after the block course; M.Sc. grades are based on both the exam and the project.

    • 19208111 Seminar
      Masterseminar Stochastics "Mathematical Reinforcement Learning for AI" (Guilherme de Lima Feltes)
      Schedule: Do 16:00-18:00 (Class starts on: 2025-10-16)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Additional information / Pre-requisites

      Prerequisites: Stochastics I and II. Desirable: Stochastics III.
      Target Group: BMS Students, Master students of Mathematics and advanced Bachelor students of Mathematics.

      Comments

      Content: The seminar covers advanced topics of stochastics.

      Detailed Information can be found on the Homepage of the seminar.

      Reinforcement learning lies at the core of many state-of-the-art artificial intelligence algorithms, enabling agents to solve complex optimal control tasks in robotics, finance, physical AI, drug discovery, computer games and many other applications.
      This seminar offers a rigorous treatment of reinforcement learning, focusing on the mathematical principles that make reinforcement learning algorithms work. We will develop a mathematically sound understanding of Markov decision processes, value function based methods and their connections to stochastic optimal control, policy gradient methods, emphasizing convergence properties of classical reinforcement learning algorithms through stochastic approximation and stochastic gradient descent. We will also explore continuous time reinforcement learning in the framework of stochastic differential equations.
      The seminar aims to provide a rigorous foundational perspective for students interested in current research related to reinforcement learning and artificial intelligence. Participants should have a strong background in mathematics specifically in probability theory.

      Suggested reading

      Literatur wird in der Vorbesprechung bekanntgegeben.

      Literature will be announced in the preliminary discussion

    • 19212211 Seminar
      Seminar on topic in Geometric Analysis and Differential Geometry (Elena Mäder-Baumdicker)
      Schedule: Mi 15.10. 12:00-14:00, Mi 05.11. 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Ana I bis III, lineare Algebra I und II sowie mindestens einer der beiden Vorlesungen Differentialgeometrie I oder Differentialgleichungen I.

      Comments

      This seminar is intended for Bachelor's and Master's students with an interest in topics related to Geometric Analysis and Differential Geometry. Each semester, the seminar focuses on a different theme — examples include geometric variational problems, geometric flows, and geometric measure theory.

      In the first meeting of the semester, students can express their interest in participating. In the second meeting, each participant selects a topic from a curated list. The presentations themselves will take place during a dedicated seminar week at the end of the term.

       

    • 19214411 Seminar
      Research Module: Differential Geometrie (Konrad Polthier, Tillmann Kleiner)
      Schedule: Di 16:00-18:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 007/008 Seminarraum (Arnimallee 6)

      Comments

      In this seminar, differential geometric topics will be independently developed based on current research and presented in the form of a talk.

      Particular emphasis is placed on the concrete implementation of differential geometric concepts in application scenarios and the questions of discretization and implementation.

      Learning objectives are a deeper understanding of differential geometry concepts, as well as problems and solution strategies in their practical use.

      Previous knowledge: Differential geometry I

    • 19223811 Seminar
      Master Seminar Topology "L^2-Betti numbers" (N.N.)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisites: Basic knowledge of topology and group theory is required.

      Comments

      The Euler characteristic of finite CW-complexes is multiplicative under finite-sheeted coverings and it is homotopy invariant. These properties can be deduced from different descriptions:
      1. As the alternating sum of the numbers of cells, which are multiplicative but not homotopy invariant.
      2. As the alternating sum of Betti numbers, which are homotopy invariant but not multiplicative. The $n$-th Betti number of $X$ is the $\mathbb{Q}$-dimension of the homology $H_n(X;\mathbb{Q})$ with rational coefficients.
      3. As the alternating sum of $L^2$-Betti numbers, which enjoy the best features from both worlds: they are multiplicative and homotopy invariant. The $n$-th $L^2$-Betti number of $X$ is the von Neumann-dimension of the homology $H_n(X; \mathcal{N}\pi_1(X))$ with suitable coefficients.

      $L^2$-Betti numbers are meaningful topological invariants, as they obstruct the structures of mapping tori and $S^1$-actions. They also have applications to group theory by considering the $L^2$-Betti numbers of classifying spaces. Moreover, $L^2$-Betti numbers are related to famous open problems, such as the Hopf and Singer conjectures on the Euler characteristic of manifolds, and the Kaplansky conjecture on zero divisors in group rings.

      Detailed Information can be found on the Homepage of the seminar.

      Suggested reading

      This seminar will be an introduction to $L^2$-Betti numbers, following mostly
      the book by Holger Kammeyer.

    • 19226511 Seminar
      Seminar Multiscale Methods in Molecular Simulations (Luigi Delle Site)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: Seminarraum in der Arnimallee 9

      Additional information / Pre-requisites

      Audience: At least 6th semester with a background in statistical and quantum mechanics, Master students and PhD students (even postdocs) are welcome.

      Comments

      Content: The seminar will concern the discussion of state-of-art techniques in molecular simulation which allow for a simulation of several space (especially) and time scale within one computational approach.

      The discussion will concerns both, specific computational coding and conceptual developments.

      Suggested reading

      Related Basic Literature:

      (1) M.Praprotnik, L.Delle Site and K.Kremer, Ann.Rev.Phys.Chem.59, 545-571 (2008)

      (2) C.Peter, L.Delle Site and K.Kremer, Soft Matter 4, 859-869 (2008).

      (3) M.Praprotnik and L.Delle Site, in "Biomolecular Simulations: Methods and Protocols" L.Monticelli and E.Salonen Eds. Vol.924, 567-583 (2012) Methods Mol. Biol. Springer-Science

    • 19246911 Seminar
      Geometric Deep Learning (Christoph Tycowicz)
      Schedule: Fr 10:00-12:00 (Class starts on: 2025-10-17)
      Location: T9/055 Seminarraum (Takustr. 9)

      Comments

      Pre-requisites:
      A solid background in differential geometry or geometric computing will be advantageous but is not mandatory.
      Students who haven't followed any related courses (Differential Geometry I, Scientific Visualization, ...) can follow the seminar but should be willing to invest more time.

      Description:
      Geometric deep learning is a broad and emerging research paradigm concerned with the derivation and study of neural network architectures that respect the invariances and symmetries in data.
      Indeed, many real-world tasks come with essential pre-defined regularities arising from the underlying low-dimensionality and structure of the physical world.
      Capturing these regularities via unified geometric principles has been shown to provide sizable empirical improvements.
      Examples of such geometric architectures include graph neural networks as well as models conditioned on data that reside on curved manifolds.

      The goal of this seminar will be to obtain in-depth knowledge about the core methodology in geometric deep learning as well as an overview of state-of-the-art methods.
      Students will acquire practical skills in reading, presenting, explaining, and discussing scientific papers.
      The seminar may be used as a preparation for an MSc thesis topic.

      Suggested reading

      Michael M. Bronstein, Joan Bruna, Taco Cohen, Petar Veličković (2021) Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges. arXiv:2104.13478

    • 19247111 Seminar
      Ordinary Differential Equations (Marita Thomas)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Ordinary differential equations arise in many applications from physics, chemistry, biology or economics. This seminar extends the topics that were covered in the Analysis III course, e.g., eigenvalue problems and stability theory will be addressed. 

  • Complementary Module: Current Research Topics B

    0280cA4.8
    • 19206111 Seminar
      Research Module: Discrete Geometry (Giulia Codenotti)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-01-26)
      Location: keine Angabe

      Additional information / Pre-requisites

      Pre-Meeting: see KVV

      Comments

      This seminar will look at remarkable polytopes — among them regular polytopes, cyclic/neighborly polytopes, hypersimplices, 2simple-2simplicial polytopes, cut polytopes, etc. We discuss the examples, their construction and their most interesting properties. Some of these examples were designed or used in order to solve problems, refute conjectures, or to support conjectures. Some of these have unexplored or unexplainable properties, and those of course we want to look at as well.

      “It is not unusual that a single example or a very few shape an entire mathematical discipline. Examples are the Petersen graph, cyclic polytopes, the Fano plane, the prisoner dilemma, the real n-dimensional projective space and the group of two by two nonsingular matrices. And it seems that overall, we are short of examples. The methods for coming up with useful examples in mathematics (or counterexamples for commonly believed conjectures) are even less clear than the methods for proving mathematical statements.” — Gil Kalai (2000)

      Suggested reading

      Themenvergabe und speziellere Literaturangaben in der Vorbesprechung zum Seminar.

    • 19207219 Seminar with practice
      Formal Proof Vetification (Christoph Spiegel, Silas Rathke)
      Schedule: -
      Location: keine Angabe

      Comments

      This two-week block course at Freie Universität Berlin offers a hands-on introduction to formal proof verification with the Lean theorem prover. Lectures take place at the Zuse Institute Berlin (ZIB); tutorial rooms at FU will be assigned once enrollment is known. The course is open to all (including guest auditors), with tutorial priority for FU students taking it toward ABV requirements. Please bring a laptop for in-class exercises. A solid grasp of Analysis I and Linear Algebra I is expected; no programming background is required, though technical curiosity helps. The teaching language is English (German contributions are welcome). Full details and materials—including modules on logic, set theory, natural numbers, the infinitude of primes, and basic graph theory—are available on the course GitHub.

      For Master’s credit, the course adds differentiated exercises and advanced assessment. Exercises are tiered into foundational tasks (with human-readable proof templates), Master’s-level problems, and optional stretch challenges, with guidance and informal progress checks during sessions. The final assessment is a written exam that tests both conceptual understanding and practical Lean skills. In addition, Master’s students complete a Lean formalization project (individually or in pairs) and present it in an oral-exam-style session one to two weeks after the block course; M.Sc. grades are based on both the exam and the project.

    • 19208111 Seminar
      Masterseminar Stochastics "Mathematical Reinforcement Learning for AI" (Guilherme de Lima Feltes)
      Schedule: Do 16:00-18:00 (Class starts on: 2025-10-16)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Additional information / Pre-requisites

      Prerequisites: Stochastics I and II. Desirable: Stochastics III.
      Target Group: BMS Students, Master students of Mathematics and advanced Bachelor students of Mathematics.

      Comments

      Content: The seminar covers advanced topics of stochastics.

      Detailed Information can be found on the Homepage of the seminar.

      Reinforcement learning lies at the core of many state-of-the-art artificial intelligence algorithms, enabling agents to solve complex optimal control tasks in robotics, finance, physical AI, drug discovery, computer games and many other applications.
      This seminar offers a rigorous treatment of reinforcement learning, focusing on the mathematical principles that make reinforcement learning algorithms work. We will develop a mathematically sound understanding of Markov decision processes, value function based methods and their connections to stochastic optimal control, policy gradient methods, emphasizing convergence properties of classical reinforcement learning algorithms through stochastic approximation and stochastic gradient descent. We will also explore continuous time reinforcement learning in the framework of stochastic differential equations.
      The seminar aims to provide a rigorous foundational perspective for students interested in current research related to reinforcement learning and artificial intelligence. Participants should have a strong background in mathematics specifically in probability theory.

      Suggested reading

      Literatur wird in der Vorbesprechung bekanntgegeben.

      Literature will be announced in the preliminary discussion

    • 19212211 Seminar
      Seminar on topic in Geometric Analysis and Differential Geometry (Elena Mäder-Baumdicker)
      Schedule: Mi 15.10. 12:00-14:00, Mi 05.11. 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Ana I bis III, lineare Algebra I und II sowie mindestens einer der beiden Vorlesungen Differentialgeometrie I oder Differentialgleichungen I.

      Comments

      This seminar is intended for Bachelor's and Master's students with an interest in topics related to Geometric Analysis and Differential Geometry. Each semester, the seminar focuses on a different theme — examples include geometric variational problems, geometric flows, and geometric measure theory.

      In the first meeting of the semester, students can express their interest in participating. In the second meeting, each participant selects a topic from a curated list. The presentations themselves will take place during a dedicated seminar week at the end of the term.

       

    • 19214411 Seminar
      Research Module: Differential Geometrie (Konrad Polthier, Tillmann Kleiner)
      Schedule: Di 16:00-18:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 007/008 Seminarraum (Arnimallee 6)

      Comments

      In this seminar, differential geometric topics will be independently developed based on current research and presented in the form of a talk.

      Particular emphasis is placed on the concrete implementation of differential geometric concepts in application scenarios and the questions of discretization and implementation.

      Learning objectives are a deeper understanding of differential geometry concepts, as well as problems and solution strategies in their practical use.

      Previous knowledge: Differential geometry I

    • 19223811 Seminar
      Master Seminar Topology "L^2-Betti numbers" (N.N.)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisites: Basic knowledge of topology and group theory is required.

      Comments

      The Euler characteristic of finite CW-complexes is multiplicative under finite-sheeted coverings and it is homotopy invariant. These properties can be deduced from different descriptions:
      1. As the alternating sum of the numbers of cells, which are multiplicative but not homotopy invariant.
      2. As the alternating sum of Betti numbers, which are homotopy invariant but not multiplicative. The $n$-th Betti number of $X$ is the $\mathbb{Q}$-dimension of the homology $H_n(X;\mathbb{Q})$ with rational coefficients.
      3. As the alternating sum of $L^2$-Betti numbers, which enjoy the best features from both worlds: they are multiplicative and homotopy invariant. The $n$-th $L^2$-Betti number of $X$ is the von Neumann-dimension of the homology $H_n(X; \mathcal{N}\pi_1(X))$ with suitable coefficients.

      $L^2$-Betti numbers are meaningful topological invariants, as they obstruct the structures of mapping tori and $S^1$-actions. They also have applications to group theory by considering the $L^2$-Betti numbers of classifying spaces. Moreover, $L^2$-Betti numbers are related to famous open problems, such as the Hopf and Singer conjectures on the Euler characteristic of manifolds, and the Kaplansky conjecture on zero divisors in group rings.

      Detailed Information can be found on the Homepage of the seminar.

      Suggested reading

      This seminar will be an introduction to $L^2$-Betti numbers, following mostly
      the book by Holger Kammeyer.

    • 19226511 Seminar
      Seminar Multiscale Methods in Molecular Simulations (Luigi Delle Site)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: Seminarraum in der Arnimallee 9

      Additional information / Pre-requisites

      Audience: At least 6th semester with a background in statistical and quantum mechanics, Master students and PhD students (even postdocs) are welcome.

      Comments

      Content: The seminar will concern the discussion of state-of-art techniques in molecular simulation which allow for a simulation of several space (especially) and time scale within one computational approach.

      The discussion will concerns both, specific computational coding and conceptual developments.

      Suggested reading

      Related Basic Literature:

      (1) M.Praprotnik, L.Delle Site and K.Kremer, Ann.Rev.Phys.Chem.59, 545-571 (2008)

      (2) C.Peter, L.Delle Site and K.Kremer, Soft Matter 4, 859-869 (2008).

      (3) M.Praprotnik and L.Delle Site, in "Biomolecular Simulations: Methods and Protocols" L.Monticelli and E.Salonen Eds. Vol.924, 567-583 (2012) Methods Mol. Biol. Springer-Science

    • 19246911 Seminar
      Geometric Deep Learning (Christoph Tycowicz)
      Schedule: Fr 10:00-12:00 (Class starts on: 2025-10-17)
      Location: T9/055 Seminarraum (Takustr. 9)

      Comments

      Pre-requisites:
      A solid background in differential geometry or geometric computing will be advantageous but is not mandatory.
      Students who haven't followed any related courses (Differential Geometry I, Scientific Visualization, ...) can follow the seminar but should be willing to invest more time.

      Description:
      Geometric deep learning is a broad and emerging research paradigm concerned with the derivation and study of neural network architectures that respect the invariances and symmetries in data.
      Indeed, many real-world tasks come with essential pre-defined regularities arising from the underlying low-dimensionality and structure of the physical world.
      Capturing these regularities via unified geometric principles has been shown to provide sizable empirical improvements.
      Examples of such geometric architectures include graph neural networks as well as models conditioned on data that reside on curved manifolds.

      The goal of this seminar will be to obtain in-depth knowledge about the core methodology in geometric deep learning as well as an overview of state-of-the-art methods.
      Students will acquire practical skills in reading, presenting, explaining, and discussing scientific papers.
      The seminar may be used as a preparation for an MSc thesis topic.

      Suggested reading

      Michael M. Bronstein, Joan Bruna, Taco Cohen, Petar Veličković (2021) Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges. arXiv:2104.13478

    • 19247111 Seminar
      Ordinary Differential Equations (Marita Thomas)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Ordinary differential equations arise in many applications from physics, chemistry, biology or economics. This seminar extends the topics that were covered in the Analysis III course, e.g., eigenvalue problems and stability theory will be addressed. 

  • Complementary Module: Current Research Topics C

    0280cA4.9
    • 19206111 Seminar
      Research Module: Discrete Geometry (Giulia Codenotti)
      Schedule: Termine siehe LV-Details (Class starts on: 2026-01-26)
      Location: keine Angabe

      Additional information / Pre-requisites

      Pre-Meeting: see KVV

      Comments

      This seminar will look at remarkable polytopes — among them regular polytopes, cyclic/neighborly polytopes, hypersimplices, 2simple-2simplicial polytopes, cut polytopes, etc. We discuss the examples, their construction and their most interesting properties. Some of these examples were designed or used in order to solve problems, refute conjectures, or to support conjectures. Some of these have unexplored or unexplainable properties, and those of course we want to look at as well.

      “It is not unusual that a single example or a very few shape an entire mathematical discipline. Examples are the Petersen graph, cyclic polytopes, the Fano plane, the prisoner dilemma, the real n-dimensional projective space and the group of two by two nonsingular matrices. And it seems that overall, we are short of examples. The methods for coming up with useful examples in mathematics (or counterexamples for commonly believed conjectures) are even less clear than the methods for proving mathematical statements.” — Gil Kalai (2000)

      Suggested reading

      Themenvergabe und speziellere Literaturangaben in der Vorbesprechung zum Seminar.

    • 19207219 Seminar with practice
      Formal Proof Vetification (Christoph Spiegel, Silas Rathke)
      Schedule: -
      Location: keine Angabe

      Comments

      This two-week block course at Freie Universität Berlin offers a hands-on introduction to formal proof verification with the Lean theorem prover. Lectures take place at the Zuse Institute Berlin (ZIB); tutorial rooms at FU will be assigned once enrollment is known. The course is open to all (including guest auditors), with tutorial priority for FU students taking it toward ABV requirements. Please bring a laptop for in-class exercises. A solid grasp of Analysis I and Linear Algebra I is expected; no programming background is required, though technical curiosity helps. The teaching language is English (German contributions are welcome). Full details and materials—including modules on logic, set theory, natural numbers, the infinitude of primes, and basic graph theory—are available on the course GitHub.

      For Master’s credit, the course adds differentiated exercises and advanced assessment. Exercises are tiered into foundational tasks (with human-readable proof templates), Master’s-level problems, and optional stretch challenges, with guidance and informal progress checks during sessions. The final assessment is a written exam that tests both conceptual understanding and practical Lean skills. In addition, Master’s students complete a Lean formalization project (individually or in pairs) and present it in an oral-exam-style session one to two weeks after the block course; M.Sc. grades are based on both the exam and the project.

    • 19208111 Seminar
      Masterseminar Stochastics "Mathematical Reinforcement Learning for AI" (Guilherme de Lima Feltes)
      Schedule: Do 16:00-18:00 (Class starts on: 2025-10-16)
      Location: A7/SR 140 Seminarraum (Hinterhaus) (Arnimallee 7)

      Additional information / Pre-requisites

      Prerequisites: Stochastics I and II. Desirable: Stochastics III.
      Target Group: BMS Students, Master students of Mathematics and advanced Bachelor students of Mathematics.

      Comments

      Content: The seminar covers advanced topics of stochastics.

      Detailed Information can be found on the Homepage of the seminar.

      Reinforcement learning lies at the core of many state-of-the-art artificial intelligence algorithms, enabling agents to solve complex optimal control tasks in robotics, finance, physical AI, drug discovery, computer games and many other applications.
      This seminar offers a rigorous treatment of reinforcement learning, focusing on the mathematical principles that make reinforcement learning algorithms work. We will develop a mathematically sound understanding of Markov decision processes, value function based methods and their connections to stochastic optimal control, policy gradient methods, emphasizing convergence properties of classical reinforcement learning algorithms through stochastic approximation and stochastic gradient descent. We will also explore continuous time reinforcement learning in the framework of stochastic differential equations.
      The seminar aims to provide a rigorous foundational perspective for students interested in current research related to reinforcement learning and artificial intelligence. Participants should have a strong background in mathematics specifically in probability theory.

      Suggested reading

      Literatur wird in der Vorbesprechung bekanntgegeben.

      Literature will be announced in the preliminary discussion

    • 19212211 Seminar
      Seminar on topic in Geometric Analysis and Differential Geometry (Elena Mäder-Baumdicker)
      Schedule: Mi 15.10. 12:00-14:00, Mi 05.11. 12:00-14:00 (Class starts on: 2025-10-15)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Ana I bis III, lineare Algebra I und II sowie mindestens einer der beiden Vorlesungen Differentialgeometrie I oder Differentialgleichungen I.

      Comments

      This seminar is intended for Bachelor's and Master's students with an interest in topics related to Geometric Analysis and Differential Geometry. Each semester, the seminar focuses on a different theme — examples include geometric variational problems, geometric flows, and geometric measure theory.

      In the first meeting of the semester, students can express their interest in participating. In the second meeting, each participant selects a topic from a curated list. The presentations themselves will take place during a dedicated seminar week at the end of the term.

       

    • 19214411 Seminar
      Research Module: Differential Geometrie (Konrad Polthier, Tillmann Kleiner)
      Schedule: Di 16:00-18:00, zusätzliche Termine siehe LV-Details (Class starts on: 2025-10-14)
      Location: A6/SR 007/008 Seminarraum (Arnimallee 6)

      Comments

      In this seminar, differential geometric topics will be independently developed based on current research and presented in the form of a talk.

      Particular emphasis is placed on the concrete implementation of differential geometric concepts in application scenarios and the questions of discretization and implementation.

      Learning objectives are a deeper understanding of differential geometry concepts, as well as problems and solution strategies in their practical use.

      Previous knowledge: Differential geometry I

    • 19223811 Seminar
      Master Seminar Topology "L^2-Betti numbers" (N.N.)
      Schedule: Do 10:00-12:00 (Class starts on: 2025-10-16)
      Location: A3/SR 115 (Arnimallee 3-5)

      Additional information / Pre-requisites

      Prerequisites: Basic knowledge of topology and group theory is required.

      Comments

      The Euler characteristic of finite CW-complexes is multiplicative under finite-sheeted coverings and it is homotopy invariant. These properties can be deduced from different descriptions:
      1. As the alternating sum of the numbers of cells, which are multiplicative but not homotopy invariant.
      2. As the alternating sum of Betti numbers, which are homotopy invariant but not multiplicative. The $n$-th Betti number of $X$ is the $\mathbb{Q}$-dimension of the homology $H_n(X;\mathbb{Q})$ with rational coefficients.
      3. As the alternating sum of $L^2$-Betti numbers, which enjoy the best features from both worlds: they are multiplicative and homotopy invariant. The $n$-th $L^2$-Betti number of $X$ is the von Neumann-dimension of the homology $H_n(X; \mathcal{N}\pi_1(X))$ with suitable coefficients.

      $L^2$-Betti numbers are meaningful topological invariants, as they obstruct the structures of mapping tori and $S^1$-actions. They also have applications to group theory by considering the $L^2$-Betti numbers of classifying spaces. Moreover, $L^2$-Betti numbers are related to famous open problems, such as the Hopf and Singer conjectures on the Euler characteristic of manifolds, and the Kaplansky conjecture on zero divisors in group rings.

      Detailed Information can be found on the Homepage of the seminar.

      Suggested reading

      This seminar will be an introduction to $L^2$-Betti numbers, following mostly
      the book by Holger Kammeyer.

    • 19226511 Seminar
      Seminar Multiscale Methods in Molecular Simulations (Luigi Delle Site)
      Schedule: Fr 12:00-14:00 (Class starts on: 2025-10-17)
      Location: Seminarraum in der Arnimallee 9

      Additional information / Pre-requisites

      Audience: At least 6th semester with a background in statistical and quantum mechanics, Master students and PhD students (even postdocs) are welcome.

      Comments

      Content: The seminar will concern the discussion of state-of-art techniques in molecular simulation which allow for a simulation of several space (especially) and time scale within one computational approach.

      The discussion will concerns both, specific computational coding and conceptual developments.

      Suggested reading

      Related Basic Literature:

      (1) M.Praprotnik, L.Delle Site and K.Kremer, Ann.Rev.Phys.Chem.59, 545-571 (2008)

      (2) C.Peter, L.Delle Site and K.Kremer, Soft Matter 4, 859-869 (2008).

      (3) M.Praprotnik and L.Delle Site, in "Biomolecular Simulations: Methods and Protocols" L.Monticelli and E.Salonen Eds. Vol.924, 567-583 (2012) Methods Mol. Biol. Springer-Science

    • 19246911 Seminar
      Geometric Deep Learning (Christoph Tycowicz)
      Schedule: Fr 10:00-12:00 (Class starts on: 2025-10-17)
      Location: T9/055 Seminarraum (Takustr. 9)

      Comments

      Pre-requisites:
      A solid background in differential geometry or geometric computing will be advantageous but is not mandatory.
      Students who haven't followed any related courses (Differential Geometry I, Scientific Visualization, ...) can follow the seminar but should be willing to invest more time.

      Description:
      Geometric deep learning is a broad and emerging research paradigm concerned with the derivation and study of neural network architectures that respect the invariances and symmetries in data.
      Indeed, many real-world tasks come with essential pre-defined regularities arising from the underlying low-dimensionality and structure of the physical world.
      Capturing these regularities via unified geometric principles has been shown to provide sizable empirical improvements.
      Examples of such geometric architectures include graph neural networks as well as models conditioned on data that reside on curved manifolds.

      The goal of this seminar will be to obtain in-depth knowledge about the core methodology in geometric deep learning as well as an overview of state-of-the-art methods.
      Students will acquire practical skills in reading, presenting, explaining, and discussing scientific papers.
      The seminar may be used as a preparation for an MSc thesis topic.

      Suggested reading

      Michael M. Bronstein, Joan Bruna, Taco Cohen, Petar Veličković (2021) Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges. arXiv:2104.13478

    • 19247111 Seminar
      Ordinary Differential Equations (Marita Thomas)
      Schedule: Di 16:00-18:00 (Class starts on: 2025-10-14)
      Location: A6/SR 009 Seminarraum (Arnimallee 6)

      Comments

      Ordinary differential equations arise in many applications from physics, chemistry, biology or economics. This seminar extends the topics that were covered in the Analysis III course, e.g., eigenvalue problems and stability theory will be addressed. 

  • Molecular Biology and Biochemistry I

    0260cA3.3
    • 21601a Lecture
      Biochemistry I - Fundamentals of Biochemistry (Helge Ewers, Florian Heyd, Markus Wahl)
      Schedule: Mi 12:00 - 14:00 Uhr; Vorbesprechung Di, 15.10.24, 12:00 - 14:00 Uhr (Class starts on: 2025-10-15)
      Location: Hs Kristallographie (Takustr. 6)

      Information for students

      Entspricht Molekularbiologie und Biochemie I für Bioinformatiker.

      Comments

      Qualifikationsziele:
      Die Studentinnen und Studenten kennen die Entstehung und molekulare Struktur der wichtigsten zellulären Makromoleküle und Stoffklassen sowie ihren biologischen Kontext. Der Schwerpunkt liegt auf einem chemischen Grundverständnis des molekularen Aufbaus von Biomolekülen.

      Inhalte:
      Chemische und zellbiologische Grundlagen, Struktur von DNA und RNA, Replikation und Transkription, Proteinbiosynthese, Regulation der Genexpression, gentechnologische Methoden, Aminosäuren und Peptide, Proteinstruktur und Proteinfaltung, Proteom, posttranslationale Modifikationen, Methoden der Proteinforschung, Enzyme, Kohlenhydrate, Lipide und Biomembranen, Einführung in den Stoffwechsel und die Stoffwechselregulation.

      Prof. Dr. H. Ewers: helge.ewers@fu-berlin.de
      Prof. Dr. F. Heyd: florian.heyd@fu-berlin.de
      Prof. Dr. M. Wahl: mwahl@zedat.fu-berlin.de

    • 21601b Practice seminar
      Tutorial for Biochemistry I - Fundamentals of Biochemistry (Helge Ewers, Florian Heyd, Markus Wahl)
      Schedule: (s. Lektionen, LV-Details) (Class starts on: 2025-10-21)
      Location: Ort nach Ansage je nach Übungsgruppe

      Additional information / Pre-requisites

      Die Übungen finden n.V. in kleineren Gruppen i.d.R. dienstags von 12:00 - 14:00 Uhr bzw. mittwochs von 10:00 - 12:00 Uhr Uhr statt. Die Verteilung findet im Rahmen der Vorbesprechung (s. 21601a) statt.

      Comments

      Qualifikationsziele: Die Studentinnen und Studenten kennen die Entstehung und molekulare Struktur der wichtigsten zellulären Makromoleküle und Stoffklassen sowie ihren biologischen Kontext. Der Schwerpunkt liegt auf einem chemischen Grundverständnis des molekularen Aufbaus von Biomolekülen. Inhalte: Chemische und zellbiologische Grundlagen, Struktur von DNA und RNA, Replikation und Transkription, Proteinbiosynthese, Regulation der Genexpression, gentechnologische Methoden, Aminosäuren und Peptide, Proteinstruktur und Proteinfaltung, Proteom, posttranslationale Modifikationen, Methoden der Proteinforschung, Enzyme, Kohlenhydrate, Lipide und Biomembranen, Einführung in den Stoffwechsel und die Stoffwechselregulation. Prof. Dr. H. Ewers: helge.ewers@fu-berlin.de Prof. Dr. F. Heyd: florian.heyd@fu-berlin.de Prof. Dr. M. Wahl: mwahl@zedat.fu-berlin.de

  • Molecular Biology and Biochemistry II

    0260cA3.4
    • 21698a Lecture
      Molecular Biology and Biochemistry II (Francesca Bottanelli, Sutapa Chakrabarti, Helge Ewers, Lydia Herzel, Florian Heyd)
      Schedule: Do 10:00-12:00 Uhr (Class starts on: 2025-10-16)
      Location: Hörsaal/ Thielallee 67

      Information for students

      Qualifikationsziele: Die Studentinnen und Studenten haben ein Grundlagenverständnis in folgenden Bereichen: Zusammenwirken anatomischer, zellbiologischer und biochemische Prinzipien der Genexpression und des Energiestoffwechsels in Säugetieren, Regulation der Genexpression auf den Ebenen von Chromatinstruktur, Transkription, Prozessierung und Modifizierung in Säugetieren, Zell-Morphologie, -Mobilität und -Adhäsion in Organstrukturen von Säugetieren. Inhalte: Strukturprinzipien in Nuckleinsäuren und Proteinen, Chaperone und Ausbildung biologisch korrekter Protein Strukturen, Prinzipien der Struktur-Vorhersage, Genom-Komponenten und quantitative Zusammensetzung, Remodellierung von Chromatin zu transkribierbaren und nicht-transkribierbaren Konformationen, epigenetischer Histon-Code, CG-Inseln und DNA-Methylierung, modularer Aufbau der Promotoren, Protein: DNA-Wechelwirkungen und deren Strukturdomänen bei der qualitativen und quantitativen Steuerung der Transkription, snRNP und RNA-Prozessierung, Selbstspleißende Introns, RNA-Editierung, Kern-Cytoplasma, Cyotoplasma-Kern Transport, anatomische, zellbiologische und biochemische Prinzipien zur Gewinnung chemischer Reaktionsernergie, Protein-Abbau und Autophagie, Cytoskelett, Zell-Motilität und Zelladhäsion.

      UN Sustainable Development Goals (SDGs): 3, 14, 15

      Comments

      Prof. Bottanelli: bottanelli@zedat.fu-berlin.de Prof. Chakrabarti: sutapa.chakrabarti@fu-berlin.de Prof. Freund: christian.freund@fu-berlin.de Pro. Herzel: lydia.herzel@fu-berlin.de Prof. Heyd: florian.heyd@fu-berlin.de Dr. Preußner: marco.preussner@fu-berlin.de Prof. Wahl: mwahl@zedat.fu-berlin.de

    • 21698b Practice seminar
      Tutorial - Molecular Biology and Biochemistry II (Francesca Bottanelli, Sutapa Chakrabarti, Lydia Herzel, Florian Heyd)
      Schedule: Mi 13:00-15:00 Uhr (Class starts on: 2025-10-22)
      Location: Hörsaal/Thielallee 67 (Thielallee 67)

      Information for students

      Weitere Informationen unter:
      http://www.fu-berlin.de/sites/fimbb/lehre/

      UN Sustainable Development Goals (SDGs): 3, 14, 15

      Comments

      Prof. Bottanelli: bottanelli@zedat.fu-berlin.de Prof. Chakrabarti: sutapa.chakrabarti@fu-berlin.de Prof. Freund: christian.freund@fu-berlin.de Pro. Herzel: lydia.herzel@fu-berlin.de Prof. Heyd: florian.heyd@fu-berlin.de Dr. Preußner: marco.preussner@fu-berlin.de Prof. Wahl: mwahl@zedat.fu-berlin.de

  • Genetics and Genome Research

    0260cA3.6
    • 23771a Lecture
      V Genetik und Genomforschung (V) (Katja Nowick)
      Schedule: siehe Terminserie (Class starts on: 2025-10-15)
      Location: Hs Zoologie (R 110) (Königin-Luise-Str. 1 / 3); siehe Terminserie

      Information for students

      UN Sustainable Development Goals (SDGs): 3, 5, 15

      Additional information / Pre-requisites

      Bitte melden Sie sich in CM nur für die Vorlesung an. Die Übung wird im Laufe des Semesters für Sie nachgetragen.

      Verbindliche Vorbesprechung am 1. Vorlesungstag (Mi, 15.10.2025; 13:00 Uhr)

      Comments

      Ein Überblick über den Aufbau der Lehrveranstaltung (d.h. Vorlesung und Übung) wird im Rahmen der ersten Vorlesung gegeben.

      Themen:
      Genregulation: Dogma der Molekularbiologie, Transkription, Translation, Transkriptionsfaktoren und deren Bindungsmotive
      Nicht-kodierende RNAs: Strukturen, Funktionen
      Genregulatorische Netzwerke: Komplexität der Genregulation, Analysemethoden
      Populationsgenetik: Vererbungsmuster und Erbkrankheiten, Mutation, Selektion, Hardy-Weinberg-Gleichgewicht, Neutrale Theory, Molekulare Uhr, Linkage Disequilibrium, Tests fuer positive Selektion in Populationen
      Phylogenetik: Bäume (rooted/unrooted), Neighbor joining, Maximum Parsimony, Maximum Likelihood, Tests für positive Selektion, Genomprojekte
      Genomtypen einer Zelle (nukleäres, mitochondriales und chloroplastisches Genom), Aufbau und Struktur des nukleären Genoms, Aufbau und Struktur von Chromosomen
      Funktion chromosomaler Strukturelemente (Replikationsursprung, Zentromer, Telomer), Steuerung des Zellzyklus, Modifikation von Histonen
      Karyogramm, Chromosomenanomalien
      Genfamilien und Prinzip der Homologie bei Genen, Next-Generation Sequencing
      Mono-allelische Expression
      Geschlechtsdetermination

    • 23771b Practice seminar
      Ü Genetik und Genomforschung (Ü) (Katja Nowick)
      Schedule: 28.01. - 18.02.2026; Mi; 13:00 - 16:00 (Class starts on: 2026-01-28)
      Location: Ehrenberg-Saal (R 126-132) (Königin-Luise-Str. 1 / 3)

      Information for students

      UN Sustainable Development Goals (SDGs): 3, 5, 15

      Additional information / Pre-requisites

      Bitte melden Sie sich in CM nur für die Vorlesung an. Die Übung wird im Laufe des Semesters für Sie nachgetragen.

      Wird am Ende des Semesters an 4 Terminen im Block durchgeführt.

      Comments

      Details werden im Rahmen der Vorbesprechung am 1. Vorlesungstag (Mi. 15.10.2025, 13:00 Uhr) bekannt gegeben.

    • 23771ak Written Exam
      Klausur Genetik und Genomforschung (Katja Nowick)
      Schedule: siehe Terminserie (Class starts on: 2026-02-25)
      Location: 1. Termin: EEC1; 2. Termin EEC1
  • Neurobiology

    0260cA3.8
    • 23772a Lecture
      V Einführung in die Neurobiologie und Neuroinformatik für Studierende der Bioinformatik (Joachim Fuchs, Peter Robin Hiesinger, Ursula Koch, Gerit Linneweber, Eric Reifenstein, Max von Kleist, Mathias Wernet)
      Schedule: siehe Terminserie (Class starts on: 2025-10-16)
      Location: siehe Terminserie

      Information for students

      UN Sustainable Development Goals (SDGs): 3, 4, 5, 15

    • 23772b Internship
      P Neurobiologie für Studierende der Bioinformatik Kurs A (Edouard Joseph Babo, Joachim Fuchs, Peter Robin Hiesinger, Gerit Linneweber, Dagmar Malun, Mathias Wernet)
      Schedule: 3. Block: 05.01. - 02.02.2026; Mo; 08:00 - 12:00 (Class starts on: 2026-01-05)
      Location: Kursraum D/E (R 2/3) (Königin-Luise-Str. 1 / 3)

      Information for students

      UN Sustainable Development Goals (SDGs): 3, 4, 5, 15

      Additional information / Pre-requisites

      1 mal wöchentlich (Mo), insgesamt 5 Termine

    • 23772c Internship
      P Neurobiologie für Studierende der Bioinformatik Kurs B (Edouard Joseph Babo, Joachim Fuchs, Peter Robin Hiesinger, Gerit Linneweber, Dagmar Malun, Mathias Wernet)
      Schedule: 3. Block: 05.01. - 02.02.2026; Mo; 14:00 - 18:00 (Class starts on: 2026-01-05)
      Location: Kursraum D/E (R 2/3) (Königin-Luise-Str. 1 / 3)

      Information for students

      UN Sustainable Development Goals (SDGs): 3, 4, 5, 15

      Additional information / Pre-requisites

      1 mal wöchentlich (Mo), insgesamt 5 Termine

    • Image Processing 0089cA1.1
    • Medical Image Processing 0089cA1.10
    • Model-driven Software Development 0089cA1.11
    • Network-Based Information Systems 0089cA1.13
    • Project Management 0089cA1.14
    • Project Management (Specialization) 0089cA1.15
    • Computer Security 0089cA1.16
    • Semantic Business Process Management 0089cA1.17
    • Compiler Construction 0089cA1.19
    • Computer Graphics 0089cA1.2
    • Distributed Systems 0089cA1.20
    • XML Technology 0089cA1.21
    • Practices in Professional Software Development 0089cA1.22
    • Computer Vision 0089cA1.3
    • Selected Topics in Applied Computer Science 0089cA1.31
    • Database Technology 0089cA1.4
    • Empirical Evaluation in Computer Science 0089cA1.5
    • Fundamentals of Software Testing 0089cA1.7
    • Artificial Intelligence 0089cA1.9
    • Starting a Business in IT 0159cA2.2
    • Model Checking 0089cA2.2
    • Computational Geometry 0089cA2.4
    • Selected Topics in Theoretical Computer Science 0089cA2.5
    • Advanced topics in Theoretical Computer Science 0089cA2.6
    • Semantics of Programming Languages 0089cA2.9
    • Selected Topics in Technical Computer Science 0089cA3.12
    • Mobile Communications 0089cA3.3
    • Robotics 0089cA3.4
    • Computer-Oriented Mathematics II 0084dA1.7
    • Probability and Statistics I 0084dA1.8
    • Higher Analysis 0084dB2.1
    • Current Topics in Mathematics 0084dB2.10
    • Special topics in Applied Mathematics 0084dB2.13
    • Complex Analysis 0084dB2.3
    • Elementary Geometry 0084dB2.6
    • Geometry 0084dB2.7
    • Mathematical Project 0084dB2.9
    • Differential Equations I 0084dB3.1
    • Algebra I 0084dB3.3
    • Topology I 0084dB3.6
    • Visualization 0084dB3.8.
    • Statistics Software (CoSta) 0162bA1.3
    • Introduction to Visualization 0162bA1.4
    • Panorama of Mathematics 0162bA1.5
    • Introductory Module: Differential Geometry II 0280bA1.2
    • Advanced Module: Differential Geometry III 0280bA1.3
    • Introductory Module: Algebra I 0280bA2.1
    • Introductory Module: Algebra II 0280bA2.2
    • Research Module: Algebra 0280bA2.4
    • Introductory Module: Discrete Mathematics I 0280bA3.1
    • Introductory Module: Discrete Geometry II 0280bA3.4
    • Advanced Module: Discrete Mathematics III 0280bA3.5
    • Research Module: Discrete Mathematics 0280bA3.7
    • Introductory Module: Topology I 0280bA4.1
    • Introductory Module: Visualization 0280bA4.3
    • Advanced Module: Topology III 0280bA4.4
    • Introductory Module: Numerical Analysis III 0280bA5.2
    • Research Module: Numerical Mathematics 0280bA5.4
    • Introductory Module: Differential Equations I 0280bA6.1
    • Advanced Module: Differential Equations III 0280bA6.3
    • Research Module: Applied Analysis and Differential Equations 0280bA6.4
    • Complementary Module: Specific Aspects 0280bA7.3
    • Complementary Module: Specific Research Aspects 0280bA7.4
    • Complementary Module: Research Project 0280bA7.6
    • Introductory Module: Algebra I 0280cA1.1
    • Introductory Module: Dynamical Systems II 0280cA1.10
    • Introductory Module: Numerical Mathematics III 0280cA1.12
    • Introductory Module: Partial Differential Equations I 0280cA1.13
    • Introductory Module: Probability and Statistics III 0280cA1.16
    • Introductory Module: Topology I 0280cA1.17
    • Introductory Module: Number Theory II 0280cA1.19
    • Introductory Module: Algebra II 0280cA1.2
    • Introductory Module: Differential Geometry II 0280cA1.4
    • Introductory Module: Discrete Geometry II 0280cA1.6
    • Introductory Module: Dynamical Systems I 0280cA1.9
    • Advanced Module: Number Theory III 0280cA2.10
    • Advanced Module: Differential Geometry III 0280cA2.2
    • Advanced Module: Discrete Mathematics III 0280cA2.4
    • Advanced Module: Dynamical Systems III 0280cA2.5
    • Advanced Module: Partial Differential Equations III 0280cA2.7
    • Advanced Module: Probability and Statistics IV 0280cA2.8
    • Advanced Module: Topology III 0280cA2.9
    • Specialization Module: Master's Seminar on Algebra 0280cA3.1
    • Specialization Module: Master's Seminar on Number Theory 0280cA3.10
    • Specialization Module: Master's Seminar on Discrete Mathematics 0280cA3.4
    • Specialization Module: Master’s Seminar on Dynamical Systems 0280cA3.5
    • Complementary Module: Specific Research Aspects 0280cA4.10
    • Complementary Module: Research Project 0280cA4.11
    • Algorithmic Bioinformatics 0260cA1.5
    • Statistics I for Students of Life Sciences 0260cA2.5
    • Statistics II for Students of Life Sciences 0260cA2.6
    • General Chemistry 0260cA3.1
    • Molecular Biology and Biochemistry III 0260cA3.5
    • Medical Physiology 0260cA3.7
    • Biodiversity and Evolution 0262bB1.1
    • Medical Bioinformatics 0262bB1.2
    • Network Analysis 0262bB1.3
    • Physiology 0262bB1.4
    • Sequence Analysis 0262bB1.5
    • Structural Bioinformatics 0262bB1.6
    • Current Topics in Cell Physiology 0262bB2.1
    • Applied Sequence Analysis 0262bB2.2
    • Measurement and Analysis of Physiological Processes 0262bB2.3
    • Computational Systems Biology 0262bB2.4
    • Environmental Metagenomics 0262bB2.5
    • Current Topics in Medical Genomics 0262bB2.6
    • Current Topics in Structural Bioinformatics 0262bB2.7
    • Research Modules: Module A 0262bB3.1
    • Research Modules: Module B 0262bB3.2
    • Data Structures and Data Abstraction with Applications 0084dB2.8
    • Applied Modules: All Other Subjects 0089cD9.1
    • Elective Area (all other subjects) 0089cD9.2
    • Elective Area (all other subjects) 0089cD9.3
    • Elective Area (all other subjects) 0089cD9.4