Exploring New Frontiers of Theoretical Informatics IFIP 18th World Computer Congress TC1 3rd International Conference on Theoretical Computer Science (TCS2004) 22–27 August 2004 Toulouse, France

In recent years, IT application scenarios have evolved in very innovative ways. Highly distributed networks have now become a common platform for large-scale distributed programming, high bandwidth communications are inexpensive and widespread, and most of our work tools are equipped with processors enabling us to perform a multitude of tasks. In addition, mobile computing (referring specifically to wireless devices and, more broadly, to dynamically configured systems) has made it possible to exploit interaction in novel ways. To harness the flexibility and power of these rapidly evolving, interactive systems, there is need of radically new foundational ideas and principles; there is need to develop the theoretical foundations required to design these systems and to cope with the many complex issues involved in their construction; and there is need to develop effective principles for building and analyzing such systems.

Reflecting the diverse and wide spectrum of topics and interests within the theoretical computer science community, Exploring New Frontiers of Theoretical Informatics, is presented in two distinct but interrelated tracks:

-Algorithms, Complexity and Models of Computation,
-Logic, Semantics, Specification and Verification.

Exploring New Frontiers of Theoretical Informatics contains 46 original and significant contributions addressing these foundational questions, as well as 4 papers by outstanding invited speakers. These papers were presented at the 3^rd IFIP International Conference on Theoretical Computer Science (TCS 2004), which was held in conjunction with the 18^th World Computer Congress in Toulouse, France in August 2004 and sponsored by the International Federation for Information Processing (IFIP).

Invited talks.- The tPI (tRNA Pairing Index) a Mathematical Measure of Repetition in a (Biological) Sequence.- Stability of Approximation in Discrete Optimization.- Towards a Broader Theory of Mobile Processes.- A Decidable Analysis of Security Protocols.- Track (1) on Algorithms, Complexity, and Models of Computation.- Looking Inside A?s and B?s.- Remove key Escrow from the Identity-Based Encryption System.- A Randomised Algorithm for Checking The Normality of Cryptographic Boolean Functions.- Reversible Circuit Realizations of Boolean Functions.- Resource Bounded Immunity and Simplicity.- Degree Bounds on Polynomials and Relativization Theory.- The Firing Squad Synchronization Problem with Many Generals for One-Dimensional CA.- A Matrix Q-Analogue of the Parikh Map.- The Inherent Queuing Delay of Parallel Packet Switches.- Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree.- Truthful Mechanisms for Generalized Utilitarian Problems.- The Driving Philosophers.- Engineering an External Memory Minimum Spanning Tree Algorithm.- Scheduling With Release Times and Deadlines on A Minimum Number of Machines.- Approximation Algorithms for Mixed Fractional Packing and Covering Problems.- On Weighted Rectangle Packing with Large Resources.- An O(n log2 n) Algorithm for a Sink Location Problem in Dynamic Tree Networks.- Efficient Algorithms for Handling Molecular Weighted Sequences.- Imperfectness of Data for STS-Based Physical Mapping.- Solving Packing Problem with Weaker Block Solvers.- Adaptive Sorting with AVL Trees.- Precise Analysis of ?-calculus in Cubic Time.- Track (2) on Logic, Semantics, Specification, and Verification.- Prototyping Proof Carrying Code.- Contract Oriented Development of Component Software.- New Insights on ArchitecturalConnectors.- On Complexity of Model-Checking for the TQL Logic.- A Generic Framework for Checking Semantic Equivalences Between Pushdown Automata and Finite-State Automata.- Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures.- A Calculus with Lazy Module Operators.- Dynamic Typing with Dependent Types.- Subtyping-Inheritance Conflicts: The Mobile Mixin Case.- Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies.- Effective Chemistry for Synchrony and Asynchrony.- Controller Synthesis for Probabilistic Systems (Extended Abstract).- Highly Undecidable Questions for Process Algebras.- New-HOPLA a higher-order process language with name generation.- Behavioural Equivalences for Dynamic Web Data.- Behavioural Theory for Mobile Ambients.- Nested Commits For Mobile Calculi: Extending Join.- Dynamic and Local Typing for Mobile Ambients.- Polya:True Type Polymorphism for Mobile Ambients.- Recovering Resources in the ?-Calculus (DRAFT).- Ensuring Termination by Typability.- The Simply-Typed Pure Pattern Type System Ensures Strong Normalization.- Termination in Modal Kleene Algebra.- Regular Tree Language Recognition with Static Information.