Mathematical Foundations of Computer Science 2008: 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$101.58
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 98%)
Other sellers (Paperback)
  • All (10) from $1.99   
  • New (6) from $1.99   
  • Used (4) from $1.99   

Overview

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.

Read More Show Less

Product Details

Table of 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 Shastic 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.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)