Towards a faster network-centric subgraph census. - Pedro Paredes 002; Pedro Manuel Pinto Ribeiro (ASONAM, 2013)

A Scalable Parallel Approach for Subgraph Census Computation. - David Oliveira Aparício; Pedro Paredes 002; Pedro Manuel Pinto Ribeiro (Euro-Par Workshops (2), 2014)

Rand-FaSE: fast approximate subgraph census. - Pedro Paredes 002; Pedro Manuel Pinto Ribeiro (Soc. Netw. Anal. Min., 2015)

Large Scale Graph Representations for Subgraph Census. - Pedro Paredes 002; Pedro Manuel Pinto Ribeiro (NetSci-X, 2016)

The SDP Value for Random Two-Eigenvalue CSPs. - Sidhanth Mohanty; Ryan O'Donnell; Pedro Paredes 002 (STACS, 2020)

Spectrum Preserving Short Cycle Removal on Regular Graphs. - Pedro Paredes 002 (STACS, 2021)

Explicit Abelian Lifts and Quantum LDPC Codes. - Fernando Granha Jeronimo; Tushant Mittal; Ryan O'Donnell; Pedro Paredes 002; Madhur Tulsiani (ITCS, 2022)

A Survey on Subgraph Counting: Concepts, Algorithms, and Applications to Network Motifs and Graphlets. - Pedro Ribeiro 004; Pedro Paredes 002; Miguel E. P. Silva; David Aparício; Fernando M. A. Silva (ACM Comput. Surv., 2022)

Explicit Near-Ramanujan Graphs of Every Degree. - Sidhanth Mohanty; Ryan O'Donnell; Pedro Paredes 002 (SIAM J. Comput., 2022)

Explicit orthogonal and unitary designs. - Ryan O'Donnell; Rocco A. Servedio; Pedro Paredes 002 (FOCS, 2023)

Explicit Two-Sided Unique-Neighbor Expanders. - Jun-Ting Hsieh; Theo McKenzie; Sidhanth Mohanty; Pedro Paredes 002 (STOC, 2024)