Del i serien Lecture Notes in Computer Science
Theoretical Computer Science
6th GI-Conference Dortmund, January 5-7, 1983
739 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Finns i fler format (10)
Produktinformation
- Utgivningsdatum1982-12-01
- Mått155 x 235 x 21 mm
- Vikt581 g
- FormatHäftad
- SpråkEngelska, Franska
- SerieLecture Notes in Computer Science
- Antal sidor368
- Upplaga1982
- FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN9783540119739
Tillhör följande kategorier
- 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 plane.- 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.
Mer från samma serie
Agent Mediated Electronic Commerce II
Alexandros Moukas, Carles Sierra, Fredrik Ygge
Häftad, 2000
739 kr
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
Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops
Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi
Häftad, 2025
959 kr
Du kanske också är intresserad av
Theoretical Computer Science
Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi
Häftad, 2001
739 kr