Pedro Paredes

Orcid: 0009-0008-2556-0967

Affiliations:
  • Carnegie Mellon University, Pittsburgh, PA, USA
  • University of Porto, DCC-FCUP & CRACS/INESC-TEC, Portugal


According to our database1, Pedro Paredes authored at least 11 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Explicit Two-Sided Unique-Neighbor Expanders.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Explicit orthogonal and unitary designs.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Explicit Near-Ramanujan Graphs of Every Degree.
SIAM J. Comput., June, 2022

A Survey on Subgraph Counting: Concepts, Algorithms, and Applications to Network Motifs and Graphlets.
ACM Comput. Surv., 2022

Explicit Abelian Lifts and Quantum LDPC Codes.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Spectrum Preserving Short Cycle Removal on Regular Graphs.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020
The SDP Value for Random Two-Eigenvalue CSPs.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2016
Large Scale Graph Representations for Subgraph Census.
Proceedings of the Advances in Network Science, 2016

2015
Rand-FaSE: fast approximate subgraph census.
Soc. Netw. Anal. Min., 2015

2014
A Scalable Parallel Approach for Subgraph Census Computation.
Proceedings of the Euro-Par 2014: Parallel Processing Workshops, 2014

2013
Towards a faster network-centric subgraph census.
Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013


  Loading...