FAKULTÄT FÜR MATHEMATIK |
January 31 - February 01, 2008 in Bielefeld, Room: V3-201
supported by
![]()
SPP 1126: Algorithmik großer und komplexer Netzwerke
10:00 Soren Riis (University of London)
Graph Entropy, Guessing Games and Network Coding, Part 1
11:00 Christian Deppe (University of Bielefeld)
The 3/4 conjecture - a survey of results
12:00 Harout Aydinian (University of Bielefeld)
On some extremal problems related to erasure coding
13:00 Lunch break
14:00 Julia Mixtacki (University of Bielefeld)
Genome halving under the double cut and join distance
10:00 Soren Riis (University of London)
Graph Entropy, Guessing Games and Network Coding, Part 2
11:00 Martin Milanic (University of Bielefeld)
Evaluating monotone Boolean functions with priced variables
12:00 Christian Bey (University of Magdeburg)
On Boolean functions with the sum of every two of them being bent
13:00 Soren Riis (University of London)
Graph Entropy, Guessing Games and Network Coding, Part 3