Mathematical Foundations of Computer Science 1999: 24th International Symposium, MFCS'99 Szklarska Poreba, Poland, September 6-10, 1999 Proceedings: Lecture Notes in Computer Science, cartea 1672
Editat de Miroslaw Kutylowski, Leszek Pacholski, Tomasz Wierzbickien Limba Engleză Paperback – 18 aug 1999
Din seria Lecture Notes in Computer Science
- 20%
Preț: 426.75 lei - 20%
Preț: 315.62 lei - 20%
Preț: 320.92 lei - 15%
Preț: 426.53 lei - 20%
Preț: 313.87 lei - 20%
Preț: 355.79 lei - 20%
Preț: 355.54 lei - 20%
Preț: 355.18 lei - 20%
Preț: 390.68 lei - 20%
Preț: 392.03 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.79 lei - 20%
Preț: 495.44 lei - 20%
Preț: 498.80 lei - 20%
Preț: 498.50 lei - 20%
Preț: 355.93 lei - 20%
Preț: 639.52 lei - 20%
Preț: 499.90 lei - 20%
Preț: 498.95 lei - 20%
Preț: 270.68 lei - 20%
Preț: 321.68 lei - 20%
Preț: 391.36 lei - 20%
Preț: 322.09 lei - 20%
Preț: 498.90 lei - 20%
Preț: 312.82 lei - 20%
Preț: 496.73 lei - 20%
Preț: 463.03 lei - 20%
Preț: 531.75 lei - 15%
Preț: 496.40 lei - 20%
Preț: 497.25 lei - 20%
Preț: 498.80 lei - 20%
Preț: 461.86 lei - 20%
Preț: 355.59 lei - 20%
Preț: 324.19 lei -
Preț: 418.19 lei - 20%
Preț: 498.59 lei - 20%
Preț: 391.28 lei - 20%
Preț: 355.69 lei - 15%
Preț: 499.72 lei - 20%
Preț: 499.40 lei - 20%
Preț: 390.42 lei - 20%
Preț: 497.75 lei - 20%
Preț: 326.81 lei - 20%
Preț: 322.32 lei - 20%
Preț: 390.42 lei - 20%
Preț: 458.84 lei - 20%
Preț: 427.09 lei - 20%
Preț: 499.90 lei - 20%
Preț: 320.72 lei
Preț: 328.29 lei
Preț vechi: 410.37 lei
-20% Nou
Puncte Express: 492
Preț estimativ în valută:
58.09€ • 67.75$ • 51.01£
58.09€ • 67.75$ • 51.01£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540664086
ISBN-10: 3540664084
Pagini: 476
Ilustrații: XII, 464 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.66 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540664084
Pagini: 476
Ilustrații: XII, 464 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.66 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Computing Over Reals.- On-Line Addition in Real Base.- Query Languages for Real Number Databases Based on Descriptive Complexity over R.- The Arithmetical Hierarchy of Real Numbers.- Compression Techniques.- The Burrows-Wheeler Transform: Theory and Practice.- Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts.- Foundations of Programming.- Computing and Comparing Semantics of Programs in Four-Valued Logics.- Foundations of Modular SOS.- Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces.- Complexity and Algorithms.- On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System.- The Complexity of the Extended GCD Problem.- Complexity Results for Confluence Problems.- Model Checking.- Is Your Model Checker on Time?.- Clausal Resolution for CTL.- Model Checking and Higher-Order Recursion.- Distributed Computing.- Multiparty Communication Complexity: Very Hard Functions.- New Perspectives in Distributed Computing.- Functional Programming.- An Improved Disjunctive Strictness Analysis for Lazy Functional Languages.- Unique Fixed Point Induction for McCarthy’s Amb.- Automata.- On Some Topological Properties of Linear Cellular Automata.- Real-Time Language Recognition by One-Way and Two-Way Cellular Automata.- Average State Complexity of Operations on Unary Automata.- Fooling Rebound Automata.- Algorithms and Complexity.- The Complexity of Minimizing FBDDs.- Efficient Strongly Universal and Optimally Universal Hashing.- Lower and Upper Bounds for the Problem of Page Replication in Ring Networks.- Security.- Language-Based Security.- Logic.- An Algebraic Approach to Knowledge Representation.- On the Structure of the Monadic Logic of the Binary Tree.- A New Space Bound for the Modal Logics K4, KD4 and S4.- CountingProblems.- On Approximating the Number of Bases of Exchange Preserving Matroids.- Processes and Bisimulation.- The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes.- On Plain and Hereditary History-Preserving Bisimulation.- Approximating Weak Bisimulation on Basic Process Algebras.- Graph Algorithms.- Edge Coloring of Bipartite Graphs with Constraints.- An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.- On Minimum Edge Ranking Spanning Trees.- Complexity.- Football Elimination Is Hard to Decide Under the 3-Point-Rule.- Generalized Regular Counting Classes.- A Foundation of Programming a Multi-tape Quantum Turing Machine.- Types: Theory and Applications.- A Type Discipline for Solving Year 2000 Problems in COBOL Programs.- Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types.
Caracteristici
Includes supplementary material: sn.pub/extras