default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th ICTCS 2007: Rome, Italy
- Giuseppe F. Italiano, Eugenio Moggi, Luigi Laura:
Theoretical Computer Science, 10th Italian Conference, ICTCS 2007, Rome, Italy, October 3-5, 2007, Proceedings. World Scientific 2007, ISBN 981-277-098-4
Invited Talks
- Giorgio Ausiello:
Clairvoyance and Laziness for on Line Travelling Agents. ICTCS 2007: 3 - Henk Barendregt:
Proving the Range Property for Lambda Theories and Models. ICTCS 2007: 4 - Chantal Berline:
Can a Proper Lambda-Model have an R.E. Equational Theory? ICTCS 2007: 5 - Rocco De Nicola:
Session Centered Calculi for Service Oriented Computing. ICTCS 2007: 6-10 - Giuseppe Longo:
Symmetries in Foundations. ICTCS 2007: 11
Regular Contributions
- Mathias Hauptmann:
On the Approximability of Dense Steiner Tree Problems. ICTCS 2007: 15-26 - Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Weak pattern matching in colored graphs: Minimizing the number of connected components. ICTCS 2007: 27-38 - Marco Bernardo, Alessandro Aldini:
Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate Actions. ICTCS 2007: 39-56 - Damiano Zanardini:
Analyzing Non-Interference with respect to Classes. ICTCS 2007: 57-69 - Igor Razgon:
Computing Minimum Directed Feedback Vertex Set in O(1.9977n). ICTCS 2007: 70-81 - Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia:
Seeing the Trees and Their Branches in the Forest is Hard. ICTCS 2007: 82-93 - Liliana D'Errico, Michele Loreti:
Modeling Fuzzy Behaviours in Concurrent Systems. ICTCS 2007: 94-105 - Davide Ancona, Elena Zucca:
A formal framework for compositional compilation. ICTCS 2007: 106-117 - Davide Ancona, Giovanni Lagorio, Elena Zucca:
Type inference for polymorphic methods in Java-like languages. ICTCS 2007: 118-129 - Travis Gagie:
Sorting streamed multisets. ICTCS 2007: 130-138 - Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
The random generation of derangements. ICTCS 2007: 139-150 - Mathias Hauptmann:
The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes. ICTCS 2007: 151-162 - Sven Kosub, Christopher M. Homan:
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. ICTCS 2007: 163-174 - Christian Choffrut, Achille Frigeri:
Definable sets in weak Presburger arithmetic. ICTCS 2007: 175-186 - Giovanni Di Crescenzo, Ivan Visconti:
On Defining Proofs of Knowledge in the Bare Public Key Model. ICTCS 2007: 187-198
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-01 15:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
