Abstract is missing.
- On Computation and Communication with Small BiasHarry Buhrman. 1 [doi]
- Design Strategies for Minimal Perfect Hash FunctionsMartin Dietzfelbinger. 2-17 [doi]
- Hamming, Permutations and AutomataRusins Freivalds. 18-29 [doi]
- Probabilistic Techniques in Algorithmic Game TheorySpyros C. Kontogiannis, Paul G. Spirakis. 30-53 [doi]
- Randomized Algorithms and Probabilistic Analysis in Wireless NetworkingAravind Srinivasan. 54-57 [doi]
- A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion GamesHeiner Ackermann. 58-69 [doi]
- Communication Problems in Random Line-of-Sight Ad-Hoc Radio NetworksArtur Czumaj, Xin Wang. 70-81 [doi]
- Approximate Discovery of Random GraphsThomas Erlebach, Alexander Hall, Matús Mihalák. 82-92 [doi]
- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio AnalysisWalter J. Gutjahr, Stefan Katzensteiner, Peter Reiter. 93-104 [doi]
- Digit Set Randomization in Elliptic Curve CryptographyDavid Jao, S. Ramesh Raju, Ramarathnam Venkatesan. 105-117 [doi]
- Lower Bounds for Hit-and-Run Direct SearchJens Jägersküpper. 118-129 [doi]
- An Exponential Gap Between LasVegas and Deterministic Sweeping Finite AutomataChristos A. Kapoutsis, Richard Královic, Tobias Mömke. 130-141 [doi]
- Stochastic Methods for Dynamic OVSF Code Assignment in 3G NetworksMustafa Karakoç, Adnan Kavak. 142-153 [doi]
- On the Support Size of Stable Strategies in Random GamesSpyros C. Kontogiannis, Paul G. Spirakis. 154-165 [doi]