default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaurabha Tavildar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c6]Saurabha R. Tavildar:
Bit-Permuted Coded Modulation for Polar Codes. WCNC Workshops 2017: 1-6- 2016
- [j5]Navid Abedini, Saurabha Tavildar, Junyi Li, Tom Richardson:
Distributed Synchronization for Device-to-Device Communications in an LTE Network. IEEE Trans. Wirel. Commun. 15(2): 1547-1561 (2016) - [i7]Saurabha Tavildar:
A H-ARQ scheme for polar codes. CoRR abs/1606.08545 (2016) - [i6]Saurabha Tavildar:
Bit-permuted coded modulation for polar codes. CoRR abs/1609.09786 (2016) - [i5]Saurabha Tavildar:
An interleaver design for polar codes over slow fading channels. CoRR abs/1610.04924 (2016) - 2015
- [i4]Bilal Sadiq, Saurabha Tavildar, Junyi Li:
Inband device-to-device relays in cellular networks. CoRR abs/1510.02519 (2015) - 2013
- [j4]Xinzhou Wu, Saurabha Tavildar, Sanjay Shakkottai, Tom Richardson, Junyi Li, Rajiv Laroia, Aleksandar Jovicic:
FlashLinQ: A Synchronous Distributed Scheduler for Peer-to-Peer Ad Hoc Networks. IEEE/ACM Trans. Netw. 21(4): 1215-1228 (2013) - 2012
- [c5]François Baccelli, Nilesh Khude, Rajiv Laroia, Junyi Li, Tom Richardson, Sanjay Shakkottai, Saurabha Tavildar, Xinzhou Wu:
On the design of device-to-device autonomous discovery. COMSNETS 2012: 1-9 - 2010
- [j3]Saurabha Tavildar, Pramod Viswanath, Aaron B. Wagner:
The Gaussian many-help-one distributed source coding problem. IEEE Trans. Inf. Theory 56(1): 564-581 (2010) - [c4]Xinzhou Wu, Saurabha Tavildar, Sanjay Shakkottai, Tom Richardson, Junyi Li, Rajiv Laroia, Aleksandar Jovicic:
FlashLinQ: A synchronous distributed scheduler for peer-to-peer ad hoc networks. Allerton 2010: 514-521
2000 – 2009
- 2008
- [j2]Aaron B. Wagner, Saurabha Tavildar, Pramod Viswanath:
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem. IEEE Trans. Inf. Theory 54(5): 1938-1961 (2008) - [i3]Saurabha Tavildar, Pramod Viswanath, Aaron B. Wagner:
The Gaussian Many-Help-One Distributed Source Coding Problem. CoRR abs/0805.1857 (2008) - 2006
- [b1]Saurabha R. Tavildar:
Source and Channel Coding for Wireless Networks. University of Illinois Urbana-Champaign, USA, 2006 - [j1]Saurabha Tavildar, Pramod Viswanath:
Approximately Universal Codes Over Slow-Fading Channels. IEEE Trans. Inf. Theory 52(7): 3233-3258 (2006) - [c3]Aaron B. Wagner, Saurabha Tavildar, Pramod Viswanath:
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem. ISIT 2006: 1404-1408 - 2005
- [i2]Aaron B. Wagner, Saurabha Tavildar, Pramod Viswanath:
Rate Region of the Quadratic Gaussian Two-Terminal Source-Coding Problem. CoRR abs/cs/0510095 (2005) - [i1]Saurabha Tavildar, Pramod Viswanath:
Approximately Universal Codes over Slow Fading Channels. CoRR abs/cs/0512017 (2005) - 2004
- [c2]Saurabha Tavildar, Pramod Viswanath:
Permutation codes: achieving the diversity-multiplexing tradeoff. ISIT 2004: 98 - [c1]Saurabha Tavildar, Pramod Viswanath:
Tradeoff-optimality of D-BLAST. ITW 2004: 45-49
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:10 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:
