We use cookies to collect statistics

We start using cookies when you continue to another page. You can decline data collection by clicking here. We will use a cookie to remember your choice.

If you wish to avoid cookies altogether, you must disable cookies in your browser settings. However, rejecting all cookies will result in losing some of the functionalities of the website.

Read more about the IT University's use of cookies.

ICALP logo
Skip to content

Last updated on 2014-06-12Conference > Program > YR-ICALP

YR-ICALP 

Updated Thu Jun 12 11:09:54 CEST 2014

Monday

Chair: Troels Sørensen

9.00–10.30 AUD4

  1. Lakhdar Akroun. Simulation Preorder for Data-Centric Web Services
  2. Amir Abboud. Hardness for Easy Problems
  3. Elli Zavou. Asymptotic Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone

11.00–12.30 AUD4

  1. Ruben Becker. Towards Efficient Combinatorial Algorithms for the Min-Cost Flow Problem
  2. Michał Różański, Solving Ad Hoc Communication Problems Through Network Coloring: A Short Overview
  3. Andreas Wierz. Primal-Dual Algorithms for Precedence Constrained Covering Problems

13.30–15.00 Atrium

Poster session

15.30–17.00 AUD4

  1. Denis Kuperberg and Michał Skrzypczak. On Determinization of Good-For-Games Automata
  2. Vitaly Perevoshchikov. Adding Operations to Weighted MSO-Logic
  3. Matthias Feldotto. Analyzing Complex Infinitely Repeated Games with Methods from Evolutionary Game Theory
 

Find this page Online

http://icalp2014.itu.dk/Conference/Program/YR-ICALP