Items related to Mathematical Foundations of Computer Science 1980:...
Mathematical Foundations of Computer Science 1980: 9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings: 88 (Lecture Notes in Computer Science, 88) - Softcover
Synopsis
No Mathematical Foundations of Computer Science 1980 Read a customer review or write one .
"synopsis" may belong to another edition of this title.
Search results for Mathematical Foundations of Computer Science 1980:...
Stock Image
Mathematical Foundations of Computer Science 1980: 9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings (Lecture Notes in Computer Science, 88)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540100270_new
Buy New
£ 48.75
£ 11.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Mathematical Foundations of Computer Science 1980 : 9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540100270
Buy New
£ 46.09
£ 15.49 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
Mathematical Foundations of Computer Science 1980
Published by
Springer Berlin Heidelberg Aug 1980, 1980
ISBN 10: 354010027X
ISBN 13: 9783540100270
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 736 pp. Englisch. Seller Inventory # 9783540100270
Stock Image
Mathematical Foundations of Computer Science 1980
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 736. Seller Inventory # 263066445
Stock Image
Mathematical Foundations of Computer Science 1980
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 736 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 5862802
Buy New
£ 68.54
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
Mathematical Foundations of Computer Science 1980
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 736. Seller Inventory # 183066439
Seller Image
Mathematical Foundations of Computer Science 1980
Published by
Springer Berlin Heidelberg, 1980
ISBN 10: 354010027X
ISBN 13: 9783540100270
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.- Abstrac. Seller Inventory # 4880765
Buy New
£ 40.45
£ 42.06 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Mathematical Foundations of Computer Science 1980
Published by
Springer, Springer Aug 1980, 1980
ISBN 10: 354010027X
ISBN 13: 9783540100270
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 736 pp. Englisch. Seller Inventory # 9783540100270
Seller Image
Mathematical Foundations of Computer Science 1980 : 9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540100270
Seller Image
Mathematical Foundations of Computer Science 1980 | 9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Mathematical Foundations of Computer Science 1980 | 9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings | P. Dembinski | Taschenbuch | viii | Englisch | 1980 | Springer | EAN 9783540100270 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 102157631