Differences

This shows you the differences between two versions of the page.

--- start [2018/01/19 11:18]
Nicolas Schabanel
+++ start [2018/01/19 12:06]
Nicolas Schabanel
@@ Line 53: / Line 53: @@
 === Publications ===
   *  **2017**
-     * **[[http://www.irif.fr/~nschaban/publications/2017/2017-Oritatami-GearyMeunierSchabanelSeki|Proving the Turing Universality of Oritatami Co-Transcriptional Folding]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. //Submitted//, 65 pages, july 2017. [ [[http://www.irif.fr/~nschaban/oritatami/|Supplementary materials]] ]
+     * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2017/2017-Oritatami-GearyMeunierSchabanelSeki|Proving the Turing Universality of Oritatami Co-Transcriptional Folding]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. //Submitted//, 65 pages, july 2017. [ [[http://perso.ens-lyon.fr/nicolas.schabanel/oritatami/|Supplementary materials]] ]
-     * **[[http://www.irif.fr/~nschaban/publications/2017/2017-Walcom-BlanchardSchabanel.pdf|Dynamic Facility Location: Minimizing the Sum of Radii]]**\\ Nicolas K. Blanchard, Nicolas Schabanel. //[[http://walcom2017.nctu.edu.tw/index.html|WALCOM]]//, LNCS 10167:30-41, march 2017.
+     * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2017/2017-Walcom-BlanchardSchabanel.pdf|Dynamic Facility Location: Minimizing the Sum of Radii]]**\\ Nicolas K. Blanchard, Nicolas Schabanel. //[[http://walcom2017.nctu.edu.tw/index.html|WALCOM]]//, LNCS 10167:30-41, march 2017.
   * **2016**
-    * **[[http://www.irif.fr/~nschaban/publications/2016/2016-Automata-Schabanel.pdf|Oritatami systems: a computational model for co-transcriptional folding]]**\\ Nicolas Schabanel. **Invited plenary talk** at //[[http://automata2016.ini.uzh.ch/|Automata]]//, Jun. 2016.
+    * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2016/2016-Automata-Schabanel.pdf|Oritatami systems: a computational model for co-transcriptional folding]]**\\ Nicolas Schabanel. **Invited plenary talk** at //[[http://automata2016.ini.uzh.ch/|Automata]]//, Jun. 2016.
-    * **[[http://www.irif.fr/~nschaban/publications/2016/2016-MFCS-GearyMeunierSchabanelSeki.pdf|Programming biomolecules that fold greedily during transcription]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. //[[http://mfcs.ki.agh.edu.pl|MFCS]]//, LIPIcs 58, 43:1-43:14, Aug. 2016.
+    * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2016/2016-MFCS-GearyMeunierSchabanelSeki.pdf|Programming biomolecules that fold greedily during transcription]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. //[[http://mfcs.ki.agh.edu.pl|MFCS]]//, LIPIcs 58, 43:1-43:14, Aug. 2016.
-    * **[[http://www.irif.fr/~nschaban/publications/2016/2016-HALG-GearyMeunierSchabanelSeki.pdf|Folding Turing is hard but feasible]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki.//[[http://highlightsofalgorithms.org/program/|HALG]]//, Jun. 2016.
+    * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2016/2016-HALG-GearyMeunierSchabanelSeki.pdf|Folding Turing is hard but feasible]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki.//[[http://highlightsofalgorithms.org/program/|HALG]]//, Jun. 2016.
   *  **2015**
-    * **[[http://www.irif.fr/~nschaban/publications/2015/2015-DNA21-GearyMeunierSchabanelSeki.pdf|Efficient universal computation by molecular co-transcriptional folding (Short announcement)]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. //[[http://dna21.wyss.harvard.edu/|DNA21]]//, 1 page, 2015.  (Full version in submission, see above)
+    * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2015/2015-DNA21-GearyMeunierSchabanelSeki.pdf|Efficient universal computation by molecular co-transcriptional folding (Short announcement)]]**\\ Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. //[[http://dna21.wyss.harvard.edu/|DNA21]]//, 1 page, 2015.  (Full version in submission, see above)
   *  **2014**
-    * **{{:users:nschaban:2014-ICALP-Eisenstat-Mathieu-Schabanel.pdf|Facility Location in Evolving Metrics}}**\\ with David Eisenstat and Claire Mathieu. //ICALP,// pages 459-470, 2014.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2014/2014-ICALP-Eisenstat-Mathieu-Schabanel.pdf|Facility Location in Evolving Metrics}}**\\ with David Eisenstat and Claire Mathieu. //ICALP,// pages 459-470, 2014.
   *  **2013**
-    * **{{:users:nschaban:2013-FM-Arrighi-Schabanel-Theyssier.pdf|Stochastic Cellular Automata: Correlations, Decidability and Simulations}}**\\ with Pablo Arrighi and Guillaume Theyssier. //Fundamenta Informaticæ,// 126:121-156, 2013.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2013/2013-FM-Arrighi-Schabanel-Theyssier.pdf|Stochastic Cellular Automata: Correlations, Decidability and Simulations}}**\\ with Pablo Arrighi and Guillaume Theyssier. //Fundamenta Informaticæ,// 126:121-156, 2013.
   *  **2012**
-    * **{{:users:nschaban:2012-JAC-Arrighi-Schabanel-Theyssier.pdf|Intrinsic simulations between stochastic cellular automata}}**\\ with Pablo Arrighi and Guillaume Theyssier. //AUTOMATA & JAC, EPTCS,// 90:208–224, 2012.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2012/2012-JAC-Arrighi-Schabanel-Theyssier.pdf|Intrinsic simulations between stochastic cellular automata}}**\\ with Pablo Arrighi and Guillaume Theyssier. //AUTOMATA & JAC, EPTCS,// 90:208–224, 2012.
-    * **{{:users:nschaban:2012-PBMB-Schabanel.pdf|Randomness + Determinism = Progresses: Why random processes could be favored by evolution}}**\\ //Progress in Biophysics and Moleculer Biology// (Special edition on the conference ”Chance at the heart of the cell”), 110(1):129–136, 2012.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2012/2012-PBMB-Schabanel.pdf|Randomness + Determinism = Progresses: Why random processes could be favored by evolution}}**\\ //Progress in Biophysics and Moleculer Biology// (Special edition on the conference ”Chance at the heart of the cell”), 110(1):129–136, 2012.
   *  **2011**
-    * **{{:users:nschaban:2011-Hermes-Bertin-Beslon-Gandrillon-Grauwin-Jensen-Schabanel.pdf|Les complexités : point de vue d’un institut des systèmes complexes}}** (in French)\\ with Éric Bertin, Guillaume Beslon, Olivier Gandrillon, Sébastian Grauwin, and Pablo Jensen. //Hermès,// 60:145–150, 2011.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2011/2011-Hermes-Bertin-Beslon-Gandrillon-Grauwin-Jensen-Schabanel.pdf|Les complexités : point de vue d’un institut des systèmes complexes}}** (in French)\\ with Éric Bertin, Guillaume Beslon, Olivier Gandrillon, Sébastian Grauwin, and Pablo Jensen. //Hermès,// 60:145–150, 2011.
-    * **{{:users:nschaban:2011-STOC-Giakkoupis-Schabanel.pdf|Optimal path search in small worlds: Dimension matters}}**\\ with George Giakkoupis. //STOC,// 43:393–402, 2011.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2011/2011-STOC-Giakkoupis-Schabanel.pdf|Optimal path search in small worlds: Dimension matters}}**\\ with George Giakkoupis. //STOC,// 43:393–402, 2011.
-    * **{{:users:nschaban:2011-TERANET-Schabanel.pdf|Analyzing search algorithms in smallworlds}}**\\ //TERANET// (colocated with DISC), 4 pages, Roma, Italy, Sep. 2011.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2011/2011-TERANET-Schabanel.pdf|Analyzing search algorithms in smallworlds}}**\\ //TERANET// (colocated with DISC), 4 pages, Roma, Italy, Sep. 2011.
   *  **2010**
-    * **{{:users:nschaban:2010-WAOA-Pruhs-Robert-Schabanel.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-Pruhs-Robert-Schabanel.pdf|Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability}}**\\ with Kirk Pruhs and Julien Robert. //WAOA,// LNCS 6534:237–248, 2010.
-    * **{{:users:nschaban:HdR-Schabanel.pdf|Systèmes complexes & algorithmes}}** (in French)\\ //Habilitation à diriger des recherches,// Université Paris Diderot, 2010. {{:users:nschaban:HDR-Defense-Schabanel.pdf|Slides}}
+    * **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}}
-    * **{{:users:nschaban:2010-DMTCS-Regnault-Schabanel-Thierry.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-Regnault-Schabanel-Thierry.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.
   *  **2009**
-    * **{{:users:nschaban:2009-TCS-Regnault-Schabanel-Thierry.pdf|Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D Minority}}**\\ with Damien Regnault and Éric Thierry. //TCS,// 410(47-49):4844-4855S, 2009. [[http://dx.doi.org/10.1016/j.tcs.2009.06.024|doi:10.1016/j.tcs.2009.06.024]]
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2009/2009-TCS-Regnault-Schabanel-Thierry.pdf|Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D Minority}}**\\ with Damien Regnault and Éric Thierry. //TCS,// 410(47-49):4844-4855S, 2009. [[http://dx.doi.org/10.1016/j.tcs.2009.06.024|doi:10.1016/j.tcs.2009.06.024]]
   *  **2008**
-    * **{{:users:nschaban:2008-SODA-RS.pdf|Non-Clairvoyant Scheduling with Precedence Constraints}}**\\ with Julien Robert. //SODA,// 491-500, Jan. 2008.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2008/2008-SODA-RS.pdf|Non-Clairvoyant Scheduling with Precedence Constraints}}**\\ with Julien Robert. //SODA,// 491-500, Jan. 2008.
-    * **{{:users:nschaban:2008-LATA-RST.pdf|On the analysis of ”simple” 2D stochastic cellular automata}}**\\ with Damien Regnault and Éric Thierry. //LATA,// LNCS 5196:452-463, Mar. 2008.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2008/2008-LATA-RST.pdf|On the analysis of ”simple” 2D stochastic cellular automata}}**\\ with Damien Regnault and Éric Thierry. //LATA,// LNCS 5196:452-463, Mar. 2008.
-    * **{{:users:nschaban:2008-DNA14-BRS.pdf|Time optimal self-assembling of 2D and 3D shapes: the case of squares and cubes}}**\\ with Florent Becker and Éric Rémila. //DNA14,// LNCS 5347:144–155, June 2008.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2008/2008-DNA14-BRS.pdf|Time optimal self-assembling of 2D and 3D shapes: the case of squares and cubes}}**\\ with Florent Becker and Éric Rémila. //DNA14,// LNCS 5347:144–155, June 2008.
-    * **{{:users:nschaban:2008-OPODIS-LS.pdf|Graph augmentation via metrics embedding}}**\\ with Emmanuelle Lebhar. //OPODIS,// LNCS 5401:217-225, Dec. 2008.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2008/2008-OPODIS-LS.pdf|Graph augmentation via metrics embedding}}**\\ with Emmanuelle Lebhar. //OPODIS,// LNCS 5401:217-225, Dec. 2008.
   *  **2007**
-    * **{{:users:nschaban:2007-ESA-RS.pdf|Non-clairvoyant batch sets scheduling: Fairness is fair enough}}**\\ with Julien Robert. //ESA,// LNCS 4698:742-753, Oct. 2007.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2007/2007-ESA-RS.pdf|Non-clairvoyant batch sets scheduling: Fairness is fair enough}}**\\ with Julien Robert. //ESA,// LNCS 4698:742-753, Oct. 2007.
-    * **{{:users:nschaban:2007-MFCS-RST.pdf|Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D Minority}}**\\ with Damien Regnault and Éric Thierry. //MFCS,// LNCS 4708:320-332, Aug. 2007.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2007/2007-MFCS-RST.pdf|Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D Minority}}**\\ with Damien Regnault and Éric Thierry. //MFCS,// LNCS 4708:320-332, Aug. 2007.
-    * **{{:users:nschaban:2007-MFCS-CMRS.pdf|Small alliances in graphs}}**\\ with Rodolfo Carvajal, Martín Matamala, and Iván Rapaport. //MFCS, LNCS 4708:218-227, Aug. 2007.//
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2007/2007-MFCS-CMRS.pdf|Small alliances in graphs}}**\\ with Rodolfo Carvajal, Martín Matamala, and Iván Rapaport. //MFCS, LNCS 4708:218-227, Aug. 2007.//
-    * **{{:users:nschaban:2007-SODA-RS.pdf|Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items}}**\\ with Julien Robert. //SODA,// p. 238-247, Jan. 2007.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2007/2007-SODA-RS.pdf|Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items}}**\\ with Julien Robert. //SODA,// p. 238-247, Jan. 2007.
   *  **2006**
