Coverart for item
The Resource Mathematical Foundations of Computer Science 2008 : 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, edited by Edward Ochmanski, Jerzy Tyszkiewicz, (electronic resource)

Mathematical Foundations of Computer Science 2008 : 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, edited by Edward Ochmanski, Jerzy Tyszkiewicz, (electronic resource)

Label
Mathematical Foundations of Computer Science 2008 : 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings
Title
Mathematical Foundations of Computer Science 2008
Title remainder
33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings
Statement of responsibility
edited by Edward Ochmanski, Jerzy Tyszkiewicz
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Summary
This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008. The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification
Member of
Is Subseries of
http://bibfra.me/vocab/relation/corporateauthor
nJehnSWVXzk
Dewey number
005.11
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • XTWkyzp2Uj4
  • MOSpO9KEglc
Image bit depth
0
Language note
English
LC call number
QA76.6-76.66
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2008
http://bibfra.me/vocab/lite/meetingName
Symposium on Mathematical Foundations of Computer Science (1972- )
Nature of contents
dictionaries
http://bibfra.me/vocab/lite/organizationName
Symposium on Mathematical Foundations of Computer Science (1972- )
http://library.link/vocab/relatedWorkOrContributorName
  • Ochmanski, Edward.
  • Tyszkiewicz, Jerzy.
Series statement
Theoretical Computer Science and General Issues
Series volume
5162
http://library.link/vocab/subjectName
  • Computer programming
  • Computers
  • Numerical analysis
  • Algorithms
  • Computer science—Mathematics
  • Programming Techniques
  • Theory of Computation
  • Numerical Analysis
  • Algorithm Analysis and Problem Complexity
  • Computation by Abstract Devices
  • Discrete Mathematics in Computer Science
Label
Mathematical Foundations of Computer Science 2008 : 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, edited by Edward Ochmanski, Jerzy Tyszkiewicz, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
Invited Papers -- One Useful Logic That Defines Its Own Truth -- On Synchronous and Asynchronous Interaction in Distributed Systems -- A Robust Class of Regular Languages -- Deterministic Models of Communication Faults -- Algebraic Graph Algorithms -- Contributed Papers -- Question/Answer Games on Towers and Pyramids -- The Maximum Independent Set Problem in Planar Graphs -- When Ignorance Helps: Graphical Multicast Cost Sharing Games -- Shortest Synchronizing Strings for Huffman Codes -- Optimizing Conjunctive Queries over Trees Using Schema Information -- Clustering with Partial Information -- Reoptimization of the Metric Deadline TSP -- On the Shortest Linear Straight-Line Program for Computing Linear Forms -- Flip Algorithm for Segment Triangulations -- Computing Sharp 2-Factors in Claw-Free Graphs -- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem -- Positional Strategies for Higher-Order Pushdown Parity Games -- Arthur and Merlin as Oracles -- A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems -- Regional Languages and Tiling: A Unifying Approach to Picture Grammars -- On a Special Class of Primitive Words -- Complexity of Data Tree Patterns over XML Documents -- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs -- Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems -- Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control -- Reversal-Bounded Counter Machines Revisited -- Iterative Compression and Exact Algorithms -- Complexity and Limiting Ratio of Boolean Functions over Implication -- Succinctness of Regular Expressions with Interleaving, Intersection and Counting -- Nilpotency and Limit Sets of Cellular Automata -- A Note on k-Colorability of P 5-Free Graphs -- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations -- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs -- Periodicity and Immortality in Reversible Computing -- Step-Out Ring Signatures -- The Height of Factorization Forests -- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae -- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise -- From ?-Calculus to Universal Algebra and Back -- A Complete Axiomatic System for a Process-Based Spatial Logic -- Voronoi Games on Cycle Graphs -- Colouring Random Empire Trees -- A Random Oracle Does Not Help Extract the Mutual Information -- Approximating Independent Set and Coloring in Random Uniform Hypergraphs -- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach -- Directed Percolation Arising in Stochastic Cellular Automata Analysis -- Resolution Width and Cutting Plane Rank Are Incomparable -- On the Decidability of Bounded Valuedness for Transducers -- Monadic Second Order Logic on Graphs with Local Cardinality Constraints -- Short Proofs of Strong Normalization
Dimensions
unknown
Edition
1st ed. 2008.
Extent
1 online resource (XIV, 626 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540852384
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-540-85238-4
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000490781
  • (SSID)ssj0000318809
  • (PQKBManifestationID)11212552
  • (PQKBTitleCode)TC0000318809
  • (PQKBWorkID)10336574
  • (PQKB)10803069
  • (DE-He213)978-3-540-85238-4
  • (MiAaPQ)EBC3063256
  • (EXLCZ)991000000000490781
Label
Mathematical Foundations of Computer Science 2008 : 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, edited by Edward Ochmanski, Jerzy Tyszkiewicz, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
Invited Papers -- One Useful Logic That Defines Its Own Truth -- On Synchronous and Asynchronous Interaction in Distributed Systems -- A Robust Class of Regular Languages -- Deterministic Models of Communication Faults -- Algebraic Graph Algorithms -- Contributed Papers -- Question/Answer Games on Towers and Pyramids -- The Maximum Independent Set Problem in Planar Graphs -- When Ignorance Helps: Graphical Multicast Cost Sharing Games -- Shortest Synchronizing Strings for Huffman Codes -- Optimizing Conjunctive Queries over Trees Using Schema Information -- Clustering with Partial Information -- Reoptimization of the Metric Deadline TSP -- On the Shortest Linear Straight-Line Program for Computing Linear Forms -- Flip Algorithm for Segment Triangulations -- Computing Sharp 2-Factors in Claw-Free Graphs -- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem -- Positional Strategies for Higher-Order Pushdown Parity Games -- Arthur and Merlin as Oracles -- A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems -- Regional Languages and Tiling: A Unifying Approach to Picture Grammars -- On a Special Class of Primitive Words -- Complexity of Data Tree Patterns over XML Documents -- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs -- Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems -- Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control -- Reversal-Bounded Counter Machines Revisited -- Iterative Compression and Exact Algorithms -- Complexity and Limiting Ratio of Boolean Functions over Implication -- Succinctness of Regular Expressions with Interleaving, Intersection and Counting -- Nilpotency and Limit Sets of Cellular Automata -- A Note on k-Colorability of P 5-Free Graphs -- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations -- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs -- Periodicity and Immortality in Reversible Computing -- Step-Out Ring Signatures -- The Height of Factorization Forests -- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae -- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise -- From ?-Calculus to Universal Algebra and Back -- A Complete Axiomatic System for a Process-Based Spatial Logic -- Voronoi Games on Cycle Graphs -- Colouring Random Empire Trees -- A Random Oracle Does Not Help Extract the Mutual Information -- Approximating Independent Set and Coloring in Random Uniform Hypergraphs -- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach -- Directed Percolation Arising in Stochastic Cellular Automata Analysis -- Resolution Width and Cutting Plane Rank Are Incomparable -- On the Decidability of Bounded Valuedness for Transducers -- Monadic Second Order Logic on Graphs with Local Cardinality Constraints -- Short Proofs of Strong Normalization
Dimensions
unknown
Edition
1st ed. 2008.
Extent
1 online resource (XIV, 626 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540852384
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-540-85238-4
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000490781
  • (SSID)ssj0000318809
  • (PQKBManifestationID)11212552
  • (PQKBTitleCode)TC0000318809
  • (PQKBWorkID)10336574
  • (PQKB)10803069
  • (DE-He213)978-3-540-85238-4
  • (MiAaPQ)EBC3063256
  • (EXLCZ)991000000000490781

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...