Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4--6, 2001. Proceedings (Q5947958)

From MaRDI portal





scientific article; zbMATH DE number 1666889
Language Label Description Also known as
English
Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4--6, 2001. Proceedings
scientific article; zbMATH DE number 1666889

    Statements

    Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4--6, 2001. Proceedings (English)
    0 references
    24 October 2001
    0 references
    The articles of mathematical interest will be reviewed individually. The preceding conference (6th, 1998) has been reviewed (see Zbl 0943.68057). Indexed articles: \textit{Ferrari, GianLuigi; Montanari, Ugo; Tuosto, Emilio}, A LTS semantics of ambients via graph synchronization with mobility, 1-16 [Zbl 1042.68615] \textit{Alessi, Fabio; Dezani-Ciancaglini, Mariangiola; Honsell, Furio}, Filter models and easy terms, 17-37 [Zbl 1042.03014] \textit{Ghilezan, Silvia; Kuncak, Viktor}, Confluence of untyped lambda calculus via simple types, 38-49 [Zbl 1042.03016] \textit{Coppo, Mario; Hirschkoff, Daniel}, Incremental inference of partial types, 50-73 [Zbl 1042.68029] \textit{Paolini, Luca}, Call-by-value separability and computability, 74-89 [Zbl 1042.68030] \textit{Hromkovic, Juraj; Steinhöfel, Kathleen; Widmayer, Peter}, Job shop scheduling with unit length tasks: bounds and algorithms, 90-106 [Zbl 1042.90020] \textit{Jansen, Klaus; Mastrolilli, Monaldo; Solis-Oba, Roberto}, Job shop scheduling problems with controllable processing times, 107-122 [Zbl 1042.90021] \textit{Mereghetti, Carlo; Palano, Beatrice}, Upper bounds on the size of one-way quantum finite automata, 123-135 [Zbl 1042.68066] \textit{Besozzi, Daniela; Zandron, Claudio; Mauri, Giancarlo; Sabadini, Nicoletta}, P systems with gemmation of mobile membranes, 136-153 [Zbl 1042.68044] \textit{Prencipe, Giuseppe}, Instantaneous actions vs. full asynchronicity : Controlling and coordinating a set of autonomous mobile robots, 154-171 [Zbl 1042.68677] \textit{Cherubini, Alessandra; Crespi Reghizzi, Stefano; San Pietro, Pierluigi}, Some structural properties of associative language descriptions, 172-183 [Zbl 1042.68608] \textit{Giammarresi, Dora; Montalbano, Rosa; Wood, Derick}, Block-deterministic regular languages, 184-196 [Zbl 1042.68062] \textit{Anselmo, Marcella}, Constructing finite maximal codes from Schützenberger conjecture, 197-214 [Zbl 1042.68058] \textit{Ancona, Davide; Anderson, Christopher; Damiani, Ferruccio; Drossopoulou, Sophia; Giannini, Paola; Zucca, Elena}, An effective translation of \({\mathcal F}\)ickle into Java, 215-234 [Zbl 1042.68534] \textit{Bugliesi, Michele; Castagna, Giuseppe; Crafa, Silvia}, Subtyping and matching for mobile objects, 235-255 [Zbl 1042.68537] \textit{Cacciagrano, Diletta; Corradini, Flavio}, On synchronous and asynchronous communication paradigms, 256-268 [Zbl 1042.68614] \textit{Jacobsen, Lars; Larsen, Kim S.}, Complexity of layered binary search trees with relaxed balance, 269-284 [Zbl 1042.68546] \textit{Fiala, Jiří; Kratochvíl, Jan; Proskurowski, Andrzej}, Distance constrained labeling of precolored trees, 285-292 [Zbl 1042.68545] \textit{Jacobsen, Lars; Larsen, Kim S.}, Exponentially decreasing number of operations in balanced trees, 293-311 [Zbl 1042.68547] \textit{Ausiello, Giorgio; Franciosa, Paolo G.; Frigioni, Daniele}, Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach, 312-327 [Zbl 1042.68084] \textit{Kaporis, Alexis C.; Kirousis, Lefteris M.; Stamatiou, Yannis C.; Vamvakari, Malvina; Zito, Michele}, Coupon collectors, \(q\)-binomial coefficients and the unsatisfiability threshold, 328-338 [Zbl 1042.68606] \textit{Große, André; Rothe, Jörg; Wechsung, Gerd}, Relating partial and complete solutions and the complexity of computing smallest solutions, 339-356 [Zbl 1042.68605] \textit{D'Arco, Paolo}, On the distribution of a key distribution center, 357-369 [Zbl 1042.68565] \textit{Cimato, Stelvio; De Bonis, Annalisa}, Online advertising: Secure e-coupons, 370-383 [Zbl 1042.68564] \textit{Olivetti, Nicola; Schwind, Camilla B.}, A calculus and complexity bound for minimal conditional logic, 384-404 [Zbl 1042.03023] \textit{Baldoni, Matteo; Giordano, Laura; Martelli, Alberto; Patti, Viviana}, Reasoning about complex actions with incomplete knowledge: A modal approach, 405-425 [Zbl 1042.68027] \textit{Viola, Emanuele}, E-unifiability via narrowing, 426-438 [Zbl 1042.68101]
    0 references
    Torino (Italy)
    0 references
    Proceedings
    0 references
    Conference
    0 references
    ICTCS 2001
    0 references
    Theoretical computer science
    0 references

    Identifiers