How to meet asynchronously (almost) everywhere

How to Play Unique Games against a Semi-Random Adversary

How to Play Unique Games on Expanders

Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme

Human being is a living random number generator

HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget

I/O Efficient Algorithms for Matrix Computations

I/O efficient bisimulation partitioning on very large directed acyclic graphs

I/O-Efficient Data Structures for Colored Range and Prefix Reporting

iBGP and Constrained Connectivity

Identifying almost sorted permutations from TCP buffer dynamics

Implementation and complexity of the watershed-from-markers algorithm computed as a minimal cost forest

Implementation of exponential and parametrized algorithms in the AGAPE project

Implementing regularization implicitly via approximate eigenvector computation

Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis

Improved Algorithm for Degree Bounded Survivable Network Design Problem

Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction

Improved Algorithms for Approximate String Matching (Extended Abstract)

Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning

Improved Approximability Result for Test Set with Small Redundancy