Theoretical Computer Science
The Table of Contents for the full book PDF is as follows:
Invited Lectures
Derandomizing approximation algorithms for hard counting problems
Enriched categories as models of computation
Multilayer perceptrons and learning
Parallel Algorithms
A novel deterministic sampling scheme with applications to broadcast-efficient sorting on the reconfigurable mesh
Parallel maximum matching and threshold graphs
A time- and cost-optimal algorithm for channel routing
A parallel algorithm for orthogonal grid drawings of cubic graphs
λ-Calculus
Syntactical properties of an extention of Girard’s System F where types can be taken as “generic” inputs
Λ! considered both as a paradigmatic language and as a meta-language
On completability of partial combinatory algebras
Algorithms
Broadcast encryption schemes with disenrollment capability
Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem
Recognition of path graphs in linear time
Optimal adaptive search: reliable and unreliable models
An efficient algorithm for optimal linear broadcast routing with capacity constraints
An improved scheme for the set intersection problem
Concurrency
Interleaving based partial ordering semantics
Compositionality for processes with durational actions
A process calculus with asynchronous communications
A causal semantics for contextual P/T nets
Temporal and Modal Logic
Set–theoretic decidability results for modal theorem proving
A sound and complete axiom system for the logic ACTL
Automata and Formal Languages
Verifying identical communicating processes is undecidable
Expansive cellular automata and chaos
On guaranteed recursively defined processes: separability and test equivalence
Implementation and Transltion of Processes
An investigation on the optimal implementation of processes
A program transformations methodology for CCS
Verification of Concurrent Systems
Reasoning about value–passing calculi in HOL
Towards a semantic–based verification environment for the π-calculus
Extended Markovian process algebra: a case study
Complexity
Transforming comparison model lower bounds to the parallel–random–access–machine
Approximability of GROUND STATE problem on tridimensional Ising spin glasses
On the algebraic complexity of certain integer linear programming problems
Logic Programming and Non-Monotonic Reasoning
Formalizing causal reasoning in law with an action-based language: a preliminary report
Constraint logic programming with dynamic scheduling: a semantics based on closure operators
Minimal models in propositional logics: approximation results
Author Index
