Formal proof of prefix adders (Q611751): Difference between revisions

@@ Property / DOI @@
-.1016/j.mcm.2010.02.008
@@ Property / DOI: 10.1016/j.mcm.2010.02.008 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.mcm.2010.02.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2087431822
@@ Property / OpenAlex ID: W2087431822 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Prefix Computation
@@ Property / cites work: Parallel Prefix Computation / rank @@
+Normal rank
@@ Property / cites work @@
+A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
+Normal rank
@@ Property / cites work @@
+A Regular Layout for Parallel Adders
@@ Property / cites work: A Regular Layout for Parallel Adders / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematics of Program Construction
@@ Property / cites work: Mathematics of Program Construction / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs of Correctness and Properties of Integer Adder Circuits
+Normal rank
@@ Property / cites work @@
+A new class of parallel algorithms for finding connected components on machines with bit-vector operations
+Normal rank
@@ Property / cites work @@
+Q2773752
@@ Property / cites work: Q2773752 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.MCM.2010.02.008
@@ Property / DOI: 10.1016/J.MCM.2010.02.008 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:611751