■
Team
■
Teaching
Information for students of B.Sc./M.Sc. Mathematics
Summer 2021
■
Winter 2020
Summer 2020
■
Winter 2019
■
Summer 2019
■
Winter 2018
■
Summer 2018
■
Winter 2017
■
Summer 2017
■
Winter 2016
■
Summer 2016
■
Winter 2015
■
Summer 2015
■
Winter 2014
Algorithms for OpenStreetMap data
Discrete Optimization
Erg. zu Algorithmen, Berechenbarkeit & Komplexität
Ergänzungen zu Logik & DS
Studienprojekt STANKER
■
Summer 2014
■
Winter 2013
■
Summer 2013
■
Winter 2012
■
Summer 2012
■
Winter 2011
Former Semester
BSc, Master-, Student-, Diplomathesis
StuPro/ ProjektINF/ SoPra/ FaPra
■
Research
Publications
Projects
Student Projects
 

Ergänzungen zu Algorithmen, Berechenbarkeit und Komplexität

Aktuelles

Besprechung der eingegangen Aufgaben am 13.08.2015 von 14-16 Uhr in Raum 0.108

vorläufige Formelsammlung

Tex-Datei zur Formelsammlung (Änderungen bitte mir als diff/patch oder besser die ganze Datei schicken)

Vorlesung

Daniel Bahrdt

Diese Veranstaltung ergänzt die Module Berechenbarkeit und Komplexität, Algorithmen und Berechenbarkeit. Die Veranstaltung gliedert sich in drei Bereiche:

  • Wiederholung der Inhalte aus den Vorlesungen und Übungen mit zusätzlichen oder ausführlicheren Erklärungen, sowie Wiederholung wichtiger Themen aus Mathematik und theoretischer Informatik des ersten Semesters
  • Ergänzung des Stoffes mit weiterführenden Ergebnissen, alternativen Beweisen, zusätzlichen Beispielen und Verknüpfung mit praktischen Anwendungen
  • Hilfe bei Schwierigkeiten mit den Hausübungen

Themenwünsche können per E-Mail an den Dozenten geäußert werden.

Termine und Materialien

Achtung: Die Termine können sich noch ändern!

Woche Wann / Wo / Was / Prüfungsrelevanz / Material
KW 42 Do 16.10
17:30-19:00
V38.03
Programmlaufzeiten / Turingmaschinen
AuB, BuK
Blatt0
KW 43 Do 23.10
17:30-19:00
V38.03
Reduktionen
AuB
KW 44 Do 30.10
17:30-19:00
V38.03
Reduktionen, Landausymbole
AuB
[Blatt2][blatt2]
KW 46 Do 13.11
17:30-19:00
V38.03
Berechenbarkeit, primitive Rekursion
BuK
Blatt3
KW 47 Do 20.11
17:30-19:00
V38.03
Polynomialzeitreduktion, Gödel’sches Prädikat
AuB
[Blatt4][blatt4]
KW 48 Do 27.11
17:30-19:00
V38.03
Reduktionen
BuK, AuB
Blatt5
KW 49 Do 4.12
17:30-19:00
V38.03
Reduktionen, Landau-Symbole, Rekursionsgleichungen
AuB
Blatt6
KW 50 Do 11.12
17:30-19:00
V38.03
Reduktionen, Arithmetische Darstellung
BuK
Blatt7
KW 51 Do 18.12
17:30-19:00
V38.03
Rekursionsgleichungen, dynamisches Programmieren
AuB
Blatt8
KW 02 Do 08.01
17:30-19:00
V38.03
Polynomialzeitreduktion
BuK
Blatt9
KW 03 Do 15.01
17:30-19:00
V38.03
Amortisationsanalyse
AuB
Blatt10
KW 04 Do 22.01
17:30-19:00
V38.03
Gödelsches Prädikat, Reduktion, Hierarchiesätze
BuK
Blatt11
KW 05 Do 29.01
17:30-19:00
V38.03
Wiederholung
AuB
Blatt12
KW 06 Do 05.02
17:30-19:00
V38.03
Wiederholung
BuK
Blatt13
KW 11 Fr 13.03
14:00-17:00
0.108
Prüfungsvorbereitung
AuB, BuK

Literatur

Algorithmik

Berechenbarkeit / Komplexitätstheorie

  • Theoretische Informatik - kurzgefasst von Uwe Schöning
  • Theoretische Informatik von Dirk W. Hoffmann

Grundwissen (und darüber hinaus)

  • Taschenbuch der Mathematik
  • Repetitorium der Mathematik
  • Logik für Informatiker von Uwe Schöning

Wahrscheinlichkeitstheorie

  • Elemente der diskreten Mathematik
  • Stochastik: Einführung in die Wahrscheinlichkeitstheorie und Statistik

News

[Oct’21] We have migrated to our new webssite here!

[Jun’19] Our paper on trajectory storage and retrieval has been accepted at SSTD 2019!

[Nov’18] Our paper on regret minimization has been accepted at AAAI 2019 (acceptance rate 16.2%)!

[Oct’18] Our paper on alternative route planning for bicycles has been accepted at ALENEX 2019!

[Apr’18] Martin has successfully defended his Ph.D. thesis. Congratulations!

[Jan’18] The journal version of our paper on k-hop path covers will receive a publication award from our university!

[Nov’17] Our paper on a theoretical explanation for several speed-up techniques for route computation has been accepted at AAAI 2018!

[Oct’17] Thomas’ paper on area preserving map simplification has been accepted at ALENEX 2018!

[May’17] Daniel’s and Martin’s paper on rational points on the unit sphere has been accepted at ISSAC 2017!

[Apr’17] Our paper on personalized route planning with dynamic approximation guarantees has been accepted at SEA 2017!

[Jan’17] Martin’s paper on map matching has been accepted at SIAM SDM 2017!

[Nov’16] Our paper on simultaneous maze solving has been accepted at AAAI 2017.

[Okt’16] Two papers, one on growing balls (!), the other on map simplification will be presented at ALENEX 2017.

[Sep’16] Our paper on Deducing Individual Driving Preferences has been accepted at the 24th ACM SIGSPATIAL GIS 2016.

[Feb’16] Our paper on placing loading stations for EVs has been accepted at ICAPS 2016.

[Jul’15] Paper about our GeoSearch Engine OSCAR at the 16th Int. Conf on Web Information Systems Engineering (WISE)!

[Jun’15] We feel very honored to have our VLDB’14 paper almost verbatimly reproduced in the ‘prestigous’ journal IJSETR, see here. Yeah! 😉

[Feb’15] We were lucky to receive a Google Research Award for research on personalized route planning!

[Sep’14] Our paper “On k-Path Covers and their Applications” has received a Best Paper Award at the 40th Int. Conference on Very Large Databases (VLDB) in Hangzhou (5 out of 139 accepted out of 695 submitted papers).

[Sep’14] Our paper on “Energy-efficient Routing: Taking Speed into Account” has received a Best Paper Award at the 37th German Conference on Artificial Intelligence (KI).

[Jul’14] Our paper “Placement of Loading Stations for Electric Vehicles: No Detours Necessary!” has received a Honorable Mention at the 28th AAAI Conference on Artificial Intelligence (AAAI) in Quebec City (5 nominated out of 398 accepted out of 1406 submitted papers).

[Mar’14] Our StuPro-Team has completed their great “SchulScheduler” project.

[Nov’13] Jochen has defended his PhD thesis and moved on to TomTom.

[Feb’13] Sabine has defended her PhD thesis (already in Dec’12) and received the INFOS award for best CS PhD thesis in 2012!

[Mar’12] Our paper Path Shapes - An Alternative Method for Map Matching and Fully Autonomous Self-Localization presented at GIS 2011 has received the Best Paper Award, also see the ACM SIGSPATIAL newsletter.