1 option
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1872.
- Lecture Notes in Computer Science, 0302-9743 ; 1872
- Language:
- English
- Subjects (All):
- Data structures (Computer science).
- Programming languages (Electronic computers).
- Computers.
- Computer graphics.
- Computer networks.
- Data Structures and Information Theory.
- Programming Languages, Compilers, Interpreters.
- Theory of Computation.
- Data Structures.
- Computer Graphics.
- Computer Communication Networks.
- Local Subjects:
- Data Structures and Information Theory.
- Programming Languages, Compilers, Interpreters.
- Theory of Computation.
- Data Structures.
- Computer Graphics.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (XVI, 636 pages).
- Edition:
- First edition 2000.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
- System Details:
- text file PDF
- Summary:
- In 1996 the International Federation for Information Processing (IFIP) establ- hed its rst Technical Committee on foundations of computer science, TC1. The aim of IFIP TC1 is to support the development of theoretical computer science as a fundamental science and to promote the exploration of fundamental c- cepts, models, theories, and formal systems in order to understand laws, limits, and possibilities of information processing. This volume constitutes the proceedings of the rst IFIP International C- ference on Theoretical Computer Science (IFIP TCS 2000) { Exploring New Frontiers of Theoretical Informatics { organized by IFIP TC1, held at Tohoku University, Sendai, Japan in August 2000. The IFIP TCS 2000 technical program consists of invited talks, contributed talks, and a panel discussion. In conjunction with this program there are two special open lectures by Professors Jan van Leeuwen and Peter D. Mosses. The decision to hold this conference was made by IFIP TC1 in August 1998, and since then IFIP TCS 2000 has bene ted from the e orts of many people; in particular, the TC1 members and the members of the Steering Committee, the Program Committee, and the Organizing Committee of the conference. Our special thanks go to the Program Committee Co-chairs: Track (1): Jan van Leeuwen (U. Utrecht), Osamu Watanabe (Tokyo Inst. Tech.) Track (2): Masami Hagiya (U. Tokyo), Peter D. Mosses (U. Aarhus).
- Contents:
- Breaking and fixing the Needham-Schroeder public-key protocol using FDR
- Reconciling Two Views of Cryptography
- Theory and Construction of Molecular Computers
- On the hardness of the permanent
- List Decoding: Algorithms and Applications
- Approximation Algorithms for String Folding Problems
- Fast multi-dimensional approximate string matching
- An Index for Two Dimensional String Matching Allowing Rotations
- Parallel Edge Coloring of a Tree on a Mesh Connected Computer
- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
- Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs
- It Is on the Boundary: Complexity Considerations for Polynomial Ideals
- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks
- Reducibility among combinatorial problems
- Task Distributions on Multiprocessor Systems
- Fast Interpolation Using Kohonen Self-Organizing Neural Networks
- Steganography Using Modern Arts
- Gossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs
- Trade-Offs between Density and Robustness in Random Interconnection Graphs
- An effcient way for edge-connectivity augmentation
- The (? + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph
- On the Approximability of NP-complete Optimization Problems
- On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem
- How Many People Can Hide in a Terrain ?
- Maximum Clique and Minimum Clique Partition in Visibility Graphs
- Language recognition and the synchronization of cellular automata
- Real-Time Language Recognition by Alternating Cellular Automata
- Inducing an order on cellular automata by a grouping operation
- Damage Spreading and ?-Sensitivity on Cellular Automata
- Financial Applications of Monte Carlo and Quasi-Monte Carlo Methods
- Discrepancy Theory and Its Application to Finance
- Fully consistent extensions of partially defined Boolean functions with missing bits
- Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv
- Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key
- Characterization of Optimal Key Set Protocols
- Algebraic Complexity Theory
- On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
- On Logarithmic Simulated Annealing
- Specification and verification of concurrent programs in CESAR
- Hierarchical State Machines
- Validating firewalls in mobile ambients
- Ambient Groups and Mobility Types
- Multiway synchronization verified with coupled simulation
- An Asynchronous, Distributed Implementation of Mobile Ambients
- Graph types for monadic mobile processes
- Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness
- Aliasing Models for Mobile Objects
- Local ?-Calculus at Work: Mobile Objects as Mobile Processes
- Typed concurrent objects
- An Interpretation of Typed Concurrent Objects in the Blue Calculus
- Inductive definitions in the system coq. rules and properties
- A Higher-Order Specification of the ?-Calculus
- Compositionality through an operational semantics of contexts
- Open Ended Systems, Dynamic Bisimulation and Tile Logic
- Observe behaviour categorically
- Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems
- The Equivalence Problem for Deterministic Pushdown Automata is Decidable
- On the Complexity of Bisimulation Problems for Pushdown Automata
- Session 2.4
- A Type-Theoretic Study on Partial Continuations
- Partially Typed Terms between Church-Style and Curry-Style
- Alternating Automata and Logics over Infinite Words
- Hypothesis Support for Information Integration in Four-Valued Logics
- Invited Talk 2.2
- Masaccio: A Formal Model for Embedded Components
- Session 2.5
- A Single Complete Refinement Rule for Demonic Specifications
- Reasoning about Composition Using Property Transformers and Their Conjugates
- Invited Talk 2.3
- Some New Directions in the Syntax and Semantics of Formal Languages
- Panel Discussion on New Challanges for TCS
- New Challenges for Theoretical Computer Science
- Algorithm Design Challenges
- Quantumization of Theoretical Informatics
- Two Problems in Wide Area Network Programming
- New Challenges for Computational Models
- Towards a Computational Theory of Everything
- Open Lectures
- On the Power of Interactive Computing
- The Varieties of Programming Language Semantics.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-44929-4
- 9783540449294
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.