The following pages link to (Q3326832):
Displaying 50 items.
- Complexity dichotomy on partial grid recognition (Q533881) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
- Semelectivity is not sufficient (Q751288) (← links)
- Planar acyclic computation (Q751805) (← links)
- Systolic parsing of context-free languages (Q756431) (← links)
- An improved upper bound on the number of intersections between two rectangular paths (Q758223) (← links)
- A framework for solving VLSI graph layout problems (Q796306) (← links)
- On an edge ranking problem of trees and graphs (Q803172) (← links)
- How to draw a planar graph on a grid (Q804582) (← links)
- Asymptotic work estimates for AMLI methods (Q806992) (← links)
- Area complexity of merging (Q807018) (← links)
- An optimal time bound for oblivious routing (Q908701) (← links)
- The area-time complexity of the greatest common divisor problem: A lower bound (Q910227) (← links)
- Parallel general prefix computations with geometric, algebraic, and other applications (Q916378) (← links)
- Optimal tradeoffs for addition on systolic arrays (Q916387) (← links)
- Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing (Q917314) (← links)
- Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms (Q1036533) (← links)
- Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
- Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations (Q1071504) (← links)
- On the maximum edge length in VLSI layouts of complete binary trees (Q1081305) (← links)
- Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs (Q1084869) (← links)
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture (Q1084875) (← links)
- Distributed algorithms in synchronous broadcasting networks (Q1088398) (← links)
- On fault tolerant routings in general networks (Q1089309) (← links)
- Area-time lower-bound techniques with applications to sorting (Q1091139) (← links)
- A minimum-area circuit for \(\ell\)-selection (Q1092661) (← links)
- Multiple cuts, input repetition, and VLSI complexity (Q1095662) (← links)
- Algorithms for the compilation of regular expressions into PLAs (Q1098299) (← links)
- Optimal three-dimensional layouts of complete binary trees (Q1099137) (← links)
- Bit serial addition trees and their applications (Q1099602) (← links)
- Communication complexity of convex optimization (Q1100896) (← links)
- Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
- On problem transformability in VLSI (Q1101222) (← links)
- River routing in VLSI (Q1102106) (← links)
- On the VLSI complexity of some arithmetic and numerical problems (Q1103401) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- Tight chip area lower bounds for string matching (Q1108789) (← links)
- On totalistic systolic networks (Q1108796) (← links)
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
- Set containment inference and syllogisms (Q1114429) (← links)
- Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits (Q1121671) (← links)
- Integer summing algorithms on reconfigurable meshes (Q1128663) (← links)
- Almost exact minimum feedback vertex set in meshes and butterflies (Q1129019) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Computing convexity properties of images on a pyramid computer (Q1175644) (← links)
- Parallel computation of distance transforms (Q1175646) (← links)
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
