default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörg Bühler
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c10]Jörg Bühler, Slawomir Stanczak:
Energy-efficient relaying using rateless codes. ICASSP 2013: 4943-4947- 2012
- [c9]Jörg Bühler, Slawomir Stanczak:
Energy-efficient decode and forward relaying in diamond networks. Allerton Conference 2012: 2096-2103 - [c8]Jörg Bühler, Gerhard Wunder:
The multiple access channel interfering with a point to point link: Linear deterministic sum capacity. ICC 2012: 2365-2369 - 2011
- [j3]Jörg Bühler, Gerhard Wunder:
A Note on Capacity Computation for the Discrete Multiple Access Channel. IEEE Trans. Inf. Theory 57(4): 1906-1910 (2011) - [c7]Gerhard Wunder, Jörg Bühler:
Deterministic capacity modeling for cellular channels: building blocks, approximate regions, and optimal transmission strategies. ISABEL 2011: 178:1-178:5 - [c6]Jörg Bühler, Gerhard Wunder:
On interference alignment and the deterministic capacity for cellular channels with weak symmetric cross links. ISIT 2011: 2085-2089 - [i4]Jörg Bühler, Gerhard Wunder:
On Interference Alignment and the Deterministic Capacity for Cellular Channels with Weak Symmetric Cross Links. CoRR abs/1104.0136 (2011) - [i3]Jörg Bühler, Gerhard Wunder:
The Deterministic Sum Capacity of a Multiple Access Channel Interfering with a Point to Point Link. CoRR abs/1105.2283 (2011) - 2010
- [j2]Jörg Bühler, Gerhard Wunder:
Traffic-aware optimization of heterogeneous access management. IEEE Trans. Commun. 58(6): 1737-1747 (2010) - [c5]Jörg Bühler, Gerhard Wunder:
A Duality Study for Fading Multiple Access / Broadcast Channels without Channel State Information at the Transmitter. GLOBECOM 2010: 1-5 - [c4]Jörg Bühler, Gerhard Wunder:
On duality relations for the discrete memoryless multiple access and broadcast channel. ISIT 2010: 525-529
2000 – 2009
- 2009
- [j1]Anastasios Giovanidis
, Gerhard Wunder, Jörg Bühler:
Optimal control of a single queue with retransmissions: delaydropping tradeoffs. IEEE Trans. Wirel. Commun. 8(7): 3736-3746 (2009) - [c3]Gerhard Wunder, Jörg Bühler:
On capacity computation for the two-user binary multiple-access channel. ISIT 2009: 2381-2385 - [c2]Jörg Bühler, Gerhard Wunder:
An optimization framework for heterogeneous access management. WCNC 2009: 2525-2530 - [i2]Anastasios Giovanidis, Gerhard Wunder, Jörg Bühler:
Optimal Control of a Single Queue with Retransmissions: Delay-Dropping Tradeoffs. CoRR abs/0902.3979 (2009) - [i1]Jörg Bühler, Gerhard Wunder:
On Capacity Computation for the Two-User Binary Multiple-Access Channel. CoRR abs/0904.3894 (2009) - 2008
- [c1]Jörg Bühler, Gerhard Wunder:
Optimal dynamic admission control in heterogeneous networks. WSA 2008: 217-224
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-04-24 23:01 CEST 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:
