New lower bound techniques for VLSI (Q3950484): Difference between revisions

@@ Property / cites work @@
+A model of computation for VLSI with related complexity results
+Normal rank
@@ Property / cites work @@
+The crossing number of K5,n
@@ Property / cites work: The crossing number of K5,n / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds to Complexities of Networks for Sorting and for Switching
+Normal rank
@@ Property / cites work @@
+Q3667941
@@ Property / cites work: Q3667941 / rank @@
+Normal rank
@@ Property / cites work @@
+Area-time optimal VLSI networks for multiplying matrices
+Normal rank
@@ Property / cites work @@
+The VLSI Complexity of Sorting
@@ Property / cites work: The VLSI Complexity of Sorting / rank @@
+Normal rank
@@ Property / cites work @@
+Universality considerations in VLSI circuits
@@ Property / cites work: Universality considerations in VLSI circuits / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01744433
+Normal rank
@@ Property / OpenAlex ID @@
+W2066782398
@@ Property / OpenAlex ID: W2066782398 / rank @@
+Normal rank