default search action
Pedro Paredes 0002
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, PA, USA
- affiliation: University of Porto, DCC-FCUP & CRACS/INESC-TEC, Portugal
Other persons with the same name
- Pedro Paredes 0001 — Universidad Autónoma de Madrid, Spain
- Pedro Paredes 0003 — Universidad Carlos III de Madrid, Leganés, Spain
- Pedro Paredes 0004 — National Institute of Aerospace, Hampton, VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Jun-Ting Hsieh
, Theo McKenzie
Explicit Two-Sided Unique-Neighbor Expanders. STOC 2024: 788-799 - 2023
- [c8]Ryan O'Donnell, Rocco A. Servedio, Pedro Paredes
Explicit orthogonal and unitary designs. FOCS 2023: 1240-1260 - [i7]Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, Pedro Paredes:
Explicit two-sided unique-neighbor expanders. CoRR abs/2302.01212 (2023) - [i6]Ryan O'Donnell, Rocco A. Servedio, Pedro Paredes:
Explicit orthogonal and unitary designs. CoRR abs/2310.13597 (2023) - 2022
- [j3]Pedro Ribeiro
A Survey on Subgraph Counting: Concepts, Algorithms, and Applications to Network Motifs and Graphlets. ACM Comput. Surv. 54(2): 28:1-28:36 (2022) - [j2]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes:
Explicit Near-Ramanujan Graphs of Every Degree. SIAM J. Comput. 51(3): 20-1 (2022) - [c7]Fernando Granha Jeronimo, Tushant Mittal
Explicit Abelian Lifts and Quantum LDPC Codes. ITCS 2022: 88:1-88:21 - 2021
- [c6]Pedro Paredes
Spectrum Preserving Short Cycle Removal on Regular Graphs. STACS 2021: 55:1-55:19 - [i5]Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes, Madhur Tulsiani:
Explicit Abelian Lifts and Quantum LDPC Codes. CoRR abs/2112.01647 (2021) - 2020
- [c5]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes
The SDP Value for Random Two-Eigenvalue CSPs. STACS 2020: 50:1-50:45 - [c4]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes
Explicit near-Ramanujan graphs of every degree. STOC 2020: 510-523 - [i4]Pedro Paredes:
Spectrum preserving short cycle removal on regular graphs. CoRR abs/2002.07211 (2020)
2010 – 2019
- 2019
- [i3]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes:
The SDP value for random two-eigenvalue CSPs. CoRR abs/1906.06732 (2019) - [i2]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes:
Explicit near-Ramanujan graphs of every degree. CoRR abs/1909.06988 (2019) - [i1]Pedro Ribeiro
A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets. CoRR abs/1910.13011 (2019) - 2016
- [c3]Pedro Paredes, Pedro Manuel Pinto Ribeiro
Large Scale Graph Representations for Subgraph Census. NetSci-X 2016: 186-194 - 2015
- [j1]Pedro Paredes, Pedro Manuel Pinto Ribeiro
Rand-FaSE: fast approximate subgraph census. Soc. Netw. Anal. Min. 5(1): 17:1-17:18 (2015) - 2014
- [c2]David Oliveira Aparício
A Scalable Parallel Approach for Subgraph Census Computation. Euro-Par Workshops (2) 2014: 194-205 - 2013
- [c1]Pedro Paredes, Pedro Manuel Pinto Ribeiro
Towards a faster network-centric subgraph census. ASONAM 2013: 264-271
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: