default search action
Arya Mazumdar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j33]Andrew B. Kahng
, Arya Mazumdar, Jodi Reeves, Yusu Wang:
The TILOS AI Institute: Integrating optimization and AI for chip design, networks, and robotics. AI Mag. 45(1): 54-60 (2024) - [j32]Wasim Huleihel, Arya Mazumdar, Soumyabrata Pal:
Random Subgraph Detection Using Queries. J. Mach. Learn. Res. 25: 126:1-126:25 (2024) - [j31]Namiko Matsumoto
Improved Support Recovery in Universal 1-bit Compressed Sensing. IEEE Trans. Inf. Theory 70(2): 1453-1472 (2024) - [j30]Avishek Ghosh
Competing Bandits in Non-Stationary Matching Markets. IEEE Trans. Inf. Theory 70(4): 2831-2850 (2024) - [j29]Harsh Vardhan, Avishek Ghosh, Arya Mazumdar:
An Improved Federated Clustering Algorithm with Model-based Clustering. Trans. Mach. Learn. Res. 2024 (2024) - [c90]Daniel Hsu, Arya Mazumdar:
On the sample complexity of parameter estimation in logistic regression with normal design. COLT 2024: 2418-2437 - [c89]Avishek Ghosh, Arya Mazumdar:
Agnostic Learning of Mixed Linear Regressions with EM and AM Algorithms. ICML 2024 - [c88]Neophytos Charalambides, Arya Mazumdar:
Distributed Local Sketching for £2 Embeddings. ISIT 2024: 1901-1906 - [c87]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar:
DIST-CURE: A Robust Distributed Learning Algorithm with Cubic Regularized Newton. ISIT 2024: 3642-3647 - [c86]Namiko Matsumoto, Arya Mazumdar:
Robust 1-bit Compressed Sensing with Iterative Hard Thresholding. SODA 2024: 2941-2979 - [i79]Avishek Ghosh, Arya Mazumdar:
Agnostic Learning of Mixed Linear Regressions with EM and AM Algorithms. CoRR abs/2406.01149 (2024) - [i78]Akhil Jalan, Arya Mazumdar, Soumendu Sundar Mukherjee, Purnamrita Sarkar:
Transfer Learning for Latent Variable Network Models. CoRR abs/2406.03437 (2024) - [i77]Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha:
Clustering with Non-adaptive Subset Queries. CoRR abs/2409.10908 (2024) - 2023
- [j28]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
Community Recovery in the Geometric Block Model. J. Mach. Learn. Res. 24: 338:1-338:53 (2023) - [j27]Arya Mazumdar
Capacity of Locally Recoverable Codes. IEEE J. Sel. Areas Inf. Theory 4: 276-285 (2023) - [c85]Xiaofan Yu
Async-HFL: Efficient and Robust Asynchronous Federated Learning in Hierarchical IoT Networks. IoTDI 2023: 236-248 - [c84]Heng Zhu, Avishek Ghosh, Arya Mazumdar:
Optimal Compression of Unit Norm Vectors in the High Distortion Regime. ISIT 2023: 719-724 - [i76]Xiaofan Yu, Ludmila Cherkasova, Harsh Vardhan, Quanling Zhao, Emily Ekaireb, Xiyuan Zhang, Arya Mazumdar, Tajana Rosing:
Async-HFL: Efficient and Robust Asynchronous Federated Learning in Hierarchical IoT Networks. CoRR abs/2301.06646 (2023) - [i75]Yash Chandak, Shiv Shankar, Venkata Gandikota
Optimization using Parallel Gradient Evaluations on Multiple Parameters. CoRR abs/2302.03161 (2023) - [i74]Daniel Hsu, Arya Mazumdar:
On the sample complexity of estimation in logistic regression. CoRR abs/2307.04191 (2023) - [i73]Heng Zhu, Avishek Ghosh, Arya Mazumdar:
Optimal Compression of Unit Norm Vectors in the High Distortion Regime. CoRR abs/2307.07941 (2023) - [i72]Namiko Matsumoto, Arya Mazumdar:
Robust 1-bit Compressed Sensing with Iterative Hard Thresholding. CoRR abs/2310.08019 (2023) - 2022
- [j26]Venkata Gandikota
vqSGD: Vector Quantized Stochastic Gradient Descent. IEEE Trans. Inf. Theory 68(7): 4573-4587 (2022) - [c83]Soumyabrata Pal, Arya Mazumdar:
On Learning Mixture Models with Sparse Parameters. AISTATS 2022: 9182-9213 - [c82]Sami Davies, Arya Mazumdar, Soumyabrata Pal, Cyrus Rashtchian:
Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians. ALT 2022: 319-341 - [c81]Namiko Matsumoto, Arya Mazumdar:
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing. FOCS 2022: 813-822 - [c80]Soumyabrata Pal, Arya Mazumdar, Rajat Sen, Avishek Ghosh:
On Learning Mixture of Linear Regressions in the Non-Realizable Setting. ICML 2022: 17202-17220 - [c79]Arya Mazumdar, Soumyabrata Pal:
Support Recovery in Universal One-Bit Compressed Sensing. ITCS 2022: 106:1-106:20 - [i71]Arya Mazumdar, Soumyabrata Pal:
On Learning Mixture Models with Sparse Parameters. CoRR abs/2202.11940 (2022) - [i70]Avishek Ghosh, Arya Mazumdar, Soumyabrata Pal, Rajat Sen:
On Learning Mixture of Linear Regressions in the Non-Realizable Setting. CoRR abs/2205.13166 (2022) - [i69]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran, Tara Javidi
Decentralized Competing Bandits in Non-Stationary Matching Markets. CoRR abs/2206.00120 (2022) - [i68]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
Community Recovery in the Geometric Block Model. CoRR abs/2206.11303 (2022) - [i67]Namiko Matsumoto, Arya Mazumdar:
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing. CoRR abs/2207.03427 (2022) - [i66]Harsh Vardhan, Avishek Ghosh, Arya Mazumdar:
An Improved Algorithm for Clustered Federated Learning. CoRR abs/2210.11538 (2022) - [i65]Namiko Matsumoto, Arya Mazumdar, Soumyabrata Pal:
Improved Support Recovery in Universal One-bit Compressed Sensing. CoRR abs/2210.16657 (2022) - 2021
- [j25]Avishek Ghosh, Raj Kumar Maity
Communication-Efficient and Byzantine-Robust Distributed Learning With Error Feedback. IEEE J. Sel. Areas Inf. Theory 2(3): 942-953 (2021) - [j24]Arya Mazumdar
Semisupervised Clustering by Queries and Locally Encodable Source Coding. IEEE Trans. Inf. Theory 67(2): 1141-1155 (2021) - [j23]Akshay Krishnamurthy
Trace Reconstruction: Generalized and Parameterized. IEEE Trans. Inf. Theory 67(6): 3233-3250 (2021) - [c78]Venkata Gandikota, Daniel Kane, Raj Kumar Maity, Arya Mazumdar:
vqSGD: Vector Quantized Stochastic Gradient Descent. AISTATS 2021: 2197-2205 - [c77]Larkin Flodin, Arya Mazumdar:
Probabilistic Group Testing with a Linear Number of Tests. ISIT 2021: 1248-1253 - [c76]Saikiran Bulusu, Venkata Gandikota
Byzantine Resilient Distributed Clustering with Redundant Data Assignment. ISIT 2021: 2143-2148 - [c75]Nishant Yadav, Rajat Sen, Daniel N. Hill, Arya Mazumdar, Inderjit S. Dhillon:
Session-Aware Query Auto-completion using Extreme Multi-Label Ranking. KDD 2021: 3835-3844 - [c74]Wasim Huleihel, Arya Mazumdar, Soumyabrata Pal:
Fuzzy Clustering with Similarity Queries. NeurIPS 2021: 789-801 - [c73]Soumyabrata Pal, Arya Mazumdar, Venkata Gandikota:
Support Recovery of Sparse Signals from a Mixture of Linear Measurements. NeurIPS 2021: 19082-19094 - [i64]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar, Kannan Ramchandran:
Escaping Saddle Points in Distributed Newton's Method with Communication efficiency and Byzantine Resilience. CoRR abs/2103.09424 (2021) - [i63]Wasim Huleihel, Arya Mazumdar, Soumyabrata Pal:
Fuzzy Clustering with Similarity Queries. CoRR abs/2106.02212 (2021) - [i62]Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal:
Support Recovery of Sparse Signals from a Mixture of Linear Measurements. CoRR abs/2106.05951 (2021) - [i61]Larkin Flodin, Arya Mazumdar:
Probabilistic Group Testing with a Linear Number of Tests. CoRR abs/2106.06878 (2021) - [i60]Arya Mazumdar, Soumyabrata Pal:
Support Recovery in Universal One-bit Compressed Sensing. CoRR abs/2107.09091 (2021) - [i59]Sami Davies, Arya Mazumdar, Soumyabrata Pal, Cyrus Rashtchian:
Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians. CoRR abs/2109.01064 (2021) - [i58]Wasim Huleihel, Arya Mazumdar, Soumyabrata Pal:
Random Subgraph Detection Using Queries. CoRR abs/2110.00744 (2021) - 2020
- [j22]Ryan McKenna, Raj Kumar Maity, Arya Mazumdar, Gerome Miklau:
A workload-adaptive mechanism for linear queries under local differential privacy. Proc. VLDB Endow. 13(11): 1905-1918 (2020) - [c72]Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal:
Algebraic and Analytic Approaches for Parameter Learning in Mixture Models. ALT 2020: 468-489 - [c71]Soumyabrata Pal, Arya Mazumdar:
Recovery of Sparse Signals from a Mixture of Linear Samples. ICML 2020: 7466-7475 - [c70]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar, Kannan Ramchandran:
Communication Efficient Distributed Approximate Newton Method. ISIT 2020: 2539-2544 - [c69]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe
Communication Efficient and Byzantine Tolerant Distributed Learning. ISIT 2020: 2545-2550 - [c68]Venkata Gandikota
Reliable Distributed Clustering with Redundant Data Assignment. ISIT 2020: 2556-2561 - [c67]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe
Communication-Efficient and Byzantine-Robust Distributed Learning. ITA 2020: 1-28 - [c66]Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal:
Recovery of sparse linear classifiers from mixture of responses. NeurIPS 2020 - [c65]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar:
Distributed Newton Can Communicate Less and Resist Byzantine Workers. NeurIPS 2020 - [c64]Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük:
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. NeurIPS 2020 - [c63]Raj Kumar Maity, Arya Mazumdar, Soumyabrata Pal:
High Dimensional Discrete Integration over the Hypergrid. UAI 2020: 410-419 - [i57]Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal:
Algebraic and Analytic Approaches for Parameter Learning in Mixture Models. CoRR abs/2001.06776 (2020) - [i56]Ryan McKenna, Raj Kumar Maity, Arya Mazumdar, Gerome Miklau:
A workload-adaptive mechanism for linear queries under local differential privacy. CoRR abs/2002.01582 (2020) - [i55]Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat:
Reliable Distributed Clustering with Redundant Data Assignment. CoRR abs/2002.08892 (2020) - [i54]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar:
Distributed Newton Can Communicate Less and Resist Byzantine Workers. CoRR abs/2006.08737 (2020) - [i53]Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük:
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. CoRR abs/2006.14084 (2020) - [i52]Arya Mazumdar, Soumyabrata Pal:
Recovery of Sparse Signals from a Mixture of Linear Samples. CoRR abs/2006.16406 (2020) - [i51]Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal:
Recovery of sparse linear classifiers from mixture of responses. CoRR abs/2010.12087 (2020) - [i50]Nishant Yadav, Rajat Sen, Daniel N. Hill, Arya Mazumdar, Inderjit S. Dhillon:
Session-Aware Query Auto-completion using Extreme Multi-label Ranking. CoRR abs/2012.07654 (2020)
2010 – 2019
- 2019
- [j21]Abhishek Agarwal, Larkin Flodin
Linear Programming Approximations for Index Coding. IEEE Trans. Inf. Theory 65(9): 5547-5564 (2019) - [j20]Arya Mazumdar
Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate. IEEE Trans. Inf. Theory 65(9): 5580-5591 (2019) - [c62]Arya Mazumdar, Ankit Singh Rawat:
Learning and Recovery in the ReLU Model. Allerton 2019: 108-115 - [c61]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
Connectivity of Random Annulus Graphs and the Geometric Block Model. APPROX-RANDOM 2019: 53:1-53:23 - [c60]Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal:
Trace Reconstruction: Generalized and Parameterized. ESA 2019: 68:1-68:25 - [c59]Raj Kumar Maity, Ankit Singh Rawat, Arya Mazumdar:
Robust Gradient Descent via Moment Encoding and LDPC Codes. ISIT 2019: 2734-2738 - [c58]Larkin Flodin, Venkata Gandikota, Arya Mazumdar:
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing. NeurIPS 2019: 10387-10396 - [c57]Wasim Huleihel, Arya Mazumdar, Muriel Médard, Soumyabrata Pal:
Same-Cluster Querying for Overlapping Clusters. NeurIPS 2019: 10485-10495 - [c56]Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal:
Sample Complexity of Learning Mixture of Sparse Linear Regressions. NeurIPS 2019: 10531-10540 - [i49]Arya Mazumdar, Soumyabrata Pal:
Semisupervised Clustering by Queries and Locally Encodable Source Coding. CoRR abs/1904.00507 (2019) - [i48]Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal:
Trace Reconstruction: Generalized and Parameterized. CoRR abs/1904.09618 (2019) - [i47]Wasim Huleihel, Arya Mazumdar, Muriel Médard, Soumyabrata Pal:
Same-Cluster Querying for Overlapping Clusters. CoRR abs/1910.12490 (2019) - [i46]Larkin Flodin, Venkata Gandikota, Arya Mazumdar:
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing. CoRR abs/1910.13971 (2019) - [i45]Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal:
Sample Complexity of Learning Mixtures of Sparse Linear Regressions. CoRR abs/1910.14106 (2019) - [i44]Venkata Gandikota, Raj Kumar Maity, Arya Mazumdar:
vqSGD: Vector Quantized Stochastic Gradient Descent. CoRR abs/1911.07971 (2019) - [i43]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication-Efficient and Byzantine-Robust Distributed Learning. CoRR abs/1911.09721 (2019) - 2018
- [j19]Abhishek Agarwal, Alexander Barg
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. IEEE Trans. Inf. Theory 64(5): 3481-3492 (2018) - [c55]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
The Geometric Block Model. AAAI 2018: 2215-2222 - [c54]Sainyam Galhotra, Soumyabrata Pal, Arya Mazumdar, Barna Saha:
The Geometric Block Model and Applications. Allerton 2018: 1147-1150 - [c53]Abhishek Agarwal, Sidharth Jaggi, Arya Mazumdar:
Novel Impossibility Results for Group-Testing. ISIT 2018: 2579-2583 - [c52]Arya Mazumdar:
Capacity of Locally Recoverable Codes. ITW 2018: 1-5 - [i42]Abhishek Agarwal, Sidharth Jaggi, Arya Mazumdar:
Novel Impossibility Results for Group-Testing. CoRR abs/1801.02701 (2018) - [i41]Arya Mazumdar, Ankit Singh Rawat:
Representation Learning and Recovery in the ReLU Model. CoRR abs/1803.04304 (2018) - [i40]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
Connectivity in Random Annulus Graphs and the Geometric Block Model. CoRR abs/1804.05013 (2018) - [i39]Raj Kumar Maity, Ankit Singh Rawat, Arya Mazumdar:
Robust Gradient Descent via Moment Encoding with LDPC Codes. CoRR abs/1805.08327 (2018) - [i38]Raj Kumar Maity, Arya Mazumdar, Soumyabrata Pal:
High Dimensional Discrete Integration by Hashing and Optimization. CoRR abs/1806.11542 (2018) - [i37]Abhishek Agarwal, Larkin Flodin, Arya Mazumdar:
Linear Programming Approximations for Index Coding. CoRR abs/1807.07193 (2018) - [i36]Arya Mazumdar:
Capacity of Locally Recoverable Codes. CoRR abs/1808.10262 (2018) - [i35]Po-Ling Loh, Arya Mazumdar, Dimitris S. Papailiopoulos, Rüdiger L. Urbanke:
Coding Theory for Inference, Learning and Optimization (Dagstuhl Seminar 18112). Dagstuhl Reports 8(3): 60-73 (2018) - 2017
- [j18]Shashanka Ubaru
Low Rank Approximation and Decomposition of Large Matrices Using Error Correcting Codes. IEEE Trans. Inf. Theory 63(9): 5544-5558 (2017) - [j17]Alexander Barg
Group Testing Schemes From Codes and Designs. IEEE Trans. Inf. Theory 63(11): 7131-7141 (2017) - [c51]Arya Mazumdar, Ankit Singh Rawat:
Associative Memory Using Dictionary Learning and Expander Decoding. AAAI 2017: 267-273 - [c50]Arya Mazumdar, Barna Saha:
A Theoretical Analysis of First Heuristics of Crowdsourced Entity Resolution. AAAI 2017: 970-976 - [c49]Pan Li, Arya Mazumdar, Olgica Milenkovic:
Efficient Rank Aggregation via Lehmer Codes. AISTATS 2017: 450-459 - [c48]Milad Nasr, Amir Houmansadr, Arya Mazumdar:
Compressive Traffic Analysis: A New Paradigm for Scalable Traffic Analysis. CCS 2017: 2053-2069 - [c47]Shashanka Ubaru, Arya Mazumdar:
Multilabel Classification with Group Testing and Codes. ICML 2017: 3492-3501 - [c46]Abhishek Agarwal, Larkin Flodin
Estimation of sparsity via simple measurements. ISIT 2017: 456-460 - [c45]Arya Mazumdar, Andrew McGregor, Sofya Vorotnikova:
Storage capacity as an information-theoretic analogue of vertex cover. ISIT 2017: 2810-2814 - [c44]Arya Mazumdar, Barna Saha:
Query Complexity of Clustering with Side Information. NIPS 2017: 4682-4693 - [c43]Arya Mazumdar, Barna Saha:
Clustering with Noisy Queries. NIPS 2017: 5788-5799 - [c42]Arya Mazumdar, Soumyabrata Pal:
Semisupervised Clustering, AND-Queries and Locally Encodable Source Coding. NIPS 2017: 6489-6499 - [i34]Pan Li, Arya Mazumdar, Olgica Milenkovic:
Efficient Rank Aggregation via Lehmer Codes. CoRR abs/1701.09083 (2017) - [i33]Arya Mazumdar, Barna Saha:
A Theoretical Analysis of First Heuristics of Crowdsourced Entity Resolution. CoRR abs/1702.01208 (2017) - [i32]Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, Itzhak Tamo:
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. CoRR abs/1702.02685 (2017) - [i31]Arya Mazumdar, Barna Saha:
Clustering with Noisy Queries. CoRR abs/1706.07510 (2017) - [i30]Arya Mazumdar, Barna Saha:
Query Complexity of Clustering with Side Information. CoRR abs/1706.07719 (2017) - [i29]Arya Mazumdar, Andrew McGregor, Sofya Vorotnikova:
Storage Capacity as an Information-Theoretic Analogue of Vertex Cover. CoRR abs/1706.09197 (2017) - [i28]Abhishek Agarwal, Larkin Flodin, Arya Mazumdar:
Estimation of Sparsity via Simple Measurements. CoRR abs/1707.06664 (2017) - [i27]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
The Geometric Block Model. CoRR abs/1709.05510 (2017) - 2016
- [j16]Abhishek Agarwal, Arya Mazumdar
Security in Locally Repairable Storage. IEEE Trans. Inf. Theory 62(11): 6204-6217 (2016) - [j15]Arya Mazumdar
Nonadaptive Group Testing With Random Set of Defectives. IEEE Trans. Inf. Theory 62(12): 7522-7531 (2016) - [c41]Arya Mazumdar, Barna Saha:
Clustering with an oracle. Allerton 2016: 738-739 - [c40]Abhishek Agarwal, Arya Mazumdar:
Bounds on the rate of linear locally repairable codes over small alphabets. Allerton 2016: 1041-1045 - [c39]Abhishek Agarwal, Arya Mazumdar:
Local Partial Clique and Cycle Covers for Index Coding. GLOBECOM Workshops 2016: 1-6 - [c38]Shashanka Ubaru, Arya Mazumdar, Alexander Barg:
Group testing schemes from low-weight codewords of BCH codes. ISIT 2016: 2863-2867 - [c37]Arya Mazumdar, Yury Polyanskiy, Ankit Singh Rawat
Distance preserving maps and combinatorial joint source-channel coding for large alphabets. ISIT 2016: 3067-3071 - [c36]William Rurik, Arya Mazumdar:
Hamming codes as error-reducing codes. ITW 2016: 404-408 - [i26]Abhishek Agarwal, Arya Mazumdar:
Local Partial Clique Covers for Index Coding. CoRR abs/1603.02366 (2016) - [i25]Arya Mazumdar, Barna Saha:
Clustering Via Crowdsourcing. CoRR abs/1604.01839 (2016) - [i24]Abhishek Agarwal, Arya Mazumdar:
Bounds on the Rate of Linear Locally Repairable Codes over Small Alphabets. CoRR abs/1607.08547 (2016) - [i23]Arya Mazumdar, Ankit Singh Rawat:
Associative Memory using Dictionary Learning and Expander Decoding. CoRR abs/1611.09621 (2016) - 2015
- [j14]Ankit Singh Rawat
Cooperative local repair in distributed storage. EURASIP J. Adv. Signal Process. 2015: 107 (2015) - [j13]Alexander Barg, Arya Mazumdar, Rongrong Wang:
Restricted Isometry Property of Random Subdictionaries. IEEE Trans. Inf. Theory 61(8): 4440-4450 (2015) - [j12]Viveck R. Cadambe
Bounds on the Size of Locally Recoverable Codes. IEEE Trans. Inf. Theory 61(11): 5787-5794 (2015) - [j11]Arya Mazumdar:
Storage Capacity of Repairable Networks. IEEE Trans. Inf. Theory 61(11): 5810-5821 (2015) - [j10]Da Wang, Arya Mazumdar, Gregory W. Wornell:
Compression in the Space of Permutations. IEEE Trans. Inf. Theory 61(12): 6417-6431 (2015) - [c35]Shashanka Ubaru, Arya Mazumdar, Yousef Saad:
Low Rank Approximation using Error Correcting Coding Matrices. ICML 2015: 702-710 - [c34]Arya Mazumdar, Ankit Singh Rawat
On adversarial joint source channel coding. ISIT 2015: 271-275 - [c33]Arya Mazumdar, Venkat Chandar, Gregory W. Wornell:
Local recovery in data compression for general sources. ISIT 2015: 2984-2988 - [c32]Abhishek Agarwal, Arya Mazumdar:
Security in locally repairable storage. ITW 2015: 1-5 - [c31]Viveck R. Cadambe
Alphabet-size dependent bounds for exact repair in distributed storage. ITW Fall 2015: 1-3 - [c30]Arya Mazumdar, Ankit Singh Rawat:
Associative Memory via a Sparse Recovery Model. NIPS 2015: 2701-2709 - [i22]Arya Mazumdar:
Nonadaptive group testing with random set of defectives via constant-weight codes. CoRR abs/1503.03597 (2015) - [i21]Abhishek Agarwal, Arya Mazumdar:
Security in Locally Repairable Storage. CoRR abs/1503.04244 (2015) - [i20]Alexander Barg, Arya Mazumdar, Rongrong Wang:
Restricted isometry property of random subdictionaries. CoRR abs/1506.06345 (2015) - [i19]Alexander Barg, Arya Mazumdar:
Almost disjunct matrices from codes and designs. CoRR abs/1510.02873 (2015) - [i18]Shashanka Ubaru, Arya Mazumdar, Yousef Saad:
Low rank approximation and decomposition of large matrices using error correcting codes. CoRR abs/1512.09156 (2015) - 2014
- [j9]Arya Mazumdar, Venkat Chandar, Gregory W. Wornell:
Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes. IEEE J. Sel. Areas Commun. 32(5): 976-988 (2014) - [j8]Arya Mazumdar:
Review of Classic Papers in Combinatorics Edited by Ira Gessel and Gian-Carlo Rota. SIGACT News 45(4): 32-35 (2014) - [c29]Arya Mazumdar, Soheil Mohajer:
Group testing with unreliable elements. Allerton 2014: 1-3 - [c28]Arya Mazumdar:
Achievable schemes and limits for local recovery on a graph. Allerton 2014: 909-913 - [c27]Arya Mazumdar, Olgica Milenkovic:
Smooth representation of rankings. CISS 2014: 1-4 - [c26]Ankit Singh Rawat
On cooperative local repair in distributed storage. CISS 2014: 1-5 - [c25]Da Wang, Arya Mazumdar, Gregory W. Wornell:
Lossy compression of permutations. ISIT 2014: 11-15 - [c24]Arya Mazumdar:
On a duality between recoverable distributed storage and index coding. ISIT 2014: 1977-1981 - [c23]Arya Mazumdar:
On the capacity of memoryless adversary. ISIT 2014: 2869-2873 - [i17]Arya Mazumdar:
On a Duality Between Recoverable Distributed Storage and Index Coding. CoRR abs/1401.2672 (2014) - [i16]Arya Mazumdar:
On the Capacity of Memoryless Adversary. CoRR abs/1401.4642 (2014) - [i15]Da Wang, Arya Mazumdar, Gregory W. Wornell:
Compression in the Space of Permutations. CoRR abs/1406.7435 (2014) - [i14]Arya Mazumdar:
Storage Capacity of Repairable Networks. CoRR abs/1408.4862 (2014) - [i13]Ankit Singh Rawat, Arya Mazumdar, Sriram Vishwanath:
Cooperative Local Repair in Distributed Storage. CoRR abs/1409.3900 (2014) - 2013
- [j7]Arya Mazumdar, Alexander Barg, Gilles Zémor
Constructions of Rank Modulation Codes. IEEE Trans. Inf. Theory 59(2): 1018-1029 (2013) - [c22]Arya Mazumdar, Yury Polyanskiy, Barna Saha:
On Chebyshev radius of a set in Hamming space and the closest string problem. ISIT 2013: 1401-1405 - [c21]Da Wang, Arya Mazumdar, Gregory W. Wornell:
A rate-distortion theory for permutation spaces. ISIT 2013: 2562-2566 - [c20]Arya Mazumdar, Venkat Chandar, Gregory W. Wornell:
Local recovery properties of capacity achieving codes. ITA 2013: 1-3 - [c19]Viveck R. Cadambe
An upper bound on the size of locally recoverable codes. NetCod 2013: 1-5 - [i12]Alexander Barg, Arya Mazumdar, Rongrong Wang:
Random Subdictionaries and Coherence Conditions for Sparse Signal Recovery. CoRR abs/1303.1847 (2013) - [i11]Arya Mazumdar, Venkat Chandar, Gregory W. Wornell:
Update Efficiency and Local Repairability Limits for Capacity Approaching Codes. CoRR abs/1305.3224 (2013) - [i10]Viveck R. Cadambe, Arya Mazumdar:
An Upper Bound On the Size of Locally Recoverable Codes. CoRR abs/1308.3200 (2013) - 2012
- [c18]Arya Mazumdar, Ligong Wang:
Covering arbitrary point patterns. Allerton Conference 2012: 2075-2080 - [c17]Arya Mazumdar:
On Almost Disjunct Matrices for Group Testing. ISAAC 2012: 649-658 - [c16]Arya Mazumdar, Gregory W. Wornell, Venkat Chandar:
Update efficient codes for error correction. ISIT 2012: 1558-1562 - [c15]Yuval Kochman, Arya Mazumdar, Yury Polyanskiy:
The adversarial joint source-channel problem. ISIT 2012: 2112-2116 - [c14]Yuval Kochman, Arya Mazumdar, Yury Polyanskiy:
Results on combinatorial joint source-channel coding. ITW 2012: 10-14 - 2011
- [b1]Arya Mazumdar:
Combinatorial Methods in Coding Theory. University of Maryland, College Park, MD, USA, 2011 - [j6]Alexander Barg, Arya Mazumdar:
On the Number of Errors Correctable with Codes on Graphs. IEEE Trans. Inf. Theory 57(2): 910-919 (2011) - [j5]Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for High-Density Recording on a 1-D Granular Magnetic Medium. IEEE Trans. Inf. Theory 57(11): 7403-7417 (2011) - [c13]Arya Mazumdar, Alexander Barg:
Sparse recovery properties of statistical RIP matrices. Allerton 2011: 9-12 - [c12]Arya Mazumdar, Alexander Barg, Gilles Zémor
Parameters of rank modulation codes: Examples. Allerton 2011: 13-17 - [c11]Arya Mazumdar, Alexander Barg:
General constructions of deterministic (S)RIP matrices for compressive sampling. ISIT 2011: 678-682 - [c10]Arya Mazumdar, Alexander Barg, Gilles Zémor
Constructions of rank modulation codes. ISIT 2011: 869-873 - [c9]Arya Mazumdar, Alexander Barg:
Channels with intermittent errors. ISIT 2011: 1753-1757 - [i9]Arya Mazumdar, Alexander Barg, Gilles Zémor:
Constructions of Rank Modulation Codes. CoRR abs/1110.2557 (2011) - [i8]Arya Mazumdar:
Explicit Group Testing Scheme that Identifies Almost All Defective Configurations. CoRR abs/1111.5003 (2011) - 2010
- [j4]Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel
On linear balancing sets. Adv. Math. Commun. 4(3): 345-361 (2010) - [j3]Alexander Barg, Arya Mazumdar:
Codes in permutations and error correction for rank modulation. IEEE Trans. Inf. Theory 56(7): 3158-3165 (2010) - [c8]Arya Mazumdar, Alexander Barg, Navin Kashyap:
On the capacity of high-density recording on a 1-D granular magnetic medium. Allerton 2010: 368-375 - [c7]Alexander Barg, Arya Mazumdar:
Codes in permutations and error correction for rank modulation. ISIT 2010: 854-858 - [c6]Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for high-density magnetic recording. ISIT 2010: 978-982 - [c5]Alexander Barg, Arya Mazumdar:
Small ensembles of sampling matrices constructed from coding theory. ISIT 2010: 1963-1967 - [i7]Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for High-Density Recording on a 1-D Granular Magnetic Medium. CoRR abs/1012.1895 (2010)
2000 – 2009
- 2009
- [c4]Alexander Barg, Arya Mazumdar:
On the number of errors correctable with codes on graphs. ISIT 2009: 2482-2486 - [c3]Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel
On linear balancing sets. ISIT 2009: 2699-2703 - [i6]Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel:
On linear balancing sets. CoRR abs/0901.3170 (2009) - [i5]Alexander Barg, Arya Mazumdar:
Codes in Permutations and Error Correction for Rank Modulation. CoRR abs/0908.4094 (2009) - [i4]Alexander Barg, Arya Mazumdar:
On the Number of Errors Correctable with Codes on Graphs. CoRR abs/0911.4522 (2009) - 2008
- [j2]Alexander Barg, Arya Mazumdar, Gilles Zémor
Weight distribution and decoding of codes on hypergraphs. Adv. Math. Commun. 2(4): 433-450 (2008) - [c2]Alexander Barg, Arya Mazumdar, Gilles Zémor
Weight distribution of codes on hypergraphs. Allerton 2008: 400-401 - [i3]Alexander Barg, Arya Mazumdar, Gilles Zémor:
Codes on hypergraphs. CoRR abs/0808.3453 (2008) - 2006
- [j1]Arya Mazumdar, Ajit Kumar Chaturvedi, Adrish Banerjee
Construction of turbo code interleaves from 3-regular Hamiltonian graphs. IEEE Commun. Lett. 10(4): 284-286 (2006) - 2005
- [c1]Arya Mazumdar, Adrish Banerjee, Ajit Kumar Chaturvedi:
On the spread of random interleavers. ISIT 2005: 439-443 - [i2]Arya Mazumdar, Adrish Banerjee, Ajit Kumar Chaturvedi:
On the Spread of Random Interleaver. CoRR abs/cs/0510067 (2005) - [i1]Arya Mazumdar, Ajit Kumar Chaturvedi, Adrish Banerjee:
Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs. CoRR abs/cs/0512093 (2005)
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-10-15 20:43 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: