Larkin Flodin

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Probabilistic Group Testing with a Linear Number of Tests	2021	Larkin Flodin Arya Mazumdar
+	Probabilistic Group Testing with a Linear Number of Tests	2021	Larkin Flodin Arya Mazumdar
+	Linear Programming Approximations for Index Coding	2019	Abhishek Agarwal Larkin Flodin Arya Mazumdar
+	Superset Technique for Approximate Recovery in One-Bit Compressed Sensing	2019	Larkin Flodin Venkata Gandikota Arya Mazumdar
+	Linear Programming Approximations for Index Coding	2018	Abhishek Agarwal Larkin Flodin Arya Mazumdar
+	Linear Programming Approximations for Index Coding	2018	Abhishek Agarwal Larkin Flodin Arya Mazumdar
+	Estimation of Sparsity via Simple Measurements	2017	Abhishek Agarwal Larkin Flodin Arya Mazumdar
+ PDF Chat	Estimation of sparsity via simple measurements	2017	Abhishek Agarwal Larkin Flodin Arya Mazumdar
+	Estimation of Sparsity via Simple Measurements	2017	Abhishek Agarwal Larkin Flodin Arya Mazumdar

Common Coauthors

Coauthor	Papers Together
Arya Mazumdar	9
Abhishek Agarwal	4
Abhishek Agarwal	1
Venkata Gandikota	1
Abhishek Agarwal	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Nonadaptive Group Testing With Random Set of Defectives	2016	Arya Mazumdar	3
+	Index coding via linear programming	2010	Anna Blasiak Robert Kleinberg Eyal Lubetzky	2
+ PDF Chat	A new index coding scheme exploiting interlinked cycles	2015	Chandra Thapa Lawrence Ong Sarah J. Johnson	2
+	On the Hardness of Approximating the Chromatic Number	2000	Sanjeev Khanna Nathan Linial Muli Safra	2
+ PDF Chat	Local graph coloring and index coding	2013	Karthikeyan Shanmugam Alexandros G. Dimakis Michael Langberg	2
+ PDF Chat	Nonlinear Index Coding Outperforming the Linear Optimum	2009	Eyal Lubetzky Uri Stav	2
+	MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs	2007	Josep Dı́az Marcin Kamiński	2
+	On the Shannon capacity of a graph	1979	László Lovász	2
+ PDF Chat	Lexicographic Products and the Power of Non-linear Network Coding	2011	Anna Blasiak Robert Kleinberg Eyal Lubetzky	2
+	Compressed Sensing without Sparsity Assumptions	2015	Miles E. Lopes	2
+ PDF Chat	On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory	2010	Salim El Rouayheb Alex Sprintson C.N. Georghiades	2
+ PDF Chat	Linear Index Coding via Semidefinite Programming	2013	Eden Chlamtáč Ishay Haviv	2
+	A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set	2016	Parinya Chalermsook Daniel Vaz	2
+	The Optimality of Partial Clique Covering for Index Coding	2017	Xinping Yi Giuseppe Caire	2
+	Storage Capacity as an Information-Theoretic Analogue of Vertex Cover	2017	Arya Mazumdar Andrew McGregor Sofya Vorotnikova	2
+ PDF Chat	Graph theory versus minimum rank for index coding	2014	Karthikeyan Shanmugam Alexandros G. Dimakis Michael Langberg	2
+ PDF Chat	Approximate capacity of index coding for some classes of graphs	2016	Fatemeh Arbabjolfaei Young-Han Kim	2
+ PDF Chat	Storage Capacity of Repairable Networks	2015	Arya Mazumdar	2
+ PDF Chat	Generalized interlinked cycle cover for index coding	2015	Chandra Thapa Lawrence Ong Sarah J. Johnson	2
+ PDF Chat	Boolean Compressed Sensing and Noisy Group Testing	2012	George K. Atia Venkatesh Saligrama	2
+	The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling	2014	Dana Ron Gilad Tsur	1
+	Noise-resilient group testing: Limitations and constructions	2012	Mahdi Cheraghchi	1
+	Group Testing using left-and-right-regular sparse-graph codes	2017	Avinash Vem Nagaraj T. Janakiraman Krishna Narayanan	1
+	Group Testing using left-and-right-regular sparse-graph codes.	2017	Avinash Vem Nagaraj Thenkarai Janakiraman Krishna R. Narayanan	1
+ PDF Chat	Sublinear-Time Non-Adaptive Group Testing With <i>O</i>(<i>k</i> log <i>n</i>) Tests via Bit-Mixing Coding	2020	Steffen Bondorf Binbin Chen Jonathan Scarlett Haifeng Yu Yuda Zhao	1
+	On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing	2019	Huseyin A. Inan Peter Kairouz Mary Wootters Ayfer Özgür	1
+	The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling	2014	Dana Ron Gilad Tsur	1
+ PDF Chat	SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes	2016	Kangwook Lee Ramtin Pedarsani Kannan Ramchandran	1
+ PDF Chat	Group Testing: An Information Theory Perspective	2019	Matthew Aldridge Oliver Johnson Jonathan Scarlett	1
+	SAFFRON: A Fast, Efficient, and Robust Framework for Group Testing Based on Sparse-Graph Codes	2019	Kangwook Lee Kabir Aladin Chandrasekher Ramtin Pedarsani Kannan Ramchandran	1
+ PDF Chat	Novel Impossibility Results for Group-Testing	2018	Abhishek Agarwal Sidharth Jaggi Arya Mazumdar	1
+ PDF Chat	Improved bounds for universal one-bit compressive sensing	2017	Jayadev Acharya Arnab Bhattacharyya Pritish Kamath	1
+ PDF Chat	Methods for quantized compressed sensing	2016	Hao-Jun Michael Shi Mindy Case Xiaoyi Gu Shenyinying Tu Deanna Needell	1
+ PDF Chat	Linear Boolean Classification, Coding and the Critical Problem	2016	Emmanuel Abbé Noga Alon Afonso S. Bandeira Colin Sandon	1
+ PDF Chat	Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime	2018	Matthew Aldridge	1
+	Group Testing Schemes From Codes and Designs	2017	Alexander Barg Arya Mazumdar	1
+	Tutorial on large deviations for the binomial distribution	1989	Richard Arratia Louis Gordon	1
+	Tutorial on large deviations for the binomial distribution	1989	R ARRATIA L GORDON	1
+ PDF Chat	Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms	2011	Chun Lam Chan Pak Hou Sidharth Jaggi Venkatesh Saligrama	1
+ PDF Chat	Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach	2012	Yaniv Plan Roman Vershynin	1
+ PDF Chat	Performance of Group Testing Algorithms With Near-Constant Tests Per Item	2018	Oliver Johnson Matthew Aldridge Jonathan Scarlett	1
+ PDF Chat	Necessary and Sufficient Conditions for Sparsity Pattern Recovery	2009	Alyson K. Fletcher Sundeep Rangan Vivek K Goyal	1
+ PDF Chat	Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors	2013	Laurent Jacques Jason N. Laska Petros T. Boufounos Richard G. Baraniuk	1
+ PDF Chat	Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?	2006	Emmanuel J. Candès Terence Tao	1
+	Sampling, data transmission, and the Nyquist rate	1967	H. J. Landau	1
+ PDF Chat	Group Testing Algorithms: Bounds and Simulations	2014	Matthew Aldridge Leonardo Baldassini Oliver Johnson	1
+ PDF Chat	The Capacity of Bernoulli Nonadaptive Group Testing	2017	Matthew Aldridge	1
+	Index coding via linear programming	2010	Anna Błasiak Robert Kleinberg Eyal Lubetzky	1
+ PDF Chat	Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework	2016	Jonathan Scarlett Volkan Cevher	1