Follow
Peter C. Richter
Peter C. Richter
Department of Computer Science, Rutgers University
Verified email at cs.rutgers.edu
Title
Cited by
Cited by
Year
On the hitting times of quantum versus random walks
F Magniez, A Nayak, PC Richter, M Santha
Algorithmica 63, 91-116, 2012
1182012
Quantum speedup of classical mixing processes
PC Richter
Physical Review A 76 (4), 042306, 2007
992007
Almost uniform sampling via quantum walks
PC Richter
New Journal of Physics 9 (3), 72, 2007
632007
Lower bounds for graph embeddings and combinatorial preconditioners
GL Miller, PC Richter
Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004
82004
An investigation of expanders and ramanujan graphs along random walks of cubic bipartite graphs
P Richter
Junior Thesis, Princeton University, Spring, 2001
72001
Quantum walks and ground state problems
PC Richter
Rutgers The State University of New Jersey, School of Graduate Studies, 2007
22007
Quantization of Markov Chains.
PC Richter, M Szegedy
Encyclopedia of Algorithms, 2008
12008
Quantum Algorithm for Finding Triangles.
PC Richter
Encyclopedia of Algorithms, 2008
2008
The Quantum Complexity of Markov Chain Monte Carlo
PC Richter
Logic and Theory of Algorithms: 4th Conference on Computability in Europe …, 2008
2008
Two remarks on the local Hamiltonian problem
PC Richter
arXiv preprint arXiv:0712.4274, 2007
2007
Bounded-Degree Expanders and Dynamic Networks
PC Richter
2002
Lower Bounds for Graph Embeddings and Combinatorial Preconditioners
P Richter
The system can't perform the operation now. Try again later.
Articles 1–12