default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaúl H. Etkin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c17]Eugene Chai, Kang G. Shin, Sung-Ju Lee, Jeongkeun Lee, Raúl H. Etkin:
SPIRO: Turning elephants into mice with efficient RF transport. INFOCOM 2015: 819-827- 2014
- [j11]Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Diamond Networks With Bursty Traffic: Bounds on the Minimum Energy-Per-Bit. IEEE Trans. Inf. Theory 60(1): 461-493 (2014) - [j10]Farzad Parvaresh, Raúl Hernán Etkin:
Efficient Capacity Computation and Power Optimization for Relay Networks. IEEE Trans. Inf. Theory 60(3): 1782-1792 (2014) - [j9]Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations. IEEE Trans. Inf. Theory 60(11): 7204-7220 (2014) - [j8]Eugene Chai, Kang G. Shin, Jeongkeun Lee, Sung-Ju Lee, Raúl H. Etkin:
Fast Spectrum Shaping for Next-Generation Wireless Networks. IEEE Trans. Mob. Comput. 13(1): 20-34 (2014) - 2013
- [j7]Farzad Parvaresh, Raúl H. Etkin:
Using Superposition Codebooks and Partial Decode-and-Forward in Low-SNR Parallel Relay Networks. IEEE Trans. Inf. Theory 59(3): 1704-1723 (2013) - [c16]Eugene Chai, Kang G. Shin, Sung-Ju Lee, Jeongkeun Lee, Raúl H. Etkin:
Defeating heterogeneity in wireless multicast networks. INFOCOM 2013: 560-564 - [c15]Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
On efficient min-cut approximations in half-duplex relay networks. ISIT 2013: 1949-1953 - [c14]Farzad Parvaresh, Raúl H. Etkin, Ilan Shomorony, Amir Salman Avestimehr:
On computing half-duplex relaying capacity in networks with orthogonal channels. IWCIT 2013: 1-6 - [i7]Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
On Min-Cut Algorithms for Half-Duplex Relay Networks. CoRR abs/1305.2548 (2013) - 2012
- [c13]Riccardo Crepaldi, Jeongkeun Lee, Raúl H. Etkin, Sung-Ju Lee, Robin Kravets
:
CSI-SF: Estimating wireless channel state using CSI sampling & fusion. INFOCOM 2012: 154-162 - [c12]Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Bounds on the minimum energy-per-bit for bursty traffic in diamond networks. ISIT 2012: 801-805 - [c11]Farzad Parvaresh, Raúl H. Etkin:
Superposition of binary and Gaussian codebooks to relay data in diamond networks. ISIT 2012: 940-944 - [c10]Eugene Chai, Jeongkeun Lee, Sung-Ju Lee, Raúl H. Etkin, Kang G. Shin:
Building efficient spectrum-agile devices for dummies. MobiCom 2012: 149-160 - [i6]Farzad Parvaresh, Raúl H. Etkin:
Using Superposition Codebooks and Partial Decode and Forward in Low SNR Parallel Relay Networks. CoRR abs/1205.3225 (2012) - [i5]Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Diamond Networks with Bursty Traffic: Bounds on the Minimum Energy-Per-Bit. CoRR abs/1205.6186 (2012) - 2011
- [j6]Raúl Hernán Etkin, Erik Ordentlich:
Analysis of Deterministic Binary Interference Channels Via a General Outer Bound. IEEE Trans. Inf. Theory 57(5): 2597-2604 (2011) - [c9]Farzad Parvaresh, Raúl H. Etkin:
On computing the capacity of relay networks in polynomial time. ISIT 2011: 1342-1346 - [c8]Sriram Lakshmanan, Jeongkeun Lee, Raúl H. Etkin, Sung-Ju Lee, Raghupathy Sivakumar:
Realizing high performance multi-radio 802.11n wireless networks. SECON 2011: 242-250 - [c7]Utpal Paul, Riccardo Crepaldi, Jeongkeun Lee, Sung-Ju Lee, Raúl H. Etkin:
Characterizing WiFi link performance in open outdoor networks. SECON 2011: 251-259 - [i4]Farzad Parvaresh, Raúl H. Etkin:
Efficient Capacity Computation and Power Optimization for Relay Networks. CoRR abs/1111.4244 (2011) - 2010
- [j5]Raúl Hernán Etkin, Neri Merhav, Erik Ordentlich:
Error exponents of optimum decoding for the interference channel. IEEE Trans. Inf. Theory 56(1): 40-56 (2010)
2000 – 2009
- 2009
- [j4]Raúl H. Etkin, Erik Ordentlich:
The degrees-of-freedom of the K-user Gaussian interference channel is discontinuous at rational channel coefficients. IEEE Trans. Inf. Theory 55(11): 4932-4946 (2009) - [c6]Raúl H. Etkin, Erik Ordentlich:
On the Degrees-of-Freedom of the K-user Gaussian interference channel. ISIT 2009: 1919-1923 - [c5]Raúl H. Etkin:
New sum-rate upper bound for the two-user Gaussian interference channel. ISIT 2009: 2582-2586 - [i3]Raúl H. Etkin, Erik Ordentlich:
On the Degrees-of-Freedom of the K-User Gaussian Interference Channel. CoRR abs/0901.1695 (2009) - 2008
- [j3]Raúl H. Etkin, David N. C. Tse, Hua Wang:
Gaussian Interference Channel Capacity to Within One Bit. IEEE Trans. Inf. Theory 54(12): 5534-5562 (2008) - [c4]Raúl H. Etkin, Neri Merhav, Erik Ordentlich:
Error exponents of optimum decoding for the interference channel. ISIT 2008: 1523-1527 - [i2]Raúl H. Etkin, Neri Merhav, Erik Ordentlich:
Error Exponents of Optimum Decoding for the Interference Channel. CoRR abs/0810.1980 (2008) - 2007
- [j2]Raúl H. Etkin, Abhay Parekh, David Tse:
Spectrum sharing for unlicensed bands. IEEE J. Sel. Areas Commun. 25(3): 517-528 (2007) - [c3]Raúl H. Etkin, David N. C. Tse, Hua Wang:
Gaussian Interference Channel Capacity to Within One Bit: the General Case. ISIT 2007: 2181-2185 - [c2]Raúl H. Etkin, Erik Ordentlich:
Discrete Memoryless Interference Channel: New Outer Bound. ISIT 2007: 2851-2855 - [i1]Raúl H. Etkin, David Tse, Hua Wang:
Gaussian Interference Channel Capacity to Within One Bit. CoRR abs/cs/0702045 (2007) - 2006
- [j1]Raúl H. Etkin, David N. C. Tse:
Degrees of freedom in some underspread MIMO fading channels. IEEE Trans. Inf. Theory 52(4): 1576-1608 (2006) - 2003
- [c1]Mehmet Izzet Gürelli, Raúl Hernán Etkin:
Capacity simulation of cdma2000 1×EV-DO forward link with opportunistic beam forming. GLOBECOM 2003: 1136-1140
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-24 23:20 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:
