Search results
From Quantum Computing Theory Group
Page title matches
File:DJR-Picture.jpg (800 × 600 (244 KB)) - 18:59, 21 July 2011- [[Image:DJR-Picture.jpg]] See my main webpage [http://www.cs.washington.edu/homes/djr/ here] for more information.115 bytes (18 words) - 19:34, 14 November 2011
File:DJR-Picture-Cropped.jpg (298 × 386 (95 KB)) - 02:01, 25 August 2011
Page text matches
- |[[Image:DJR-Picture-Cropped.jpg|120px]] || '''David Rosenbaum''' [http://www.cs.washington.edu/homes/djr/ more info]4 KB (547 words) - 19:14, 11 December 2016
- * [[user:djr | David Rosenbaum]] has a new paper on breaking the n^(log n) barrier for s * [[user:djr | David Rosenbaum]] has a new paper on optimal quantum circuits for nearest9 KB (1,231 words) - 03:35, 29 May 2012
- * [[User:Djr|D. Rosenbaum]], '''Quantum Algorithms for Tree Isomorphism and State Symmet152 bytes (17 words) - 01:17, 21 March 2012
- [[Image:DJR-Picture.jpg]] See my main webpage [http://www.cs.washington.edu/homes/djr/ here] for more information.115 bytes (18 words) - 19:34, 14 November 2011
- * [[User:Djr|D. Rosenbaum]], [http://www.cs.washington.edu/homes/aram/ Aram Harrow] '''U199 bytes (26 words) - 01:16, 21 March 2012
- * [[user:djr | David Rosenbaum]] '''Optimal Quantum Circuits for Nearest-Neighbor Archit151 bytes (15 words) - 00:53, 3 May 2012
- * [[user:djr | David Rosenbaum]] '''Breaking the n^(log n) Barrier for Solvable-Group Is153 bytes (18 words) - 03:34, 29 May 2012
- * [[user:djr | David Rosenbaum]] '''Bidirectional Collision Detection and Faster Determi170 bytes (17 words) - 04:01, 12 May 2013
