| Keynote Plenary Talk | p. 1 |
| Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) | p. 3 |
| Keynote Plenary Talk | p. 2 |
| Theory and Construction of Molecular Computers | p. 23 |
| Keynote Plenary Talk | p. 3 |
| List Decoding: Algorithms and Applications | p. 25 |
| Track (1) on Algorithms, Complexity and Models of Computation | |
| Session 1.1 | |
| Approximation Algorithms for String Folding Problems | p. 45 |
| An Index for Two Dimensional String Matching Allowing Rotations | p. 59 |
| Session 1.2 | |
| Parallel Edge Coloring of a Tree on a Mesh Connected Computer | p. 76 |
| Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs | p. 84 |
| Invited Talk 1.1 | |
| It Is on the Boundary: Complexity Considerations for Polynomial Ideals | p. 99 |
| Session 1.3 | |
| An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks | p. 100 |
| Task Distributions on Multiprocessor Systems | p. 112 |
| Fast Interpolation Using Kohonen Self-Organizing Neural Networks | p. 126 |
| Steganography Using Modern Arts (Extended Abstract) | p. 140 |
| Session 1.4 | |
| Trade-Offs between Density and Robustness in Random Interconnection Graphs | p. 152 |
| The ( + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph | p. 169 |
| On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Extended Abstract) | p. 186 |
| Maximum Clique and Minimum Clique Partition in Visibility Graphs | p. 200 |
| Session 1.5 | |
| Real-Time Language Recognition by Alternating Cellular Automata | p. 213 |
| Damage Spreading and -Sensitivity on Cellular Automata | p. 226 |
| Invited Talk 1.2 | |
| Discrepancy Theory and Its Application to Finance | p. 243 |
| Session 1.6 | |
| Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits | p. 257 |
| Characterization of Optimal Key Set Protocols (Extended Abstract) | p. 273 |
| On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model | p. 286 |
| On Logarithmic Simulated Annealing | p. 301 |
| Invited Talk 1.3 | |
| Hierarchical State Machines | p. 315 |
| Track (2) on Logic, Semantics, Sepecification, and Verification | |
| Session 2.1 | |
| Ambient Groups and Mobility Types | p. 333 |
| An Asynchronous, Distributed Implementation of Mobile Ambients | p. 348 |
| Invited Talk 2.1 | |
| Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness | p. 365 |
| Session 2.2 | |
| Local -Calculus at Work: Mobile Objects as Mobile Processes | p. 390 |
| An Interpretation of Typed Concurrent Objects in the Blue Calculus | p. 409 |
| Session 2.3 | |
| A Higher-Order Specification of the -Calculus | p. 425 |
| Open Ended Systems, Dynamic Bisimulation and Tile Logic | p. 440 |
| Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems (Extended Abstract) | p. 457 |
| On the Complexity of Bisimulation Problems for Pushdown Automata | p. 474 |
| Session 2.4 | |
| A Type-Theoretic Study on Partial Continuations | p. 489 |
| Partially Typed Terms between Church-Style and Curry-Style | p. 505 |
| Alternating Automata and Logics over Infinite Words (Extended Abstract) | p. 521 |
| Hypothesis Support for Information Integration in Four-Valued Logics | p. 536 |
| Invited Talk 2.2 | |
| Masaccio: A Formal Model for Embedded Components | p. 549 |
| Session 2.5 | |
| A Single Complete Refinement Rule for Demonic Specifications | p. 564 |
| Reasoning about Composition Using Property Transformers and Their Conjugates | p. 580 |
| Invited Talk 2.3 | |
| Some New Directions in the Syntax and Semantics of Formal Languages | p. 596 |
| Panel Discussion on New Challenges for TCS | |
| New Challenges for Theoretical Computer Science (General Introduction to the Panel) | p. 599 |
| Algorithm Design Challenges (Position Statement) | p. 602 |
| Quantumization of Theoretical Informatics (Position Statement) | p. 604 |
| Two Problems in Wide Area Network Programming (Position Statement) | p. 609 |
| New Challenges for Computational Models (Position Statement) | p. 612 |
| Towards a Computational Theory of Everything (Position Statement) | p. 614 |
| Open Lectures | |
| On the Power of Interactive Computing | p. 619 |
| The Varieties of Programming Language Semantics (Summary) | p. 624 |
| Author Index | p. 629 |
| Table of Contents provided by Publisher. All Rights Reserved. |