Johannes Friedrich

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 Dmitri B. Chklovskii

> Home > Persons > Johannes Friedrich

Publications

2021
[c6]
- view
  - electronic edition @ neurips.cc (open access)
  - details & citations
- export record
  dblp key:
  - conf/nips/FriedrichGFGSC21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/FriedrichGFGSC21
Johannes Friedrich, Siavash Golkar, Shiva Farashahi, Alexander Genkin, Anirvan M. Sengupta, Dmitri B. Chklovskii:
Neural optimal feedback control with local learning rules. NeurIPS 2021: 16358-16370
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-2111-06920
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2111-06920
Johannes Friedrich, Siavash Golkar, Shiva Farashahi, Alexander Genkin, Anirvan M. Sengupta, Dmitri B. Chklovskii:
Neural optimal feedback control with local learning rules. CoRR abs/2111.06920 (2021)
2017
[c2]
- view
- export record
  dblp key:
  - conf/nips/GiovannucciFKCC17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/GiovannucciFKCC17
Andrea Giovannucci, Johannes Friedrich, Matthew T. Kaufman, Anne Churchland, Dmitri B. Chklovskii, Liam Paninski, Eftychios A. Pnevmatikakis:
OnACID: Online Analysis of Calcium Imaging Data in Real Time. NIPS 2017: 2381-2391

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.