Regular biography
Pedro Paredes is a Lecturer in the Department of Computer Science at Princeton University. Before joining Princeton, Paredes completed his PhD in Computer Science in 2022 at Carnegie Mellon University, where he was advised by Ryan O'Donnell. He holds bachelor's and master's degrees from the University of Porto in Portugal. His research interests include theoretical computer science, with a focus on spectral graph theory, pseudorandomness, coding theory, combinatorics, and quantum information theory. Paredes is recognized for his teaching excellence at Princeton University.
Scholar-generated biography
Pedro Paredes is a researcher at Princeton University with expertise in Spectral Graph Theory, Pseudorandomness, Coding Theory, Combinatorics, and Quantum Information Theory. His work explores subgraph counting, network motifs, and graphlets, with a focus on scalable algorithms for subgraph census computation. He has contributed to the development of explicit near-Ramanujan graphs, two-sided unique-neighbor expanders, and quantum LDPC codes. His research also includes spectral methods for random CSPs and fast streaming algorithms for small graph canonization. Paredes' publications highlight the intersection of combinatorics, graph theory, and theoretical computer science, emphasizing efficient algorithms and structural properties of complex networks.