default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatei Ripeanu
- > Home > Persons > Matei Ripeanu
Publications
- 2021
[j30]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)- 2020
- [c91]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 - [c90]Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce:
Towards Interactive Pattern Search in Massive Graphs. GRADES-NDA@SIGMOD 2020: 9:1-9:6 - [c89]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
- [c83]Scott Sallinen, Roger Pearce, Matei Ripeanu:
Incremental Graph Processing for On-line Analytics. IPDPS 2019: 1007-1018 - [i24]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
- [c81]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 - [c80]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 - 2017
- [c77]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 - 2016
- [c69]Scott Sallinen, Keita Iwabuchi, Suraj Poudel, Maya B. Gokhale, Matei Ripeanu, Roger A. Pearce:
Graph colouring as a challenge problem for dynamic graph processing on distributed systems. SC 2016: 347-358
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-09-10 02:10 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:
