https://nerva.informatik.uni-bonn.de/ 2026-04-06T10:10:35+00:00 https://nerva.informatik.uni-bonn.de/ https://nerva.informatik.uni-bonn.de/lib/exe/fetch.php/wiki/dokuwiki.svg text/html 2019-03-11T08:03:02+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/teaching/ss19/lab-combinatorialalg?rev=1552291382&do=diff Lab: Combinatorial Algorithms MA-INF 1207 Dates When Where LecturerTuesday 16:00 - 17:30Room 2.059A. Schmitz, Prof. Dr. N. Blum The kickoff meeting will be held on the 25th March, 13 o'clock. The themes of this years LAB are graphs and strings. Also, it is possible to suggest your ideas for an LAB theme. text/html 2019-06-25T11:21:17+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/teaching/ss19/lab-efficientalg?rev=1561461677&do=diff Lab: Efficient Algorithms for selected Problems MA-INF 1309 Dates When Where LecturerTuesday 12:15 - 14:00Endenicher Allee 19a / 2.050Fischer, Schmidt, Tönnis The kickoff meeting will be on Monday, 1st of April at 12:15 in room 2.050. If you are interested please contact text/html 2019-04-01T14:17:02+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/teaching/ss19/lab-kesselheim?rev=1554128222&do=diff MA-INF 1309 - Lab Efficient Algorithms for Selected Problems: Design, Analysis and Implementation (Kesselheim) Offered by Thomas Kesselheim In this lab, we will be implement algorithms for optimization under uncertainty and evaluate their performance. In particular, the question is to what extent the derived theoretical guarantees are tight and if algorithms that perform better in theory also do so in experiments. text/html 2018-12-14T09:24:35+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/teaching/ss19/pg?rev=1544779475&do=diff Projektgruppe: Entwurf & Implementierung von Algorithmen BA-INF 051 Termine Wann Wo DozentMontag 14:15 - 16:00Endenicher Allee 19a / 2.050Fischer, Schmidt, Tönnis Das erste Treffen findet am 1. April statt. Wir bitten potentielle Interessenten darum, vorab eine kurze Email an text/html 2019-03-11T08:02:22+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/teaching/ss19/seminar-advancedalgo?rev=1552291342&do=diff Seminar Advanced Algorithms MA-INF 1307 Dates When Where LecturerTuesday 16:00 - 17:30Room 2.059A. Schmitz, Prof. Dr. N, Blum The kickoff meeting will be held on the 25th of March, 13 o'clock. If you are interested please contact Adrian Schmitz, so we can estimate the number of additional participants. text/html 2019-04-01T14:16:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/teaching/ss19/seminar-kesselheim?rev=1554128191&do=diff MA-INF 1307 - Seminar Advanced Algorithms Offered by Thomas Kesselheim Online Algorithms and Optimization under Uncertainty In this seminar, we cover topics in the area of online algorithms and optimization under uncertainty. That is, algorithms have to make decisions under incomplete information. text/html 2019-08-05T14:59:17+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/teaching/ss19/vl-agt?rev=1565017157&do=diff MA-INF 1301: Algorithmic Game Theory and the Internet Next Semester Next semester, we will offer a seminar and a lab, which are both on topics of algorithmic game theory. Please contact Thomas Kesselheim if you are interested. The lab will probably much more fun with many participants. text/html 2019-07-16T10:39:25+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/teaching/ss19/vl-bool?rev=1563273565&do=diff Advanced Topics of Algorithmics: Complexity of Boolean Functions (MA-INF 1302) Description Is P = NP? This is the most famous open problem in computer science. A popular approach to attack this problem is to look for a proof of a nonpolynomial lower bound for the circuit complexity of the characteristic function of a language in NP. But no nonlinear lower bound for such a function is known. Can we multiply two integers in linear time or can we prove an Ω(n log n) lower bound for the circuit co…