default search action
André Röhm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i16]Shun Kotoku, Takatomo Mihana, André Röhm, Ryoichi Horisaki:
Decentralized multi-agent reinforcement learning algorithm using a cluster-synchronized laser network. CoRR abs/2407.09124 (2024) - 2023
- [j9]Hiroaki Shinkawa
, Nicolas Chauvet
Optimal Preference Satisfaction for Conflict-Free Joint Decisions. Complex. 2023: 2794839:1-2794839:19 (2023) - [j8]Naoki Fujita
Pairing Optimization via Statistics: Algebraic Structure in Pairing Problems and Its Application to Performance Enhancement. Entropy 25(1): 146 (2023) - [j7]Tomoki Yamagami
Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk. Entropy 25(6): 843 (2023) - [j6]Takuya Okuyama
Acceleration of Approximate Matrix Multiplications on GPUs. Entropy 25(8): 1130 (2023) - [i15]Kohei Tsuchiyama, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Makoto Naruse:
Effect of temporal resolution on the reproduction of chaotic dynamics via reservoir computing. CoRR abs/2302.10761 (2023) - [i14]Tomoki Yamagami, Etsuo Segawa, Takatomo Mihana, André Röhm, Ryoichi Horisaki, Makoto Naruse:
Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk. CoRR abs/2304.10118 (2023) - [i13]Honoka Shiratori, Hiroaki Shinkawa, André Röhm, Nicolas Chauvet, Etsuo Segawa, Jonathan Laurent, Guillaume Bachelier, Tomoki Yamagami, Ryoichi Horisaki, Makoto Naruse:
Asymmetric quantum decision-making. CoRR abs/2305.02117 (2023) - [i12]Shun Kotoku, Takatomo Mihana, André Röhm, Ryoichi Horisaki, Makoto Naruse:
Asymmetric leader-laggard cluster synchronization for collective decision-making with laser network. CoRR abs/2312.02537 (2023) - 2022
- [j5]Naoki Fujita
Efficient Pairing in Unknown Environments: Minimal Observations and TSP-Based Optimization. IEEE Access 10: 57630-57640 (2022) - [j4]Tomoki Yamagami
Directivity of Quantum Walk via Its Random Walk Replica. Complex. 2022: 9021583:1-9021583:14 (2022) - [j3]Benedikt Vettelschoss
Information Processing Capacity of a Single-Node Reservoir Computer: An Experimental Evaluation. IEEE Trans. Neural Networks Learn. Syst. 33(6): 2714-2725 (2022) - [i11]Naoki Fujita, Nicolas Chauvet, André Röhm, Ryoichi Horisaki, Aohan Li, Mikio Hasegawa, Makoto Naruse:
Efficient Pairing in Unknown Environments: Minimal Observations and TSP-based Optimization. CoRR abs/2203.12214 (2022) - [i10]Hiroaki Shinkawa, Nicolas Chauvet, Guillaume Bachelier, André Röhm, Ryoichi Horisaki, Makoto Naruse:
Optimal preference satisfaction for conflict-free joint decisions. CoRR abs/2205.00799 (2022) - [i9]Daniel J. Gauthier, Ingo Fischer, André Röhm:
Learning unseen coexisting attractors. CoRR abs/2207.14133 (2022) - [i8]Hiroaki Shinkawa, Nicolas Chauvet, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Guillaume Bachelier, Makoto Naruse:
Conflict-free joint sampling for preference satisfaction through quantum interference. CoRR abs/2208.03082 (2022) - [i7]Tomoki Yamagami, Etsuo Segawa, Ken'ichiro Tanaka, Takatomo Mihana, André Röhm, Ryoichi Horisaki, Makoto Naruse:
Skeleton structure inherent in discrete-time quantum walks. CoRR abs/2209.02943 (2022) - [i6]Naoki Fujita, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Aohan Li, Mikio Hasegawa, Makoto Naruse:
Pairing optimization via statistics: Algebraic structure in pairing problems and its application to performance enhancement. CoRR abs/2211.01661 (2022) - [i5]Hiroaki Shinkawa, Nicolas Chauvet, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Guillaume Bachelier, Makoto Naruse:
Bandit approach to conflict-free multi-agent Q-learning in view of photonic implementation. CoRR abs/2212.09926 (2022) - 2021
- [i4]André Röhm, Daniel J. Gauthier, Ingo Fischer:
Model-free inference of unseen attractors: Reconstructing phase space features from a single noisy trajectory using reservoir computing. CoRR abs/2108.04074 (2021) - 2020
- [j2]Florian Stelzer
Performance boost of time-delay reservoir computing by non-resonant clock cycle. Neural Networks 124: 158-169 (2020) - [i3]Florian Stelzer, André Röhm, Raul Vicente, Ingo Fischer, Serhiy Yanchuk:
Deep Learning with a Single Neuron: Folding a Deep Neural Network in Time using Feedback-Modulated Delay Loops. CoRR abs/2011.10115 (2020)
2010 – 2019
- 2019
- [j1]Kathy Lüdge
Computing with a camera. Nat. Mach. Intell. 1(12): 551-552 (2019) - [i2]Florian Stelzer, André Röhm, Kathy Lüdge, Serhiy Yanchuk:
Performance boost of time-delay reservoir computing by non-resonant clock cycle. CoRR abs/1905.02534 (2019) - 2018
- [i1]André Röhm, Kathy Lüdge:
Reservoir computing with simple oscillators: Virtual and real networks. CoRR abs/1802.08590 (2018)
Coauthor Index
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.
last updated on 2025-01-07 00:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: