Mathematical Foundations of Computer Science 2006 (Record no. 33719)

000 -LEADER
fixed length control field 06258nam a22005655i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540377931
-- 978-3-540-37793-1
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
245 10 - TITLE STATEMENT
Title Mathematical Foundations of Computer Science 2006
Sub Title 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006. Proceedings /
Statement of responsibility, etc edited by Rastislav Královič, Paweł Urzyczyn.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 2006.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XVI, 816 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Talks -- A Core Calculus for Scala Type Checking -- Tree Exploration with an Oracle -- Distributed Data Structures: A Survey on Informative Labeling Schemes -- From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions -- The Structure of Tractable Constraint Satisfaction Problems -- On the Representation of Kleene Algebras with Tests -- From Three Ideas in TCS to Three Applications in Bioinformatics -- Contributed Papers -- Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles -- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces -- A Unified Construction of the Glushkov, Follow, and Antimirov Automata -- Algebraic Characterizations of Unitary Linear Quantum Cellular Automata -- A Polynomial Time Nilpotence Test for Galois Groups and Related Results -- The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems -- Crochemore Factorization of Sturmian and Other Infinite Words -- Equations on Partial Words -- Concrete Multiplicative Complexity of Symmetric Functions -- On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures -- Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities -- The Kleene Equality for Graphs -- On the Repetition Threshold for Large Alphabets -- Improved Parameterized Upper Bounds for Vertex Cover -- On Comparing Sums of Square Roots of Small Integers -- A Combinatorial Approach to Collapsing Words -- Optimal Linear Arrangement of Interval Graphs -- The Lempel-Ziv Complexity of Fixed Points of Morphisms -- Partially Commutative Inverse Monoids -- Learning Bayesian Networks Does Not Have to Be NP-Hard -- Lower Bounds for the Transition Complexity of NFAs -- Smart Robot Teams Exploring Sparse Trees -- k-Sets of Convex Inclusion Chains of Planar Point Sets -- Toward the Eigenvalue Power Law -- Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves -- Very Sparse Leaf Languages -- On the Correlation Between Parity and Modular Polynomials -- Optimally Fast Data Gathering in Sensor Networks -- Magic Numbers in the State Hierarchy of Finite Automata -- Online Single Machine Batch Scheduling -- Machines that Can Output Empty Words -- Completeness of Global Evaluation Logic -- NOF-Multiparty Information Complexity Bounds for Pointer Jumping -- Dimension Characterizations of Complexity Classes -- Approximation Algorithms and Hardness Results for Labeled Connectivity Problems -- An Expressive Temporal Logic for Real Time -- On Matroid Representability and Minor Problems -- Non-cooperative Tree Creation -- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners -- Reductions for Monotone Boolean Circuits -- Generalised Integer Programming Based on Logically Defined Relations -- Probabilistic Length-Reducing Automata -- Sorting Long Sequences in a Single Hop Radio Network -- Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture -- Valiant’s Model: From Exponential Sums to Exponential Products -- A Reachability Algorithm for General Petri Nets Based on Transition Invariants -- Approximability of Bounded Occurrence Max Ones -- Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability -- Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes -- Quantum Weakly Nondeterministic Communication Complexity -- Minimal Chordal Sense of Direction and Circulant Graphs -- Querying and Embedding Compressed Texts -- Lempel-Ziv Dimension for Lempel-Ziv Compression -- Characterizing Valiant’s Algebraic Complexity Classes -- The Price of Defense -- The Data Complexity of MDatalog in Basic Modal Logics -- The Complexity of Counting Functions with Easy Decision Version -- On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model -- Constrained Minimum Enclosing Circle with Center on a Query Line Segment -- Hierarchical Unambiguity -- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the ?erny Conjecture -- On Genome Evolution with Innovation.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logic design.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithms.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computation by Abstract Devices.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Data Structures.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logics and Meanings of Programs.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithms.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Královič, Rastislav.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Urzyczyn, Paweł.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/11821069
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2006.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK4425 http://dx.doi.org/10.1007/11821069 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha