ISBN: 9783540100270 - mathematical foundations of computer science 1980: 9th symposium held in rydzyna, poland, september 1-5, 1980. proceedings (lecture notes in computer science, 88, band 88) (13 Ergebnisse)

- Softcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 74,53
EUR 2,39 VersandVersand innerhalb von USAAnzahl: 15 verfügbar
Zustand: New.

- Softcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 82,71
EUR 2,39 VersandVersand innerhalb von USAAnzahl: 15 verfügbar
Zustand: As New. Unread book in perfect condition.

- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 66,29
EUR 21,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In English.

- Softcover
Anbieter: Books Puddle, Woodside, NY, USABooks Puddle
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 96,41
EUR 3,62 VersandVersand innerhalb von USAAnzahl: 4 verfügbar
Zustand: New. pp. 736.

- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 63,72
EUR 42,67 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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.…
Weitere Bilder- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 47,75
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: 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. …

- Softcover
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes KönigreichMispah books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht - Gut
EUR 138,29
EUR 29,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Paperback. Zustand: Very Good. Used Very Good -Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

- Softcover
- Print-on-Demand
Anbieter: Chiron Media, Wallingford, Vereinigtes KönigreichChiron Media
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 56,91
EUR 11,98 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 20 verfügbar
PF. Zustand: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

- Softcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 50,28
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: 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.…

- Softcover
- Print-on-Demand
Anbieter: moluna, Greven, Deutschlandmoluna
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 45,74
EUR 48,99 VersandVersand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
Zustand: 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.…

- Softcover
- Print-on-Demand
Anbieter: Majestic Books, Hounslow, Vereinigtes KönigreichMajestic Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 93,49
EUR 7,79 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
Zustand: 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.

- Softcover
- Print-on-Demand
Anbieter: Biblios, frankfurt am main, HESSE, DeutschlandBiblios
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 95,77
EUR 9,95 VersandVersand von Deutschland nach USAAnzahl: 4 verfügbar
Zustand: New. PRINT ON DEMAND pp. 736.

- Softcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 50,28
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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.…