- Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346 - Giovanni Conforti, Damiano Macedonio, Vladimiro Sassone:
Spatial Logics for Bigraphs. ICALP 2005: 766-778 - Giovanni Di Crescenzo, Aggelos Kiayias:
Asynchronous Perfectly Secure Communication over One-Time Pads. ICALP 2005: 216-227 - Giovanni Di Crescenzo, Ivan Visconti:
Concurrent Zero Knowledge in the Public-Key Model. ICALP 2005: 816-827 - Eugen Czeizler, Jarkko Kari:
A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata. ICALP 2005: 410-420 - Anupam Datta, Ante Derek, John C. Mitchell, Vitaly Shmatikov, Mathieu Turuani:
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic. ICALP 2005: 16-29 - Giorgio Delzanno, Maurizio Gabbrielli:
Compositional Verification of Asynchronous Processes via Constraint Solving. ICALP 2005: 1239-1250 - Scott Diehl, Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. ICALP 2005: 982-993 - Martin Dietzfelbinger, Christoph Weidling:
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. ICALP 2005: 166-178 - Nedialko B. Dimitrov, C. Greg Plaxton:
Optimal Cover Time for a Graph-Based Coupon Collector Process. ICALP 2005: 702-716 - Debora Donato, Stefano Leonardi, Panayiotis Tsaparas:
Stability and Similarity of Link Analysis Ranking Algorithms. ICALP 2005: 717-729 - Manfred Droste, Paul Gastin:
Weighted Automata and Weighted Logics. ICALP 2005: 513-525 - Charilaos Efthymiou, Paul G. Spirakis:
On the Existence of Hamiltonian Cycles in Random Intersection Graphs. ICALP 2005: 690-701 - Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella:
New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162 - Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters:
Approximation Algorithms for Euclidean Group TSP. ICALP 2005: 1115-1126 - Isaac Elias, Jens Lagergren:
Fast Neighbor Joining. ICALP 2005: 1263-1274 - Matthias Englert, Matthias Westermann:
Reordering Buffer Management for Non-uniform Cost Models. ICALP 2005: 627-638 - Leah Epstein, Meital Levy:
Online Interval Coloring and Variants. ICALP 2005: 602-613 - Kousha Etessami, Mihalis Yannakakis:
Recursive Markov Decision Processes and Recursive Stochastic Games. ICALP 2005: 891-903 - Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur:
Optimal Spaced Seeds for Faster Approximate String Matching. ICALP 2005: 1251-1262 - Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372 - Marc Fischlin:
Completely Non-malleable Schemes. ICALP 2005: 779-790 - Wan J. Fokkink, Sumit Nain:
A Finite Basis for Failure Semantics. ICALP 2005: 755-765 - Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203 - Jeff Ford, Anna Gál:
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. ICALP 2005: 1163-1175 - Gianni Franceschini, Roberto Grossi:
Optimal In-place Sorting of Vectors and Records. ICALP 2005: 90-102 - Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann:
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP 2005: 51-65 - Martin Gairing, Burkhard Monien, Andreas Woclaw:
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. ICALP 2005: 828-839 - David Galindo:
Boneh-Franklin Identity Based Encryption Revisited. ICALP 2005: 791-802 - Craig Gentry, Zulfikar Ramzan:
Single-Database Private Information Retrieval with Constant Communication Rate. ICALP 2005: 803-815