default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Kauffmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j5]Felipe Olmos, Bruno Kauffmann:
An Inverse Problem Approach for Content Popularity Estimation. EAI Endorsed Trans. Scalable Inf. Syst. 3(9): e3 (2016)- 2015
- [i3]Felipe Olmos, Bruno Kauffmann:
An Inverse Problem Approach for Content Popularity Estimation. CoRR abs/1510.07480 (2015) - 2014
- [j4]Massimo Gallo, Bruno Kauffmann
, Luca Muscariello, Alain Simonian, Christian Tanguy:
Performance evaluation of the random replacement policy for networks of caches. Perform. Evaluation 72: 16-36 (2014) - [c6]Felipe Olmos, Bruno Kauffmann, Alain Simonian, Yannick Carlinet:
Catalog dynamics: Impact of content publishing and perishing on the performance of a LRU cache. ITC 2014: 1-9 - [i2]Felipe Olmos, Bruno Kauffmann, Alain Simonian, Yannick Carlinet:
Catalog Dynamics: Impact of Content Publishing and Perishing on the Performance of a LRU Cache. CoRR abs/1403.5479 (2014) - 2013
- [c5]Fabrice Guillemin, Bruno Kauffmann, Stephanie Moteau, Alain Simonian:
Experimental analysis of caching efficiency for YouTube traffic in an ISP network. ITC 2013: 1-9 - 2012
- [c4]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 - [c3]Massimo Gallo, Bruno Kauffmann, Luca Muscariello, Alain Simonian, Christian Tanguy:
Performance evaluation of the random replacement policy for networks of caches. SIGMETRICS 2012: 395-396 - [c2]Bruno Kauffmann:
Inverse problems in bandwidth sharing networks. ITC 2012: 1-8 - [i1]Massimo Gallo, Bruno Kauffmann, Luca Muscariello, Alain Simonian, Christian Tanguy:
Performance Evaluation of the Random Replacement Policy for Networks of Caches. CoRR abs/1202.4880 (2012) - 2011
- [b1]Bruno Kauffmann:
Inverse problems in networks (Problèmes inverses dans les réseaux). Pierre and Marie Curie University, Paris, France, 2011 - 2010
- [j3]Furcy Pin, Darryl Veitch, Bruno Kauffmann:
Statistical estimation of delays in a multicast tree using accelerated EM. Queueing Syst. Theory Appl. 66(4): 369-412 (2010)
2000 – 2009
- 2009
- [j2]François Baccelli, Bruno Kauffmann, Darryl Veitch:
Inverse problems in queueing theory and Internet probing. Queueing Syst. Theory Appl. 63(1-4): 59-107 (2009) - [j1]François Baccelli, Bruno Kauffmann, Darryl Veitch:
Towards multihop available bandwidth estimation. SIGMETRICS Perform. Evaluation Rev. 37(2): 83-84 (2009) - 2007
- [c1]Bruno Kauffmann, François Baccelli, Augustin Chaintreau, Vivek Mhatre, Konstantina Papagiannaki, Christophe Diot:
Measurement-Based Self Organization of Interfering 802.11 Wireless Access Networks. INFOCOM 2007: 1451-1459
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:19 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:
