default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabien Mathieu
Person information
- affiliation: Swapcard Lab, Paris, France
- affiliation: Sorbonne University, LIP6, Paris, France
- affiliation (PhD 2004): Montpellier 2 University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c36]Emma Caizergues, François Durand, Fabien Mathieu:
Anytime Sorting Algorithms. IJCAI 2024: 7101-7108- [i27]Emma Caizergues, François Durand, Fabien Mathieu:
Anytime Sorting Algorithms (Extended Version). CoRR abs/2405.08564 (2024) - 2023
- [c35]Théo Delemazure, François Durand, Fabien Mathieu:
Aggregating Correlated Estimations with (Almost) no Training. ECAI 2023: 541-548 - [c34]Emma Caizergues, François Durand, Fabien Mathieu:
L'abus de comparaisons est mauvais pour la santé. JIAF 2023: 159-168 - [i26]Emma Caizergues, François Durand, Fabien Mathieu:
Sorting wild pigs. CoRR abs/2304.11952 (2023) - [i25]Theo Delemazure, François Durand, Fabien Mathieu:
Aggregating Correlated Estimations with (Almost) no Training. CoRR abs/2309.02005 (2023) - 2022
- [c33]Fabien Mathieu
, Sébastien Tixeuil:
Fun with FUN. FUN 2022: 21:1-21:13 - 2021
- [i24]Céline Comte, Fabien Mathieu, Ana Busic:
Stochastic dynamic matching: A mixed graph-theory and linear-algebra approach. CoRR abs/2112.14457 (2021) - 2020
- [j8]Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc:
Deciding and verifying network properties locally with few output bits. Distributed Comput. 33(2): 169-187 (2020) - [j7]Céline Comte, Fabien Mathieu:
Kleinberg's grid unchained. Theor. Comput. Sci. 826-827: 25-39 (2020)
2010 – 2019
- 2018
- [j6]Thi Mai Trang Nguyen, Lyes Hamidouche, Fabien Mathieu, Sébastien Monnet, Syphax Iskounen:
SDN-based Wi-Fi Direct clustering for cloud access in campus networks. Ann. des Télécommunications 73(3-4): 239-249 (2018) - [c32]Thomas Bonald, Céline Comte, Fabien Mathieu:
Performance of Balanced Fairness in Resource Pools: A Recursive Approach. SIGMETRICS (Abstracts) 2018: 125-127 - [c31]Anne Bouillard, Céline Comte, Elie de Panafieu, Fabien Mathieu:
Of Kernels and Queues: When Network Calculus Meets Analytic Combinatorics. ITC (2) 2018: 49-54 - [i23]Laurent Viennot, Yacine Boufkhad, Leonardo Linguaglossa, Fabien Mathieu, Diego Perino:
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets. CoRR abs/1809.01896 (2018) - [i22]Anne Bouillard, Céline Comte, Elie de Panafieu, Fabien Mathieu:
Of Kernels and Queues: when network calculus meets analytic combinatorics. CoRR abs/1810.04875 (2018) - 2017
- [j5]Thomas Bonald, Céline Comte, Fabien Mathieu:
Performance of Balanced Fairness in Resource Pools: A Recursive Approach. Proc. ACM Meas. Anal. Comput. Syst. 1(2): 41:1-41:25 (2017) - [j4]François Baccelli, Fabien Mathieu, Ilkka Norros:
Mutual service processes in Euclidean spaces: existence and ergodicity. Queueing Syst. Theory Appl. 86(1-2): 95-140 (2017) - [c30]Philippe Sehier, Anne Bouillard, Fabien Mathieu, Thomas Deiß:
Transport Network Design for FrontHaul. VTC Fall 2017: 1-5 - [i21]Céline Comte, Fabien Mathieu, Thomas Bonald:
Performance of Balanced Fairness in Resource Pools: A Recursive Approach. CoRR abs/1711.02880 (2017) - [i20]Rim Kaddah, Daniel Kofman, Fabien Mathieu, Michal Pióro:
Semi-Distributed Demand Response Solutions for Smart Homes. CoRR abs/1711.11390 (2017) - 2016
- [j3]The Dang Huynh, Fabien Mathieu, Laurent Viennot:
LiveRank: How to Refresh Old Datasets. Internet Math. 12(1-2): 68-84 (2016) - [c29]François Durand, Fabien Mathieu, Ludovic Noirie:
SVVAMP: Simulator of Various Voting Algorithms in Manipulating Populations. AAAI 2016: 4353-4354 - [c28]François Durand, Fabien Mathieu, Ludovic Noirie:
Can a Condorcet Rule Have a Low Coalitional Manipulability? ECAI 2016: 707-715 - [c27]Fabien Mathieu:
Kleinberg's Grid Reloaded. OPODIS 2016: 21:1-21:15 - [i19]The Dang Huynh, Fabien Mathieu, Laurent Viennot:
LiveRank: How to Refresh Old Datasets. CoRR abs/1601.01191 (2016) - [i18]Yacine Boufkhad, Ricardo De La Paz, Leonardo Linguaglossa, Fabien Mathieu, Diego Perino, Laurent Viennot:
Forwarding Tables Verification through Representative Header Sets. CoRR abs/1601.07002 (2016) - [i17]Fabien Mathieu:
Kleinberg's Grid Reloaded. CoRR abs/1612.05760 (2016) - 2015
- [c26]François Durand, Benoît Kloeckner, Fabien Mathieu, Ludovic Noirie:
Geometry on the Utility Space. ADT 2015: 189-204 - [i16]Dohy Hong, The Dang Huynh, Fabien Mathieu:
D-Iteration: diffusion approach for solving PageRank. CoRR abs/1501.06350 (2015) - [i15]François Durand, Benoît Kloeckner, Fabien Mathieu, Ludovic Noirie:
Geometry on the Utility Space. CoRR abs/1511.01303 (2015) - 2014
- [c25]Dario Rossi, Guilhem Pujol, Xiao Wang, Fabien Mathieu:
Peeking through the BitTorrent Seedbox Hosting Ecosystem. TMA 2014: 115-126 - [c24]The Dang Huynh, Fabien Mathieu, Laurent Viennot:
LiveRank: How to Refresh Old Crawls. WAW 2014: 148-160 - [c23]Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu:
Distributedly Testing Cycle-Freeness. WG 2014: 15-28 - 2013
- [c22]François Durand, Fabien Mathieu, Ludovic Noirie:
On the manipulability of voting systems: application to multi-operator networks. CNSM 2013: 292-297 - [c21]François Baccelli, Fabien Mathieu, Ilkka Norros, Rémi Varloot:
Can P2P networks be super-scalable? INFOCOM 2013: 1753-1761 - [i14]Dohy Hong, Fabien Mathieu, Gérard Burnside:
Convergence of the D-iteration algorithm: convergence rate and asynchronous distributed scheme. CoRR abs/1301.3007 (2013) - [i13]François Baccelli, Fabien Mathieu, Ilkka Norros, Rémi Varloot:
Can P2P Networks be Super-Scalable? CoRR abs/1304.6489 (2013) - 2012
- [c20]Yannick Carlinet, The Dang Huynh, Bruno Kauffmann, Fabien Mathieu, Ludovic Noirie, Sébastien Tixeuil:
Four months in daily motion: Dissecting user video requests. IWCMC 2012: 613-618 - [i12]François Durand, Fabien Mathieu, Ludovic Noirie:
On the Manipulability of Voting Systems: Application to Multi-Carrier Networks. CoRR abs/1204.6455 (2012) - 2011
- [j2]Robert Birke, Emilio Leonardi, Marco Mellia, Arpad Bakay, Tivadar Szemethy, Csaba Király, Renato Lo Cigno, Fabien Mathieu, Luca Muscariello, Saverio Niccolini, Jan Seedorf, Giuseppe Tropea:
Architecture of a network-aware P2P-TV application: the NAPA-WINE approach. IEEE Commun. Mag. 49(6): 154-163 (2011) - [c19]Fabien Mathieu:
Live seeding: Performance bounds of seeders for P2P live streaming. Peer-to-Peer Computing 2011: 172-181 - [i11]Fabien Mathieu:
On Using Seeders for P2P Live Streaming. CoRR abs/1104.4904 (2011) - [i10]François Baccelli, Fabien Mathieu, Ilkka Norros:
Performance of P2P Networks with Spatial Interactions of Peers. CoRR abs/1108.4129 (2011) - 2010
- [c18]Nidhi Hegde, Fabien Mathieu, Diego Perino:
On Optimizing for Epidemic Live Streaming. ICC 2010: 1-5 - [c17]Fabien Mathieu, Laurent Viennot:
Local Aspects of the Global Ranking of Web Pages. IICS 2010: 493-506 - [c16]Fabien Mathieu:
Heterogeneity in data-driven live streaming: Blessing or curse? IPDPS Workshops 2010: 1-8 - [c15]Fabien Mathieu, Diego Perino:
On resource aware algorithms in epidemic live streaming. ITC 2010: 1-8
2000 – 2009
- 2009
- [b2]Fabien Mathieu:
Autour du pair-à-pair : distribution de contenus, réseaux à préférences acycliques. Pierre and Marie Curie University, Paris, France, 2009 - [c14]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
Fine Tuning of a Distributed VoD System. ICCCN 2009: 1-7 - [c13]Fabien Mathieu, Gheorghe Postelnicu, Julien Reynier:
The Stable Configuration of Acyclic Preference-Based Systems. INFOCOM 2009: 1440-1448 - [c12]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability. IPDPS 2009: 1-10 - [i9]Nidhi Hegde, Fabien Mathieu, Diego Perino:
Size Does Matter (in P2P Live Streaming). CoRR abs/0909.1713 (2009) - [i8]Fabien Mathieu, Diego Perino:
On Resource Aware Algorithms in Epidemic Live Streaming. CoRR abs/0909.1789 (2009) - [i7]Fabien Mathieu:
Heterogeneity in Distributed Live Streaming: Blessing or Curse? CoRR abs/0909.1792 (2009) - 2008
- [j1]Fabien Mathieu:
Self-stabilization in preference-based systems. Peer-to-Peer Netw. Appl. 1(2): 104-121 (2008) - [c11]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
Achievable catalog size in peer-to-peer video-on-demand systems. IPTPS 2008: 4 - [c10]Farid Benbadis, Fabien Mathieu, Nidhi Hegde, Diego Perino:
Playing with the Bandwidth Conservation Law. Peer-to-Peer Computing 2008: 140-149 - [c9]Thomas Bonald, Laurent Massoulié, Fabien Mathieu, Diego Perino, Andrew Twigg:
Epidemic live streaming: optimal performance trade-offs. SIGMETRICS 2008: 325-336 - [i6]Bruno Gaume, Fabien Mathieu:
From Random Graph to Small World by Wandering. CoRR abs/0804.0149 (2008) - [i5]Laurent Viennot, Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino:
Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms. CoRR abs/0804.0743 (2008) - [i4]Fabien Mathieu, Gheorghe Postelnicu, Julien Reynier:
The stable configuration in acyclic preference-based systems. CoRR abs/0809.0833 (2008) - 2007
- [c8]Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier, Laurent Viennot:
Acyclic Preference Systems in P2P Networks. Euro-Par 2007: 825-834 - [c7]Anh-Tuan Gai, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier:
Stratification in P2P Networks: Application to BitTorrent. ICDCS 2007: 30 - [c6]Fabien Mathieu:
Self-Stabilization in Preference-Based Networks. Peer-to-Peer Computing 2007: 203-210 - [c5]Fabien Mathieu:
Upper Bounds for Stabilization in Acyclic Preference-Based Systems. SSS 2007: 372-382 - [i3]Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier, Laurent Viennot:
Acyclic Preference Systems in P2P Networks. CoRR abs/0704.3904 (2007) - 2006
- [c4]Fabien Mathieu, Julien Reynier:
Missing Piece Issue and Upload Strategies in Flashcrowds and P2P-assisted Filesharing. AICT/ICIW 2006: 112 - [i2]Dmitry Lebedev, Fabien Mathieu, Laurent Viennot, Anh-Tuan Gai, Julien Reynier, Fabien de Montgolfier:
On Using Matching Theory to Understand P2P Network Design. CoRR abs/cs/0612108 (2006) - [i1]Anh-Tuan Gai, Fabien Mathieu, Julien Reynier, Fabien de Montgolfier:
Stratification in P2P Networks - Application to BitTorrent. CoRR abs/cs/0612130 (2006) - 2005
- [c3]Mohamed Bouklit, Fabien Mathieu:
BackRank: an alternative for PageRank? WWW (Special interest tracks and posters) 2005: 1122-1123 - 2004
- [b1]Fabien Mathieu:
Graphes du Web, Mesures d'importance à la PageRank. (Web Graphs, PageRank-like Measurements). Montpellier 2 University, France, 2004 - [c2]Fabien Mathieu, Mohamed Bouklit:
The effect of the back button in a random walk: application for pagerank. WWW (Alternate Track Papers & Posters) 2004: 370-371 - 2003
- [c1]Fabien Mathieu, Laurent Viennot:
Local Structure in the Web. WWW (Posters) 2003
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 2026-05-29 00:04 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:
