VLSI Algorithms and Architectures

Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986. Proceedings

Häftad, Engelska, 1986

AvFillia Makedon,Kurt Mehlhorn,T. Papatheodorou,P. Spirakis

689 kr

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

Produktinformation

Utgivningsdatum1986-06-01
Mått155 x 235 x 19 mm
Vikt517 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor330
Upplaga1986
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540167662

Tillhör följande kategorier

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.

Du kanske också är intresserad av

Electronic Multimedia Publishing

Electronic Multimedia Publishing

Fillia Makedon, Samuel A. Rebelsky, Samuel a. Rebelsky, Fillia Makedon, Samuel a. Rebelsky

1 409 kr

Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups and Applications

Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups and Applications

D M Kornhauser, G Miller, P Spirakis, G. Miller, P. Spirakis

309 kr

Computed Synchronization for Multimedia Applications

Computed Synchronization for Multimedia Applications

Charles B. Owen, Fillia Makedon

2 069 kr

Computed Synchronization for Multimedia Applications

Computed Synchronization for Multimedia Applications

Charles B. Owen, Fillia Makedon, Charles Owen

2 069 kr

Electronic Multimedia Publishing

Electronic Multimedia Publishing

Fillia Makedon, Samuel A. Rebelsky, Samuel a. Rebelsky

1 419 kr

Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups and Applications

Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups and Applications

D M Kornhauser, G Miller, P Spirakis, G. Miller, P. Spirakis

529 kr

Lectures in Parallel Computation

Del 4

Lectures in Parallel Computation

Alan Gibbons, Paul Spirakis, Alan (University of Warwick) Gibbons, Greece) Spirakis, Paul (University of Patras, P. Spirakis, W. F. McColl

1 229 kr

Automata, Languages, and Programming

Automata, Languages, and Programming

Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer

689 kr

Algorithms and Data Structures

Algorithms and Data Structures

Kurt Mehlhorn, Peter Sanders

859 kr

Grundlagen der Programmiersprachen

Grundlagen der Programmiersprachen

Kurt Mehlhorn, Reinhard Wilhelm

639 kr