Mathematical Foundations of Computer Science 1980: 9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings: Lecture Notes in Computer Science, cartea 88
Editat de P. Dembinskien Limba Engleză Paperback – aug 1980
Din seria Lecture Notes in Computer Science
- 20% Preț: 297.45 lei
- 20% Preț: 297.45 lei
- 20% Preț: 517.29 lei
- 5% Preț: 343.06 lei
- 20% Preț: 241.52 lei
- 20% Preț: 303.27 lei
- 20% Preț: 624.06 lei
- 20% Preț: 296.89 lei
- Preț: 346.79 lei
- Preț: 340.83 lei
- 20% Preț: 379.02 lei
- 20% Preț: 221.75 lei
- 20% Preț: 275.91 lei
- Preț: 262.38 lei
- 20% Preț: 298.57 lei
- 20% Preț: 266.97 lei
- 20% Preț: 360.10 lei
- 20% Preț: 310.09 lei
- 20% Preț: 284.43 lei
- 20% Preț: 308.00 lei
- 20% Preț: 202.42 lei
- 20% Preț: 283.35 lei
- 20% Preț: 315.25 lei
- 20% Preț: 572.84 lei
- 20% Preț: 475.27 lei
- 20% Preț: 291.91 lei
- 20% Preț: 289.52 lei
- 20% Preț: 290.45 lei
- 20% Preț: 698.69 lei
- 20% Preț: 347.90 lei
- 20% Preț: 413.13 lei
- 17% Preț: 338.16 lei
- 20% Preț: 771.51 lei
- 20% Preț: 447.62 lei
- 20% Preț: 298.57 lei
- 20% Preț: 287.43 lei
- 20% Preț: 414.27 lei
- 20% Preț: 413.75 lei
- 20% Preț: 639.35 lei
- 20% Preț: 267.73 lei
- 20% Preț: 322.75 lei
- 20% Preț: 297.58 lei
- 20% Preț: 367.40 lei
- 20% Preț: 607.93 lei
- 20% Preț: 297.58 lei
- 20% Preț: 377.31 lei
- 20% Preț: 289.95 lei
- 20% Preț: 418.32 lei
- 20% Preț: 345.69 lei
Preț: 392.41 lei
Preț vechi: 490.51 lei
-20%
Puncte Express: 589
Preț estimativ în valută:
75.18€ • 81.44$ • 64.47£
75.18€ • 81.44$ • 64.47£
Carte tipărită la comandă
Livrare economică 06-13 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540100270
ISBN-10: 354010027X
Pagini: 736
Ilustrații: VIII, 726 p.
Dimensiuni: 155 x 235 x 39 mm
Greutate: 2.24 kg
Ediția:1980
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354010027X
Pagini: 736
Ilustrații: VIII, 726 p.
Dimensiuni: 155 x 235 x 39 mm
Greutate: 2.24 kg
Ediția:1980
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Formal description of programming concepts.- Electronic category theory.- An essay about research on sparse NP complete sets.- Some theoretical aspects of applicative multiprocessing.- On some discrete optimization problems in mass storage systems.- Abstract data types: A retrospective and prospective view.- Controlling behaviours of systems : Some basic concepts and some applications.- Conceptual relations between databases transformed under join and projection.- The weighted Sperner's Set problem.- Proof of a concurrent program finding Euler paths.- A theoretical basis for the systematic proof method.- Consistent semantics for a data flow language.- Analog processes.- An extended polymorphic type system for applicative languages.- A criterion of undecidability of algorithmic theories.- On finding the optimal access path to resolve a relational data base query.- Compound algebraic implementations: An approach to stepwise refinement of software systems.- On and/or schemes.- A term model for CCS.- A mathematical approach to multi-pass parsing.- Abstract implementation of abstract data types.- Parallel algorithms in graph theory: Planarity testing (preliminary version).- On atomic nets and concurrency relations.- Node-label controlled graph grammars (Extended abstract).- A method to compare the descriptive power of different types of Petrinets.- A simple class of algorithmic specifications for abstract software modules.- Inducing patterns of behaviour in distributed system parts.- Van wijngaarden grammars as a special information processing model.- Approaches to concurrency in B-trees.- On a subclass of pseudopolynomial problems.- Decidability of reachability in persistent vector replacement systems.- Generalized heapsort.- Decidability results on a query language for data bases with incomplete information.- New results on completeness and consistency of abstract data types.- Asymptotic complexity of game-searching procedures.- Completeness in classical logic of complex algorithms.- Initially — Restricting algebraic theories.- Schemes for nonsequential processing systems.- Dynamic algebras which are not Kripke structures.- Time and space bounds in producing certain partial orders.- Axioms of algorithmic logic univocally determine semantics of programs.- A logical approach to the problem “P=NP?”.- Verifying concurrent system specifications in COSY.- Deadlocks and livelocks in transition systems.- Descriptional complexity of concurrent processes (preliminary version).- A uniform approach to applicative and imperative features in programming languages.- A resource allocation problem.- An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problem.- Decision complexity of variants of propositional dynamic logic.- Relativized obliviousness.- Abstract data types as lattices of finitely generated models.- The LR(k) parser.- Substitution systems — A family of system models based on concurrency.