Description:
Invited Papers -- On Computation and Communication with Small Bias -- Design Strategies for Minimal Perfect Hash Functions -- Hamming, Permutations and Automata -- Probabilistic Techniques in Algorithmic Game Theory -- Randomized Algorithms and Probabilistic Analysis in Wireless Networking -- Contributed Papers -- A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games -- Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks -- Approximate Discovery of Random Graphs -- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis -- Digit Set Randomization in Elliptic Curve Cryptography -- Lower Bounds for Hit-and-Run Direct Search -- An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata -- Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks -- On the Support Size of Stable Strategies in Random Games.