Open AccessBook
Computational Aspects of Vlsi
About:
The article was published on 1984-01-01 and is currently open access. It has received 862 citations till now. The article focuses on the topics: Very-large-scale integration.read more
Citations
More filters
Journal ArticleDOI
Optimal edge ranking of complete bipartite graphs in polynomial time
TL;DR: This paper presents a polynomial-time algorithm to find an optimal edge ranking for a complete-bipartite graph by using the dynamic programming strategy.
Book ChapterDOI
Parallel General Prefix Computations with Geometric, Algebraic and Other Applications
TL;DR: It is shown that general prefix techniques can be applied to a wide variety of geometric problems, including triangulation of point sets, two-set dominance counting, ECDF searching, finding two- and three-dimensional maximal points, and the (classical) reconstruction of trees from their traversals.
Journal ArticleDOI
Indirect measurements in finite fields
TL;DR: It is demonstrated that application of the arithmetic of residual classes possesses a number of interesting and useful properties for construction of measurement algorithms and indirect measurement procedures.
Optimal computation of the contour of maximal elements on mesh-connected computers
Manzur Murshed,Markus Hegland +1 more
TL;DR: It has been calculated that Dehne’s algorithm requires23pn steps and it has been able to reduce the required steps to19pn through pre-sorting and using an efficient strategy in dividing the mesh into halves.
Complexity dichotomy on partial grid recognition ⁄ Vin¶‡cius G. P. de Sa y Guilherme D. da Fonseca z
TL;DR: This work provides a broad classiflcation of graphs that make for polynomial or NP-complete instances based on the set of allowed vertex degrees in the input graphs, yielding a full dichotomy on the complexity of the problem.