Abstract is missing.
- On Petri Net semantics for Process CalculiRoberto Gorrieri. 3
- A palindromization map in free monoidsAldo de Luca. 3
- Two algorithms issues from a teacher's perspectiveFabrizio Luccio. 4
- Deciding Spatial and behavioral properties in the pi-calculusLucia Acciai, Michele Boreale. 7-11
- The Maze Generation Problem is NP-completeMario Alviano. 12-18
- An idealized coinductive type system for imperative object-oriented programsDavide Ancona, Giovanni Lagorio. 19-25
- Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected ComponentsGiorgio Ausiello, Donatella Firmani, Luigi Laura. 26-29
- A Shape Calculus for Biological ProcessesEzio Bartocci, Flavio Corradini, Maria Rita Di Berardini, Emanuela Merelli, Luca Tesei. 30-33
- A Logic for ContractsMassimo Bartoletti, Roberto Zunino. 34-37
- Typed Reductions of CLSLivio Bioglio. 38-45
- Private-Key Hidden Vector Encryption with Key PrivacyCarlo Blundo, Vincenzo Iovino, Giuseppe Persiano. 46-50
- Flexible Interpolated-Binary Search over Sorted SetsBiogio Bonasera, Francesco Pagano, Alessandro Provetti. 51-54
- A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of ClustersPaola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi. 55-58
- A method to evaluate the computational complexity of the theorems from functional analysisVasco Brattka, Guido Gherardi. 59-61
- The L(2, 1)-Labeling Problem on Oriented Regular GridsTiziana Calamoneri. 62-65
- Informative Labeling Schemes for the Least Common Ancestor ProblemSaverio Caminiti, Irene Finocchi, Rossella Petreschi. 66-70
- Synchronizing Automata and Independent Systems of WordsArturo Carpi, Flavio D'Alessandro. 71-74
- Hopcroft's Algorithm and Tree-like AutomataGiuseppa Castiglione, Antonio Restivo, Marinella Sciortino. 75-81
- Languages defined by consensual computationsStefano Crespi-Reghizzi, Pierluigi San Pietro. 82-85
- Quantum Annealing: an IntroductionDiego de Falco, Enrico Pertoso, Dario Tamascelli. 86-90
- The compositional construction of Markov processesLuisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters. 91-98
- The essence of static and dynamic bindingsMariangiola Dezani-Ciancaglini, Paola Giannini, Elena Zucca. 99-106
- Move vs Copy: Towards a Formal Comparison of Ambients and Higher-Order Process CalculiCinzia Di Giusto, Jorge A. Pérez. 107-112
- On the Price of Anarchy of Restricted Job Scheduling GamesDiodato Ferraioli, Carmine Ventre. 113-116
- Automata and Logic on p-adic numbersAchille Frigeri. 117-120
- Towards Relaxing Metric Information in Linear Temporal LogicCarlo A. Furia, Paola Spoletini. 121-124
- Broadcasting in UDG Radio Networks with Missing and Inaccurate InformationEmanuele G. Fusco. 125-128
- A Note on the Cooperation in Rewriting Systems with Context-Dependency CheckingZbynek Krivka, Tomás Masopust. 129-135
- Customizable composition operators for Java-like classesGiovanni Lagorio, Marco Servetto, Elena Zucca. 136-142
- On the Expressiveness of Polyadicity in Higher-Order Process CalculiIvan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt. 143-149
- Deterministic recognizability of picture languages by Wang automataVioletta Lonati, Matteo Pradella. 150-154
- Infinite Evolution Mechanism of Probabilistic ProcessesYanfang Ma, Min Zhang, Yixiang Chen. 155-161
- Logical Description of Structured and XML LanguagesAndreas Malcher, Carlo Mereghetti, Beatrice Palano. 162-168
- An algorithm for proving identities with Riordan transformationsDonatella Merlini, Renzo Sprugnoli. 169-174
- Monad Transformers as Monoid TransformersEugenio Moggi. 175-178
- When theory meets practice: improving a Peer-To-Peer framework by means of a real DHT algorithmCarlo Nocentini. 179-182
- State Complexity For Prefix, Suffix and Bifix operators on regular languagesElena V. Pribavkina, Emanuele Rodaro. 183-189
- On Balancing of a Direct ProductAntonio Restivo, Giovanna Rosone. 190-195
- Strong exception-safety for Java-like languagesMarco Servetto. 196-198