-    * **{{:users:nschaban:2006-DS-LATIN.pdf|Customized Newspaper Problem: Data Broadcast with dependancies}}**\\ with Sandeep Dey. //LATIN,// LNCS 3887:362-373, Valdivia, march 2006.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2006/2006-DS-LATIN.pdf|Customized Newspaper Problem: Data Broadcast with dependancies}}**\\ with Sandeep Dey. //LATIN,// LNCS 3887:362-373, Valdivia, march 2006.
-    * **{{:users:nschaban:2006-FRST-LATIN2006.pdf|Asynchronous behavior of double-quiescent elementary cellular automata}}**\\ with Nazim Fatès, Damien Regnault and Éric Thierry. //LATIN,// LNCS 3887:455-466, Valdivia, march 2006.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2006/2006-FRST-LATIN2006.pdf|Asynchronous behavior of double-quiescent elementary cellular automata}}**\\ with Nazim Fatès, Damien Regnault and Éric Thierry. //LATIN,// LNCS 3887:455-466, Valdivia, march 2006.
-    * **{{:users:nschaban:2006-TCS_special-DHLS.pdf|Could any graph be turn into a smallworld?}}**\\ with Philippe Duchon, Nicolas Hanusse and Emmanuelle Lebhar. //TCS,// 355(1):96-103, 2006.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2006/2006-TCS_special-DHLS.pdf|Could any graph be turn into a smallworld?}}**\\ with Philippe Duchon, Nicolas Hanusse and Emmanuelle Lebhar. //TCS,// 355(1):96-103, 2006.
-    * **{{:users:nschaban:2006-SPAA-DHLS.pdf|Towards small world emergence}}**\\ with Philippe Duchon, Nicolas Hanusse and Emmanuelle Lebhar.//SPAA,// 225-232, july 2006.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2006/2006-SPAA-DHLS.pdf|Towards small world emergence}}**\\ with Philippe Duchon, Nicolas Hanusse and Emmanuelle Lebhar.//SPAA,// 225-232, july 2006.
-    * **{{:users:nschaban:2006-FMST-TCS.pdf|Fully asynchronous behavior of double-quiescent elementary cellular automata}}**\\ with Nazim Fatès, Michel Morvan, Éric Thierry.//TCS,// 362(1-3):1-16, 2006.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2006/2006-FMST-TCS.pdf|Fully asynchronous behavior of double-quiescent elementary cellular automata}}**\\ with Nazim Fatès, Michel Morvan, Éric Thierry.//TCS,// 362(1-3):1-16, 2006.
   *  **2005**
