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ț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 341.30 lei
Preț vechi: 426.63 lei
-20% Nou
Puncte Express: 512
Preț estimativ în valută:
65.31€ • 67.78$ • 54.59£
65.31€ • 67.78$ • 54.59£
Carte tipărită la comandă
Livrare economică 17-31 martie
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