scientific article

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithms integrated circuits VLSI design parallel algorithms compilation VLSI circuits systolic algorithms processor networks automatic design systems layout algorithms lower bounds for area and time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items

Algorithms for the fixed linear crossing number problem, Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges, On the maximum edge length in VLSI layouts of complete binary trees, Drawing graphs in two layers, Constant-slowdown simulations of normal hypercube algorithms on the butterfly network, Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs, Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture, Multi-way graph partition by stochastic probe, Two-page book embedding of trees under vertex-neighborhood constraints, Distributed algorithms in synchronous broadcasting networks, On fault tolerant routings in general networks, Alternative evaluation functions for the cyclic bandwidth sum problem, Area-time lower-bound techniques with applications to sorting, Continuous quadratic programming formulations of optimization problems on graphs, A minimum-area circuit for \(\ell\)-selection, Multiple cuts, input repetition, and VLSI complexity, Algorithms and Bounds for L-Drawings of Directed Graphs, Algorithms for the compilation of regular expressions into PLAs, Optimal three-dimensional layouts of complete binary trees, Bit serial addition trees and their applications, Communication complexity of convex optimization, Succinct representation of regular sets using gotos and Boolean variables, On problem transformability in VLSI, The balanced binary tree technique on mesh-connected computers, River routing in VLSI, On the VLSI complexity of some arithmetic and numerical problems, Graph graphics: Theory and practice, Symmetrizing a Hessenberg matrix: Designs for VLSI parallel processor arrays, Tight chip area lower bounds for string matching, On totalistic systolic networks, On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors, Set containment inference and syllogisms, Using domain decomposition to find graph bisectors, Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits, Applications of the crossing number, Fast sequential and parallel algorithms for finding the largest rectangle separating two sets, Integer summing algorithms on reconfigurable meshes, Almost exact minimum feedback vertex set in meshes and butterflies, From regular expressions to DFA's using compressed NFA's, Edge ranking of graphs is hard, Bisecting de Bruijn and Kautz graphs, An optimal time bound for oblivious routing, The area-time complexity of the greatest common divisor problem: A lower bound, Parallel general prefix computations with geometric, algebraic, and other applications, Optimal tradeoffs for addition on systolic arrays, Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing, Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1, The complexity of short two-person games, Computing convexity properties of images on a pyramid computer, Parallel computation of distance transforms, Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays, Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays, Formula dissection: A parallel algorithm for constraint satisfaction, On graphs preserving rectilinear shortest paths in the presence of obstacles, Approximating the fixed linear crossing number, A tight upper bound for the number of intersections between two rectangulars paths, Nonlinear lower bounds on the number of processors of circuits with sublinear separators, Parallel merging on the instruction systolic array, Decoupling the dimensions of a system of affine recurrence equations, A nonlinear lower bound on the practical combinational complexity, Automatic verification of a class of systolic circuits, Efficient algorithms for the largest rectangle problem, Lower bounds on the area complexity of Boolean circuits, Finding a largest rectangle inside a digital object and rectangularization, Embedding-preserving rectangle visibility representations of nonplanar graphs, A multilevel bilinear programming algorithm for the vertex separator problem, Stirling networks: A versatile combinatorial topology for multiprocessor systems, An asymptotic equality for the number of necklaces in a shuffle-exchange network, A hybrid breakout local search and reinforcement learning approach to the vertex separator problem, Optimal vertex ranking of block graphs, Efficient VLSI fault simulation, Complexity dichotomy on partial grid recognition, Asymptotic component densities in programmable gate arrays realizing all circuits of a given size, A new model for large memories, A note on optimal area algorithms for upward drawings of binary trees, An analysis of some linear graph layout heuristics, Representing graph families with edge grammars, Semelectivity is not sufficient, Planar acyclic computation, Systolic parsing of context-free languages, An improved upper bound on the number of intersections between two rectangular paths, Path optimization for graph partitioning problems, A fast and simple Steiner routing heuristic, Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms, On the communication complexity of Lipschitzian optimization for the coordinated model of computation, Dense edge-disjoint embedding of complete binary trees in interconnection networks, On the complexity of planar Boolean circuits, Optimal systolic array algorithms for tensor product, A framework for solving VLSI graph layout problems, Separator-based graph embedding into multidimensional grids with small edge-congestion, A finite automata approach to modeling the cross product of interconnection networks., Fast consensus in networks of bounded degree., On an edge ranking problem of trees and graphs, How to draw a planar graph on a grid, Asymptotic work estimates for AMLI methods, Area complexity of merging, Topological transformations as a tool in the design of systolic networks, Coverings that preserve sense of direction, Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations, A near-optimal Manhattan channel router for a class of nets with the shift-right-one pattern, Communication Complexity and Lower Bounds on Multilective Computations, An optimal algorithm for computing visible nearest foreign neighbors among colored line segments, Algorithmic arguments in physics of computation, An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form, Parallel computation of discrete Voronoi diagrams, Communication throughput of interconnection networks, Area-efficient algorithms for upward straight-line tree drawings, Concurrent flows and packet routing in Cayley graphs (Preliminary version), Book embeddings and crossing numbers, Representing shared data on distributed-memory parallel computers, Mixed Linear Layouts of Planar Graphs, Systolic designs for the root-squaring method, Cutwidth of the de Bruijn graph, Systolic algorithms, Systolic givens factorization of dense rectangular matrices, On the interleaving semantics of transformation units — A step into GRACE, Drawing graphs with attribute graph grammars, On meshy trees, On a class of cell circuits, A simple systolic method to find all bridges of an undirected graph, Automatic verification of parameterized networks of processes, Fast parallel algorithms for the maximum empty rectangle problem., A unified framework for off-line permutation routing in parallel networks, Tight bounds for oblivious routing in the hypercube, A nonlinear lower bound on the practical combinational complexity, ON SIMULATING A CLASS OF PARALLEL ARCHITECTURES, Unnamed Item, Exposing graph uniformities via algebraic specification, Unnamed Item