Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Oliver Obst

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Simon G. Hardin

> Home > Persons > Oliver Obst

Publications

2013
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ncn/ObstTHCCMHOPPW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ncn/ObstTHCCMHOPPW13
Oliver Obst, Adrian Trinchi, Simon G. Hardin, Matthew Chadwick, Ivan Cole, Tim H. Muster, Nigel Hoschke, Diet Ostry, Don Price, Khoa N. Pham, Tim Wark:
Nano-scale reservoir computing. Nano Commun. Networks 4(4): 189-196 (2013)
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/icc/ObstTHCCMHOPPW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icc/ObstTHCCMHOPPW13
Oliver Obst, Adrian Trinchi, Simon G. Hardin, Matthew Chadwick, Ivan Cole, Tim H. Muster, Nigel Hoschke, Diet Ostry, Don Price, Khoa N. Pham, Tim Wark:
Nano-scale reservoir computing. ICC Workshops 2013: 804-808
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ObstTHCCMHOPPW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ObstTHCCMHOPPW13
Oliver Obst, Adrian Trinchi, Simon G. Hardin, Matthew Chadwick, Ivan Cole, Tim H. Muster, Nigel Hoschke, Diet Ostry, Don Price, Khoa N. Pham, Tim Wark:
Nano-scale reservoir computing. CoRR abs/1309.1521 (2013)

a service of

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.