default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Ruas
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Rémy Raes, Olivier Ruas, Adrien Luxey-Bitri, Romain Rouvoy:
Compact Storage of Data Streams in Mobile Devices. DAIS 2024: 45-61- 2023
- [j2]Rachid Guerraoui, Anne-Marie Kermarrec
, Guilhem Niot, Olivier Ruas, François Taïani:
GoldFinger: Fast & Approximate Jaccard for Efficient KNN Graph Constructions. IEEE Trans. Knowl. Data Eng. 35(11): 11461-11475 (2023) - [i3]Michal Bartoszkiewicz, Jan Chorowski, Adrian Kosowski, Jakub Kowalski, Sergey Kulik, Mateusz Lewandowski, Krzysztof Nowicki, Kamil Piechowiak, Olivier Ruas, Zuzanna Stamirowska, Przemyslaw Uznanski:
Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications. CoRR abs/2307.13116 (2023) - [i2]Lauric Desauw, Adrien Luxey-Bitri, Rémy Raes, Romain Rouvoy, Olivier Ruas, Walter Rudametkin:
A critical review of mobile device-to-device communication. CoRR abs/2309.11871 (2023) - 2022
- [j1]Yuhan Wu, Jintao He, Shen Yan, Jianyu Wu, Tong Yang, Olivier Ruas, Gong Zhang, Bin Cui:
Elastic Bloom Filter: Deletable and Expandable Filter Using Elastic Fingerprints. IEEE Trans. Computers 71(4): 984-991 (2022) - 2021
- [c6]George Giakkoupis, Anne-Marie Kermarrec, Olivier Ruas, François Taïani:
Cluster-and-Conquer: When Randomness Meets Graph Locality. ICDE 2021: 2027-2032 - 2020
- [c5]Yibo Yan, Cheng Chen, Huiping Lin, Olivier Ruas, Tengjiao Wang, Tong Yang:
Priority-Aware Per-flow Measurement using Cuckoo Sketch. Networking 2020: 622-624 - [c4]Wentao Zhang, Xupeng Miao, Yingxia Shao, Jiawei Jiang, Lei Chen, Olivier Ruas, Bin Cui:
Reliable Data Distillation on Graph Convolutional Network. SIGMOD Conference 2020: 1399-1414 - [c3]Rachid Guerraoui, Anne-Marie Kermarrec, Olivier Ruas, François Taïani:
Smaller, Faster & Lighter KNN Graph Constructions. WWW 2020: 1060-1070 - [i1]George Giakkoupis, Anne-Marie Kermarrec, Olivier Ruas, François Taïani:
Cluster-and-Conquer: When Randomness Meets Graph Locality. CoRR abs/2010.11497 (2020)
2010 – 2019
- 2019
- [c2]Rachid Guerraoui, Anne-Marie Kermarrec, Olivier Ruas, François Taïani:
Fingerprinting Big Data: The Case of KNN Graph Construction. ICDE 2019: 1738-1741 - 2018
- [b1]Olivier Ruas:
The many faces of approximation in KNN graph computation. (Les multiples facettes des approximations dans la construction de graphes KNN). University of Rennes 1, France, 2018 - [c1]Anne-Marie Kermarrec, Olivier Ruas, François Taïani:
Nobody Cares if You Liked Star Wars: KNN Graph Construction on the Cheap. Euro-Par 2018: 419-431
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 22:09 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:
