Seminar: FUN with Algorithms

General

Modulbeschreibung  Proseminar / Seminar A / Seminar B

Lecturer: Marc Hellmuth

Date and Place: NEW: Friday (10-12am),  Walther-Rathenau-Str 47 - R 5.08 (First Talk: 16.Nov)

Previous Knowledge: Familiarity with discrete mathematics, algorithmics and complexity theory

Certificate Requirements: Active participation in seminar + talk (+ written summary)

Dates and News

  • Seminar takes now place in Room 5.08 (W.-Rathenau-Str. 47) on Friday 10 am st.
  • Seminar starts on Thursday 18. Oct. 2018

Latest 1 week before your talk, come to my office in order to show me your slides or presentation-proposal!

 

SeminarTalkTopics

(in alphabetical order)

  1. A Cryptographer’s Conspiracy Santa
    Paper-Link
  2. A Muffin-Theorem Generator
    Paper-Link
  3. Classic Nintendo games are (computationally) hard
    Paper-Link
  4. Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games
    Paper-Link
  5. Hanabi is NP-Complete, Even for Cheaters Who Look at Their Cards
    Paper-Link
  6. How long does it take for all users in a social network to choose their communities?
    Paper-Link
  7. LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?
    Paper-Link
  8. Measuring with jugs
    Paper-Link
  9. Optimizing airspace closure with respect to politicians' egos
    Paper-Link
  10. The Complexity of Snake
    Paper-Link
  11. The Urinal Problem
    Paper-Link
  12. UNO is hard, even for a single player
    Paper-Link
  13. Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives
    Paper-Link