Mathematical Foundations of Computer Science 2008 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings - neues Buch

EAN (ISBN-13): 9783540852377
ISBN (ISBN-10): 3540852379
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2008
Herausgeber: Springer Berlin Heidelberg
626 Seiten
Gewicht: 0,917 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-06-03T12:18:09+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-04-04T13:40:44+02:00 (Vienna)
ISBN/EAN: 9783540852377

ISBN - alternative Schreibweisen:
3-540-85237-9, 978-3-540-85237-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: tyszkiewicz, ochmanski, jerzy
Titel des Buches: poland, mathematical foundations computer science, coup dés, torun, 2008, august, the mathematical foundations, general, before the computer, ufo symposium, mfcs, science notes, computer science 1st edition ebook

---

Daten vom Verlag:

Autor/in: Edward Ochmanski; Jerzy Tyszkiewicz
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Mathematical Foundations of Computer Science 2008 - 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings
Verlag: Springer; Springer Berlin
626 Seiten
Erscheinungsjahr: 2008-08-12
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XIV, 626 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; Automat; algorithms; artificial intelligence; automata; complexity; computer science; data structure; data structures; distributed computing; formal language; formal languages; formal specification; game theory; semantics; verification; algorithm analysis and problem complexity; Programming Techniques; Theory of Computation; Numerical Analysis; Algorithms; Discrete Mathematics in Computer Science; Theoretische Informatik; Numerische Mathematik; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; EA

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.