Abstract is missing.
- The tPI (tRNA Pairing Index), a Mathematical Measure of Repetition in a (Biological) SequenceGaston H. Gonnet. 1-2
- Stability of Approximation in Discrete OptimizationJuraj Hromkovic. 3-18
- Towards a Broader Theory of Mobile ProcessesRobin Milner. 19
- A Decidable Analysis of Security ProtocolsMichaël Rusinowitch. 21
- Looking Inside AES and BESIlia Toli, Alberto Zanoni. 23-36
- Remove Key Escrow from The Identity-Based Encryption SystemZhaohui Cheng, Richard Comley, Luminita Vasiu. 37-50
- A Randomised Algorithm for Checking the Normality of Cryptographic Boolean FunctionsAn Braeken, Christopher Wolf, Bart Preneel. 51-66
- Reversible Circuit Realizations of Boolean FunctionsAlex Brodsky. 67-80
- Resource Bounded Immunity and SimplicityToshio Suzuki, Tomoyuki Yamakami. 81-96
- Degree Bounds on Polynomials and Relativization TheoryHolger Spakowski, Rahul Tripathi. 97-110
- The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CAHubert Schmid, Thomas Worsch. 111-124
- A Matrix q-Analogue of the Parikh MapÖmer Egecioglu, Oscar H. Ibarra. 125-138
- The Inherent Queuing Delay of Parallel Packet SwitchesHagit Attiya, David Hay. 139-152
- Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path TreePaola Flocchini, Antonio Mesa Enriques, Linda Pagli, Giuseppe Prencipe, Nicola Santoro. 153-166
- Truthful Mechanisms for Generalized Utilitarian ProblemsGiovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer. 167-180
- The Driving PhilosophersSébastien Baehni, Roberto Baldoni, Rachid Guerraoui, Bastian Pochon. 181-194
- Engineering an External Memory Minimum Spanning Tree AlgorithmRoman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn. 195-208
- Scheduling with Release Times and Deadlines on a Minimum Number of MachinesMark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer. 209-222
- Approximation Algorithms for Mixed Fractional Packing and Covering ProblemsKlaus Jansen. 223-236
- On Weighted Rectangle Packing with Large ResourcesAleksei V. Fishkin, Olga Gerber, Klaus Jansen. 237-250
- An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree NetworksSatoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige. 251-264
- Efficient Algorithms for Handling Molecular Weighted SequencesCostas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis. 265-278
- Imperfectness of Data for STS-Based Physical MappingHiro Ito, Kazuo Iwama, Takeyuki Tamura. 279-292
- Solving Packing Problem with Weaker Block SolversHu Zhang. 293-306
- Adaptive Sorting with AVL TreesAmr Elmasry. 307-316
- Precise Analysis of p-Calculus in Cubic TimeLivio Colussi, Gilberto Filé, A. Griggio. 317-332
- Prototyping Proof Carrying CodeMartin Wildmoser, Tobias Nipkow, Gerwin Klein, Sebastian Nanz. 333-348
- Contract Oriented Development of Component SoftwareZhiming Liu, Jifeng He, Xiaoshan Li. 349-366
- New Insights on Architectural ConnectorsRoberto Bruni, José Luiz Fiadeiro, Ivan Lanese, Antónia Lopes, Ugo Montanari. 367-380
- On Complexity of Model-Checking for the TQL LogicIovka Boneva, Jean-Marc Talbot. 381-394
- A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State AutomataAntonín Kucera, Richard Mayr. 395-408
- Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary StructuresOlivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. 409-422
- A Calculus with Lazy Module OperatorsDavide Ancona, Sonia Fagorzi, Elena Zucca. 423-436
- Dynamic Typing with Dependent TypesXinming Ou, Gang Tan, Yitzhak Mandelbaum, David Walker. 437-450
- Subtyping-Inheritance Conflicts: The Mobile Mixin CaseLorenzo Bettini, Viviana Bono, Betti Venneri. 451-464
- Asymptotic Behaviors of Type-2 Algorithms and Induced Baire TopologiesChung-Chih Li. 465-478
- Effective Chemistry for Synchrony and AsynchronyDeepak Garg, Akash Lal, Sanjiva Prasad. 479-492
- Controller Synthesis for Probabilistic SystemsChristel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski. 493-506
- Highly Undecidable Questions for Process AlgebrasPetr Jancar, Jirí Srba. 507-520
- New-HOPLA: A Higher-order Process Language with Name GenerationGlynn Winskel, Francesco Zappa Nardelli. 521-534
- Behavioural Equivalences for Dynamic Web DataSergio Maffeis, Philippa Gardner. 535-548
- Behavioural Theory for Mobile AmbientsMassimo Merro, Francesco Zappa Nardelli. 549-562
- Nested Commits for Mobile Calculi: Extending JoinRoberto Bruni, Hernán C. Melgratti, Ugo Montanari. 563-576
- Dynamic and Local Typing for Mobile AmbientsMario Coppo, Mariangiola Dezani-Ciancaglini, Elio Giovannetti, Rosario Pugliese. 577-590
- Recovering Resources in the p-calculusDavid Teller. 605-618
- Ensuring Termination by TypabilityYuxin Deng, Davide Sangiorgi. 619-632
- The Simply-typed Pure Pattern Type System Ensures Strong NormalizationBenjamin Wack. 633-646
- Termination in Modal Kleene AlgebraJules Desharnais, Bernhard Möller, Georg Struth. 647-660
- Regular Tree Language Recognition with Static InformationAlain Frisch. 661-674
- PolyA: True Type Polymorphism for Mobile AmbientsTorben Amtoft, Henning Makholm, J. B. Wells. 591604