default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Heindlmaier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j5]Andrea Munari
, Federico Clazzer, Gianluigi Liva, Michael Heindlmaier:
Multiple-Relay Slotted ALOHA: Performance Analysis and Bounds. IEEE Trans. Commun. 69(3): 1578-1594 (2021)
2010 – 2019
- 2019
- [i9]Andrea Munari, Federico Clazzer, Gianluigi Liva, Michael Heindlmaier:
Multiple-Relay Slotted ALOHA: Performance Analysis and Bounds. CoRR abs/1903.03420 (2019) - 2018
- [j4]Michael Heindlmaier, Shirin Saeedi Bidokhti:
Capacity Regions of Two-Receiver Broadcast Erasure Channels With Feedback and Memory. IEEE Trans. Inf. Theory 64(7): 5042-5069 (2018) - 2016
- [c15]Michael Heindlmaier, Markus Staudacher:
Iterative decoding for Noisy Network Coding for Two-Way Relay channels. ISTC 2016: 91-95 - [i8]Michael Heindlmaier, Shirin Saeedi Bidokhti:
Capacity Regions of Two-Receiver Broadcast Erasure Channels with Feedback and Memory. CoRR abs/1612.01487 (2016) - 2015
- [b1]Michael Heindlmaier:
Network Coding for Two-Way Relay Channels and Broadcast Erasure Channels with Feedback. Technical University Munich, Verlag Dr. Hut 2015, ISBN 978-3-8439-2391-0, pp. 1-207 - [c14]Michael Heindlmaier, Shirin Saeedi Bidokhti:
Capacity regions of two-user broadcast erasure channels with feedback and hidden memory. ISIT 2015: 406-410 - [i7]Michael Heindlmaier, Shirin Saeedi Bidokhti:
Capacity Regions of Two-User Broadcast Erasure Channels with Feedback and Hidden Memory. CoRR abs/1506.07198 (2015) - 2014
- [c13]Michael Heindlmaier, Navid Reyhanian, Shirin Saeedi Bidokhti:
On capacity regions of two-receiver broadcast packet erasure channels with feedback and memory. Allerton 2014: 191-198 - [c12]Michael Heindlmaier, Emina Soljanin:
Isn't hybrid ARQ sufficient? Allerton 2014: 563-568 - [c11]Michael Heindlmaier, Andrea Munari, Gianluigi Liva, Matteo Berioli:
Index coding for unicast flows in interactive satellite networks. ASMS/SPSC 2014: 211-217 - [c10]Michael Heindlmaier, Clemens Blöchl:
The two-user broadcast packet erasure channel with feedback and memory. NetCod 2014: 1-6 - [i6]Andrea Munari, Michael Heindlmaier, Gianluigi Liva, Matteo Berioli:
The Throughput of Slotted Aloha with Diversity. CoRR abs/1401.3660 (2014) - [i5]Michael Heindlmaier, Onurcan Iscan:
Rate-Distortion Properties of Single-Layer Quantize-and-Forward for Two-Way Relaying. CoRR abs/1402.0313 (2014) - [i4]Michael Heindlmaier, Navid Reyhanian, Shirin Saeedi Bidokhti:
Capacity Regions of Two-Receiver Broadcast Packet Erasure Channels with Feedback and Memory. CoRR abs/1410.0380 (2014) - [i3]Michael Heindlmaier, Emina Soljanin:
Isn't Hybrid ARQ Sufficient? CoRR abs/1411.4061 (2014) - 2013
- [c9]Andrea Munari, Michael Heindlmaier, Gianluigi Liva, Matteo Berioli:
The throughput of slotted aloha with diversity. Allerton 2013: 698-706 - [c8]Michael Heindlmaier, Onurcan Iscan, Christopher Rosanka:
Scalar Quantize-and-Forward for symmetric half-duplex Two-Way Relay Channels. ISIT 2013: 1322-1326 - [i2]Michael Heindlmaier, Onurcan Iscan, Christopher Rosanka:
Scalar Quantize-and-Forward for Symmetric Half-duplex Two-Way Relay Channels. CoRR abs/1301.6397 (2013) - 2012
- [j3]Dieter Duyck, Michael Heindlmaier, Daniele Capirone, Marc Moeneclaey:
Diversity analysis, code design, and tight error rate lower bound for binary joint network-channel coding. EURASIP J. Wirel. Commun. Netw. 2012: 350 (2012) - [j2]Danail Traskov, Michael Heindlmaier, Muriel Médard, Ralf Koetter:
Scheduling for Network-Coded Multicast. IEEE/ACM Trans. Netw. 20(5): 1479-1488 (2012) - [c7]Michael Heindlmaier, Onurcan Iscan, Ronald Böhnke, Christoph Hausl:
On optimized memoryless relaying functions for the two-way relay channel. ISWCS 2012: 271-275 - [i1]Dieter Duyck, Michael Heindlmaier, Daniele Capirone, Marc Moeneclaey:
Diversity Analysis, Code Design and Tight Error Rate Lower Bound for Binary Joint Network-Channel Coding. CoRR abs/1202.2944 (2012) - 2011
- [c6]Dieter Duyck, Daniele Capirone, Michael Heindlmaier, Marc Moeneclaey:
Towards full-diversity joint network-channel coding for large networks. EW 2011 - [c5]Michael Heindlmaier, Desmond S. Lun, Danail Traskov, Muriel Médard:
Wireless Inter-Session Network Coding - An Approach Using Virtual Multicasts. ICC 2011: 1-5 - [c4]Onurcan Iscan, Michael Heindlmaier, Christoph Hausl:
Network coded two-way relaying with reduced relay complexity. ISWCS 2011: 497-501 - [c3]Ashutosh Kulkarni, Michael Heindlmaier, Danail Traskov, Marie-José Montpetit, Muriel Médard:
An Implementation of Network Coding with Association Policies in Heterogeneous Networks. Networking Workshops 2011: 110-118 - 2010
- [c2]Maximilian Riemensberger, Michael Heindlmaier, Andreas Dotzler, Danail Traskov, Wolfgang Utschick:
Optimal slotted random access in coded wireless packet networks. WiOpt 2010: 387-392
2000 – 2009
- 2009
- [j1]Wei Chen, Danail Traskov, Michael Heindlmaier, Muriel Médard, Sean P. Meyn, Asuman E. Ozdaglar:
Coding and control for communication networks. Queueing Syst. Theory Appl. 63(1-4): 195-216 (2009) - [c1]Michael Heindlmaier, Lang Yu, Klaus Diepold:
The impact of nonlinear filtering and confidence information on optical flow estimation in a Lucas & Kanade framework. ICIP 2009: 1593-1596
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-09 13:01 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:
