11. ICTCS 2009: Cremona, Italy
Alessandra Cherubini, Mario Coppo, Giuseppe Persiano (Eds.): Theoretical Computer Science, 11th Italian Conference, ICTCS 2009, Cremona, Italy, September 28-30, 2009, Proceedings. 2009
Invited Papers
- Aldo de Luca: A palindromization map in free monoids. 3
- Roberto Gorrieri: On Petri Net semantics for Process Calculi. 3
- Fabrizio Luccio: Two algorithms issues from a teacher's perspective. 4
Contributions
- Mario Alviano: The Maze Generation Problem is NP-complete. 12-18
- Davide Ancona, Giovanni Lagorio: An idealized coinductive type system for imperative object-oriented programs. 19-25
- Giorgio Ausiello, Donatella Firmani, Luigi Laura: Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components. 26-29
- Ezio Bartocci, Flavio Corradini, Maria Rita Di Berardini, Emanuela Merelli, Luca Tesei: A Shape Calculus for Biological Processes. 30-33
- Livio Bioglio: Typed Reductions of CLS. 38-45
- Carlo Blundo, Vincenzo Iovino, Giuseppe Persiano: Private-Key Hidden Vector Encryption with Key Privacy. 46-50
- Biogio Bonasera, Francesco Pagano, Alessandro Provetti: Flexible Interpolated-Binary Search over Sorted Sets. 51-54
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi: A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters. 55-58
- Vasco Brattka, Guido Gherardi: A method to evaluate the computational complexity of the theorems from functional analysis. 59-61
- Tiziana Calamoneri: The L(2, 1)-Labeling Problem on Oriented Regular Grids. 62-65
- Saverio Caminiti, Irene Finocchi, Rossella Petreschi: Informative Labeling Schemes for the Least Common Ancestor Problem. 66-70
- Giuseppa Castiglione, Antonio Restivo, Marinella Sciortino: Hopcroft's Algorithm and Tree-like Automata. 75-81
- Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters: The compositional construction of Markov processes. 91-98
- Mariangiola Dezani-Ciancaglini, Paola Giannini, Elena Zucca: The essence of static and dynamic bindings. 99-106
- Cinzia Di Giusto, Jorge A. Pérez: Move vs Copy: Towards a Formal Comparison of Ambients and Higher-Order Process Calculi. 107-112
- Diodato Ferraioli, Carmine Ventre: On the Price of Anarchy of Restricted Job Scheduling Games. 113-116
- Achille Frigeri: Automata and Logic on p-adic numbers. 117-120
- Carlo A. Furia, Paola Spoletini: Towards Relaxing Metric Information in Linear Temporal Logic. 121-124
- Emanuele G. Fusco: Broadcasting in UDG Radio Networks with Missing and Inaccurate Information. 125-128
- Zbynek Krivka, Tomás Masopust: A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. 129-135
- Giovanni Lagorio, Marco Servetto, Elena Zucca: Customizable composition operators for Java-like classes. 136-142
- Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt: On the Expressiveness of Polyadicity in Higher-Order Process Calculi. 143-149
- Violetta Lonati, Matteo Pradella: Deterministic recognizability of picture languages by Wang automata. 150-154
- Yanfang Ma, Min Zhang, Yixiang Chen: Infinite Evolution Mechanism of Probabilistic Processes. 155-161
- Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Logical Description of Structured and XML Languages. 162-168
- Donatella Merlini, Renzo Sprugnoli: An algorithm for proving identities with Riordan transformations. 169-174
- Eugenio Moggi: Monad Transformers as Monoid Transformers. 175-178
- Carlo Nocentini: When theory meets practice: improving a Peer-To-Peer framework by means of a real DHT algorithm. 179-182
- Elena V. Pribavkina, Emanuele Rodaro: State Complexity For Prefix, Suffix and Bifix operators on regular languages. 183-189
- Marco Servetto: Strong exception-safety for Java-like languages. 196-198
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team