default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoy Timo
Person information
- affiliation: Technical University of Munich, Germany
- affiliation (former): Ericsson Research, Stockholm, Sweden
- affiliation (former): Australian National University, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i19]Xingqin Lin, Mingzhe Chen, Henrik Rydén, Jaeseong Jeong, Heunchul Lee, Mårten Sundberg, Roy Timo, Hazhir Shokri-Razaghi, H. Vincent Poor:
Fueling the Next Quantum Leap in Cellular Networks: Embracing AI in 5G Evolution towards 6G. CoRR abs/2111.10663 (2021)
2010 – 2019
- 2019
- [j13]Badri N. Vellambi
, Roy Timo:
Common Reconstructions in the Successive Refinement Problem With Receiver Side Information. IEEE Trans. Inf. Theory 65(10): 6332-6354 (2019) - [j12]Roy Timo, Badri N. Vellambi, Alex J. Grant, Khoa D. Nguyen:
Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels. IEEE Trans. Inf. Theory 65(12): 8140-8163 (2019) - 2018
- [j11]Sadaf Salehkalaibar, Michèle A. Wigger, Roy Timo:
On Hypothesis Testing Against Conditional Independence With Multiple Decision Centers. IEEE Trans. Commun. 66(6): 2409-2420 (2018) - [j10]Roy Timo, Shirin Saeedi Bidokhti, Michèle A. Wigger, Bernhard C. Geiger:
A Rate-Distortion Approach to Caching. IEEE Trans. Inf. Theory 64(3): 1957-1976 (2018) - [j9]Shirin Saeedi Bidokhti, Michèle A. Wigger, Roy Timo:
Noisy Broadcast Networks With Receiver Caching. IEEE Trans. Inf. Theory 64(11): 6996-7016 (2018) - 2017
- [j8]Michèle A. Wigger, Roy Timo, Shlomo Shamai Shitz:
Conferencing in Wyner's Asymmetric Interference Network: Effect of Number of Rounds. IEEE Trans. Inf. Theory 63(2): 1199-1226 (2017) - [i18]Sadaf Salehkalaibar, Michèle A. Wigger, Roy Timo:
On Hypothesis Testing Against Independence with Multiple Decision Centers. CoRR abs/1708.03941 (2017) - 2016
- [c28]Shirin Saeedi Bidokhti, Michèle A. Wigger, Roy Timo:
Erasure broadcast networks with receiver caching. ISIT 2016: 1819-1823 - [c27]Lars Palzer, Roy Timo:
Fixed-length compression for letter-based fidelity measures in the finite blocklength regime. ISIT 2016: 2424-2428 - [c26]Shirin Saeedi Bidokhti, Michèle A. Wigger, Roy Timo:
An upper bound on the capacity-memory tradeoff of degraded broadcast channels. ISTC 2016: 350-354 - [c25]Lars Palzer, Roy Timo:
A lower bound for the rate-distortion function of spike sources that is asymptotically tight. ITW 2016: 101-105 - [c24]Michèle A. Wigger, Roy Timo, Shlomo Shamai:
Complete interference mitigation through receiver-caching in Wyner's networks. ITW 2016: 335-339 - [i17]Michèle Angela Wigger, Roy Timo, Shlomo Shamai:
Conferencing in Wyner's Asymmetric Interference Network: Effect of Number of Rounds. CoRR abs/1603.05540 (2016) - [i16]Shirin Saeedi Bidokhti, Michèle Angela Wigger, Roy Timo:
Noisy Broadcast Networks with Receiver Caching. CoRR abs/1605.02317 (2016) - [i15]Michèle Angela Wigger, Roy Timo, Shlomo Shamai:
Complete Interference Mitigation Through Receiver-Caching in Wyner's Networks. CoRR abs/1605.03761 (2016) - [i14]Lawrence Ong, Roy Timo:
A Multiway Relay Channel with Balanced Sources. CoRR abs/1605.09493 (2016) - [i13]Roy Timo, Shirin Saeedi Bidokhti, Michèle A. Wigger, Bernhard C. Geiger:
A Rate-Distortion Approach to Caching. CoRR abs/1610.07304 (2016) - [i12]Badri N. Vellambi, Roy Timo:
Common Reconstructions in the Successive Refinement Problem with Receiver Side Information. CoRR abs/1611.05467 (2016) - 2015
- [j7]Roy Timo, Michèle A. Wigger:
Slepian-Wolf Coding for Broadcasting With Cooperative Base-Stations. IEEE Trans. Commun. 63(5): 1850-1866 (2015) - [j6]Lawrence Ong, Roy Timo:
A Multiway Relay Channel With Balanced Sources. IEEE Trans. Commun. 63(12): 4809-4823 (2015) - [c23]Roy Timo, Michèle A. Wigger:
Slepian-wolf coding for broadcasting with cooperative base-stations. ISIT 2015: 266-270 - [c22]Khoa D. Nguyen, Roy Timo, Lars K. Rasmussen:
Causal-CSIT rate adaptation for block-fading channels. ISIT 2015: 351-355 - [c21]Abdellatif Zaidi, Mohamed Ali Moussa, Roy Timo:
Bounds on the benefits of interaction in distributed source coding for function computation. ISWCS 2015: 196-200 - [c20]Roy Timo, Michèle A. Wigger:
Joint cache-channel coding over erasure broadcast channels. ISWCS 2015: 201-205 - [c19]Michèle A. Wigger, Roy Timo, Shlomo Shamai:
Conferencing in Wyner's asymmetric interference network: Effect of number of rounds. ITW 2015: 1-5 - [i11]Roy Timo, Michèle A. Wigger:
Joint Cache-Channel Coding over Erasure Broadcast Channels. CoRR abs/1505.01016 (2015) - 2014
- [j5]Roy Timo, Tobias J. Oechtering, Michèle A. Wigger:
Source Coding Problems With Conditionally Less Noisy Side Information. IEEE Trans. Inf. Theory 60(9): 5516-5532 (2014) - [c18]Badri N. Vellambi, Roy Timo:
Lossy broadcasting with common transmitter-receiver reconstructions. AusCTW 2014: 138-143 - [c17]Roy Timo, Alex J. Grant, Badri N. Vellambi:
Streaming with autoregressive-hamming distortion for ultra short-delay communications. ISIT 2014: 16-20 - [c16]Badri N. Vellambi, Roy Timo:
Successive refinement with common receiver reconstructions. ISIT 2014: 2664-2668 - [i10]Roy Timo, Michèle A. Wigger:
A Base-Station Cooperation Model for Broadcasting. CoRR abs/1409.3050 (2014) - 2013
- [j4]Roy Timo, Gottfried Lechner, Lawrence Ong, Sarah J. Johnson:
Multi-Way Relay Networks: Orthogonal Uplink, Source-Channel Separation and Code Design. IEEE Trans. Commun. 61(2): 753-768 (2013) - [j3]Roy Timo, Alex J. Grant, Gerhard Kramer:
Lossy Broadcasting With Complementary Side Information. IEEE Trans. Inf. Theory 59(1): 104-131 (2013) - [c15]Roy Timo, Tobias J. Oechtering, Michèle A. Wigger:
Successive refinement with conditionally less noisy side information. ISIT 2013: 2985-2989 - [c14]Badri N. Vellambi, Roy Timo:
The Heegard-Berger problem with common receiver reconstructions. ITW 2013: 1-5 - 2012
- [c13]Tobias J. Oechtering, Michèle A. Wigger, Roy Timo:
Broadcast capacity regions with three receivers and message cognition. ISIT 2012: 388-392 - [c12]Lawrence Ong, Roy Timo, Sarah J. Johnson:
The finite field multi-way relay channel with correlated sources: Beyond three users. ISIT 2012: 791-795 - [c11]Roy Timo, Tobias J. Oechtering, Michèle A. Wigger:
Source coding with conditionally less noisy side information. ITW 2012: 55-59 - [i9]Lawrence Ong, Roy Timo, Gottfried Lechner, Sarah J. Johnson, Christopher M. Kellett:
The Three-User Finite Field Multi-Way Relay Channel with Correlated Sources. CoRR abs/1201.1684 (2012) - [i8]Lawrence Ong, Roy Timo, Sarah J. Johnson:
The Finite Field Multi-Way Relay Channel with Correlated Sources: Beyond Three Users. CoRR abs/1205.5603 (2012) - [i7]Roy Timo, Gottfried Lechner, Lawrence Ong, Sarah J. Johnson:
Multi-Way Relay Networks: Orthogonal Uplink, Source-Channel Separation and Code Design. CoRR abs/1210.0271 (2012) - [i6]Roy Timo, Tobias J. Oechtering, Michèle A. Wigger:
Source Coding Problems with Conditionally Less Noisy Side Information. CoRR abs/1212.2396 (2012) - 2011
- [j2]Roy Timo, Terence Chan, Alex J. Grant:
Rate Distortion With Side-Information at Many Decoders. IEEE Trans. Inf. Theory 57(8): 5240-5257 (2011) - [c10]Roy Timo, Lawrence Ong, Gottfried Lechner:
The Two-Way Relay Network with Arbitrarily Correlated Sources and an Orthogonal MAC. DCC 2011: 253-262 - [c9]Gottfried Lechner, Roy Timo, Lawrence Ong:
Sparse Graph Codes for the Two-Way Relay Network with Correlated Sources. DCC 2011: 466 - [c8]Lawrence Ong, Roy Timo, Gottfried Lechner, Sarah J. Johnson, Christopher M. Kellett:
The finite field multi-way relay channel with correlated sources: The three-user case. ISIT 2011: 2238-2242 - [c7]Roy Timo, Alex J. Grant, Gerhard Kramer:
Rate-distortion functions for source coding with complementary side information. ISIT 2011: 2934-2938 - [i5]Lawrence Ong, Roy Timo, Gottfried Lechner, Sarah J. Johnson, Christopher M. Kellett:
The Finite Field Multi-Way Relay Channel with Correlated Sources: The Three-User Case. CoRR abs/1106.2886 (2011) - 2010
- [j1]Roy Timo, Kim L. Blackmore, Leif Hanlen:
Word-valued sources: an ergodic theorem, an AEP, and the conservation of entropy. IEEE Trans. Inf. Theory 56(7): 3139-3148 (2010) - [c6]Songqing Zhao, Roy Timo, Terence Chan, Alex J. Grant, Daniela Tuninetti:
The Impact of Side-Information on Gaussian Source Transmission over Block-Fading Channels. ICC 2010: 1-5 - [c5]Roy Timo, Terence Chan, Alex J. Grant:
Rate distortion with Side-Information at many receivers. ISIT 2010: 16-20 - [i4]Roy Timo, Alex J. Grant, Gerhard Kramer:
Lossy Broadcasting in Two-Way Relay Networks with Common Reconstructions. CoRR abs/1011.4725 (2010)
2000 – 2009
- 2009
- [c4]Roy Timo, Badri N. Vellambi:
Two lossy source coding problems with causal side-information. ISIT 2009: 1040-1044 - [i3]Roy Timo, Terence Chan, Alexander J. Grant:
Rate-Distortion with Side-Information at Many Receivers. CoRR abs/0901.1705 (2009) - [i2]Roy C. Timo, Kim L. Blackmore, Leif Hanlen:
Word-Valued Sources: an Ergodic Theorem, an AEP and the Conservation of Entropy. CoRR abs/0904.3778 (2009) - 2008
- [c3]Roy Timo, Alex J. Grant, Terence Chan, Gerhard Kramer:
Source coding for a simple network with receiver side information. ISIT 2008: 2307-2311 - [i1]Roy Timo, Alexander J. Grant, Terence Chan, Gerhard Kramer:
Source Coding for a Simple Network with Receiver Side Information. CoRR abs/0805.4053 (2008) - 2007
- [c2]Roy Timo, Kim L. Blackmore, Leif Hanlen:
Strong Stochastic Stability for MANET Mobility Models. ICON 2007: 13-18 - 2006
- [c1]Roy C. Timo, Leif Hanlen:
MANETs: Routing Overhead and Reliability. VTC Spring 2006: 1107-1111
Coauthor Index
aka: Michèle Angela Wigger
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:10 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:
