Sreeram Kannan
Sreeram Kannan
Assistant Professor, University of Washington
Verified email at uw.edu - Homepage
Title
Cited by
Cited by
Year
Communication algorithms via deep learning
H Kim, Y Jiang, R Rana, S Kannan, S Oh, P Viswanath
arXiv preprint arXiv:1805.09317, 2018
1032018
Deceiving google's perspective api built for detecting toxic comments
H Hosseini, S Kannan, B Zhang, R Poovendran
arXiv preprint arXiv:1702.08138, 2017
952017
Estimating mutual information for discrete-continuous mixtures
W Gao, S Kannan, S Oh, P Viswanath
Advances in neural information processing systems, 5986-5997, 2017
692017
Blocking transferability of adversarial examples in black-box learning systems
H Hosseini, Y Chen, S Kannan, B Zhang, R Poovendran
arXiv preprint arXiv:1703.04318, 2017
512017
Prism: Deconstructing the blockchain to approach physical limits
V Bagaria, S Kannan, D Tse, G Fanti, P Viswanath
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
46*2019
Clustergan: Latent space clustering in generative adversarial networks
S Mukherjee, H Asnani, E Lin, S Kannan
Proceedings of the AAAI Conference on Artificial Intelligence 33, 4610-4617, 2019
462019
Deepcode: Feedback codes via deep learning
H Kim, Y Jiang, S Kannan, S Oh, P Viswanath
Advances in neural information processing systems, 9436-9446, 2018
412018
Multicommodity flows and cuts in polymatroidal networks
C Chekuri, S Kannan, A Raja, P Viswanath
SIAM Journal on Computing 44 (4), 912-943, 2015
32*2015
Approximately optimal wireless broadcasting
S Kannan, A Raja, P Viswanath
Information Theory, IEEE Transactions on 58 (12), 7154-7167, 2012
312012
Multi-session function computation and multicasting in undirected graphs
S Kannan, P Viswanath
Selected Areas in Communications, IEEE Journal on 31 (4), 702-713, 2013
29*2013
Capacity of multiple unicast in wireless networks: A polymatroidal approach
S Kannan, P Viswanath
IEEE Transactions on Information Theory 60 (10), 6303-6328, 2014
27*2014
DMT of multi-hop cooperative networks-part I: basic results
K Sreeram, S Birenjith, PV Kumar
arXiv preprint arXiv:0808.0234, 2008
25*2008
Multi-hop cooperative wireless networks: diversity multiplexing tradeoff and optimal code design
K Sreeram, S Birenjith, PV Kumar
arXiv preprint arXiv:0802.1888, 2008
252008
Resolving multicopy duplications de novo using polyploid phasing
MJ Chaisson, S Mukherjee, S Kannan, EE Eichler
International Conference on Research in Computational Molecular Biology, 117-133, 2017
242017
Learn codes: Inventing low-latency codes via recurrent neural networks
Y Jiang, H Kim, H Asnani, S Kannan, S Oh, P Viswanath
IEEE Journal on Selected Areas in Information Theory, 2020
222020
Polyshard: Coded sharding achieves linearly scaling efficiency and security simultaneously
S Li, M Yu, S Avestimehr, S Kannan, P Viswanath
arXiv preprint arXiv:1809.10361, 2018
222018
DMT of multi-hop cooperative networks-part II: Half-duplex networks with full-duplex performance
K Sreeram, S Birenjith, PV Kumar
arXiv preprint arXiv:0808.0235, 2008
222008
Dmt of multihop networks: end points and computational tools
K Sreeram, S Birenjith, PV Kumar
IEEE transactions on information theory 58 (2), 804-819, 2012
21*2012
Shannon: An information-optimal de novo RNA-seq assembler
S Kannan, J Hui, K Mazooji, L Pachter, D Tse
bioRxiv, 039230, 2016
20*2016
DMT of parallel-path and layered networks under the half-duplex constraint
K Sreeram, S Birenjith, PV Kumar
IEEE transactions on information theory 59 (6), 3875-3891, 2013
20*2013
The system can't perform the operation now. Try again later.
Articles 1–20