9783540119739 - theoretical computer science: 6th gi-conference dortmund, january 5-7, 1983 (lecture notes in computer science) (v. 145) (english and french edition) (lecture notes in computer science, 145, band 145) (2 Ergebnisse)
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 94,14
EUR 13,96 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 53,49
EUR 62,91 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Partial functions in comstructive formal theories.- A Monte Carlo factoring algorithm with finite storage.- Theory of concurrency control.- Interprocedural data flow systems.- On the crossing-free, rectangular embedding of weighted graphs in the plan…e.- Discreteness, K-density and D-continuity of occurrence nets.- Controlled relativizations of P and NP.- The computational complexity of certain graph grammars.- Inconsistencies of pure LISP.- FIFO nets: A new model of parallel computation.- Une extension aux mots infinis de la notion de transduction rationnelle.- Algebraic and operational semantics of exceptions and errors.- The expected number of nodes and leaves at level k in ordered trees.- Complexity theory on real numbers and functions.- A multifit algorithm for uniform multiprocessor scheduling.- Analysis of polynomial approximation algorithms for constraint expressions.- Heuristics for minimum edge length rectangular partitions of rectilinear figures.- An axiomatic approach to semantics of specification languages.- Efficiency of universal parallel computers.- Coroutines and processes in block structured languages.- A general scheme for some deterministically parsable grammars and their strong equivalents.- A decidability result about sufficient-completeness of axiomatically specified abstract data types.- Two remarks on the power of counting.- Some operations and transductions that preserve rationality.- On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.- Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.- The equivalence problem for N.T.S. languages is deoidable.- Weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi.- A hierarchy of sets of infinite trees.- Maintaining order in a generalized linked list.- Periodic versus arbitrary tessellations of the plane using polyominos of a single type.
