| Publication | Date of Publication | Type |
|---|
| Design methods for 3D wireframe DNA nanostructures | 2023-11-30 | Paper |
| Probably approximately optimal satisficing strategies | 2022-09-22 | Paper |
| Neural networks and complexity theory | 2022-08-18 | Paper |
| Unconventional computation and natural computation. 19th international conference, UCNC 2021, Espoo, Finland, October 18--22, 2021. Proceedings | 2021-11-15 | Paper |
| On the computational power of discrete Hopfield nets | 2019-03-29 | Paper |
| Algorithmic design of cotranscriptionally folding 2D RNA origami structures | 2018-10-18 | Paper |
| Computing with continuous-time Liapunov systems | 2015-02-27 | Paper |
| Search methods for tile sets in patterned DNA self-assembly | 2014-01-28 | Paper |
| Online bin packing with delay and holding costs | 2013-06-24 | Paper |
| Unordered Constraint Satisfaction Games | 2012-09-25 | Paper |
| Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly | 2011-09-16 | Paper |
| Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly | 2011-01-28 | Paper |
| Optimization, block designs and no free lunch theorems | 2009-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3497967 | 2008-05-28 | Paper |
| An efficient local search method for random 3-satisfiability | 2007-05-29 | Paper |
| Continuous-Time Symmetric Hopfield Nets Are Computationally Universal | 2006-03-07 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Exact and approximate balanced data gathering in energy-constrained sensor networks | 2005-12-05 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Algorithmic Aspects of Wireless Sensor Networks | 2005-08-25 | Paper |
| General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results | 2004-10-05 | Paper |
| Exponential transients in continuous-time Liapunov systems. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787393 | 2003-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496256 | 2001-03-04 | Paper |
| Computing with truly asynchronous threshold logic networks | 1998-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336274 | 1997-08-07 | Paper |
| Random strings make hard instances | 1996-11-27 | Paper |
| Instance complexity | 1995-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028800 | 1993-03-28 | Paper |
| Dempster's rule of combination is {\#}P-complete | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3350759 | 1989-01-01 | Paper |
| Lowness Properties of Sets in the Exponential-Time Hierarchy | 1988-01-01 | Paper |
| OnP-subset structures | 1987-01-01 | Paper |
| The density and complexity of polynomial cores for intractable sets | 1986-01-01 | Paper |
| Optimal Approximations and Polynomially Levelable Sets | 1986-01-01 | Paper |
| A classification of complexity core lattices | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727431 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747724 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3690221 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3219763 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670562 | 1983-01-01 | Paper |
