Home > Computing and Information Technology > Computer programming / software engineering > Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings(6281 Lecture Notes in Computer Science)
Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings(6281 Lecture Notes in Computer Science)

Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings(6281 Lecture Notes in Computer Science)

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

The series of MFCS symposia, organized in rotation by Poland, Slovakia, and the Czech Republic since 1972, has a long and well-established tradition. The symposiaencouragehigh-qualityresearchinallbranchesoftheoreticalcomputer science.Their broadscopeprovidesanopportunityto bring together researchers whodonotusuallymeetatspecialized conferences. The 35th International Symposium on Mathematical Foundations of C- puter Science (MFCS 2010) was organized in parallel with the 19th EACSL Annual Conference on Computer Science Logic (CSL 2010). The federated MFCS and CSL 2010 conference had shared plenary sessions and social events forallparticipants,butthescienti?cprogramandtheproceedingswereprepared independently for both events. Out of 149 regular submissions to MFCS 2010, the Program Committee - lected 56 papers for presentation at the conference and publication in this v- ume. Each paper was reviewed by at least three Program Committee members with the help of outside experts, and the actual selection was based on a sub- quent electronic discussion. In addition to the contributed papers, the scienti?c program of MFCS 2010 included ?ve MFCS and CSL plenary talks delivered by David Basin (ETH Z. . urich),HerbertEdelsbrunner (IST Austria andDuke University),ErichGrad .. el (RWTH Aachen), Bojan Mohar (University of Ljubljana and Simon Fraser U- versity),andJosephSifakis (CNRS), andthree invitedMFCS lecturesby Andris Ambainis (University of Latvia), Juraj Hromkovi?c(ETHZur .. ich), and Daniel Lokshtanov (Universitetet i Bergen). We are grateful to the invited speakers for accepting our invitation and sharing their knowledge and skills with all MFCS 2010 participants.

Table of Contents:
New Developments in Quantum Algorithms.- Persistent Homology under Non-uniform Error.- Information Complexity of Online Problems.- Algorithmic Lower Bounds for Problems on Decomposable Graphs.- Do We Really Understand the Crossing Numbers?.- Balanced Queries: Divide and Conquer.- Slowly Synchronizing Automata and Digraphs.- Weights of Exact Threshold Functions.- Proof Systems and Transformation Games.- Scheduling Real-Time Mixed-Criticality Jobs.- A dexptime-Complete Dolev-Yao Theory with Distributive Encryption.- On Problem Kernels for Possible Winner Determination under the k-Approval Protocol.- Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time.- Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree.- Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems.- Distance Constraint Satisfaction Problems.- Faster Algorithms on Branch and Clique Decompositions.- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks.- Robust Computations with Dynamical Systems.- On Factor Universality in Symbolic Spaces.- Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity.- Resource Combinatory Algebras.- Randomness for Free.- Qualitative Analysis of Partially-Observable Markov Decision Processes.- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model.- Online Clustering with Variable Sized Clusters.- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.- Counting Classes and the Fine Structure between NC 1 and L.- The Average Complexity of Moore’s State Minimization Algorithm Is O( n loglogn).- Connected Searching of Weighted Trees.- Iterated Regret Minimization inGame Graphs.- Properties of Visibly Pushdown Transducers.- Second-Order Algebraic Theories.- Frame Definability for Classes of Trees in the ?-calculus.- Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model.- Finding and Counting Vertex-Colored Subtrees.- Limiting Negations in Bounded Treewidth and Upward Planar Circuits.- On the Topological Complexity of MSO+U and Related Automata Models.- Least and Greatest Solutions of Equations over Sets of Integers.- Improved Simulation of Nondeterministic Turing Machines.- The Prize-Collecting Edge Dominating Set Problem in Trees.- The Multivariate Resultant Is NP-hard in Any Characteristic.- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems.- Meta-Envy-Free Cake-Cutting Protocols.- Two Variables and Two Successors.- Harnessing ML F with the Power of System F.- Describing Average- and Longtime-Behavior by Weighted MSO Logics.- Solving minones-2-sat as Fast as vertex cover.- Unambiguous Finite Automata over a Unary Alphabet.- The Complexity of Finding Reset Words in Finite Automata.- Does Treewidth Help in Modal Satisfiability?.- Asynchronous Omega-Regular Games with Partial Information.- Parity Games with Partial Information Played on Graphs of Bounded Complexity.- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets.- Enumeration of the Monomials of a Polynomial and Related Complexity Classes.- Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs.- Semi-linear Parikh Images of Regular Expressions via Reduction.- Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds.- Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences.- Counting Dependent and IndependentStrings.- Impossibility of Independence Amplification in Kolmogorov Complexity Theory.


Best Sellers


Product Details
  • ISBN-13: 9783642151545
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Edition: 2010
  • Language: English
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Sub Title: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings
  • Width: 155 mm
  • ISBN-10: 364215154X
  • Publisher Date: 10 Aug 2010
  • Binding: Paperback
  • Height: 236 mm
  • No of Pages: 714
  • Series Title: 6281 Lecture Notes in Computer Science
  • Spine Width: 28 mm
  • Weight: 1065 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings(6281 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings(6281 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings(6281 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA