
Theoretical Computer Science - Proceedings Of The 6th Italian Conference
World Scientific Publishing Co Pte Ltd
Will be published approx. on 20. October 1998
Book
Hardback
396 pages
978-981-02-3655-7 (ISBN)
Description
The Italian Conference on Theoretical Computer Science (ICTCS '98) is the annual conference of the Italian Chapter of the European Association for Theoretical Computer Science. The Conference aims at enabling computer scientists, especially young researchers to enter the community and to exchange theoretical ideas and results, as well as theoretical based practical experiences and tools in computer science.This volume contains 32 papers selected out of 50 submissions. The main topics include computability, automata, formal languages, term rewriting, analysis and design of algorithms, computational geometry, computational complexity, symbolic and algebraic computation, cryptography and security, data types and data structures, semantics of programming languages, program specification and verification, foundations of logic programming, parallel and distributed computation, and theory of concurrency.The volume provides an up-to-date view of the status of several relevant topics in theoretical computer science and suggests directions for future research. It constitutes a valuable working tool for researchers and graduate students.
More details
Language
English
Place of publication
Singapore
Singapore
Target group
College/higher education
Professional and scholarly
ISBN-13
978-981-02-3655-7 (9789810236557)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Editor
Iami Cnr Sezione Di Firenze, Italy
Univ Di Pisa, Italy
Univ Di Salerno, Italy
Content
Bohm's Theorem for Bohm's trees, M. Dezani-Ciancaglini et al; concrete syntax for intuitionistic light affine logic with polymorphic type assignment, L. Roversi; tight bounds on broadcasting with dynamic faults, G. De Marco and A.A. Rescigno; maintaining dynamic graph properties deterministically, M. Marzolla; a symbolic semantics for abstract model checking, F. Levi; ambient decor, L. Cardelli and A.D. Gordon; implementing tile systems - some examples from process calculi, R. Bruni et al; Q-ary searching with lies, F. Cicalese; quantum NP is hard for PH, S. Fenner et al; analysis of normal logic programs, F. Fages and R. Gori; factorizing codes and Krasner factorizations, C. De Felice and R. Zizza. (Part contents)