| Publication | Date of Publication | Type |
|---|
| Oritatami systems assemble shapes No less complex than tile assembly model (ATAM) | 2024-04-23 | Paper |
| Simple intrinsic simulation of cellular automata in oritatami molecular folding model | 2022-10-13 | Paper |
Proving the Turing universality of oritatami co-transcriptional folding
(available as arXiv preprint) | 2022-07-21 | Paper |
| Intrinsic simulations between stochastic cellular automata | 2021-04-27 | Paper |
Intrinsic simulations between stochastic cellular automata
(available as arXiv preprint) | 2021-04-27 | Paper |
Know when to fold 'em: self-assembly of shapes by folding in oritatami
(available as arXiv preprint) | 2018-11-08 | Paper |
| Programming biomolecules that fold greedily during transcription | 2018-03-21 | Paper |
Dynamic sum-radii clustering
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
| scientific article; zbMATH DE number 6381650 (Why is no real title available?) | 2014-12-18 | Paper |
Polynomial-time approximation scheme for data broadcast
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Facility location in evolving metrics
Automata, Languages, and Programming | 2014-07-01 | Paper |
Optimal path search in small worlds, dimension matters
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Stochastic cellular automata: correlations, decidability and simulations
(available as arXiv preprint) | 2014-02-11 | Paper |
Minimizing maximum flowtime of jobs with arbitrary parallelizability
Approximation and Online Algorithms | 2011-02-15 | Paper |
| scientific article; zbMATH DE number 5764854 (Why is no real title available?) | 2010-08-06 | Paper |
| scientific article; zbMATH DE number 5761854 (Why is no real title available?) | 2010-07-27 | Paper |
Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
DNA Computing | 2009-11-10 | Paper |
Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority
Theoretical Computer Science | 2009-11-06 | Paper |
On the Analysis of “Simple” 2D Stochastic Cellular Automata
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Customized Newspaper Broadcast: Data Broadcast with Dependencies
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Small Alliances in Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Fully asynchronous behavior of double-quiescent elementary cellular automata
Theoretical Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Could any graph be turned into a small-world?
Theoretical Computer Science | 2006-04-28 | Paper |
Close to optimal decentralized routing in long-range contact networks
Theoretical Computer Science | 2006-01-09 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
The data broadcast problem with non-uniform transmission times
Algorithmica | 2003-06-02 | Paper |
| scientific article; zbMATH DE number 1760035 (Why is no real title available?) | 2002-11-06 | Paper |
| scientific article; zbMATH DE number 1500517 (Why is no real title available?) | 2000-11-22 | Paper |
| scientific article; zbMATH DE number 1305447 (Why is no real title available?) | 1999-06-17 | Paper |
