Boolean circuit programming: A new paradigm to design parallel algorithms

Aho, 1974 M. Ajtai, J. Komlós, E. Szemerédi, An O(nlogn) sorting network, in: Proc. 15th Ann. ACM Symp. on Theory of Computing 1983, pp. 1–9 Aho, 1986 Ashenden, 2001 Bergland, 1969, Fast Fourier Transform hardware implementation – A survey, IEEE Transactions on Audio and Electroacoustics, 17, 104, 10.1109/TAU.1969.1162041 Ciletti, 2003 Chandy, 1988 Crochemore, 1997, Constant-time randomized parallel string matching, SIAM Journal on Computing, 26, 950, 10.1137/S009753979528007X Cormen, 1990 D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Proc. 4th ACM S1GPLAN Symp. On Principles and Practice of Parallel Programming (PPoPP '93), San Diego, CA, May 1993 Culler, 1999 Gibbons, 1988 Greenlaw, 1995 Hwang, 1998 JaJa, 1992 Koren, 1993 Leighton, 1992 Liu, 2005, A VLSI array processing oriented Fast Fourier Transform algorithm and hardware implementation, IEICE Transactions on Fundamentals, E88-A, 3523, 10.1093/ietfec/e88-a.12.3523 MentorGraphics Inc. E. Park, K. Park, A new Boolean circuit for maximum matching in a convex bipartite graph, in: 17th Australasian Workshop on Combinatorial Algorithms, July 2006 Paterson, 1990, Improved sorting networks with O(logN) depth, Algorithmica, 5, 75, 10.1007/BF01840378 Paul, 1982, Decision trees and random access machines, Monographie de L'Enseigment Mathematique, 30, 331 Savage, 1998 M. Sipser, Introduction to the Theory of Computation, PWS 1997 Snyder, 1986, Type architectures, shared memory, and the corollary of modest potential, Annual Review of Computer Science, 1, 289, 10.1146/annurev.cs.01.060186.001445 Synopsis Inc. Valiant, 1990, A bridging model for parallel computation, Communications of the ACM, 33, 103, 10.1145/79173.79181 Vollmer, 1999 Wegener, 1987