default search action
Philippe Raipin Parvédy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i2]Duc-Thinh Ngo, Kandaraj Piamrat, Ons Aouedi, Thomas Hassan, Philippe Raipin Parvédy:
FLEXIBLE: Forecasting Cellular Traffic by Leveraging Explicit Inductive Graph-Based Learning. CoRR abs/2405.08843 (2024) - 2023
- [j9]Maria Massri, Zoltán Miklós, Philippe Raipin Parvédy, Pierre Meye, Amaury Bouchra Pilet
, Thomas Hassan:
RTGEN++: A Relative Temporal Graph GENerator. Future Gener. Comput. Syst. 146: 139-155 (2023) - [j8]Duc-Thinh Ngo
Empowering Digital Twin for Future Networks with Graph Neural Networks: Overview, Enabling Technologies, Challenges, and Opportunities. Future Internet 15(12): 377 (2023) - [j7]Maria Massri, Zoltán Miklós, Philippe Raipin Parvédy, Pierre Meye:
Clock-G: Temporal Graph Management System. Trans. Large Scale Data Knowl. Centered Syst. 54: 1-40 (2023) - [c22]Yu Liu, Shenle Pan, Pauline Folz, Thomas Hassan, Philippe Raipin Parvédy, Eric Ballot:
Smart City Logistics Enabled by Digital Twins and Semantic Technologies. SOHOMA 2023: 420-429 - 2022
- [c21]Maria Massri, Zoltán Miklós, Philippe Raipin Parvédy, Pierre Meye:
Clock-G: A temporal graph management system with space-efficient storage technique. ICDE 2022: 2263-2276 - 2021
- [j6]Mohammed Islam Naas, Laurent Lemarchand, Philippe Raipin Parvédy, Jalil Boukhobza
IoT Data Replication and Consistency Management in Fog Computing. J. Grid Comput. 19(3): 33 (2021) - [c20]Yunbo Li, Chuanyou Li, Anne-Cécile Orgerie, Philippe Raipin Parvédy:
WSGP: A Window-based Streaming Graph Partitioning Approach. CCGRID 2021: 586-595 - 2020
- [j5]Xavier Défago
Self-stabilizing gathering of mobile robots under crash or Byzantine faults. Distributed Comput. 33(5): 393-421 (2020)
2010 – 2019
- 2018
- [c19]Mohammed Islam Naas, Jalil Boukhobza
An Extension to iFogSim to Enable the Design of Data Placement Strategies. ICFEC 2018: 1-8 - [c18]Mohammed Islam Naas, Laurent Lemarchand, Jalil Boukhobza
A graph partitioning-based heuristic for runtime IoT data placement strategies in a fog infrastructure. SAC 2018: 767-774 - 2017
- [c17]Mohammed Islam Naas, Philippe Raipin Parvédy, Jalil Boukhobza
iFogStor: An IoT Data Placement Strategy for Fog Infrastructure. ICFEC 2017: 97-104 - 2016
- [i1]Xavier Défago, Maria Gradinariu Potop-Butucaru, Julien Clément, Stéphane Messika, Philippe Raipin Parvédy:
Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering - Feasibility Study -. CoRR abs/1602.05546 (2016) - 2014
- [c16]Pierre Meye, Philippe Raipin Parvédy, Frédéric Tronel
A Secure Two-Phase Data Deduplication Scheme. HPCC/CSS/ICESS 2014: 802-809 - [c15]Pierre Meye, Philippe Raipin Parvédy, Frederic Tronel
Mistore: A distributed storage system leveraging the DSL infrastructure of an ISP. HPCS 2014: 260-267 - 2010
- [j4]Philippe Raipin Parvédy, Michel Raynal, Corentin Travers:
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. Theory Comput. Syst. 47(1): 259-287 (2010)
2000 – 2009
- 2008
- [j3]Emmanuelle Anceaume, Eric Mourgaya, Philippe Raipin Parvédy:
Unreliable Distributed Timing Scrutinizer to Converge toward Decision Conditions. Stud. Inform. Univ. 6(2): 110-136 (2008) - 2006
- [j2]Ajoy Kumar Datta, Maria Gradinariu, Preethi Linga, Philippe Raipin Parvédy:
Self-* Distributed Query Region Covering in Sensor Networks. J. Aerosp. Comput. Inf. Commun. 3(8): 437-452 (2006) - [c14]Michel Hurfin, Jean-Pierre Le Narzul, Julien Pley, Philippe Raipin Parvédy:
Using Agreement Services in Grid Computing. ISPA Workshops 2006: 165-174 - [c13]Philippe Raipin Parvédy, Michel Raynal, Corentin Travers:
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. SIROCCO 2006: 182-196 - [c12]Xavier Défago
Fault-Tolerant and Self-stabilizing Mobile Robots Gathering. DISC 2006: 46-60 - 2005
- [c11]Philippe Raipin Parvédy, Michel Raynal, Corentin Travers:
Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes. PaCT 2005: 49-58 - [c10]Philippe Raipin Parvédy, Michel Raynal, Corentin Travers:
Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures. PRDC 2005: 23-30 - [c9]Ajoy Kumar Datta, Preethi Linga, Maria Gradinariu, Philippe Raipin Parvédy:
Self Distributed Query Region Covering in Sensor Networks. SRDS 2005: 50-59 - 2004
- [j1]Emmanuelle Anceaume, Eric Mourgaya, Philippe Raipin Parvédy:
Unreliable Distributed Timing Scrutinizer to Converge toward\\ Decision Conditions. Stud. Inform. Univ. 3(1): 19-42 (2004) - [c8]Philippe Raipin Parvédy, Michel Raynal:
Optimal early stopping uniform consensus in synchronous systems with process omission failures. SPAA 2004: 302-310 - 2003
- [c7]Achour Mostéfaoui, Eric Mourgaya, Philippe Raipin Parvédy, Michel Raynal:
Evaluating the Condition-Based Approach to Solve Consensus. DSN 2003: 541-550 - [c6]Philippe Raipin Parvédy, Michel Raynal:
Uniform Agreement Despite Process Omission Failures. IPDPS 2003: 212 - [c5]Fabrice Le Fessant, Philippe Raipin Parvédy, Michel Raynal:
Brief announcement: early decision despite general process omission failures. PODC 2003: 222 - [c4]Michel Hurfin, Jean-Pierre Le Narzul, Julien Pley, Philippe Raipin Parvédy:
A Fault-Tolerant Protocol for Resource Allocation in a Grid Dedicated to Genomic Applications. PPAM 2003: 1154-1161 - [c3]Philippe Raipin Parvédy, Michel Raynal:
Reliable Compare & Swap for Fault-Tolerant Synchronization. WORDS 2003: 50-55 - 2002
- [c2]Emmanuelle Anceaume, Michel Hurfin, Philippe Raipin Parvédy:
An Efficient Solution to the k-Set Agreement Problem. EDCC 2002: 62-78 - [c1]Emmanuelle Anceaume, Eric Mourgaya, Philippe Raipin Parvédy:
Converging toward Decision Conditions. OPODIS 2002: 51-62
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-08-05 21:12 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: