Planar acyclic computation
From MaRDI portal
Publication:751805
DOI10.1016/0890-5401(91)90003-KzbMath0715.68026OpenAlexW2040320701MaRDI QIDQ751805
Publication date: 1991
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(91)90003-k
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- The performance of multilective VLSI algorithms
- Optimal three-dimensional layouts of complete binary trees
- Feasible arithmetic computations: Valiant's hypothesis
- Three-Dimensional VLSI
- Logarithmic Depth Circuits for Algebraic Functions
- Three-Dimensional Circuit Layouts
- Planar Crossovers
- Applications of a Planar Separator Theorem
- Optimal three-dimensional VLSI layouts
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Planar acyclic computation
