04513nam 22006855 450 99646594630331620200630190013.03-540-38746-310.1007/3-540-16766-8(CKB)1000000000548908(SSID)ssj0000327588(PQKBManifestationID)11230512(PQKBTitleCode)TC0000327588(PQKBWorkID)10303700(PQKB)11588899(DE-He213)978-3-540-38746-6(PPN)155200909(EXLCZ)99100000000054890820121227d1986 u| 0engurnn|008mamaatxtccrVLSI Algorithms and Architectures[electronic resource] Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986. Proceedings /edited by Fillia Makedon, Kurt Mehlhorn, T. Papatheodorou, P. Spirakis1st ed. 1986.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1986.1 online resource (X, 330 p.) Lecture Notes in Computer Science,0302-9743 ;227Bibliographic Level Mode of Issuance: Monograph3-540-16766-8 Digital filtering in VLSI -- Two processor scheduling is in NC -- Breaking symmetry in synchronous networks -- Parallel ear decomposition search (EDS) and st-numbering in graphs -- A unifying framework for systolic designs -- Optimal tradeoffs for addition on systolic arrays -- On the connection between hexagonal and unidirectional rectangular systolic arrays -- Lower bounds for sorting on mesh-connected architectures -- Diogenes, circa 1986 ????? ??? ??? ????o ????o?o -- Nonsequential computation and laws of nature -- Linear algorithms for two CMOS layout problems -- Some new results on a restricted channel routing problem -- Efficient modular design of TSC checkers for m-out-of-2m codes -- Vlsi algorithms and pipelined architectures for solving structured linear system -- A high-performance single-chip vlsi signal processor architecture -- Exploiting hierarchy in VLSI design -- A polynomial algorithm for recognizing images of polyhedra -- Parallel tree techniques and code optimization -- AT2-optimal galois field multiplier for VLSI -- Linear and book embeddings of graphs -- Efficient parallel evaluation of straight-line code and arithmetic circuits -- A logarithmic boolean time algorithm for parallel polynomial division -- A polynomial algorithm for recognizing small cutwidth in hypergraphs -- A generalized topological sorting problem -- Combinational static CMOS networks -- Fast and efficient parallel linear programming and linear least squares computations -- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes -- A comparative study of concurrency control methods in B-trees -- Generalized river routing — Algorithms and performance bounds.Lecture Notes in Computer Science,0302-9743 ;227Electrical engineeringElectronicsMicroelectronicsMicroprocessorsComputersElectrical Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/T24000Electronics and Microelectronics, Instrumentationhttps://scigraph.springernature.com/ontologies/product-market-codes/T24027Processor Architectureshttps://scigraph.springernature.com/ontologies/product-market-codes/I13014Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Electrical engineering.Electronics.Microelectronics.Microprocessors.Computers.Electrical Engineering.Electronics and Microelectronics, Instrumentation.Processor Architectures.Computation by Abstract Devices.621.3Makedon Filliaedthttp://id.loc.gov/vocabulary/relators/edtMehlhorn Kurtedthttp://id.loc.gov/vocabulary/relators/edtPapatheodorou Tedthttp://id.loc.gov/vocabulary/relators/edtSpirakis Pedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465946303316VLSI Algorithms and Architectures2831123UNISA01119nam 2200385 450 991079806160332120230803213925.01-4258-9556-5(CKB)3710000000551975(MiAaPQ)EBC5881914(Au-PeEL)EBL5881914(OCoLC)1117633253(EXLCZ)99371000000055197520190926d2014 uy 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierBrain-powered lessons to engage all learnersLevel 3. /author, LaVonna RothHuntington Beach, California :Shell Education,[2014]©20141 online resource (154 pages)1-4258-1180-9 Third grade (Education)Third grade (Education)372.241Roth LaVonna1557921MiAaPQMiAaPQMiAaPQBOOK9910798061603321Brain-powered lessons to engage all learners3821906UNINA