-    * **{{:users:nschaban:2005-LS-TCS.pdf|Close to optimal decentralized routing in long-range contact networks}}**\\ with Emmanuelle Lebhar. //TCS,// 348:294–310, 2005.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2005/2005-LS-TCS.pdf|Close to optimal decentralized routing in long-range contact networks}}**\\ with Emmanuelle Lebhar. //TCS,// 348:294–310, 2005.
-    * **{{:users:nschaban:2005-DHLS-DISC.pdf|Could any graph be turn into a smallworld?}}**\\ with Philippe Duchon, Nicolas Hanusse and, Emmanuelle Lebhar. //DISC,// LNCS 3724:512-513, Cracow, september 2005.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2005/2005-DHLS-DISC.pdf|Could any graph be turn into a smallworld?}}**\\ with Philippe Duchon, Nicolas Hanusse and, Emmanuelle Lebhar. //DISC,// LNCS 3724:512-513, Cracow, september 2005.
-    * **{{:users:nschaban:2005-FMST-MFCS.pdf|Fully asynchronous behavior of double-quiescent elementary cellular automata}}**\\ with Nazim Fatès, Michel Morvan and Éric Thierry. //MFCS, LNCS 3618:316-327, Gdansk, september 2005.//
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2005/2005-FMST-MFCS.pdf|Fully asynchronous behavior of double-quiescent elementary cellular automata}}**\\ with Nazim Fatès, Michel Morvan and Éric Thierry. //MFCS, LNCS 3618:316-327, Gdansk, september 2005.//
   *  **2004**
-    * **{{:users:nschaban:2004-LS-ICALP2004.pdf|Almost optimal decentralized routing in long-range contact networks}}**\\ with Emmanuelle Lebhar. //ICALP,// Turku, Finland, july 2004. {{:users:nschaban: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}}
-    * **{{:users:nschaban: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**
-    * **{{:users:nschaban: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**
-    * **{{:users:nschaban: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) {{:users:nschaban: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//Schabanel-PhDThesis.pdf|PDF}}\\ //PhD Thesis,// École normale supérieure de Lyon, 2000. Advisors: Claire Kenyon and Stéphane Ubéda (local advisor).
-    * **{{:users:nschaban: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.
-    * **{{:users:nschaban:S00.pdf|The databroadcast problem with preemption}}**\\ //STACS,// LNCS 1770:181-192, Lille, February 2000.  {{:users:nschaban: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//S99-RR1999-49.ps.gz|Full}}
   *  **1999**
-    * **{{:users:nschaban: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.
-    * **{{:users:nschaban: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**
-    * **{{:users:nschaban: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.
-    * **{{:users:nschaban: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. {{:users:nschaban: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//BGMS98-RR1998-18.ps.gz|Full}}
-    * **{{:users:nschaban: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 ===
   * 2016
-     * **[[http://www.irif.fr/~nschaban/publications/2016/2016-Tangente-Schabanel1.pdf|Vérifier une preuve en n'en lisant que quelques lettres !]]**\\ Nicolas Schabanel. //[[http://www.poleditions.com/pole/publications.php?collection=Tangente%20HS%20kiosque|Tangente]]//, Hors série n°55:144-147 Les démonstrations, Jan. 2016
+     * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2016/2016-Tangente-Schabanel1.pdf|Vérifier une preuve en n'en lisant que quelques lettres !]]**\\ Nicolas Schabanel. //[[http://www.poleditions.com/pole/publications.php?collection=Tangente%20HS%20kiosque|Tangente]]//, Hors série n°55:144-147 Les démonstrations, Jan. 2016
-    * **[[http://www.irif.fr/~nschaban/publications/2016/2016-Tangente-Schabanel1.pdf|Le «petit» théorème PCP]]**\\ Nicolas Schabanel. //[[http://www.poleditions.com/pole/publications.php?collection=Tangente%20HS%20kiosque|Tangente]]//, Hors série n°55:148-151 Les démonstrations, Jan. 2016
+    * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2016/2016-Tangente-Schabanel1.pdf|Le «petit» théorème PCP]]**\\ Nicolas Schabanel. //[[http://www.poleditions.com/pole/publications.php?collection=Tangente%20HS%20kiosque|Tangente]]//, Hors série n°55:148-151 Les démonstrations, Jan. 2016
-    * **[[http://www.irif.fr/~nschaban/publications/2016/2016-Tangente-Schabanel1.pdf|Réduire la taille d'une preuve]]**\\ Nicolas Schabanel. //[[http://www.poleditions.com/pole/publications.php?collection=Tangente%20HS%20kiosque|Tangente]]//, Hors série n°55:152-155 Les démonstrations, Jan. 2016
+    * **[[http://perso.ens-lyon.fr/nicolas.schabanel/publications/2016/2016-Tangente-Schabanel1.pdf|Réduire la taille d'une preuve]]**\\ Nicolas Schabanel. //[[http://www.poleditions.com/pole/publications.php?collection=Tangente%20HS%20kiosque|Tangente]]//, Hors série n°55:152-155 Les démonstrations, Jan. 2016
   * 2015
     * **{{http://www.societe-informatique-de-france.fr/wp-content/uploads/2015/03/1024-hs1-guion-schabanel.pdf|La médiation en informatique vue par le CNRS}}**\\ with Laure Guion. //1024// (Bulletin de la Société Informatique de France), //[[http://www.societe-informatique-de-france.fr/bulletin/1024-numero-hs1/|Hors-série numéro 1 « Médiation scientifique : de la science informatique au grand public »]],// p.19-21, février 2015.
@@ Line 142: / Line 142: @@
   * 2013
-    * **{{:users:nschaban:2012-Maths-Pansu-Schabanel.pdf|Couper, attendrir, trancher, réduire : un conte culinaire sur la résolution informatique des problèmes difficiles.}}** (in French)\\ With Pierre Pansu. //[[http://smf.emath.fr/content/lexplosion-continue-sommaire|Mathématiques, l’explosion continue]],// pages 15-22, 2013.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2012/2012-Maths-Pansu-Schabanel.pdf|Couper, attendrir, trancher, réduire : un conte culinaire sur la résolution informatique des problèmes difficiles.}}** (in French)\\ With Pierre Pansu. //[[http://smf.emath.fr/content/lexplosion-continue-sommaire|Mathématiques, l’explosion continue]],// pages 15-22, 2013.
   * 2007
-    * **[[http://interstices.info/jcms/c_15920/routage-dans-les-petits-mondes?qs=id%3Djalios_5127|Routage dans les petits mondes]]  {{:users:nschaban: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
-    * **{{:users:nschaban:2003.04-Minotaure-Schabanel.pdf|Thèse idiote: le hasard fabrique des certitudes}}** (in French)\\ //Le minotaure// (trimenstrial journal, 20 000ex), 1:66-69, april-june 2003.
+    * **http://perso.ens-lyon.fr/nicolas.schabanel/publications/2003/2003.04-Minotaure-Schabanel.pdf|Thèse idiote: le hasard fabrique des certitudes}}** (in French)\\ //Le minotaure// (trimenstrial journal, 20 000ex), 1:66-69, april-june 2003.
 === Teaching ===