Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006 [electronic resource] :IFIP 19th Worm Computer Congress, TC-1, Foundations of Computer Science, August 23–24, 2006, Santiago, Chile / edited by Gonzalo Navarro, Leopoldo Bertossi, Yoshiharu Kohayakawa.
by Navarro, Gonzalo [editor.]; Bertossi, Leopoldo [editor.]; Kohayakawa, Yoshiharu [editor.]; SpringerLink (Online service).
Material type:
Item type | Current location | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
MAIN LIBRARY | QA75.5-76.95 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
Electromagnetic and Optical Pulse Propagation 1 | LB1028.43-1028.75 Education for the 21st Century — Impact of ICT and Digital Resources | QA75.5-76.95 Biologically Inspired Cooperative Computing | QA75.5-76.95 Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006 | TK5105.5-5105.9 Mobile and Wireless Communication Networks | TK5105.5-5105.9 Ad-Hoc Networking | Q334-342 Artificial Intelligence in Theory and Practice |
Invited Talks -- Locality of Queries and Transformations -- From Informatics to Quantum Informatics -- RDF as a Data Model -- Adversarial Queueing Theory Revisited -- Distributed Algorithms for Autonomous Mobile Robots -- Recursion and Probability -- Invited Papers -- From Informatics to Quantum Informatics -- Distributed Algorithms for Autonomous Mobile Robots -- Contributed Papers -- The Unsplittable Stable Marriage Problem -- Variations on an Ordering Theme with Constraints -- BuST-Bundled Suffix Trees -- An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture -- An Algorithm to Reduce the Communication Traffic for Multi-Word Searches in a Distributed Hash Table -- Exploring an Unknown Graph to Locate a Black Hole Using Tokens -- Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity -- Asynchonous Distributed Components: Concurrency and Determinacy -- Decidable Properties for Regular Cellular Automata -- Symbolic Determinisation of Extended Automata -- Regular Hedge Model Checking -- Completing Categorical Algebras -- Reusing Optimal TSP Solutions for Locally Modified Input Instances -- Spectral Partitioning of Random Graphs with Given Expected Degrees -- A Connectivity Rating for Vertices in Networks -- On PTAS for Planar Graph Problems.
International Federation for Information Processing The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of referred international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing. For more information about the 300 other books in the IFIP series, please visit www.springer.com. For more information about IFIP, please visit www.ifip.org.
There are no comments for this item.