default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Schabanel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c32]Daria Pchelina
, Nicolas Schabanel, Shinnosuke Seki, Guillaume Theyssier:
Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM). STACS 2022: 51:1-51:23- 2021
- [c31]Nicolas Levy, Nicolas Schabanel:
ENSnano: A 3D Modeling Software for DNA Nanostructures. DNA 2021: 5:1-5:23 - 2020
- [c30]Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Yuki Ubukata:
Simple Intrinsic Simulation of Cellular Automata in Oritatami Molecular Folding Model. LATIN 2020: 425-436
2010 – 2019
- 2018
- [c29]Erik D. Demaine, Jacob Hendricks, Meagan Olsen, Matthew J. Patitz, Trent A. Rogers, Nicolas Schabanel, Shinnosuke Seki, Hadley Thomas:
Know When to Fold 'Em: Self-assembly of Shapes by Folding in Oritatami. DNA 2018: 19-36 - [c28]Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki:
Proving the Turing Universality of Oritatami Co-Transcriptional Folding. ISAAC 2018: 23:1-23:13 - [i8]Erik D. Demaine, Jacob Hendricks, Meagan Olsen, Matthew J. Patitz, Trent A. Rogers, Nicolas Schabanel, Shinnosuke Seki, Hadley Thomas:
Know When to Fold 'Em: Self-Assembly of Shapes by Folding in Oritatami. CoRR abs/1807.04682 (2018) - 2017
- [c27]N. K. Blanchard, Nicolas Schabanel:
Dynamic Sum-Radii Clustering. WALCOM 2017: 30-41 - 2016
- [c26]Cody W. Geary, Pierre-Etienne Meunier, Nicolas Schabanel, Shinnosuke Seki:
Programming Biomolecules That Fold Greedily During Transcription. MFCS 2016: 43:1-43:14 - 2015
- [i7]Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki:
Efficient Universal Computation by Greedy Molecular Folding. CoRR abs/1508.00510 (2015) - 2014
- [c25]David Eisenstat, Claire Mathieu, Nicolas Schabanel:
Facility Location in Evolving Metrics. ICALP (2) 2014: 459-470 - [i6]David Eisenstat, Claire Mathieu, Nicolas Schabanel:
Facility Location in Evolving Metrics. CoRR abs/1403.6758 (2014) - 2013
- [j8]Pablo Arrighi, Nicolas Schabanel, Guillaume Theyssier:
Stochastic Cellular Automata: Correlations, Decidability and Simulations. Fundam. Informaticae 126(2-3): 121-156 (2013) - [i5]Pablo Arrighi, Nicolas Schabanel, Guillaume Theyssier:
Stochastic Cellular Automata: Correlations, Decidability and Simulations. CoRR abs/1304.7185 (2013) - 2012
- [c24]Pablo Arrighi, Nicolas Schabanel, Guillaume Theyssier:
Intrinsic Simulations between Stochastic Cellular Automata. AUTOMATA & JAC 2012: 208-224 - 2011
- [c23]George Giakkoupis, Nicolas Schabanel:
Optimal path search in small worlds: dimension matters. STOC 2011: 393-402 - 2010
- [j7]Damien Regnault, Nicolas Schabanel, Eric Thierry:
On the analysis of "simple" 2D stochastic cellular automata. Discret. Math. Theor. Comput. Sci. 12(2): 263-294 (2010) - [c22]Kirk Pruhs, Julien Robert, Nicolas Schabanel:
Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability. WAOA 2010: 237-248
2000 – 2009
- 2009
- [j6]Damien Regnault, Nicolas Schabanel, Eric Thierry:
Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority. Theor. Comput. Sci. 410(47-49): 4844-4855 (2009) - 2008
- [c21]Florent Becker, Eric Rémila, Nicolas Schabanel:
Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes. DNA 2008: 144-155 - [c20]Damien Regnault, Nicolas Schabanel, Eric Thierry:
On the Analysis of "Simple" 2D Stochastic Cellular Automata. LATA 2008: 452-463 - [c19]Emmanuelle Lebhar, Nicolas Schabanel:
Graph Augmentation via Metric Embedding. OPODIS 2008: 217-225 - [c18]Julien Robert, Nicolas Schabanel:
Non-clairvoyant scheduling with precedence constraints. SODA 2008: 491-500 - 2007
- [c17]Julien Robert, Nicolas Schabanel:
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough. ESA 2007: 741-753 - [c16]Nir Shavit, Nicolas Schabanel, Pascal Felber, Christos Kaklamanis:
Topic 12 Theory and Algorithms for Parallel Computation. Euro-Par 2007: 793 - [c15]Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel:
Small Alliances in Graphs. MFCS 2007: 218-227 - [c14]Damien Regnault, Nicolas Schabanel, Eric Thierry:
Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority. MFCS 2007: 320-332 - [c13]Julien Robert, Nicolas Schabanel:
Pull-based data broadcast with dependencies: be fair to users, not to items. SODA 2007: 238-247 - [i4]Damien Regnault, Nicolas Schabanel, Eric Thierry:
Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study of Asynchronous 2D Minority. CoRR abs/0706.2479 (2007) - 2006
- [j5]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Could any graph be turned into a small-world? Theor. Comput. Sci. 355(1): 96-103 (2006) - [j4]Nazim Fatès, Eric Thierry, Michel Morvan, Nicolas Schabanel:
Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor. Comput. Sci. 362(1-3): 1-16 (2006) - [c12]Sandeep Dey, Nicolas Schabanel:
Customized Newspaper Broadcast: Data Broadcast with Dependencies. LATIN 2006: 362-373 - [c11]Nazim Fatès, Damien Regnault, Nicolas Schabanel, Eric Thierry:
Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. LATIN 2006: 455-466 - [c10]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Towards small world emergence. SPAA 2006: 225-232 - [i3]Julien Robert, Nicolas Schabanel:
Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items. CoRR abs/cs/0608013 (2006) - [i2]Julien Robert, Nicolas Schabanel:
Non-Clairvoyant Batch Sets Scheduling: Fairness is Fair enough. CoRR abs/cs/0612088 (2006) - 2005
- [j3]Emmanuelle Lebhar, Nicolas Schabanel:
Close to optimal decentralized routing in long-range contact networks. Theor. Comput. Sci. 348(2-3): 294-310 (2005) - [c9]Nazim Fatès, Michel Morvan, Nicolas Schabanel, Eric Thierry:
Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. MFCS 2005: 316-327 - [c8]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Could any Graph be Turned into a Small-World?. DISC 2005: 511-513 - 2004
- [c7]Emmanuelle Lebhar, Nicolas Schabanel:
Almost Optimal Decentralized Routing in Long-Range Contact Networks. ICALP 2004: 894-905 - 2003
- [j2]Claire Kenyon, Nicolas Schabanel:
The Data Broadcast Problem with Non-Uniform Transmission Times. Algorithmica 35(2): 146-175 (2003) - 2002
- [i1]Claire Kenyon, Nicolas Schabanel, Neal E. Young:
Polynomial-Time Approximation Scheme for Data Broadcast. CoRR cs.DS/0205012 (2002) - 2000
- [c6]Nicolas Schabanel:
The Data Broadcast Problem with Preemption. STACS 2000: 181-192 - [c5]Claire Kenyon, Nicolas Schabanel, Neal E. Young:
Polynomial-time approximation scheme for data broadcast. STOC 2000: 659-666
1990 – 1999
- 1999
- [j1]Afonso Ferreira, Nicolas Schabanel:
A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem. Parallel Process. Lett. 9(3): 411-422 (1999) - [c4]Afonso Ferreira, Nicolas Schabanel:
A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem. ISPAN 1999: 284-289 - [c3]Claire Kenyon, Nicolas Schabanel:
The Data Broadcast Problem with Non-Uniform Transmission Rimes. SODA 1999: 547-556 - 1997
- [c2]Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel:
Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract). Euro-Par 1997: 421-429 - 1996
- [c1]Michael A. Anuta, Daniel W. Lozier, Nicolas Schabanel, Peter R. Turner:
Basic Linear Algebra Operations in SLI Arithmetic. Euro-Par, Vol. II 1996: 193-202
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 2025-01-09 12:45 CET 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:
