Citation: Jh. Reif, Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix, ALGORITHMIC, 29(3), 2001, pp. 487-510
Citation: Jh. Reif et Sr. Tate, Fast spatial decomposition and closest pair computation for limited precision input, ALGORITHMIC, 28(3), 2000, pp. 271-287
Citation: Cd. Mao et al., Logical computation using algorithmic self-assembly of DNA triple-crossover molecules (vol 407, pg 493, 2000), NATURE, 408(6813), 2000, pp. 750-750
Authors:
LaBean, TH
Yan, H
Kopatsch, J
Liu, FR
Winfree, E
Reif, JH
Seeman, NC
Citation: Th. Labean et al., Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes, J AM CHEM S, 122(9), 2000, pp. 1848-1860
Citation: Zy. Li et al., Synthesizing efficient out-of-core programs for block recursive algorithmsusing block-cyclic data distributions, IEEE PARALL, 10(3), 1999, pp. 297-315
Citation: S. Azhar et Jh. Reif, Efficient algorithmic learning of the structure of permutation groups by examples, COMPUT MATH, 37(10), 1999, pp. 105-132