38th ICALP 2011: Zurich, Switzerland - Part I

Refine list

showing all ?? records

Network Design Problems

Quantum Computing

Graph Algorithms

Games, Approximation Schemes, Smoothed Analysis

Online Algorithms

Data Structures, Distributed Computing

Complexity, Randomness

Submodular Optimization, Matroids

Cryptography, Learning

Fixed Parameter Tractability

Hardness of Approximation

Counting, Testing


Proof Complexity

Sorting, Matchings, Paths

Constraint Satisfaction, Algebraic Complexity

Steiner Problems, Clustering

a service of  Schloss Dagstuhl - Leibniz Center for Informatics