Del i serien Lecture Notes in Computer Science

Mathematical Foundations of Computer Science 1980

Name: Mathematical Foundations of Computer Science 1980
SKU: 9783540100270
Price: 699 SEK
Availability: InStock
Author: P. Dembinski
ISBN: 9783540100270

9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings

Häftad, Engelska, 1980

AvP. Dembinski

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1980-08-01
Mått155 x 235 x 40 mm
Vikt1 095 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor726
Upplaga1980
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540100270

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

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.

Mer från samma författare

P. Dembinski - Finance: Servant or Deceiver?, Inbunden

Role of Large Enterprises in Democracy and Society

B. Fryzel, P. Dembinski

Inbunden, 2010

739 kr

P. Dembinski - Finance: Servant or Deceiver?, Häftad

Role of Large Enterprises in Democracy and Society

B. Fryzel, P. Dembinski

Häftad, 2010

739 kr

Enron and World Finance

P. Dembinski, C. Lager, A. Cornford, J. Bonvin

Inbunden, 2005

1 479 kr

Mer från samma serie

Del 16477

Passive and Active Measurement

Simone Ferlin-Reiter, Romain Fontugne, Johanna Ullrich

Häftad, 2026

1 409 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Albert Cohen - Compiler Construction, Häftad

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Yehuda Lindell - Theory of Cryptography, Häftad

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 209 kr

Du kanske också är intresserad av

Finance: Servant or Deceiver?

P. Dembinski

Häftad, 2009

739 kr

Enron and World Finance

P. Dembinski, C. Lager, A. Cornford, J. Bonvin

Inbunden, 2005

1 479 kr

Role of Large Enterprises in Democracy and Society

B. Fryzel, P. Dembinski

Häftad, 2010

739 kr

Finance: Servant or Deceiver?

P. Dembinski

Inbunden, 2008

739 kr

Role of Large Enterprises in Democracy and Society

B. Fryzel, P. Dembinski

Inbunden, 2010

739 kr

Sarah J. Maas - A Court of Splintered Harmony, Häftad

Nyhet

Del 6

A Court of Splintered Harmony

Sarah J. Maas

Häftad, 2026

259 kr

Ruth Kvarnström-Jones - Systrarna på Sophiahemmet, Inbunden

Nyhet

Del 3

Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

299 kr329 kr

Katarina Wennstam - Moder blod, Inbunden

Nyhet

Del 4

Moder blod

Katarina Wennstam

Inbunden, 2026

269 kr299 kr

Verity

Colleen Hoover

Inbunden, 2023

(2)

289 kr

Nyhet

Del 7

Fördrivaren

Viveca Sten

Inbunden, 2026

289 kr319 kr

Del i serien Lecture Notes in Computer Science

Mathematical Foundations of Computer Science 1980

9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings

Häftad, Engelska, 1980

AvP. Dembinski

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1980-08-01
Mått155 x 235 x 40 mm
Vikt1 095 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor726
Upplaga1980
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540100270

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

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.