Discrete-query quantum algorithm for NAND trees AM Childs, R Cleve, SP Jordan, D Yonge-Mallo arXiv preprint quant-ph/0702160, 2007 | 77 | 2007 |
Efficient discrete-time simulations of continuous-time quantum query algorithms R Cleve, D Gottesman, M Mosca, RD Somma, D Yonge-Mallo Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 47 | 2009 |
Fault diagnosis in discrete-event systems: Incomplete models and learning RH Kwong, DL Yonge-Mallo IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 41 …, 2010 | 42 | 2010 |
Fault diagnosis in discrete-event systems with incomplete models: Learnability and diagnosability RH Kwong, DL Yonge-Mallo IEEE transactions on cybernetics 45 (7), 1236-1249, 2014 | 30 | 2014 |
Photometric Monitoring of Bright Be Stars. III. 1988-89 and 1992-95 JR Percy, J Harlow, KAW Hayhoe, II Ivans, M Lister, R Plume, T Rosebery, ... Publications of the Astronomical Society of the Pacific 109 (741), 1215, 1997 | 24 | 1997 |
Quantum Algorithms for Evaluating Min-Max Trees R Cleve, D Gavinsky, DL Yonge-Mallo Workshop on Quantum Computation, Communication, and Cryptography, 11-15, 2008 | 21 | 2008 |
Task-Specific Query Expansion (MultiTest Experiments for TREC 2003 DL Yeung, CLA Clarke, GV Cormack, TR Lynam, EL Terra In Proceedings of the 12th Text Retrieval Conference TREC, 810-819, 2003 | 13 | 2003 |
Proceedings of the 41st Annual ACM Symposium on the Theory of Computing R Cleve, D Gottesman, M Mosca, RD Somma, DL Yonge-Mallo ACM, 2009 | 7 | 2009 |
Adversary lower bounds in the Hamiltonian oracle model D Yonge-Mallo arXiv preprint arXiv:1108.2479, 2011 | 5 | 2011 |
Theory of Quantum Computation, Communication, and Cryptography R Cleve, D Gavinsky, D Yonge-Mallo Springer-Verlag, 2008 | 5 | 2008 |
Be Stars in the AAVSO Photoelectric Photometry Program JR Percy, A Desjardins, D Yeung The Journal of the American Association of Variable Star Observers, vol. 25 …, 1996 | 1 | 1996 |