Theoretical Computer Science

8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings

Carlo Blundo, Cosimo Laneve (Herausgeber)

Buch | Softcover

XII, 400 Seiten

2003 | 2003
Springer Berlin (Verlag)
978-3-540-20216-5 (ISBN)

Artikel merken

The Eighth Italian Conference on Theoretical Computer Science (ICTCS 2003) was held at the University Residential Center of Bertinoro, Italy, on October 13 15 2003. The center is composed of three large historical and monumental buildings not far from one another, forming a united complex on the top of the built up area of the ancient town of Bertinoro. Previous conferences took place in Pisa (1972), Mantova (1974 and 1989), L Aquila (1992), Ravello (1995), Prato (1998), and Torino (2001). The conference aims at bringing together computer scientists, expecially youngresearchers,tofostercooperationandexchangeideasandresults.Itsmain topicsinclude:analysisanddesignofalgorithms,datatypesanddatastructures, theory of logical design and layout, computability, complexity, automata, s- bolic and algebraic computation, security, cryptography, speci?cation and ve- ?cation, formal languages, foundations of functional programming, foundations of logic programming, term-rewriting, semantics, type theory, new computing paradigms, parallel and distributed computation, theory of concurrency, theory of databases, theory of knowledge bases, theory of robotics. The program committee, consisting of 14 members, considered 65 papers and selected 27 for presentation. These papers were selected on the basis of origin- ity, quality, and relevance to theoretical computer science. These proceedings include the revised versions of the 27 accepted papers and the invited talks by Marios Mavronicolas (Extreme Nash Equilibria), Martin Hofmann (Certi?cation of Memory Usage), and G erard Boudol (On Programming Models for Mobility).

Invited Talks.- Extreme Nash Equilibria.- Certification of Memory Usage.- On Programming Models for Mobility.- Program Design, Models and Analysis.- On the Computational Complexity of Cut-Elimination in Linear Logic.- A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics.- Finite Horizon Analysis of Stochastic Systems with the Mur? Verifier.- Towards Compact and Tractable Automaton-Based Representations of Time Granularities.- Lower Bounds on the Size of Quantum Automata Accepting Unary Languages.- Refined Effects for Unanticipated Object Re-classification: .- Algorithms and Complexity.- Cost Constrained Fixed Job Scheduling.- A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set.- An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality.- Channel Assignment in Honeycomb Networks.- Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks.- The Complexity of Checking Consistency of Pedigree Information and Related Problems.- On Clausal Equivalence and Hull Inclusion.- Semantics and Formal Languages.- Logical Semantics for the First Order ?-Calculus.- On the Expressive Power of Light Affine Logic.- Reasoning about Self and Others: Communicating Agents in a Modal Action Logic.- Decidability Properties of Recursive Types.- Algebraic Theories for Contextual Pre-nets.- A Coalgebraic Description of Web Interactions.- A Calculus for Dynamic Linking.- Towards a Smart Compilation Manager for Java.- Security and Cryptography.- Anonymous Group Communication in Mobile Networks.- Aspects of Pseudorandomness in Nonlinear Generators of Binary Sequences.- AnInformation-Theoretic Approach to the Access Control Problem.- Security-Aware Program Transformations.- Information Flow Security and Recursive Systems.- Compositional Verification of Secure Streamed Data: A Case Study with EMSS.

Erscheint lt. Verlag	29.9.2003
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	XII, 400 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	581 g
Themenwelt	Mathematik / Informatik ► Informatik ► Datenbanken
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Schlagworte	Algorithm analysis and problem complexity • Algorithmics • algorithms • Automata • Automata Theory • Complexity • Complexity theory • Computer Science • data structures • Discrete Mathematics • formal language • formal methods • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Java • Logic • Mathematical Foundations • Mathematical Logic • Programming Theory • Program Semantics • theoretical computer science • Theoretical Informatics • theory of computing • verification
ISBN-10	3-540-20216-1 / 3540202161
ISBN-13	978-3-540-20216-5 / 9783540202165
Zustand	Neuware