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