Coverart for item
The Resource Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, edited by Ludek Kucera, Antonín Kucera, (electronic resource)

Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, edited by Ludek Kucera, Antonín Kucera, (electronic resource)

Label
Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings
Title
Mathematical Foundations of Computer Science 2007
Title remainder
32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings
Statement of responsibility
edited by Ludek Kucera, Antonín Kucera
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Member of
Is Subseries of
Dewey number
004.0151
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • jScDn5KXs70
  • fzWsWfkh_IM
Image bit depth
0
Language note
English
LC call number
  • QA75.5-76.95
  • QA76.63
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2007
http://bibfra.me/vocab/lite/meetingName
Symposium on Mathematical Foundations of Computer Science (1972- )
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • Kucera, Ludek.
  • Kucera, Antonín.
Series statement
Theoretical Computer Science and General Issues
Series volume
4708
http://library.link/vocab/subjectName
  • Computers
  • Algorithms
  • Computer science—Mathematics
  • Data structures (Computer science)
  • Computer logic
  • Theory of Computation
  • Algorithm Analysis and Problem Complexity
  • Computation by Abstract Devices
  • Discrete Mathematics in Computer Science
  • Data Structures
  • Logics and Meanings of Programs
Label
Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, edited by Ludek Kucera, Antonín Kucera, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
Invited Papers -- How To Be Fickle -- Finite Model Theory on Tame Classes of Structures -- Minimum Cycle Bases in Graphs Algorithms and Applications -- Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes -- Evolvability -- Random Graphs -- Expander Properties and the Cover Time of Random Intersection Graphs -- Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs -- Rewriting -- Transition Graphs of Rewriting Systems over Unranked Trees -- Rewriting Conjunctive Queries Determined by Views -- Approximation Algorithms -- Approximation Algorithms for the Maximum Internal Spanning Tree Problem -- New Approximability Results for 2-Dimensional Packing Problems -- On Approximation of Bookmark Assignments -- Automata and Circuits -- Height-Deterministic Pushdown Automata -- Minimizing Variants of Visibly Pushdown Automata -- Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids -- Complexity I -- Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete -- NP by Means of Lifts and Shadows -- The Complexity of Solitaire -- Streams and Compression -- Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems -- Space-Conscious Compression -- Graphs I -- Small Alliances in Graphs -- The Maximum Solution Problem on Graphs -- Iteration and Recursion -- What Are Iteration Theories? -- Properties Complementary to Program Self-reference -- Algorithms I -- Dobrushin Conditions for Systematic Scan with Block Dynamics -- On the Complexity of Computing Treelength -- On Time Lookahead Algorithms for the Online Data Acknowledgement Problem -- Automata -- Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods -- Towards a Rice Theorem on Traces of Cellular Automata -- Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority -- Complexity II -- Public Key Identification Based on the Equivalence of Quadratic Forms -- Reachability Problems in Quaternion Matrix and Rotation Semigroups -- VPSPACE and a Transfer Theorem over the Complex Field -- Protocols -- Efficient Provably-Secure Hierarchical Key Assignment Schemes -- Nearly Private Information Retrieval -- Graphs II -- Packing and Squeezing Subgraphs into Planar Graphs -- Dynamic Matchings in Convex Bipartite Graphs -- Networks -- Communication in Networks with Random Dependent Faults -- Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults -- Algorithms II -- A Linear Time Algorithm for the k Maximal Sums Problem -- A Lower Bound of 1?+?? for Truthful Scheduling Mechanisms -- Analysis of Maximal Repetitions in Strings -- Languages -- Series-Parallel Languages on Scattered and Countable Posets -- Traces of Term-Automatic Graphs -- State Complexity of Basic Operations on Suffix-Free Regular Languages -- Graphs III -- Exact Algorithms for L(2,1)-Labeling of Graphs -- On (k,?)-Leaf Powers -- Quantum Computing -- An Improved Claw Finding Algorithm Using Quantum Walk -- Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument -- Isomorphism -- On the Complexity of Game Isomorphism -- Hardness Results for Tournament Isomorphism and Automorphism -- Relating Complete and Partial Solution for Problems Similar to Graph Automorphism -- Equilibria -- Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach -- Selfish Load Balancing Under Partial Knowledge -- Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria -- Games -- Congestion Games with Player-Specific Constants -- Finding Patterns in Given Intervals -- The Power of Two Prices: Beyond Cross-Monotonicity -- Algebra and Strings -- Semisimple Algebras of Almost Minimal Rank over the Reals -- Structural Analysis of Gapped Motifs of a String -- Algorithms III -- Online and Offline Access to Short Lists -- Optimal Randomized Comparison Based Algorithms for Collision -- Randomized and Approximation Algorithms for Blue-Red Matching -- Words and Graphs -- Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation -- Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances -- Shuffle Expressions and Words with Nested Data
Dimensions
unknown
Edition
1st ed. 2007.
Extent
1 online resource (XVIII, 766 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540744566
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-540-74456-6
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000490780
  • (SSID)ssj0000318808
  • (PQKBManifestationID)11240019
  • (PQKBTitleCode)TC0000318808
  • (PQKBWorkID)10335941
  • (PQKB)10943664
  • (DE-He213)978-3-540-74456-6
  • (MiAaPQ)EBC3063300
  • (EXLCZ)991000000000490780
Label
Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, edited by Ludek Kucera, Antonín Kucera, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
Invited Papers -- How To Be Fickle -- Finite Model Theory on Tame Classes of Structures -- Minimum Cycle Bases in Graphs Algorithms and Applications -- Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes -- Evolvability -- Random Graphs -- Expander Properties and the Cover Time of Random Intersection Graphs -- Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs -- Rewriting -- Transition Graphs of Rewriting Systems over Unranked Trees -- Rewriting Conjunctive Queries Determined by Views -- Approximation Algorithms -- Approximation Algorithms for the Maximum Internal Spanning Tree Problem -- New Approximability Results for 2-Dimensional Packing Problems -- On Approximation of Bookmark Assignments -- Automata and Circuits -- Height-Deterministic Pushdown Automata -- Minimizing Variants of Visibly Pushdown Automata -- Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids -- Complexity I -- Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete -- NP by Means of Lifts and Shadows -- The Complexity of Solitaire -- Streams and Compression -- Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems -- Space-Conscious Compression -- Graphs I -- Small Alliances in Graphs -- The Maximum Solution Problem on Graphs -- Iteration and Recursion -- What Are Iteration Theories? -- Properties Complementary to Program Self-reference -- Algorithms I -- Dobrushin Conditions for Systematic Scan with Block Dynamics -- On the Complexity of Computing Treelength -- On Time Lookahead Algorithms for the Online Data Acknowledgement Problem -- Automata -- Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods -- Towards a Rice Theorem on Traces of Cellular Automata -- Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority -- Complexity II -- Public Key Identification Based on the Equivalence of Quadratic Forms -- Reachability Problems in Quaternion Matrix and Rotation Semigroups -- VPSPACE and a Transfer Theorem over the Complex Field -- Protocols -- Efficient Provably-Secure Hierarchical Key Assignment Schemes -- Nearly Private Information Retrieval -- Graphs II -- Packing and Squeezing Subgraphs into Planar Graphs -- Dynamic Matchings in Convex Bipartite Graphs -- Networks -- Communication in Networks with Random Dependent Faults -- Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults -- Algorithms II -- A Linear Time Algorithm for the k Maximal Sums Problem -- A Lower Bound of 1?+?? for Truthful Scheduling Mechanisms -- Analysis of Maximal Repetitions in Strings -- Languages -- Series-Parallel Languages on Scattered and Countable Posets -- Traces of Term-Automatic Graphs -- State Complexity of Basic Operations on Suffix-Free Regular Languages -- Graphs III -- Exact Algorithms for L(2,1)-Labeling of Graphs -- On (k,?)-Leaf Powers -- Quantum Computing -- An Improved Claw Finding Algorithm Using Quantum Walk -- Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument -- Isomorphism -- On the Complexity of Game Isomorphism -- Hardness Results for Tournament Isomorphism and Automorphism -- Relating Complete and Partial Solution for Problems Similar to Graph Automorphism -- Equilibria -- Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach -- Selfish Load Balancing Under Partial Knowledge -- Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria -- Games -- Congestion Games with Player-Specific Constants -- Finding Patterns in Given Intervals -- The Power of Two Prices: Beyond Cross-Monotonicity -- Algebra and Strings -- Semisimple Algebras of Almost Minimal Rank over the Reals -- Structural Analysis of Gapped Motifs of a String -- Algorithms III -- Online and Offline Access to Short Lists -- Optimal Randomized Comparison Based Algorithms for Collision -- Randomized and Approximation Algorithms for Blue-Red Matching -- Words and Graphs -- Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation -- Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances -- Shuffle Expressions and Words with Nested Data
Dimensions
unknown
Edition
1st ed. 2007.
Extent
1 online resource (XVIII, 766 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540744566
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-540-74456-6
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000490780
  • (SSID)ssj0000318808
  • (PQKBManifestationID)11240019
  • (PQKBTitleCode)TC0000318808
  • (PQKBWorkID)10335941
  • (PQKB)10943664
  • (DE-He213)978-3-540-74456-6
  • (MiAaPQ)EBC3063300
  • (EXLCZ)991000000000490780

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 ...