Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Jaikumar Radhakrishnan"'
Autor:
Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal
Publikováno v:
Proceedings of the 55th Annual ACM Symposium on Theory of Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60c33ddc558adcd3770804fb14a10aa8
https://doi.org/10.1145/3564246.3585199
https://doi.org/10.1145/3564246.3585199
Publikováno v:
IEEE Transactions on Information Theory. 68:238-247
We consider the problem of determining the zero-error list-decoding capacity of the $q/(q-1)$ channel studied by Elias (1988). The $q/(q-1)$ channel has input and output alphabet consisting of $q$ symbols, say, $Q = \{x_1,x_2,\ldots, x_q\}$; when the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60fc926730cefe6fa2b7ab9c05b579ce
https://doi.org/10.1109/tit.2021.3111455
https://doi.org/10.1109/tit.2021.3111455
Publikováno v:
ISIT
We prove a new, improved upper bound on the size of codes C ⊆{1, 2, 3, 4}n with the property that every four distinct codewords in C have a coordinate where they all differ. Specifically, we show that such a code has size at most 26n/19 +o(n), or e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d89d5f27feb32c61b561f3205213484
https://doi.org/10.1109/tit.2019.2933424
https://doi.org/10.1109/tit.2019.2933424
Under the influence of oscillatory shear, a mono-layer of frictional granular disks exhibits two dynamical phase transitions: a transition from an initially disordered state to an ordered crystalline state, and a dynamic active-absorbing phase transi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bcdd99c14a69198a782e8d063f4bac1
Publikováno v:
SIAM Journal on Computing. 47:1644-1666
Saks and Wigderson [in Proceedings of the $27$th FOCS, IEEE Computer Society, Los Alamitos, CA, 1986, pp. 29--38] conjectured that $R_0(f) = \Omega(D(f)^{0.753\ldots})$ for all Boolean functions $f...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09c0db15e59f98eae55e7b9cd2bbafdb
https://doi.org/10.1137/17m1124115
https://doi.org/10.1137/17m1124115
Autor:
Jaikumar Radhakrishnan, Kshitij Gajjar
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030199548
CSR
CSR
It is \(\textsf {NP}\)-hard to determine the minimum number of branching vertices needed in a single-source distance-preserving subgraph of an undirected graph. We show that this problem can be solved in polynomial time if the input graph is an inter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a3025d4f5d0ac2de6a8bd5c3d931bd9
https://doi.org/10.1007/978-3-030-19955-5_12
https://doi.org/10.1007/978-3-030-19955-5_12
Publikováno v:
IEEE Transactions on Information Theory. 62:2836-2848
We consider the problem of communication over a classical-quantum broadcast channel with one sender and two receivers. Generalizing the classical inner bounds shown by Marton and the recent quantum asymptotic version shown by Savov and Wilde, we obta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::668ca94d75a10458c061f1c7b0907f29
https://doi.org/10.1109/tit.2016.2531795
https://doi.org/10.1109/tit.2016.2531795
Publikováno v:
ISIT
We consider the problem of determining the zero-error list-decoding capacity of the $q/(q-1)$ channel studied by Elias (1988). The $q/(q-1)$ channel has input and output alphabet consisting of $q$ symbols, say, $Q = \{x_1,x_2,\ldots, x_q\}$; when the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3ba69a04ada8f62e91d836718fb365c
http://arxiv.org/abs/1802.08396
http://arxiv.org/abs/1802.08396
Autor:
Jaikumar Radhakrishnan, Kshitij Gajjar
Publikováno v:
FOCS
We construct a family of planar graphs $\{G_n\}_{n\geq 4}$, where $G_n$ has $n$ vertices including a source vertex $s$ and a sink vertex $t$, and edge weights that change linearly with a parameter $\lambda$ such that, as $\lambda$ varies in $(-\infty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::880dfe063550604ab97ca4d7d8052bf6
Publikováno v:
SPAA
We show that some topologies arising naturally in the context of wireless networking are low-degree, expander graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::feed2882fd759402fa248bdff8fda599
https://doi.org/10.1145/2229163.2229165
https://doi.org/10.1145/2229163.2229165