default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUrs Niesen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c40]Urs Niesen, Jayakrishnan Unnikrishnan:
Camera-Radar Fusion for 3-D Depth Reconstruction. IV 2020: 265-271
2010 – 2019
- 2019
- [j28]Urs Niesen
, Shrinivas Kudekar:
Joint Crosstalk-Avoidance and Error-Correction Coding for Parallel Data Buses. IEEE Trans. Inf. Theory 65(3): 1626-1638 (2019) - [j27]Mohammad Ali Maddah-Ali, Urs Niesen:
Cache-Aided Interference Channels. IEEE Trans. Inf. Theory 65(3): 1714-1724 (2019) - [j26]Urs Niesen:
An Information-Theoretic Analysis of Deduplication. IEEE Trans. Inf. Theory 65(9): 5688-5704 (2019) - [j25]Urs Niesen, Jayakrishnan Unnikrishnan:
Joint Beamforming and Association Design for MIMO Radar. IEEE Trans. Signal Process. 67(14): 3663-3675 (2019) - [c39]Jayakrishnan Unnikrishnan, Urs Niesen:
Resolving Elevation Ambiguity in 1-D Radar Array Measurements using Deep Learning. IROS 2019: 5883-5888 - 2018
- [j24]Jad Hachem, Urs Niesen, Suhas N. Diggavi:
Energy-Efficiency Gains of Caching for Interference Channels. IEEE Commun. Lett. 22(7): 1434-1437 (2018) - [j23]Jad Hachem, Urs Niesen, Suhas N. Diggavi:
Degrees of Freedom of Cache-Aided Wireless Interference Networks. IEEE Trans. Inf. Theory 64(7): 5359-5380 (2018) - [c38]Urs Niesen, Jayakrishnan Unnikrishnan:
Association-Aware Radar Beamforming. ACSSC 2018: 1905-1909 - [i30]Jad Hachem, Urs Niesen, Suhas N. Diggavi:
Energy-Efficiency Gains of Caching for Interference Channels. CoRR abs/1808.00653 (2018) - [i29]Urs Niesen, Jayakrishnan Unnikrishnan:
Joint Beamforming and Association Design for MIMO Radar. CoRR abs/1809.03389 (2018) - 2017
- [j22]Urs Niesen, Mohammad Ali Maddah-Ali:
Coded Caching With Nonuniform Demands. IEEE Trans. Inf. Theory 63(2): 1146-1158 (2017) - [j21]Adiseshu Hari, Urs Niesen, Gordon T. Wilfong:
On the Problem of Optimal Path Encoding for Software-Defined Networks. IEEE/ACM Trans. Netw. 25(1): 189-198 (2017) - [j20]Urs Niesen, Venkatesan N. Ekambaram, Jubin Jose, Xinzhou Wu:
Intervehicle Range Estimation From Periodic Broadcasts. IEEE Trans. Veh. Technol. 66(12): 10637-10646 (2017) - [c37]Urs Niesen:
An information-theoretic analysis of deduplication. ISIT 2017: 1738-1742 - [i28]Urs Niesen:
An Information-Theoretic Analysis of Deduplication. CoRR abs/1701.04451 (2017) - 2016
- [j19]Mohammad Ali Maddah-Ali, Urs Niesen:
Coding for caching: fundamental limits and practical challenges. IEEE Commun. Mag. 54(8): 23-29 (2016) - [j18]Nikhil Karamchandani, Urs Niesen, Mohammad Ali Maddah-Ali, Suhas N. Diggavi:
Hierarchical Coded Caching. IEEE Trans. Inf. Theory 62(6): 3212-3229 (2016) - [j17]Ramtin Pedarsani, Mohammad Ali Maddah-Ali, Urs Niesen:
Online Coded Caching. IEEE/ACM Trans. Netw. 24(2): 836-845 (2016) - [c36]Jad Hachem, Urs Niesen, Suhas N. Diggavi:
A layered caching architecture for the interference channel. ISIT 2016: 415-419 - [i27]Urs Niesen, Shrinivas Kudekar:
Joint Crosstalk-Avoidance and Error-Correction Coding for Parallel Data Buses. CoRR abs/1601.04961 (2016) - [i26]Jad Hachem, Urs Niesen, Suhas N. Diggavi:
A Layered Caching Architecture for the Interference Channel. CoRR abs/1605.01668 (2016) - [i25]Jad Hachem, Urs Niesen, Suhas N. Diggavi:
Degrees of Freedom of Cache-Aided Wireless Interference Networks. CoRR abs/1606.03175 (2016) - 2015
- [j16]Yu-Chih Huang, Urs Niesen, Piyush Gupta:
Energy-Efficient Communication in the Presence of Synchronization Errors. IEEE Trans. Inf. Theory 61(11): 6131-6144 (2015) - [j15]Mohammad Ali Maddah-Ali, Urs Niesen:
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff. IEEE/ACM Trans. Netw. 23(4): 1029-1040 (2015) - [c35]Urs Niesen, Mohammad Ali Maddah-Ali:
Coded caching for delay-sensitive content. ICC 2015: 5559-5564 - [c34]Mohammad Ali Maddah-Ali, Urs Niesen:
Cache-aided interference channels. ISIT 2015: 809-813 - [c33]Subhashini Krishnasamy, Urs Niesen, Piyush Gupta:
On the scaling of interference alignment under delay and power constraints. ISIT 2015: 1487-1491 - [c32]Adiseshu Hari, Urs Niesen, Gordon T. Wilfong:
Optimal path encoding for software-defined networks. ISIT 2015: 2361-2365 - [c31]Urs Niesen, Venkatesan Nallampatti Ekambaram, Jubin Jose, Xinzhou Wu:
Vehicular Ranging Using Periodic Broadcasts. VTC Fall 2015: 1-5 - [i24]Subhashini Krishnasamy, Urs Niesen, Piyush Gupta:
On the Scaling of Interference Alignment Under Delay and Power Constraints. CoRR abs/1504.03246 (2015) - [i23]Adiseshu Hari, Urs Niesen, Gordon T. Wilfong:
Optimal Path Encoding for Software-Defined Networks. CoRR abs/1507.07217 (2015) - [i22]Mohammad Ali Maddah-Ali, Urs Niesen:
Cache-Aided Interference Channels. CoRR abs/1510.06121 (2015) - [i21]Urs Niesen, Venkatesan N. Ekambaram, Jubin Jose, Xinzhou Wu:
Vehicular Ranging using Periodic Broadcasts. CoRR abs/1512.02059 (2015) - 2014
- [j14]Mohammad Ali Maddah-Ali, Urs Niesen:
Fundamental Limits of Caching. IEEE Trans. Inf. Theory 60(5): 2856-2867 (2014) - [j13]Ritesh Kolte, Urs Niesen, Piyush Gupta:
Energy-Efficient Communication Over the Unsynchronized Gaussian Diamond Network. IEEE Trans. Inf. Theory 60(12): 7719-7731 (2014) - [c30]Ramtin Pedarsani, Mohammad Ali Maddah-Ali, Urs Niesen:
Online coded caching. ICC 2014: 1878-1883 - [c29]Urs Niesen, Mohammad Ali Maddah-Ali:
Coded caching with nonuniform demands. INFOCOM Workshops 2014: 221-226 - [c28]Ritesh Kolte, Urs Niesen, Piyush Gupta:
Energy-efficient communication over the unsynchronized Gaussian diamond network. ISIT 2014: 1201-1205 - [c27]Nikhil Karamchandani, Urs Niesen, Mohammad Ali Maddah-Ali, Suhas N. Diggavi:
Hierarchical coded caching. ISIT 2014: 2142-2146 - [i20]Ritesh Kolte, Urs Niesen, Piyush Gupta:
Energy-Efficient Communication over the Unsynchronized Gaussian Diamond Network. CoRR abs/1401.1711 (2014) - [i19]Nikhil Karamchandani, Urs Niesen, Mohammad Ali Maddah-Ali, Suhas N. Diggavi:
Hierarchical Coded Caching. CoRR abs/1403.7007 (2014) - [i18]Urs Niesen, Mohammad Ali Maddah-Ali:
Coded Caching for Delay-Sensitive Content. CoRR abs/1407.4489 (2014) - 2013
- [j12]Nikhil Karamchandani, Urs Niesen, Suhas N. Diggavi:
Computation over Mismatched Channels. IEEE J. Sel. Areas Commun. 31(4): 666-677 (2013) - [j11]Urs Niesen, Suhas N. Diggavi:
The Approximate Capacity of the Gaussian $N$-Relay Diamond Network. IEEE Trans. Inf. Theory 59(2): 845-859 (2013) - [j10]Urs Niesen, Bobak Nazer, Phil Whiting:
Computation Alignment: Capacity Approximation Without Noise Accumulation. IEEE Trans. Inf. Theory 59(6): 3811-3832 (2013) - [j9]Urs Niesen, Mohammad Ali Maddah-Ali:
Interference Alignment: From Degrees of Freedom to Constant-Gap Capacity Approximations. IEEE Trans. Inf. Theory 59(8): 4855-4888 (2013) - [c26]Mohammad Ali Maddah-Ali, Urs Niesen:
Decentralized coded caching attains order-optimal memory-rate tradeoff. Allerton 2013: 421-427 - [c25]Mohammad Ali Maddah-Ali, Urs Niesen:
Fundamental limits of caching. ISIT 2013: 1077-1081 - [c24]Yu-Chih Huang, Urs Niesen, Piyush Gupta:
Energy-efficient communication in the presence of synchronization errors. ISIT 2013: 2935-2939 - [i17]Mohammad Ali Maddah-Ali, Urs Niesen:
Decentralized Caching Attains Order-Optimal Memory-Rate Tradeoff. CoRR abs/1301.5848 (2013) - [i16]Yu-Chih Huang, Urs Niesen, Piyush Gupta:
Energy-Efficient Communication in the Presence of Synchronization Errors. CoRR abs/1301.6589 (2013) - [i15]Urs Niesen, Mohammad Ali Maddah-Ali:
Coded Caching with Nonuniform Demands. CoRR abs/1308.0178 (2013) - [i14]Ramtin Pedarsani, Mohammad Ali Maddah-Ali, Urs Niesen:
Online Coded Caching. CoRR abs/1311.3646 (2013) - 2012
- [j8]Urs Niesen, Phil Whiting:
The Degrees of Freedom of Compute-and-Forward. IEEE Trans. Inf. Theory 58(8): 5214-5232 (2012) - [j7]Urs Niesen, Devavrat Shah, Gregory W. Wornell:
Caching in Wireless Networks. IEEE Trans. Inf. Theory 58(10): 6524-6540 (2012) - [c23]Urs Niesen:
Session WA4a: Interference and cognition. ACSCC 2012: 1807-1808 - [c22]Urs Niesen, Thomas L. Marzetta:
Interference alignment for channel-adaptive waveform modulation. ACSCC 2012: 1809-1812 - [c21]Nikhil Karamchandani, Urs Niesen, Suhas N. Diggavi:
Computation over mismatched channels. Allerton Conference 2012: 1042-1048 - [c20]Urs Niesen, Mohammad Ali Maddah-Ali:
Interference alignment: From degrees-of-freedom to constant-gap capacity approximations. ISIT 2012: 2077-2081 - [i13]Nikhil Karamchandani, Urs Niesen, Suhas N. Diggavi:
Computation over Mismatched Channels. CoRR abs/1204.5059 (2012) - [i12]Mohammad Ali Maddah-Ali, Urs Niesen:
Fundamental Limits of Caching. CoRR abs/1209.5807 (2012) - 2011
- [j6]Urs Niesen:
Interference Alignment in Dense Wireless Networks. IEEE Trans. Inf. Theory 57(5): 2889-2901 (2011) - [c19]Urs Niesen, Bobak Nazer, Phil Whiting:
Computation alignment: Capacity approximation without noise accumulation. Allerton 2011: 1607-1612 - [c18]Urs Niesen, Suhas N. Diggavi:
The approximate capacity of the Gaussian N-relay diamond network. ISIT 2011: 259-263 - [c17]Urs Niesen, Phil Whiting:
The degrees of freedom of compute-and-forward. ISIT 2011: 1081-1085 - [c16]Sudeep Kamath, Urs Niesen, Piyush Gupta:
The capacity per unit energy of large wireless networks. ISIT 2011: 1618-1622 - [i11]Urs Niesen, Phil Whiting:
The Degrees of Freedom of Compute-and-Forward. CoRR abs/1101.2182 (2011) - [i10]Urs Niesen, Bobak Nazer, Phil Whiting:
Computation Alignment: Capacity Approximation without Noise Accumulation. CoRR abs/1108.6312 (2011) - [i9]Urs Niesen, Mohammad Ali Maddah-Ali:
Interference Alignment: From Degrees-of-Freedom to Constant-Gap Capacity Approximations. CoRR abs/1112.4879 (2011) - 2010
- [j5]Urs Niesen, Piyush Gupta, Devavrat Shah:
The balanced unicast and multicast capacity regions of large wireless networks. IEEE Trans. Inf. Theory 56(5): 2249-2271 (2010) - [c15]Urs Niesen, Suhas N. Diggavi:
Non-coherent hierarchical cooperation. Allerton 2010: 507-513 - [c14]Urs Niesen, Piyush Gupta, David Tse:
A communication architecture for large heterogeneous wireless networks. Allerton 2010: 1280-1287 - [c13]Urs Niesen, Piyush Gupta, David Tse:
On the optimality of multi-hop communication in large wireless networks. ISIT 2010: 505-509 - [i8]Urs Niesen, Suhas N. Diggavi:
The Approximate Capacity of the Gaussian N-Relay Diamond Network. CoRR abs/1008.3813 (2010)
2000 – 2009
- 2009
- [b1]Urs Niesen:
Scaling laws for heterogeneous wireless networks. Massachusetts Institute of Technology, Cambridge, MA, USA, 2009 - [j4]Urs Niesen, Aslan Tchamkerten:
Tracking Stopping Times Through Noisy Observations. IEEE Trans. Inf. Theory 55(1): 422-432 (2009) - [j3]Urs Niesen, Devavrat Shah, Gregory W. Wornell:
Adaptive Alternating Minimization Algorithms. IEEE Trans. Inf. Theory 55(3): 1423-1429 (2009) - [j2]Urs Niesen, Piyush Gupta, Devavrat Shah:
On capacity scaling in arbitrary wireless networks. IEEE Trans. Inf. Theory 55(9): 3959-3982 (2009) - [c12]Urs Niesen, Piyush Gupta, Devavrat Shah:
The Multicast Capacity Region of Large Wireless Networks. INFOCOM 2009: 1881-1889 - [c11]Urs Niesen, Devavrat Shah, Gregory W. Wornell:
Caching in wireless networks. ISIT 2009: 2111-2115 - [i7]Urs Niesen, Devavrat Shah, Gregory W. Wornell:
Caching in Wireless Networks. CoRR abs/0908.1916 (2009) - [i6]Urs Niesen:
Interference Alignment in Dense Wireless Networks. CoRR abs/0912.0868 (2009) - 2008
- [c10]Urs Niesen, Piyush Gupta, Devavrat Shah:
The capacity region of large wireless networks. Allerton 2008: 460-466 - [c9]Urs Niesen, Piyush Gupta, Devavrat Shah:
Hierarchical cooperation for arbitrary wireless networks. ISIT 2008: 181-185 - [c8]Urs Niesen, Piyush Gupta, Devavrat Shah:
Cooperative multi-hop schemes for arbitrary wireless networks. ITW 2008: 222-226 - [i5]Urs Niesen, Devavrat Shah, Gregory W. Wornell:
Source Coding with Mismatched Distortion Measures. CoRR abs/0804.0635 (2008) - [i4]Urs Niesen, Piyush Gupta, Devavrat Shah:
The Capacity Region of Large Wireless Networks. CoRR abs/0809.1344 (2008) - 2007
- [j1]Urs Niesen, Christina Fragouli, Daniela Tuninetti:
On Capacity of Line Networks. IEEE Trans. Inf. Theory 53(11): 4039-4058 (2007) - [c7]Urs Niesen, Aslan Tchamkerten, Gregory W. Wornell:
The Complexity of Tracking a Stopping Time. ISIT 2007: 1136-1140 - [c6]Urs Niesen, Devavrat Shah, Gregory W. Wornell:
Adaptive Alternating Minimization Algorithms. ISIT 2007: 1641-1645 - [i3]Urs Niesen, Piyush Gupta, Devavrat Shah:
On Capacity Scaling in Arbitrary Wireless Networks. CoRR abs/0711.2745 (2007) - [i2]Urs Niesen, Devavrat Shah, Gregory W. Wornell:
Adaptive Alternating Minimization Algorithms. CoRR abs/cs/0701043 (2007) - [i1]Urs Niesen, Aslan Tchamkerten, Gregory W. Wornell:
Tracking Stopping Times. CoRR abs/math/0701261 (2007) - 2006
- [c5]Urs Niesen, Uri Erez, Devavrat Shah, Gregory W. Wornell:
Rateless Codes for the Gaussian Multiple Access Channel. GLOBECOM 2006 - [c4]Urs Niesen, Christina Fragouli, Daniela Tuninetti:
Scaling Laws for Line Networks: From Zero-Error to Min-Cut Capacity. ISIT 2006: 1698-1702 - 2004
- [c3]Urs Niesen, Beat Pfister:
Speaker verification by means of ANNs. ESANN 2004: 145-150 - [c2]Jin Lu, José M. F. Moura, Urs Niesen:
A class of structured LDPC codes with large girth. ICC 2004: 425-429 - [c1]Jin Lu, José M. F. Moura, Urs Niesen:
Grouping-and-shifting designs for structured LDPC codes with large girth. ISIT 2004: 236
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-04-25 05:54 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:
