LEADER 00839nam0-22002891i-450- 001 990001660900403321 005 20070712145844.0 035 $a000166090 035 $aFED01000166090 035 $a(Aleph)000166090FED01 035 $a000166090 100 $a20030910d1851----km-y0itay50------ba 101 0 $afre 102 $aFR 200 1 $aPrécis d?agriculture théoriqueet pratique à l?usage des écoles d?agriculture, des propriétaires et des fermiers$fA. Payen, A. Richard 210 $aParis$cHachette$d1851 215 $a2 v.$d22 cm 610 0 $aAgricoltura 676 $a630 700 1$aPayen,$bAnselme$0302436 701 1$aRichard,$bAchille$0357030 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990001660900403321 952 $a60 630 B 18$b1774/75$fFAGBC 959 $aFAGBC 997 $aUNINA LEADER 03367nam 22005055 450 001 996465831103316 005 20220714144810.0 010 $a3-540-47760-8 024 7 $a10.1007/3-540-18099-0 035 $a(CKB)1000000000230651 035 $a(SSID)ssj0000325497 035 $a(PQKBManifestationID)11268461 035 $a(PQKBTitleCode)TC0000325497 035 $a(PQKBWorkID)10322192 035 $a(PQKB)10221094 035 $a(DE-He213)978-3-540-47760-0 035 $a(PPN)155192434 035 $a(EXLCZ)991000000000230651 100 $a20121227d1987 u| 0 101 0 $aeng 135 $aurnn#|||mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aParallel Algorithms and Architectures$b[electronic resource] $eInternational Workshop Suhl, GDR, May 25-30, 1987; Proceedings /$fedited by Andreas Albrecht, Hermann Jung, Kurt Mehlhorn 205 $a1st ed. 1987. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1987. 215 $a1 online resource (IX, 200 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v269 300 $aBibliographic Level Mode of Issuance: Monograph 311 1 $a3-540-18099-0 327 $aDeterministic simulation of idealized parallel computers on more realistic ones -- Convex hull of randomly chosen points from a polytope -- Dataflow computing -- Parallel in sequence ? Towards the architecture of an elementary cortical processor -- Parallel algorithms and static analysis of parallel programs -- Parallel processing of combinatorial search trees -- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem -- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region -- RELACS ? A recursive layout computing system -- Parallel linear conflict-tree subtree access -- A formal definition for systolic systems -- Parallel recognition of outerplanar graphs -- Solutions for the distributed termination problem -- Memories for parallel subtree-access -- Synapse: A multi-microprocessor lisp machine with parallel garbage collector -- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata -- Optimal parallel parsing of bracket languages -- On reliable networks from unreliable gates -- Area-time tradeoffs for selection -- Optimization of special permutation networks using simple algebraic relations -- Computing a rectilinear steiner minimal tree in ^{O(\sqrt n )} time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v269 606 $aComputers 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 615 0$aComputers. 615 14$aComputation by Abstract Devices. 676 $a004.0151 702 $aAlbrecht$b Andreas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJung$b Hermann$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMehlhorn$b Kurt$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465831103316 996 $aParallel Algorithms and Architectures$92829772 997 $aUNISA