The following pages link to (Q5743413):
Displaying 29 items.
- When distributed computation is communication expensive (Q1689746) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Connectivity and connected components in the number-in-hand computation model (Q2086717) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Separating adaptive streaming from oblivious streaming using the bounded storage model (Q2128990) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Public vs. private randomness in simultaneous multi-party communication complexity (Q2292918) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Single-pass streaming algorithms to partition graphs into few forests (Q2695324) (← links)
- Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Brief Announcement: MapReduce Algorithms for Massive Trees (Q5002852) (← links)
- (Q5009578) (← links)
- A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
- (Q5090424) (← links)
- (Q5090930) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- Summary Data Structures for Massive Data (Q5326361) (← links)
- (Q6062143) (← links)
