default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranck Butelle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c14]Franck Butelle, Camille Coti:
Distributed Snapshot for Rollback-Recovery with One-Sided Communications. HPCS 2018: 614-620- 2017
- [c13]Camille Coti, Étienne Leclercq, Frédéric Roupin, Franck Butelle:
Solving 0-1 Quadratic Problems with Two-Level Parallelization of the BiqCrunch Solver. FedCSIS 2017: 445-452 - 2016
- [j7]Franck Butelle, Laurent Alfandari, Camille Coti
, Lucian Finta, Lucas Létocart, Gérard Plateau, Frédéric Roupin, Antoine Rozenknop, Roberto Wolfler Calvo:
Fast machine reassignment. Ann. Oper. Res. 242(1): 133-160 (2016) - 2013
- [i4]Marc Bui, Franck Butelle, Christian Lavault:
A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree. CoRR abs/1312.1961 (2013) - [i3]Franck Butelle, Christian Lavault, Marc Bui:
A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm. CoRR abs/1312.3303 (2013) - 2012
- [j6]Franck Butelle, Camille Coti:
Data Coherency in Distributed Shared Memory. Int. J. Netw. Comput. 2(1): 117-130 (2012) - 2011
- [j5]Heithem Abbes, Franck Butelle, Christophe Cérin:
Parallelization of Littlewood-Richardson Coefficients Computation and its Integration into the BonjourGrid Meta-Desktop Grid Middleware. Int. J. Grid High Perform. Comput. 3(4): 71-86 (2011) - [c12]Franck Butelle, Camille Coti:
A Model for Coherent Distributed Memory for Race Condition Detection. IPDPS Workshops 2011: 584-590 - [i2]Franck Butelle, Camille Coti:
A Model for Coherent Distributed Memory For Race Condition Detection. CoRR abs/1101.4193 (2011) - 2010
- [c11]Franck Butelle, Florent Hivert, Micaela Mayero, Frédéric Toumazet:
Formal Proof of SCHUR Conjugate Function. AISC/MKM/Calculemus 2010: 158-171 - [c10]Heithem Abbes, Franck Butelle, Christophe Cérin:
Multithreading of Kostka Numbers Computation for the BonjourGrid Meta-desktop Grid Middleware. ICA3PP (1) 2010: 287-298 - [i1]Franck Butelle, Florent Hivert, Micaela Mayero, Frédéric Toumazet:
Formal Proof of SCHUR Conjugate Function. CoRR abs/1004.5034 (2010)
2000 – 2009
- 2007
- [b2]Franck Butelle:
Contribution à l'algorithmique distribuée : arbres et ordonnancement. (Contribution to distributed algorithmic : trees and scheduling). Paris 13 University, France, 2007 - [c9]Mourad Hakem, Franck Butelle:
Reliability and Scheduling on Systems Subject to Failures. ICPP 2007: 38 - [c8]Franck Butelle, Mourad Hakem, Lucian Finta:
Real-Time Distributed Scheduling of Precedence Graphs on Arbitrary Wide Networks. IPDPS 2007: 1-6 - 2006
- [j4]Mourad Hakem, Franck Butelle:
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors. Int. J. Found. Comput. Sci. 17(2): 287-302 (2006) - 2005
- [c7]Mourad Hakem, Franck Butelle:
Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors. IPDPS 2005 - [c6]Mourad Hakem, Franck Butelle:
Efficient Critical Task Scheduling Parallel Programs on a Bounded Number of Processors. IASTED PDCS 2005: 139-144 - 2004
- [j3]Lélia Blin, Franck Butelle:
The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs. Int. J. Found. Comput. Sci. 15(3): 507-516 (2004) - [j2]Marc Bui, Franck Butelle, Christian Lavault:
A distributed algorithm for constructing a minimum diameter spanning tree. J. Parallel Distributed Comput. 64(5): 571-577 (2004) - [c5]Mourad Hakem, Franck Butelle:
A New On-Line Scheduling Algorithm for Distributed Real-Time System. ISSADS 2004: 241-251 - 2003
- [j1]Chantal Morley, Bruno Defude, Franck Butelle, Daniel Lang:
Les outils du commerce électronique. Ann. des Télécommunications 58(1-2): 8-58 (2003) - [c4]Lélia Blin, Franck Butelle:
The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. IPDPS 2003: 161 - 2001
- [c3]Lélia Blin, Franck Butelle:
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. OPODIS 2001: 113-124 - 2000
- [e1]Franck Butelle:
Procedings of the 4th International Conference on Principles of Distributed Systems, OPODIS 2000, Paris, France, December 20-22, 2000. Studia Informatica Universalis, Suger, Saint-Denis, rue Catulienne, France 2000, ISBN 2-912590-11-6 [contents]
1990 – 1999
- 1998
- [c2]Franck Butelle, Christian Lavault:
Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems. OPODIS 1998: 77-88 - 1995
- [c1]Franck Butelle, Christian Lavault, Marc Bui:
A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract). WDAG 1995: 257-272 - 1994
- [b1]Franck Butelle:
Contribution à l'algorithmique distribuée de contrôle : arbres couvrants avec et sans containtes. Paris 8 University, Saint-Denis, France, 1994
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-04-24 23:07 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:
