Abstract is missing.
- Semantic Subtyping: Challenges, Perspectives, and Open ProblemsGiuseppe Castagna. 1-20 [doi]
- Biological Systems as Reactive SystemsLuca Cardelli. 21 [doi]
- Mobile Agents Computing: Security Issues and Algorithmic SolutionsNicola Santoro. 22 [doi]
- Efficient Algorithms for Detecting Regular Point ConfigurationsLuzi Anderegg, Mark Cieliebak, Giuseppe Prencipe. 23-35 [doi]
- Pickup and Delivery for Moving Objects on Broken LinesYuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa. 36-50 [doi]
- A Static Analysis of PKI-Based SystemsBenjamin Aziz, David Gray, Geoff W. Hamilton. 51-65 [doi]
- Subtyping Object and Recursive Types LogicallySteffen van Bakel, Ugo de Liguoro. 66-80 [doi]
- The Language chi: Circuits, Computations and Classical LogicSteffen van Bakel, Stéphane Lengrand, Pierre Lescanne. 81-96 [doi]
- Checking Risky Events Is Enough for Local PoliciesMassimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari. 97-112 [doi]
- The Graph Rewriting Calculus: Confluence and ExpressivenessClara Bertolissi. 113-127 [doi]
- Safe Object Composition in the Presence of SubtypingLorenzo Bettini, Viviana Bono, Silvia Likavec. 128-142 [doi]
- Reachability Analysis in Boxed AmbientsNadia Busi, Gianluigi Zavattaro. 143-159 [doi]
- Error Mining for Regular Expression PatternsGiuseppe Castagna, Dario Colazzo, Alain Frisch. 160-172 [doi]
- Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal ProjectionsMarie-Christine Costa, Fethi Jarray, Christophe Picouleau. 173-181 [doi]
- Inapproximability Results for the Lateral Gene Transfer ProblemBhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani. 182-195 [doi]
- Faster Deterministic Wakeup in Multiple Access ChannelsGianluca De Marco, Marco Pellegrini, Giovanni Sburlati. 196-204 [doi]
- Weighted Coloring: Further Complexity and Approximability ResultsBruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos. 205-214 [doi]
- Quantum Algorithms for a Set of Group Theoretic ProblemsStephen A. Fenner, Yong Zhang. 215-227 [doi]
- On the Computational Complexity of the ::::L::::::(2, 1)::-Labeling Problem for Regular GraphsJirí Fiala, Jan Kratochvíl. 228-236 [doi]
- A Polymerase Based Algorithm for SATGiuditta Franco. 237-250 [doi]
- Laxity Helps in Broadcast SchedulingStanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon. 251-264 [doi]
- Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity TheoryLane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena. 265-279 [doi]
- Synthesis from Temporal Specifications Using Preferred Answer Set ProgrammingStijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir. 280-294 [doi]
- Model Checking Strategic Abilities of Agents Under Incomplete InformationWojciech Jamroga, Jürgen Dix. 295-308 [doi]
- Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive ErrorTsvi Kopelowitz, Ely Porat. 309-322 [doi]
- A Theoretical Analysis of Alignment and Edit Problems for TreesTetsuji Kuboyama, Kilho Shin, Tetsuhiro Miyahara, Hiroshi Yasuda. 323-337 [doi]
- A Complete Formulation of Generalized Affine EquivalenceMarco Macchetti, Mario Caironi, Luca Breveglieri, Alessandra Cherubini. 338-347 [doi]
- A New Combinatorial Approach to Sequence ComparisonSabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino. 348-359 [doi]
- A Typed Assembly Language for Non-interferenceRicardo Medel, Adriana B. Compagnoni, Eduardo Bonelli. 360-374 [doi]
- Improved Exact Exponential Algorithms for Vertex Bipartization and Other ProblemsVenkatesh Raman, Saket Saurabh, Somnath Sikdar. 375-389 [doi]
- A Typed Semantics of Higher-Order Store and SubtypingJan Schwinghammer. 390-405 [doi]
- Two Variables Are Not EnoughRichard Statman. 406-409 [doi]