Asymptotic component densities in programmable gate arrays realizing all circuits of a given size

DOI10.1007/BF01188707zbMath0760.94017OpenAlexW2142577839MaRDI QIDQ1206434

A. Hekstra, Toby Berger, Alon Orlitsky

Publication date: 1 April 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01188707

zbMATH Keywords

graphVLSIvertex connectivityedge connectivitygrid embeddingsprogrammable gate array

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multilayer grid embeddings for VLSI
• The shortest path and the shortest road through n points
• Permutation layout
• How Long Can a Euclidean Traveling Salesman Tour Be?

This page was built for publication: Asymptotic component densities in programmable gate arrays realizing all circuits of a given size