The following pages link to Andrew McGregor (Q1009268):
Displayed 50 items.
- Sketching information divergences (Q1009269) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- (Q2830872) (← links)
- Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition (Q2839171) (← links)
- Dynamic Graphs in the Sliding-Window Model (Q2849326) (← links)
- Spectral Sparsification in Dynamic Graph Streams (Q2851844) (← links)
- Sketching Earth-Mover Distance on Graph Metrics (Q2851863) (← links)
- Trace Reconstruction Revisited (Q2921454) (← links)
- (Q2921736) (← links)
- Sublinear estimation of entropy and information distances (Q2930260) (← links)
- A near-optimal algorithm for estimating the entropy of a stream (Q2930333) (← links)
- (Q2934611) (← links)
- (Q2934675) (← links)
- Densest Subgraph in Dynamic Graph Streams (Q2946417) (← links)
- Periodicity and Cyclic Shifts via Linear Sketches (Q3088091) (← links)
- (Q3113708) (← links)
- (Q3174917) (← links)
- Evaluating Bayesian Networks via Data Streams (Q3196429) (← links)
- Run Generation Revisited: What Goes Up May or May Not Come Down (Q3459907) (← links)
- Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination (Q3521964) (← links)
- Distance Distribution of Binary Codes and the Error Probability of Decoding (Q3546534) (← links)
- (Q3579407) (← links)
- Streaming and sublinear approximation of entropy and information distances (Q3581507) (← links)
- Annotations in Data Streams (Q3638037) (← links)
- The Oil Searching Problem (Q3639270) (← links)
- Graph Distances in the Data-Stream Model (Q3642861) (← links)
- Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams (Q3642875) (← links)
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams (Q4575674) (← links)
- (Q4601830) (← links)
- (Q4606301) (← links)
- Planar Matching in Streams Revisited (Q4636449) (← links)
- Annotations in Data Streams (Q4962165) (← links)
- Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein” (Q5001709) (← links)
- Trace Reconstruction: Generalized and Parameterized (Q5001712) (← links)
- (Q5075814) (← links)
- Vertex Ordering Problems in Directed Graph Streams (Q5146890) (← links)
- Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate (Q5211390) (← links)
- Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
- (Q5240429) (← links)
- On the Hardness of Approximating Stopping and Trapping Sets (Q5281524) (← links)
- (Q5302089) (← links)
- Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming (Q5428851) (← links)
- Checking and Spot-Checking the Correctness of Priority Queues (Q5428854) (← links)
- Sketching Information Divergences (Q5434066) (← links)
- Sorting and Selection with Random Costs (Q5458516) (← links)
- Automata, Languages and Programming (Q5466491) (← links)