Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Stephan ten Brink

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 Dana Ciochina-Kar

> Home > Persons > Stephan ten Brink

Publications

2023
[d1]
- view
  - electronic edition @ uni-stuttgart.de (open access)
  - no references & citations available
- export record
  dblp key:
  - data/10/FuchsHCVB23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/data/10/FuchsHCVB23
Ephraim Fuchs, Thomas Handte, Dana Ciochina-Kar, Daniel Verenzuela, Stephan ten Brink:
Data for: Optimized Sequences for Nonlinearity Estimation and Self-Interference Cancellation. DaRUS, 2023
2017
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/spawc/FellhauerLCHB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spawc/FellhauerLCHB17
Felix Fellhauer, Nabil Sven Loghin, Dana Ciochina, Thomas Handte, Stephan ten Brink:
Low complexity beamforming training method for mmWave communications. SPAWC 2017: 1-5
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/FellhauerLCHB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/FellhauerLCHB17
Felix Fellhauer, Nabil Sven Loghin, Dana Ciochina, Thomas Handte, Stephan ten Brink:
Low Complexity Beamforming Training Method for mmWave Communications. CoRR abs/1703.05650 (2017)

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.