Follow
Jay Mardia
Title
Cited by
Cited by
Year
Improved read/write cost tradeoff in DNA-based data storage using LDPC codes
S Chandak, K Tatwawadi, B Lau, J Mardia, M Kubit, J Neu, P Griffin, ...
2019 57th Annual Allerton Conference on Communication, Control, and …, 2019
842019
Overcoming high nanopore basecaller error rates for DNA storage via basecaller-decoder integration and convolutional codes
S Chandak, J Neu, K Tatwawadi, J Mardia, B Lau, M Kubit, R Hulett, ...
ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and …, 2020
582020
Concentration inequalities for the empirical distribution of discrete distributions: beyond the method of types
J Mardia, J Jiao, E Tánczos, RD Nowak, T Weissman
Information and Inference: A Journal of the IMA 9 (4), 813-850, 2020
56*2020
Repairing multiple failures for scalar MDS codes
J Mardia, B Bartan, M Wootters
IEEE Transactions on Information Theory 65 (5), 2661-2672, 2018
452018
Finding planted cliques in sublinear time
J Mardia, H Asi, KA Chandrasekher
arXiv preprint arXiv:2004.12002, 2020
102020
Is the space complexity of planted clique recovery the same as that of detection?
J Mardia
arXiv preprint arXiv:2008.12825, 2020
42020
Low-degree phase transitions for detecting a planted clique in sublinear time
J Mardia, KA Verchand, AS Wein
arXiv preprint arXiv:2402.05451, 2024
12024
Implementation and analysis of stabilizer codes in pyQuil
S Chandak, J Mardia, M Tolunay
12022
Some Algorithms and Hardness Results for the Planted Clique Problem
JS Mardia
Stanford University, 2023
2023
Logspace Reducibility From Secret Leakage Planted Clique
J Mardia
arXiv preprint arXiv:2107.11886, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–10