Oberseminar
Das Oberseminar findet Di 10-12 und Fr 14-16 im Raum Z1.09 (neu: L109), Oettingenstr. 67 statt.
- Hinweise
- Allgemeine Hinweise zum TCS-Oberseminar
- Jan Johannsen: Lower bounds for width-restricted clause learning (Z1.09 (neu: L109), from 05.03.2010 14:15 to 05.03.2010 15:45)
- 05.03.2010 14:15
- Dulma Rodriguez: Towards Type Inference for RAJA (work in progress) (Z1.09 (neu: L109), from 05.02.2010 14:15 to 05.02.2010 15:45)
- 05.02.2010 14:15
- Jan Hoffmann: Analyzing Sorting Algorithms with Resource Aware ML (Z1.09 (neu: L109), from 02.02.2010 10:15 to 02.02.2010 11:45)
- 02.02.2010 10:15
- Martin Hofmann: What is a pure functional? (Z1.09 (neu: L109), from 29.01.2010 14:15 to 29.01.2010 15:45)
- 29.01.2010 14:15
- Christian Spitschka: Vorstellung der Zulassungsarbeit (Z1.09 (neu: L109), from 12.01.2010 10:15 to 12.01.2010 11:45)
- 12.01.2010 10:15
- Paul Harrenstein: Minimal Retentive Sets in Tournaments (Z1.09 (neu: L109), from 18.12.2009 14:15 to 18.12.2009 15:45)
- 18.12.2009 14:15
- Haris Aziz: Wiretapping: the nucleolus of connectivity (Z1.09 (neu: L109), from 04.12.2009 14:15 to 04.12.2009 15:45)
- 04.12.2009 14:15
- Robert Grabowski: Noninterference with dynamic security domains and policies (Z1.09 (neu: L109), from 01.12.2009 10:15 to 01.12.2009 11:45)
- 01.12.2009 10:15
- Markus Brill: Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (Z1.09 (neu: L109), from 24.11.2009 10:15 to 24.11.2009 11:45)
- 24.11.2009 10:15
- Evangelia Pyrga (MPI Informatik, Saarbrücken): Contention Resolution under Selfishness (Z1.09 (neu: L109), from 20.11.2009 14:15 to 20.11.2009 15:45)
- 20.11.2009 14:15
- Hans Georg Seedig: Network Flow Optimization with Minimum Quantities (Z1.09 (neu: L109), from 17.11.2009 10:15 to 17.11.2009 11:45)
- 17.11.2009 10:15
- Troels Bjerre Sørensen: Computing strategies for poker (Z1.09 (neu: L109), from 13.11.2009 14:15 to 13.11.2009 15:45)
- 13.11.2009 14:15
- Ulrich Schöpp: Functional Programming in Sublinear Space (Z1.09 (neu: L109), from 06.11.2009 14:15 to 06.11.2009 15:45)
- 06.11.2009 14:15
- Martin Lange: Extended Computation Tree Logic (Z1.09 (neu: L109), from 03.11.2009 10:15 to 03.11.2009 11:45)
- 03.11.2009 10:15
- Arist Kojevnikov: On Circuit Complexity of MOD-functions (Z1.09 (neu: L109), from 30.10.2009 14:15 to 30.10.2009 15:45)
- 30.10.2009 14:15
- Dongyuan Yu: Algorithmen und Heuristiken für das Longest-Common-Substring-Problem (Z1.09, from 09.10.2009 14:15 to 09.10.2009 15:45)
- 09.10.2009 14:15
- Edith Elkind (Nanyang Technological University, Singapore): Distance Rationalizability of Voting Rules (Z1.09, from 03.09.2009 15:00 to 03.09.2009 16:30)
- 03.09.2009 15:00
