Moritz Helias

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 Andreas Frommer

> Home > Persons > Moritz Helias

Publications

2017
[j26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/fini/HahneDSFBHD17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fini/HahneDSFBHD17
Jan Hahne, David Dahmen, Jannis Schuecker, Andreas Frommer, Matthias Bolten, Moritz Helias, Markus Diesmann:
Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator. Frontiers Neuroinformatics 11: 34 (2017)
2015
[j18]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/fini/HahneHKIBFD15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fini/HahneHKIBFD15
Jan Hahne, Moritz Helias, Susanne Kunkel, Jun Igarashi, Matthias Bolten, Andreas Frommer, Markus Diesmann:
A unified framework for spiking and gap-junction interactions in distributed neuronal network simulations. Frontiers Neuroinformatics 9: 22 (2015)
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/braincomp/HahneHKIKWBFD15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/braincomp/HahneHKIKWBFD15
Jan Hahne, Moritz Helias, Susanne Kunkel, Jun Igarashi, Itaru Kitayama, Brian J. N. Wylie, Matthias Bolten, Andreas Frommer, Markus Diesmann:
Including Gap Junctions into Distributed Neuronal Network Simulations. BrainComp 2015: 43-57

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.