Abstract is missing.
- Power of Quantum EntanglementJozef Gruska, Hiroshi Imai, Keiji Matsumoto. 3-22
- Information Networks, Link Analysis, and Temporal DynamicsJon M. Kleinberg. 23-25
- Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk GraphsJochen Alber, Jirí Fiala. 26-37
- Bin-Packing with Fragile ObjectsNikhil Bansal, Zhen Liu, Arvind Sankar. 38-46
- Lower and Upper Bounds for Tracking Mobile UsersSergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. 47-58
- On the Enumerability of the Determinant and the RankAlina Beygelzimer, Mitsunori Ogihara. 59-70
- On the Symmetric Range Assignment Problem in Wireless Ad Hoc NetworksDouglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi. 71-82
- Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig, Stephan Waack, Philipp Woelfel. 83-94
- Computability of Linear EquationsVasco Brattka, Martin Ziegler. 95-106
- Hierarchy Among Automata on Linear OrderingsVéronique Bruyère, Olivier Carton. 107-118
- Symmetric Connectivity with Minimum Power Consumption in Radio NetworksGruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky. 119-130
- A Modified Recursive Triangular Factorization for Cauchy-like SystemsZhao Chen. 131-142
- Algorithmic Complexity of Protein Identification: Searching in Weighted StringsMark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl. 143-156
- An Efficient Parallel Pointer Machine Algorithm for the NCA ProblemAlessandro Dal Palù, Enrico Pontelli, Desh Ranjan. 157-168
- Randomized Dining Philosophers without Fairness AssumptionMarie Duflot, Laurent Fribourg, Claudine Picaronny. 169-180
- Guarding Galleries and TerrainsAlon Efrat, Sariel Har-Peled. 181-192
- Gossiping with Unit Messages in Known Radio NetworksLeszek Gasieniec, Igor Potapov. 193-205
- Memoryless Search Algorithms in a Network with Faulty AdviceNicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc. 206-216
- Lower Bounds and the Hardness of Counting PropertiesLane A. Hemaspaandra, Mayur Thakur. 217-229
- Framework for Analyzing Garbage CollectionMatthew Hertz, Neil Immerman, J. Eliot B. Moss. 230-242
- One-Way Permutations and Self-Witnessing LanguagesChristopher M. Homan, Mayur Thakur. 243-254
- Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential FunctionKlaus Jansen, Hu Zhang. 255-266
- On Randomness and InfinityGrégory Lafitte. 267-279
- Server Placements, Roman Domination and other Dominating Set VariantsAris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer. 280-291
- A Linear Time Algorithm for Finding Tree 3-Spanner on 2-TreesB. S. Panda, Sajal K. Das. 292-309
- Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young ElectionsJörg Rothe, Holger Spakowski, Jörg Vogel. 310-322
- Quantum NP and Quantum HierarchyTomoyuki Yamakami. 323-336
- Probabilistically Checkable Proofs the Easy WayMarius Zimand. 337-351
- XML Web Services: The Global Computer?Andrew D. Gordon. 355
- Micro Mobile ProgramsCarl A. Gunter. 356-369
- Checking Polynomial Time Complexity with TypesPatrick Baillot. 370-382
- Boundary Inference for Enforcing Security Policies in Mobile AmbientsChiara Braghin, Agostino Cortesi, Riccardo Focardi, Steffen van Bakel. 383-395
- Decidability and Tractability of Problems in Object-Based Graph GrammarsAline Brum Loreto, Leila Ribeiro, Laira Vieira Toscani. 396-408
- Coverage of Implementations by Simulating SpecificationsHana Chockler, Orna Kupferman. 409-421
- TQL Algebra and its ImplementationGiovanni Conforti, Orlando Ferrara, Giorgio Ghelli. 422-434
- Model Checking Birth and DeathDino Distefano, Arend Rensink, Joost-Pieter Katoen. 435-447
- Phantom Types and SubtypingMatthew Fluet, Riccardo Pucella. 448-460
- On the Weakest Failure Detector for Non-Blocking Atomic CommitRachid Guerraoui, Petr Kouznetsov. 461-473
- Combining Computational Effects: commutativity & sumMartin Hyland, Gordon D. Plotkin, John Power. 474-484
- Optimal-Reachability and Control for Acyclic Weighted Timed AutomataSalvatore La Torre, Supratik Mukhopadhyay, Aniello Murano. 485-497
- Substructural Verification and Computational FeasibilityDaniel Leivant. 498-510
- An Improved System of Intersection Types for Explicit SubstitutionsDaniel J. Dougherty, Stéphane Lengrand, Pierre Lescanne. 511-523
- About Compositional Analysis of Pi-Calculus ProcessesFabio Martinelli. 524-536
- A Randomized Distributed Encoding of the Pi-Calculus with Mixed ChoiceCatuscia Palamidessi, Oltea Mihaela Herescu. 537-549
- On Reduction Semantics for the Push and Pull Ambitent CalculusIain Phillips, Maria Grazia Vigliotti. 550-562
- Safe Dynamic Binding in the Join CalculusAlan Schmitt. 563-575
- Vectorial Languages and Linear Temporal LogicOlivier Serre. 576-587
- A Bound on Attacks on Authentication ProtocolsScott D. Stoller. 588-600
- Responsive BisimulationXiaogang Zhang, John Potter. 601-612