Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoger A. Pearce
- > Home > Persons > Roger A. Pearce
Publications
- 2023
[j7]Tahsin Reza, Trevor Steil, Geoffrey Sanders, Roger Pearce:
Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs. J. Parallel Distributed Comput. 181: 104717 (2023)- [c55]Keita Iwabuchi
, Trevor Steil, Benjamin Priest, Roger Pearce, Geoffrey Sanders:
Towards A Massive-scale Distributed Neighborhood Graph Construction. SC Workshops 2023: 728-738 - [i10]Michael Ostroski, Geoffrey Sanders, Trevor Steil, Roger Pearce:
Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs. CoRR abs/2311.10337 (2023) - 2022
- [c52]Tahsin Reza, Geoffrey Sanders, Roger Pearce:
Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs. IPDPS 2022: 549-559 - [p1]Geoffrey Sanders, Roger Pearce, Benjamin W. Priest, Trevor Steil:
Massive-Scale Distributed Triangle Computation and Applications. Massive Graph Analytics 2022: 127-158 - [i9]Tahsin Reza, Geoffrey Sanders, Roger Pearce:
Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs. CoRR abs/2205.14503 (2022) - 2021
- [j3]Tahsin Reza, Hassan Halawa, Matei Ripeanu, Geoffrey Sanders, Roger A. Pearce:
Scalable Pattern Matching in Metadata Graphs via Constraint Checking. ACM Trans. Parallel Comput. 8(1): 2:1-2:45 (2021) - [c51]Trevor Steil, Geoffrey Sanders, Roger Pearce:
Towards Distributed Square Counting in Large Graphs. HPEC 2021: 1-7 - [c48]Trevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce:
TriPoll: computing surveys of triangles in massive-scale temporal graphs with metadata. SC 2021: 67 - [i8]Trevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce:
TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata. CoRR abs/2107.12330 (2021) - 2020
- [c45]Trevor Steil, Scott McMillan, Geoffrey Sanders, Roger Pearce, Benjamin Priest:
Kronecker Graph Generation with Ground Truth for 4-Cycles and Dense Structure in Bipartite Graphs. IPDPS Workshops 2020: 237-246 - [c43]Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce:
Labeled Triangle Indexing for Efficiency Gains in Distributed Interactive Subgraph Search††This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344 (LLNL-CONF-814976). Experiments were performed at the Livermore Computing facility. IA3@SC 2020: 45-53 - [c42]Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce:
Towards Interactive Pattern Search in Massive Graphs. GRADES-NDA@SIGMOD 2020: 9:1-9:6 - [c41]Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce:
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees. SIGMOD Conference 2020: 1115-1131 - 2019
- [c40]Roger Pearce, Trevor Steil, Benjamin W. Priest, Geoffrey Sanders:
One Quadrillion Triangles Queried on One Million Processors. HPEC 2019: 1-5 - [c39]Benjamin Priest, Trevor Steil, Geoffrey Sanders, Roger Pearce:
You've Got Mail (YGM): Building Missing Asynchronous Communication Primitives. IPDPS Workshops 2019: 221-230 - [c38]Trevor Steil, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce, Timothy La Fond, Keita Iwabuchi:
Distributed Kronecker Graph Generation with Ground Truth of Many Graph Properties. IPDPS Workshops 2019: 251-260 - [i5]Tahsin Reza, Hassan Halawa, Matei Ripeanu, Geoffrey Sanders, Roger Pearce:
Scalable Pattern Matching in Metadata Graphs via Constraint Checking. CoRR abs/1912.08453 (2019) - 2018
- [c33]Keita Iwabuchi, Geoffrey Sanders, Keith Henderson, Roger Pearce:
Computing Exact Vertex Eccentricity on Massive-Scale Distributed Graphs. CLUSTER 2018: 257-267 - [c32]Roger Pearce, Geoffrey Sanders:
K-truss decomposition for Scale-Free Graphs at Scale in Distributed Memory. HPEC 2018: 1-6 - [c31]Benjamin W. Priest, Roger Pearce, Geoffrey Sanders:
Estimating Edge-Local Triangle Count Heavy Hitters in Edge-Linear Time and Almost-Vertex-Linear Space. HPEC 2018: 1-7 - [c30]Jeremy Kepner, Siddharth Samsi, William Arcand, David Bestor, Bill Bergeron, Tim Davis, Vijay Gadepally, Michael Houle, Matthew Hubbell, Hayden Jananthan, Michael Jones, Anna Klein, Peter Michaleas, Roger Pearce, Lauren Milechin, Julie Mullen, Andrew Prout, Antonio Rosa, Geoffrey Sanders, Charles Yee, Albert Reuther:
Design, Generation, and Validation of Extreme Scale Power-Law Graphs. IPDPS Workshops 2018: 279-286 - [c29]Geoffrey Sanders, Roger Pearce, Timothy La Fond, Jeremy Kepner:
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices. IPDPS Workshops 2018: 287-296 - [c27]Nicolas Tripoul, Hassan Halawa, Tahsin Reza, Geoffrey Sanders, Roger Pearce, Matei Ripeanu:
There are Trillions of Little Forks in the Road. Choose Wisely! - Estimating the Cost and Likelihood of Success of Constrained Walks to Optimize a Graph Pruning Pipeline. IA3@SC 2018: 20-27 - [c26]Tahsin Reza, Matei Ripeanu, Nicolas Tripoul, Geoffrey Sanders, Roger Pearce:
PruneJuice: pruning trillion-edge graphs to a precise pattern-matching solution. SC 2018: 21:1-21:17 - [i4]Jeremy Kepner, Siddharth Samsi, William Arcand, David Bestor, Bill Bergeron, Tim Davis, Vijay Gadepally, Michael Houle, Matthew Hubbell, Hayden Jananthan, Michael Jones, Anna Klein, Peter Michaleas, Roger Pearce, Lauren Milechin, Julie Mullen, Andrew Prout, Antonio Rosa, Geoffrey Sanders, Charles Yee, Albert Reuther:
Design, Generation, and Validation of Extreme Scale Power-Law Graphs. CoRR abs/1803.01281 (2018) - [i2]Geoffrey Sanders, Roger Pearce, Timothy La Fond, Jeremy Kepner:
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices. CoRR abs/1803.09021 (2018) - 2017
- [c25]Tahsin Reza, Christine Klymko, Matei Ripeanu, Geoffrey Sanders, Roger A. Pearce:
Towards Practical and Robust Labeled Pattern Matching in Trillion-Edge Graphs. CLUSTER 2017: 1-12
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-04-21 17:18 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:
