4. SAGA 2007: Zurich, Switzerland

Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer (Eds.): Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings. Lecture Notes in Computer Science 4665 Springer 2007, ISBN 978-3-540-74870-0

Invited Papers

Harry Buhrman:
On Computation and Communication with Small Bias. 1
Martin Dietzfelbinger:
Design Strategies for Minimal Perfect Hash Functions. 2-17
Rusins Freivalds:
Hamming, Permutations and Automata. 18-29
Spyros C. Kontogiannis, Paul G. Spirakis:
Probabilistic Techniques in Algorithmic Game Theory. 30-53
Aravind Srinivasan:
Randomized Algorithms and Probabilistic Analysis in Wireless Networking. 54-57

Heiner Ackermann:
A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games. 58-69
Artur Czumaj, Xin Wang:
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks. 70-81
Thomas Erlebach, Alexander Hall, Matús Mihalák:
Approximate Discovery of Random Graphs. 82-92
Walter J. Gutjahr, Stefan Katzensteiner, Peter Reiter:
A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis. 93-104
David Jao, S. Ramesh Raju, Ramarathnam Venkatesan:
Digit Set Randomization in Elliptic Curve Cryptography. 105-117
Jens Jägersküpper:
Lower Bounds for Hit-and-Run Direct Search. 118-129
Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. 130-141
Mustafa Karakoç, Adnan Kavak:
Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks. 142-153
Spyros C. Kontogiannis, Paul G. Spirakis:
On the Support Size of Stable Strategies in Random Games. 154-165

Last update Fri May 24 19:46:37 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page