Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
start [2018/01/19 12:23] Nicolas Schabanel |
start [2018/01/19 12:28] Nicolas Schabanel |
||
---|---|---|---|
Line 6: | Line 6: | ||
==== Nicolas Schabanel === | ==== Nicolas Schabanel === | ||
- | === Directeur de recherches CNRS == | + | === Directeur de recherches CNRS ==con |
**[[http://www.cnrs.fr/|CNRS]] - [[http://www.ens-lyon.fr/LIP|LIP]]**\\ | **[[http://www.cnrs.fr/|CNRS]] - [[http://www.ens-lyon.fr/LIP|LIP]]**\\ | ||
**[[http://www.ens-lyon.fr/|École Normale Supérieure de Lyon]]**\\ | **[[http://www.ens-lyon.fr/|École Normale Supérieure de Lyon]]**\\ | ||
Line 80: | Line 80: | ||
* **2010** | * **2010** | ||
* **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2010/2010-WAOA-PruhsRobertSchabanel.pdf|Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability]]**\\ with Kirk Pruhs and Julien Robert. //WAOA,// LNCS 6534:237–248, 2010. | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2010/2010-WAOA-PruhsRobertSchabanel.pdf|Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability]]**\\ with Kirk Pruhs and Julien Robert. //WAOA,// LNCS 6534:237–248, 2010. | ||
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//HdR-Schabanel.pdf|Systèmes complexes & algorithmes]]** (in French)\\ //Habilitation à diriger des recherches,// Université Paris Diderot, 2010. http://perso.ens-lyon.fr/nicolas.schabanel/publications//HDR-Defense-Schabanel.pdf|Slides}} | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2010/HdR-Schabanel.pdf|Systèmes complexes & algorithmes]]** (in French)\\ //Habilitation à diriger des recherches,// Université Paris Diderot, 2010. http://perso.ens-lyon.fr/nicolas.schabanel/publications/2010/HDR-Defense-Schabanel.pdf|Slides}} |
* **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2010/2010-DMTCS-RegnaultSchabanelThierry.pdf|On the analysis of “simple” 2D stochastic cellular automata]]**\\ with Damien Regnault and Éric Thierry. //Invited publication to the special issue of DMTCS in honor of Philippe Flajolet,// 12(2):263–294, 2009. | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2010/2010-DMTCS-RegnaultSchabanelThierry.pdf|On the analysis of “simple” 2D stochastic cellular automata]]**\\ with Damien Regnault and Éric Thierry. //Invited publication to the special issue of DMTCS in honor of Philippe Flajolet,// 12(2):263–294, 2009. | ||
Line 111: | Line 111: | ||
* **2004** | * **2004** | ||
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2004/2004-LS-ICALP2004.pdf|Almost optimal decentralized routing in long-range contact networks]]**\\ with Emmanuelle Lebhar. //ICALP,// Turku, Finland, july 2004. http://perso.ens-lyon.fr/nicolas.schabanel/publications/2004/2004-LS-ICALP2004-FULL.pdf|Full}} | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2004/2004-LS-ICALP2004.pdf|Almost optimal decentralized routing in long-range contact networks]]**\\ with Emmanuelle Lebhar. //ICALP,// Turku, Finland, july 2004. [[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2004/2004-LS-ICALP2004-FULL.pdf|Full]] |
* **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2004/2004-AS-EPJB.pdf|An Internet Graph Model based on trade-off optimization]]**\\ with José-Ignacio Alvarez-Hamelin. //European Physical Journal B (EPJB),// 38(2):231-238, 2004.\\ //A preliminary version of the paper was presented at the Conference on Growing Networks and Graphs in Statistical Physics, Finance, Biology and Social Systems, Rome, 1-5 Sep. 2003.// | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2004/2004-AS-EPJB.pdf|An Internet Graph Model based on trade-off optimization]]**\\ with José-Ignacio Alvarez-Hamelin. //European Physical Journal B (EPJB),// 38(2):231-238, 2004.\\ //A preliminary version of the paper was presented at the Conference on Growing Networks and Graphs in Statistical Physics, Finance, Biology and Social Systems, Rome, 1-5 Sep. 2003.// | ||
* **2003** | * **2003** | ||
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//KS03.pdf|The data broadcast problem with non-uniform transmission times]]**\\ with Claire Kenyon. //Algorithmica,// 35:146-175, February 2003.\\ //A preliminary version of this paper was published in SODA 1999, pages 547-556.// | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2003/KS03.pdf|The data broadcast problem with non-uniform transmission times]]**\\ with Claire Kenyon. //Algorithmica,// 35:146-175, February 2003.\\ //A preliminary version of this paper was published in SODA 1999, pages 547-556.// |
* **2000** | * **2000** | ||
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//Schabanel-PhDThesis.ps.gz|Algorithmes d'approximation pour les télécommunications sans fil : Ordonnancement pour la dissémination de données et Allocation statique de fréquences]]** (in French) http://perso.ens-lyon.fr/nicolas.schabanel/publications//Schabanel-PhDThesis.pdf|PDF}}\\ //PhD Thesis,// École normale supérieure de Lyon, 2000. Advisors: Claire Kenyon and Stéphane Ubéda (local advisor). | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2000/Schabanel-PhDThesis.ps.gz|Algorithmes d'approximation pour les télécommunications sans fil : Ordonnancement pour la dissémination de données et Allocation statique de fréquences]]** (in French) [[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2000/Schabanel-PhDThesis.pdf|PDF]]\\ //PhD Thesis,// École normale supérieure de Lyon, 2000. Advisors: Claire Kenyon and Stéphane Ubéda (local advisor). |
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//KSY2000.pdf|Polynomial-Time Approximation Scheme for Data Broadcast]]**\\ with Claire Kenyon and Neal E. Young. //STOC,// pages 659-666, May 2000. | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2000/KSY2000.pdf|Polynomial-Time Approximation Scheme for Data Broadcast]]**\\ with Claire Kenyon and Neal E. Young. //STOC,// pages 659-666, May 2000. |
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//S00.pdf|The databroadcast problem with preemption]]**\\ //STACS,// LNCS 1770:181-192, Lille, February 2000. http://perso.ens-lyon.fr/nicolas.schabanel/publications//S99-RR1999-49.ps.gz|Full}} | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2000/S00.pdf|The databroadcast problem with preemption]]**\\ //STACS,// LNCS 1770:181-192, Lille, February 2000. [[http://perso.ens-lyon.fr/nicolas.schabanel/publications/1999/S99-RR1999-49.ps.gz|Full]] |
* **1999** | * **1999** | ||
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//KS99.pdf|The data broadcast problem with non-uniform transmission times]]**\\ with Claire Kenyon. //SODA,// pp.547–556. SIAM, Jan. 1999. | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/1999/KS99.pdf|The data broadcast problem with non-uniform transmission times]]**\\ with Claire Kenyon. //SODA,// pp.547–556. SIAM, Jan. 1999. |
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//FS99.ps.gz|A randomized BSP algorithm for the maximal independent set problem]]**\\ with Afonso Ferreira. In //PPL,// 9(3):411-422, 1999.\\ //A preliminary version was published in I-SPAN'99, pages 284-289, june 1999.// | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/1999/FS99.ps.gz|A randomized BSP algorithm for the maximal independent set problem]]**\\ with Afonso Ferreira. In //PPL,// 9(3):411-422, 1999.\\ //A preliminary version was published in I-SPAN'99, pages 284-289, june 1999.// |
* **1998 and beyond** | * **1998 and beyond** | ||
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//SUZ98.ps.gz|Parallel algorithm for the optimization of the span of an hexagonal frequency planning graph]]**\\ with Stéphane Ubéda and Janez Žerovnik. //Telepar,// pages 237-241, Boston, Avril 1998. SCS. | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/1998/SUZ98.ps.gz|Parallel algorithm for the optimization of the span of an hexagonal frequency planning graph]]**\\ with Stéphane Ubéda and Janez Žerovnik. //Telepar,// pages 237-241, Boston, Avril 1998. SCS. |
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//BGMS97-RR1997-13.ps.gz|Concurrent rebalancing of AVL trees: a fine-grained approach]]**\\ with Luc Bougé, J. Gabarro, and X. Messeguer. //Euro-Par,// LNCS 1300:421-429, Août 1997. http://perso.ens-lyon.fr/nicolas.schabanel/publications//BGMS98-RR1998-18.ps.gz|Full]] | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/1997/BGMS97-RR1997-13.ps.gz|Concurrent rebalancing of AVL trees: a fine-grained approach]]**\\ with Luc Bougé, J. Gabarro, and X. Messeguer. //Euro-Par,// LNCS 1300:421-429, Août 1997. [[http://perso.ens-lyon.fr/nicolas.schabanel/publications/1998/BGMS98-RR1998-18.ps.gz|Full]] |
- | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications//ALST96.ps.gz|Basic linear algebra operations in SLI arithmetic]]**\\ with M. A. Anuta, D. W. Lozier, and Peter R. Turner. //Euro-Par,// LNCS 1124:193-202, Août 1996. | + | * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/1996/ALST96.ps.gz|Basic linear algebra operations in SLI arithmetic]]**\\ with M. A. Anuta, D. W. Lozier, and Peter R. Turner. //Euro-Par,// LNCS 1124:193-202, Août 1996. |
=== Popularization === | === Popularization === | ||
Line 145: | Line 145: | ||
* 2007 | * 2007 | ||
- | * **[[http://interstices.info/jcms/c_15920/routage-dans-les-petits-mondes?qs=id%3Djalios_5127|Routage dans les petits mondes]] http://perso.ens-lyon.fr/nicolas.schabanel/publications/2007/2007-Interstices-LS.pdf|PDF]]**\\ with Emmanuelle Lebhar. //)i( interstices// INRIA popularization website, 2007. | + | * **[[http://interstices.info/jcms/c_15920/routage-dans-les-petits-mondes?qs=id%3Djalios_5127|Routage dans les petits mondes]] [[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2007/2007-Interstices-LS.pdf|PDF]]**\\ with Emmanuelle Lebhar. //)i( interstices// INRIA popularization website, 2007. |
* 2003 | * 2003 |