On June 3, 2015, the 4th SFB 901 seminar in the summer semester will take place.
16:00 - 16:45 (TP A4) Title: Do not judge the quality of composed services by certificates: How service providers (intentionally) misuse certificates to conceal true quality. – An experimental analysis (Abstract) Speaker: Prof. Dr. René Fahr
17:00…
On June 2, 2015, Dr. Sebastian Mammen (University of Augsburg) will give a talk about "Ready for Action: Challenges of Swarm-Based M&S for Real-World Applications" in the context of the SFB 901.
Abstract:
Computationally modelling systems based on their individual, often reactive components bears many…
On May 13, 2015, the 3rd SFB 901 seminar in the summer semester will take place.
16:00 - 16:45 (C2) Title: Scheduling and Transmodal Migration of Tasks in Heterogeneous OFT Computing Nodes (Abstract) Speaker. Achim Lösch
17:00 - 17:45 (B2) Title: Automated Online Service Composition and the Increasing Importance…
On May 11, 2015, Jun.-Prof. Dr. Lars Metzger from the TU Dortmund will give a talk about "Alliance formation in contests with incomplete information" in the context of the SFB 901 colloquium.
Abstract:
This paper studies a contest in which players with unobservable types may form an alliance in a pre-stage of the game to join their…
On April 29, 2015, the 2nd SFB 901 seminar in the summer semester will take place.
16:00 - 16:45 (A3) Title: Be happy by sharing - On approximate Nash equilibria in bandwidth allocation games (Abstract) Speaker: Max Drees
17:00 - 17:45 (C1) Title: SAFER: A Storage Failure Resistant Distributed Storage…
On April 15, 2015, the 1st SFB 901 seminar in the summer semester will take place.
16:00 - 16:45 (A1) Title: On Online Resource Leasing (Abstract) Speaker: Christine Markarian
17:00 - 17:45 (B1) Title:…
On March 16, 2015, Dr, Jonas Lèfevre will give a talk about "About Population Protocols. Selfstabilizing Algorithms" in the context of the SFB 901.
Abstract:
Population protocols are a computational model for distributed systems where the agents are equivalent to finite automata, passively mobile and…
On March 3, 2015, Prof. Harald Räcke from the Technische Universität München will give a talk about "Fast Tree Approximations of Graphs" in the context of the SFB 901 colloquium.
Abstract:
Given a graph G=(V,E,c) with edge capacities, a cut-sparsifier for G is a graph H=(V',E',c') with V\subseteq V' that…
Prof. Dr. Johannes Blömer will give a popular scientific talk on challenges in cryptography. The event will take place on February 27th, 9:00 am - 4:00 pm, at lecture hall O1.
For more information please visit:
http://www.cs.uni-paderborn.de/fachgebiete/ag-bloemer/kryptotag
