Fast prefix adders for non-uniform input arrival times (Q513308): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-015-0067-x
@@ Property / DOI: 10.1007/s00453-015-0067-x / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.2917
@@ Property / arXiv ID: 1411.2917 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster optimal parallel prefix sums and list ranking
+Normal rank
@@ Property / cites work @@
+The delay of circuits whose inputs have specified arrival times
+Normal rank
@@ Property / cites work @@
+A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
+Normal rank
@@ Property / cites work @@
+Parallel Prefix Computation
@@ Property / cites work: Parallel Prefix Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Delay optimization of linear depth Boolean circuits with prescribed input arrival times
+Normal rank
@@ Property / cites work @@
+On the cost of optimal alphabetic code trees with unequal letter costs
+Normal rank
@@ Property / DOI @@
+.1007/S00453-015-0067-X
@@ Property / DOI: 10.1007/S00453-015-0067-X / rank @@
+Normal rank