On the hitting times of quantum versus random walks F Magniez, A Nayak, PC Richter, M Santha Algorithmica 63, 91-116, 2012 | 102 | 2012 |

Quantum speedup of classical mixing processes PC Richter Physical Review A 76 (4), 042306, 2007 | 93 | 2007 |

Almost uniform sampling via quantum walks PC Richter New Journal of Physics 9 (3), 72, 2007 | 59 | 2007 |

Lower bounds for graph embeddings and combinatorial preconditioners GL Miller, PC Richter Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004 | 8 | 2004 |

An investigation of expanders and ramanujan graphs along random walks of cubic bipartite graphs P Richter Junior Thesis, Princeton University, Spring, 2001 | 7 | 2001 |

Quantization of Markov Chains. PC Richter, M Szegedy Encyclopedia of Algorithms, 2008 | 1 | 2008 |

Quantum walks and ground state problems PC Richter Rutgers The State University of New Jersey, School of Graduate Studies, 2007 | 1 | 2007 |

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 |

Lower Bounds for Graph Embeddings and GL Miller, PC Richter Annual ACM Symposium on Parallel Algorithms and Architectures 16, 112, 2004 | | 2004 |

Bounded-Degree Expanders and Dynamic Networks PC Richter | | 2002 |

Lower Bounds for Graph Embeddings and Combinatorial Preconditioners P Richter | | |