Damien Woods - RankMe

89 papers A* 6A 2B 13C 12Journal 43Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Algorithmic Hardness of the Partition Function for Nucleic Acid Strands. DNA Gwendal Ducloz, Ahmed Shalaby, Damien Woods
2025	J	`jnl`	Algorithmic hardness of the partition function for nucleic acid strands. CoRR Gwendal Ducloz, Ahmed Shalaby, Damien Woods
2025	A*	`conf`	An Efficient Algorithm to Compute the Minimum Free Energy of Interacting Nucleic Acid Strands. ICALP Ahmed Shalaby, Damien Woods
2025	B	`conf`	Tile Blockers as a Simple Motif to Control Self-Assembly: Kinetics and Thermodynamics. DNA Constantine G. Evans, Angel Cervera Roldan, Trent A. Rogers, Damien Woods
2024	J	`jnl`	An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands. CoRR Ahmed Shalaby, Damien Woods
2024	B	`conf`	Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds. DNA Erik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert Schweller, Ahmed Shalaby, Damien Woods
2024	—	`conf`	Hardness of Busy Beaver Value BB(15). RP Tristan Stérin, Damien Woods
2024	J	`jnl`	Turning machines: a simple algorithmic model for molecular robotics. Nat. Comput. Irina Kostitsyna, Cai Wood, Damien Woods
2023	J	`jnl`	Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 23091). Dagstuhl Reports Aaron T. Becker, Sándor P. Fekete, Irina Kostitsyna, Matthew J. Patitz, Damien Woods, Ioannis Chatzigiannakis
2023	J	`jnl`	Harvesting Brownian Motion: Zero Energy Computational Sampling. CoRR David Doty, Niels Kornerup, Austin Luchsinger, Leo Orshansky, David Soloveichik, Damien Woods
2023	B	`conf`	Minimum Free Energy, Partition Function and Kinetics Simulation Algorithms for a Multistranded Scaffolded DNA Computer. DNA Ahmed Shalaby, Chris Thachuk, Damien Woods
2021	J	`jnl`	On the hardness of knowing busy beaver values BB(15) and BB(5, 4). CoRR Tristan Stérin, Damien Woods
2021	B	`conf`	Small Tile Sets That Compute While Solving Mazes. DNA Matthew Cook, Tristan Stérin, Damien Woods
2021	J	`jnl`	Small tile sets that compute while solving mazes. CoRR Matthew Cook, Tristan Stérin, Damien Woods
2020	J	`jnl`	Limitations on counting in Boolean circuits and self-assembly. CoRR Tristan Stérin, Damien Woods
2020	—	`conf`	The Collatz Process Embeds a Base Conversion Algorithm. RP Tristan Stérin, Damien Woods
2020	J	`jnl`	The Collatz process embeds a base conversion algorithm. CoRR Tristan Stérin, Damien Woods
2020	A*	`conf`	The program-size complexity of self-assembled paths. STOC Pierre-Étienne Meunier, Damien Regnault, Damien Woods
2020	J	`jnl`	The program-size complexity of self-assembled paths. CoRR Pierre-Étienne Meunier, Damien Regnault, Damien Woods
2020	B	`conf`	Turning Machines. DNA Irina Kostitsyna, Cai Wood, Damien Woods
2020	J	`jnl`	Turning machines. CoRR Irina Kostitsyna, Cai Wood, Damien Woods
2019	J	`jnl`	Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Nat. Damien Woods, David Doty, Cameron Myhrvold, Joy Hui, Felix Zhou, Peng Yin, Erik Winfree
2018	J	`jnl`	Preface. Nat. Comput. Damien Woods, Yannick Rondelez
2017	A*	`conf`	The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation. STOC Pierre-Étienne Meunier, Damien Woods
2017	J	`jnl`	The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation. CoRR Pierre-Étienne Meunier, Damien Woods
2017	B	`conf`	Thermodynamic Binding Networks. DNA David Doty, Trent A. Rogers, David Soloveichik, Chris Thachuk, Damien Woods
2017	J	`jnl`	Thermodynamic Binding Networks. CoRR David Doty, Trent A. Rogers, David Soloveichik, Chris Thachuk, Damien Woods
2016	—	`ch.`	Active Self-Assembly and Molecular Robotics with Nubots. Encyclopedia of Algorithms Damien Woods
2016	B	`ed.`	DNA Computing and Molecular Programming - 22nd International Conference, DNA 2016, Munich, Germany, September 4-8, 2016, Proceedings DNA Yannick Rondelez, Damien Woods
2016	—	`ch.`	Intrinsic Universality in Self-Assembly. Encyclopedia of Algorithms Damien Woods
2016	J	`jnl`	The Two-Handed Tile Assembly Model is not Intrinsically Universal. Algorithmica Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods
2015	J	`jnl`	Parallel computation using active self-assembly. Nat. Comput. Moya Chen, Doris Xin, Damien Woods
2015	—	`conf`	Tag Systems and the Complexity of Simple Programs. Automata Turlough Neary, Damien Woods
2015	J	`jnl`	Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines. Fundam. Informaticae Damien Woods, Turlough Neary
2014	B	`conf`	Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation. DNA Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang
2014	J	`jnl`	Fast algorithmic self-assembly of simple shapes using random agitation. CoRR Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang
2014	A*	`conf`	Intrinsic universality in tile self-assembly requires cooperation. SODA Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods
2014	—	`conf`	One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile. ICALP (1) Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods
2014	J	`jnl`	Parallel computation using active self-assembly. CoRR Moya Chen, Doris Xin, Damien Woods
2014	J	`jnl`	Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems. Fundam. Informaticae Niall Murphy, Damien Woods
2014	J	`jnl`	Uniformity is weaker than semi-uniformity for some membrane systems. CoRR Niall Murphy, Damien Woods
2014	J	`jnl`	Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy. J. Complex. Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick
2013	C	`conf`	AND and/or OR: Uniform Polynomial-Size Circuits MCU Niall Murphy, Damien Woods
2013	J	`jnl`	Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time CoRR Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree, Peng Yin
2013	A	`conf`	Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. ITCS Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree, Peng Yin
2013	C	`conf`	Intrinsic universality and the computational power of self-assembly. MCU Damien Woods
2013	J	`jnl`	Intrinsic universality in tile self-assembly requires cooperation CoRR Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods
2013	B	`conf`	Parallel Computation Using Active Self-assembly. DNA Moya Chen, Doris Xin, Damien Woods
2013	—	`conf`	The Two-Handed Tile Assembly Model Is Not Intrinsically Universal. ICALP (1) Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods
2013	J	`jnl`	The two-handed tile assembly model is not intrinsically universal. CoRR Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods
2013	J	`jnl`	Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy CoRR Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick
2012	J	`jnl`	One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece CoRR Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods
2012	B	`conf`	The Complexity of Small Universal Turing Machines: A Survey. SOFSEM Turlough Neary, Damien Woods
2012	A*	`conf`	The Tile Assembly Model is Intrinsically Universal. FOCS David Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Damien Woods
2011	J	`jnl`	Preface. Theor. Comput. Sci. Damien Woods, Turlough Neary, Anthony Karel Seda
2011	J	`jnl`	The complexity of small universal Turing machines: a survey CoRR Turlough Neary, Damien Woods
2011	J	`jnl`	The computational power of membrane systems under tight uniformity conditions. Nat. Comput. Niall Murphy, Damien Woods
2011	J	`jnl`	The tile assembly model is intrinsically universal CoRR David Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Damien Woods
2010	J	`jnl`	Intrinsic Universality in Self-Assembly CoRR David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods
2010	A	`conf`	Intrinsic Universality in Self-Assembly. STACS David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods
2009	J	`jnl`	Four Small Universal Turing Machines. Fundam. Informaticae Turlough Neary, Damien Woods
2009	C	`conf`	Membrane Dissolution and Division in P. UC Damien Woods, Niall Murphy, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez
2009	—	`ch.`	Optical Computing. Encyclopedia of Complexity and Systems Science Thomas J. Naughton, Damien Woods
2009	J	`jnl`	Optical computing. Appl. Math. Comput. Damien Woods, Thomas J. Naughton
2009	—	`ed.`	Proceedings International Workshop on The Complexity of Simple Programs, CSP 2008, Cork, Ireland, 6-7th December 2008. CSP Turlough Neary, Damien Woods, Anthony Karel Seda, Niall Murphy
2009	C	`conf`	Random Number Selection in Self-assembly. UC David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods
2009	J	`jnl`	Small Semi-Weakly Universal Turing Machines. Fundam. Informaticae Damien Woods, Turlough Neary
2009	B	`conf`	Small Weakly Universal Turing Machines. FCT Turlough Neary, Damien Woods
2009	J	`jnl`	The complexity of small universal Turing machines: A survey. Theor. Comput. Sci. Damien Woods, Turlough Neary
2008	C	`conf`	A Characterisation of NL Using Membrane Systems without Charges and Dissolution. UC Niall Murphy, Damien Woods
2008	J	`jnl`	Implementations of a Model of Physical Sorting. Int. J. Unconv. Comput. Niall Murphy, Thomas J. Naughton, Damien Woods, Beverley Henley, Kieran McDermott, Elaine Duffy, Peter J. M. Van Der Burgt, Niamh Woods
2008	J	`jnl`	Lower bounds on the computational power of an optical model of computation. Nat. Comput. Damien Woods, J. Paul Gibson
2008	—	`conf`	On acceptance conditions for membrane systems: characterisations of L and NL CSP Niall Murphy, Damien Woods
2008	—	`conf`	Parallel and Sequential Optical Computing. OSC Damien Woods, Thomas J. Naughton
2007	—	`conf`	Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P. Workshop on Membrane Computing Niall Murphy, Damien Woods
2007	C	`conf`	Four Small Universal Turing Machines. MCU Turlough Neary, Damien Woods
2007	C	`conf`	Small Semi-weakly Universal Turing Machines. MCU Damien Woods, Turlough Neary
2007	J	`jnl`	Small weakly universal Turing machines CoRR Turlough Neary, Damien Woods
2007	C	`conf`	The Complexity of Small Universal Turing Machines. CiE Damien Woods, Turlough Neary
2006	J	`jnl`	On the time complexity of 2-tag systems and small universal Turing machines CoRR Damien Woods, Turlough Neary
2006	A*	`conf`	On the time complexity of 2-tag systems and small universal Turing machines. FOCS Damien Woods, Turlough Neary
2006	C	`conf`	Optical Computing and Computational Complexity. UC Damien Woods
2006	—	`conf`	P-completeness of Cellular Automaton Rule 110. ICALP (1) Turlough Neary, Damien Woods
2006	J	`jnl`	Small fast universal Turing machines. Theor. Comput. Sci. Turlough Neary, Damien Woods
2005	J	`jnl`	An optical model of computation. Theor. Comput. Sci. Damien Woods, Thomas J. Naughton
2005	C	`conf`	Complexity of Continuous Space Machine Operations. CiE Damien Woods, J. Paul Gibson
2005	C	`conf`	Lower Bounds on the Computational Power of an Optical Model of Computation. UC Damien Woods, J. Paul Gibson
2005	B	`conf`	Upper Bounds on the Computational Power of an Optical Model of Computation. ISAAC Damien Woods
2001	C	`conf`	On the Computational Power of a Continuous-Space Optical Model of Computation. MCU Thomas J. Naughton, Damien Woods