The following pages link to (Q2969611):
Displaying 12 items.
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- Succinct summing over sliding windows (Q1741865) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- Maximum Matching in Turnstile Streams (Q3452845) (← links)
- (Q4638113) (← links)
- Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams (Q5002618) (← links)
- (Q5002673) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- Semi-streaming algorithms for submodular matroid intersection (Q5918428) (← links)
- Semi-streaming algorithms for submodular matroid intersection (Q5925648) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
