No. Title Author Year
1 Graph Reconstruction from Random Subgraphs McGregor, Andrew et al. 2022
2 Improved Approximation and Scalability for Fair Max-Min Diversification Addanki, Raghavendra et al. 2022
3 Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries Addanki, Raghavendra et al. 2022
4 Diverse Data Selection under Fairness Constraints Moumoulidou, Zafeiria et al. 2021
5 Maximum Coverage in the Data Stream Model: Parameterized and Generalized McGregor, Andrew et al. 2021
6 Trace Reconstruction: Generalized and Parameterized Krishnamurthy, Akshay et al. 2019
7 A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs McGregor, Andrew et al. 2018
8 Better Streaming Algorithms for the Maximum Coverage Problem McGregor, Andrew et al. 2017
9 Planar Matching in Streams Revisited McGregor, Andrew et al. 2016
10 Stochastic Streams: Sample Complexity vs. Space Complexity Crouch, Michael et al. 2016
11 Verifiable Stream Computation and Arthur–Merlin Communication Chakrabarti, Amit et al. 2015
12 Polynomial Fitting of Data Streams with Applications to Codeword Testing McGregor, Andrew et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 12

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI