Mathematical Foundations of Computer Science 2006 (Record no. 95499)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 06546nam a22005895i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-540-37793-1 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240730195146.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 101221s2006 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783540377931 |
| -- | 978-3-540-37793-1 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/11821069 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA75.5-76.95 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM014000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Mathematical Foundations of Computer Science 2006 |
| Medium | [electronic resource] : |
| Remainder of title | 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings / |
| Statement of responsibility, etc. | edited by Rastislav Královic, Pawel Urzyczyn. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2006. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Place of production, publication, distribution, manufacture | Berlin, Heidelberg : |
| Name of producer, publisher, distributor, manufacturer | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2006. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XVI, 816 p. |
| Other physical details | online resource. |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Content type code | txt |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | computer |
| Media type code | c |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Carrier type code | cr |
| Source | rdacarrier |
| 347 ## - DIGITAL FILE CHARACTERISTICS | |
| File type | text file |
| Encoding format | |
| Source | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Theoretical Computer Science and General Issues, |
| International Standard Serial Number | 2512-2029 ; |
| Volume/sequential designation | 4162 |
| 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 -- CharacterizingValiant'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 or geographic name entry element | Computer science. |
| 9 (RLIN) | 9832 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Algorithms. |
| 9 (RLIN) | 3390 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computer science |
| General subdivision | Mathematics. |
| 9 (RLIN) | 3866 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Discrete mathematics. |
| 9 (RLIN) | 12873 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Artificial intelligence |
| General subdivision | Data processing. |
| 9 (RLIN) | 21787 |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Theory of Computation. |
| 9 (RLIN) | 159315 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Algorithms. |
| 9 (RLIN) | 3390 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Discrete Mathematics in Computer Science. |
| 9 (RLIN) | 31837 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Data Science. |
| 9 (RLIN) | 34092 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computer Science Logic and Foundations of Programming. |
| 9 (RLIN) | 42203 |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Královic, Rastislav. |
| Relator term | editor. |
| Relationship | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 9 (RLIN) | 159316 |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Urzyczyn, Pawel. |
| Relator term | editor. |
| Relationship | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 9 (RLIN) | 159317 |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 9 (RLIN) | 159318 |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Printed edition: |
| International Standard Book Number | 9783540377917 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Printed edition: |
| International Standard Book Number | 9783540828198 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Theoretical Computer Science and General Issues, |
| International Standard Serial Number | 2512-2029 ; |
| Volume/sequential designation | 4162 |
| 9 (RLIN) | 159319 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/11821069">https://doi.org/10.1007/11821069</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-Lecture Notes in CS |
No items available.