default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 40 matches
- 2008
- Artiom Alhazov, Ion Petre, Vladimir Rogojin:
Solutions to computational problems through gene assembly. Nat. Comput. 7(3): 385-401 (2008) - Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai:
On the complexity of graph self-assembly in accretive systems. Nat. Comput. 7(2): 183-201 (2008) - Dirk V. Arnold, Hans-Georg Beyer:
Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge. Nat. Comput. 7(4): 555-587 (2008) - M. Sakthi Balan, Helmut Jürgensen:
On the universality of peptide computing. Nat. Comput. 7(1): 71-94 (2008) - Alec Banks, Jonathan Vincent, Chukwudi Anyakoha:
A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat. Comput. 7(1): 109-124 (2008) - Cristian S. Calude, Gheorghe Paun:
Foreword. Nat. Comput. 7(1): 1 (2008) - Matteo Cavaliere, Ivan Mura:
Experiments on the reliability of stochastic spiking neural P systems. Nat. Comput. 7(4): 453-470 (2008) - Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj, Andrei Paun, Gheorghe Paun, Mario J. Pérez-Jiménez:
Spiking neural P systems with extended rules: universality and languages. Nat. Comput. 7(2): 147-166 (2008) - Erzsébet Csuhaj-Varjú, Sergey Verlan:
On length-separating test tube systems. Nat. Comput. 7(2): 167-181 (2008) - Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine:
Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues. Nat. Comput. 7(3): 347-370 (2008) - Michael Domaratzki:
Equivalence in template-guided recombination. Nat. Comput. 7(3): 439-449 (2008) - Pablo Moisset de Espanés, Ashish Goel:
Toward minimum size self-assembled counters. Nat. Comput. 7(3): 317-334 (2008) - Marc García-Arnau, David Pérez, Alfonso Rodríguez-Patón, Petr Sosík:
On the power of elementary features in spiking neural P systems. Nat. Comput. 7(4): 471-483 (2008) - Max H. Garzon, Hao Yan:
Preface. Nat. Comput. 7(3): 299-301 (2008) - Miguel Angel Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Daniel Ramírez-Martínez:
A software tool for verification of Spiking Neural P Systems. Nat. Comput. 7(4): 485-497 (2008) - Miki Hirabayashi, Hirotada Ohashi, Tai Kubo:
Experimental analysis of the basic idea on the transcription-based diagnostic automata controlled by programmed molecules. Nat. Comput. 7(3): 403-421 (2008) - Oscar H. Ibarra, Sara Woodworth:
Characterizations of some classes of spiking neural P systems. Nat. Comput. 7(4): 499-517 (2008) - Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun:
On spiking neural P systems and partially blind counter machines. Nat. Comput. 7(1): 3-19 (2008) - Zuwairie Ibrahim, John A. Rose, Akira Suyama, Marzuki Khalid:
Experimental implementation and analysis of a DNA computing readout method based on real-time PCR with TaqMan probes. Nat. Comput. 7(2): 277-286 (2008) - Mihai Ionescu, Gheorghe Paun, Takashi Yokomori:
Preface. Nat. Comput. 7(4): 451-452 (2008) - Tseren-Onolt Ishdorj, Alberto Leporati:
Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources. Nat. Comput. 7(4): 519-534 (2008) - Clifford R. Johnson:
Automating the DNA computer: solving n-Variable 3-SAT problems. Nat. Comput. 7(2): 239-253 (2008) - Atsushi Kameda, Masahito Yamamoto, Azuma Ohuchi, Satsuki Yaegashi, Masami Hagiya:
Unravel four hairpins! Nat. Comput. 7(2): 287-298 (2008) - William B. Langdon, Wolfgang Banzhaf:
Repeated patterns in genetic programming. Nat. Comput. 7(4): 589-613 (2008) - William B. Langdon, Riccardo Poli:
Mapping non-conventional extensions of genetic programming. Nat. Comput. 7(1): 21-43 (2008) - Chengde Mao, Takashi Yokomori:
Foreword. Nat. Comput. 7(2): 145-146 (2008) - Michael C. Mozer, Adrian Fan:
Top-Down modulation of neural responses in visual perception: a computational exploration. Nat. Comput. 7(1): 45-55 (2008) - Akio Nishikawa, Satsuki Yaegashi, Fumiaki Tanaka, Kazumasa Ohtake, Masami Hagiya:
Multi-fueled approach to DNA nano-robotics. Nat. Comput. 7(3): 371-383 (2008) - Mihai Oltean:
Solving the Hamiltonian path problem with a light-based computer. Nat. Comput. 7(1): 57-70 (2008) - Kaoru Onodera, Takashi Yokomori:
Doubler and linearizer: an approach toward a unified theory for molecular computing based on DNA complementarity. Nat. Comput. 7(1): 125-143 (2008)
skipping 10 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-10 23:13 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint