| 2008 |
|---|
| 15 | EE | Greg Leibon,
Daniel N. Rockmore,
Wooram Park,
Robert Taintor,
Gregory S. Chirikjian:
A fast Hermite transform.
Theor. Comput. Sci. 409(2): 211-228 (2008) |
| 2007 |
|---|
| 14 | EE | Greg Leibon,
Daniel N. Rockmore,
Gregory S. Chirikjian:
A fast hermite transform with applications to protein structure determination.
SNC 2007: 117-124 |
| 13 | EE | Cristopher Moore,
Daniel N. Rockmore,
Alexander Russell,
Leonard J. Schulman:
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts.
SIAM J. Comput. 37(3): 938-958 (2007) |
| 2006 |
|---|
| 12 | EE | Cristopher Moore,
Daniel N. Rockmore,
Alexander Russell:
Generic quantum Fourier transforms.
ACM Transactions on Algorithms 2(4): 707-723 (2006) |
| 2004 |
|---|
| 11 | EE | Cristopher Moore,
Daniel N. Rockmore,
Alexander Russell,
Leonard J. Schulman:
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups.
SODA 2004: 1113-1122 |
| 10 | EE | Cristopher Moore,
Daniel N. Rockmore,
Alexander Russell:
Generic quantum Fourier transforms.
SODA 2004: 778-787 |
| 9 | EE | Dennis M. Healy Jr.,
P. J. Kostelec,
Daniel N. Rockmore:
Towards Safe and Effective High-Order Legendre Transforms with Applications to FFTs for the 2-sphere.
Adv. Comput. Math. 21(1-2): 59-105 (2004) |
| 8 | EE | Jeremy R. Johnson,
José M. F. Moura,
Markus Püschel,
Daniel N. Rockmore:
Special issue on computer algebra and signal processing: forward by the guest editors.
J. Symb. Comput. 37(2): 133-135 (2004) |
| 7 | EE | Richard Foote,
Gagan Mirchandani,
Daniel N. Rockmore:
Two-dimensional wreath product group-based image processing.
J. Symb. Comput. 37(2): 187-207 (2004) |
| 1997 |
|---|
| 6 | EE | D. Warner,
Dennis M. Healy Jr.,
Daniel N. Rockmore:
A Smooth Non-Rectangular Time-Frequency Segmentation of L2(R2).
ICIP (1) 1997: 695-698 |
| 5 | EE | John D. Lafferty,
Daniel N. Rockmore:
Spectral Techniques for Expander Codes.
STOC 1997: 160-167 |
| 4 | | James R. Driscoll,
Dennis M. Healy Jr.,
Daniel N. Rockmore:
Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs.
SIAM J. Comput. 26(4): 1066-1099 (1997) |
| 1995 |
|---|
| 3 | | David Keith Maslen,
Daniel N. Rockmore:
Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups.
SODA 1995: 253-262 |
| 1994 |
|---|
| 2 | EE | Daniel N. Rockmore:
Efficient Computation of Fourier Inversion for Finite Groups.
J. ACM 41(1): 31-66 (1994) |
| 1993 |
|---|
| 1 | EE | László Babai,
Robert Beals,
Daniel N. Rockmore:
Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time.
ISSAC 1993: 117-126 |
