| Publication | Date of Publication | Type |
|---|
Design methods for 3D wireframe DNA nanostructures
Natural Computing | 2023-11-30 | Paper |
Probably approximately optimal satisficing strategies
Artificial Intelligence | 2022-09-22 | Paper |
Neural networks and complexity theory
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Unconventional computation and natural computation. 19th international conference, UCNC 2021, Espoo, Finland, October 18--22, 2021. Proceedings
Lecture Notes in Computer Science | 2021-11-15 | Paper |
On the computational power of discrete Hopfield nets
Automata, Languages and Programming | 2019-03-29 | Paper |
| Algorithmic design of cotranscriptionally folding 2D RNA origami structures | 2018-10-18 | Paper |
Computing with continuous-time Liapunov systems
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Search methods for tile sets in patterned DNA self-assembly
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Online bin packing with delay and holding costs
Operations Research Letters | 2013-06-24 | Paper |
Unordered constraint satisfaction games
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Synthesizing small and reliable tile sets for patterned DNA self-assembly
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
Lecture Notes in Computer Science | 2011-01-28 | Paper |
Optimization, block designs and no free lunch theorems
Information Processing Letters | 2009-12-04 | Paper |
| scientific article; zbMATH DE number 5280064 (Why is no real title available?) | 2008-05-28 | Paper |
An efficient local search method for random 3-satisfiability
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
Neural Computation | 2006-03-07 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Exact and approximate balanced data gathering in energy-constrained sensor networks
Theoretical Computer Science | 2005-12-05 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithmic Aspects of Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-25 | Paper |
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
Neural Computation | 2004-10-05 | Paper |
Exponential transients in continuous-time Liapunov systems.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1849152 (Why is no real title available?) | 2003-01-06 | Paper |
| scientific article; zbMATH DE number 1490012 (Why is no real title available?) | 2001-03-04 | Paper |
Computing with truly asynchronous threshold logic networks
Theoretical Computer Science | 1998-10-22 | Paper |
| scientific article; zbMATH DE number 1008514 (Why is no real title available?) | 1997-08-07 | Paper |
Random strings make hard instances
Journal of Computer and System Sciences | 1996-11-27 | Paper |
Instance complexity
Journal of the ACM | 1995-03-01 | Paper |
| scientific article; zbMATH DE number 140393 (Why is no real title available?) | 1993-03-28 | Paper |
Dempster's rule of combination is {\#}P-complete
Artificial Intelligence | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4201618 (Why is no real title available?) | 1989-01-01 | Paper |
Lowness Properties of Sets in the Exponential-Time Hierarchy
SIAM Journal on Computing | 1988-01-01 | Paper |
OnP-subset structures
Mathematical Systems Theory | 1987-01-01 | Paper |
The density and complexity of polynomial cores for intractable sets
Information and Control | 1986-01-01 | Paper |
Optimal Approximations and Polynomially Levelable Sets
SIAM Journal on Computing | 1986-01-01 | Paper |
A classification of complexity core lattices
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4001485 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3984572 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3913678 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3887072 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3825168 (Why is no real title available?) | 1983-01-01 | Paper |
