default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Lange 0001
Person information
- affiliation: Hochschule für Technik und Wirtschaft Berlin, Germany
Other persons with the same name
- Christoph Lange 0002
![[0000-0001-9879-3827]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-9879-3827")
(aka: Christoph Lange-Bever) — Fraunhofer Institute for Applied Information Technology (FIT), Sankt Augustin, Germany (and 4 more) - Christoph Lange 0003 — Harvard School of Public Health, Department of Biostatistics, Cambridge, MA, USA (and 2 more)
- Christoph Lange 0004 — Deutsche Telekom AG, Telekom Innovation Laboratories, Germany
- Christoph Lange 0005 — Fraunhofer Institute for Medical Image Computing (MEVIS), Munich, Germany
- Christoph Lange 0006 — IBM Germany
- Christoph Lange 0007 — TU Berlin, KIWI biolab, Germany
- Christoph Lange 0008 — Passau University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Christoph Lange, Andreas Ahrens, Jasmeet Singh, Olaf Grote:
Analysing All-Optical Random Bit Sequences Using Gap-Based Approaches. Sensors 24(14): 4474 (2024)- 2022
- [j2]Christoph Lange, Andreas Ahrens:
Power and Energy Efficiency of Multilevel Baseband Transmission Systems: Analysis, Optimization and Improvements. J. Commun. 17(12): 961-971 (2022) - [c9]Christoph Lange, Andreas Ahrens:
Improving Power and Energy Efficiency of Linearly Equalized Baseband Cable Transmission Links. SENSORNETS 2022: 15-25 - 2020
- [j1]Andreas Ahrens, Christoph Lange, Jelena Zascerinska:
Energy Savings by Using Traffic Estimation for Dynamic Capacity Adaptation in Communication Network Operations. J. Commun. 15(11): 790-795 (2020)
2010 – 2019
- 2016
- [c8]Andreas Ahrens, Christoph Lange, César Benavente-Peces:
Traffic Estimation for Dynamic Capacity Adaptation in Load Adaptive Network Operation Regimes. PECCS 2016: 99-104
2000 – 2009
- 2008
- [c7]Andreas Ahrens, Christoph Lange:
Iteratively Detected MIMO-OFDM Twisted-Pair Transmission Schemes. ICETE (Selected Papers) 2008: 281-293 - [c6]Andreas Ahrens, Christoph Lange:
Far-End Crosstalk in Iteratively Detected MIMO-OFDM Twisted Pair Transmission Systems. SIGMAP 2008: 39-46 - 2007
- [c5]Andreas Ahrens, Christoph Lange, Volker Kühn, Tobias Weber:
Optimal Power Allocation in SVD Equalized Multicarrier Systems. ICC 2007: 4468-4474 - 2006
- [c4]Andreas Ahrens, Christoph Lange:
Optimal Power Allocation in a MIMO-OFDM Twisted Pair Transmission System with Far-End Crosstalk. SIGMAP 2006: 164-169 - [c3]Andreas Ahrens, Christoph Lange:
Exploitation of Far-End Crosstalk in MIMO-OFDM Twisted Pair Transmission Systems. Wireless and Optical Communications 2006 - 2004
- [c2]Th. Vergin, Thomas Kessler, Andreas Ahrens, Christoph Lange, Hans-Dietrich Melzer:
Packet arrivals in ethernet-based data networks. ISICT 2004: 80-85 - 2001
- [c1]Christoph Lange, Andreas Ahrens:
On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory. IMACC 2001: 9-19
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 2024-11-22 20:40 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:
