Nicolas Schabanel

According to our database1, Nicolas Schabanel
  • authored at least 42 papers between 1996 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Dynamic Sum-Radii Clustering.
Proceedings of the WALCOM: Algorithms and Computation, 2017

2016
Programming Biomolecules That Fold Greedily During Transcription.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Efficient Universal Computation by Greedy Molecular Folding.
CoRR, 2015

2014
Facility Location in Evolving Metrics.
CoRR, 2014

Facility Location in Evolving Metrics.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Stochastic Cellular Automata: Correlations, Decidability and Simulations.
Fundam. Inform., 2013

Stochastic Cellular Automata: Correlations, Decidability and Simulations
CoRR, 2013

2012
Intrinsic Simulations between Stochastic Cellular Automata
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

2011
Optimal path search in small worlds: dimension matters.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
On the analysis of "simple" 2D stochastic cellular automata.
Discrete Mathematics & Theoretical Computer Science, 2010

Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

2009
Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority.
Theor. Comput. Sci., 2009

2008
Non-clairvoyant scheduling with precedence constraints.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Graph Augmentation via Metric Embedding.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

On the Analysis of "Simple" 2D Stochastic Cellular Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes.
Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

2007
Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study of Asynchronous 2D Minority
CoRR, 2007

Pull-based data broadcast with dependencies: be fair to users, not to items.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Small Alliances in Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Topic 12 Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2007, 2007

Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough.
Proceedings of the Algorithms, 2007

2006
Fully asynchronous behavior of double-quiescent elementary cellular automata.
Theor. Comput. Sci., 2006

Could any graph be turned into a small-world?
Theor. Comput. Sci., 2006

Non-Clairvoyant Batch Sets Scheduling: Fairness is Fair enough
CoRR, 2006

Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items
CoRR, 2006

Towards small world emergence.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Customized Newspaper Broadcast: Data Broadcast with Dependencies.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
Close to optimal decentralized routing in long-range contact networks.
Theor. Comput. Sci., 2005

Could any Graph be Turned into a Small-World?.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
Almost Optimal Decentralized Routing in Long-Range Contact Networks.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
The Data Broadcast Problem with Non-Uniform Transmission Times.
Algorithmica, 2003

2002
Polynomial-Time Approximation Scheme for Data Broadcast
CoRR, 2002

2000
Polynomial-time approximation scheme for data broadcast.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

The Data Broadcast Problem with Preemption.
Proceedings of the STACS 2000, 2000

1999
A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem.
Parallel Processing Letters, 1999

The Data Broadcast Problem with Non-Uniform Transmission Rimes.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1997
Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract).
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
Basic Linear Algebra Operations in SLI Arithmetic.
Proceedings of the Euro-Par '96 Parallel Processing, 1996


  Loading...