scientific article; zbMATH DE number 5182608
From MaRDI portal
Publication:5757091
Recommendations
- On fast running max-min filtering
- Maximum matching in semi-streaming with few passes
- Non-submodular streaming maximization with minimum memory and low adaptive complexity
- Optimal algorithms for running max and min filters on random inputs
- Streaming Lower Bounds for Approximating MAX-CUT
- Lower bounds for multi-pass processing of multiple data streams
- Approximate Maximum Matching in Random Streams
- Maximum matching in two, three, and a few more passes over graph streams
Cited in
(9)- Algebraic quantitative semantics for efficient online temporal monitoring
- Faster retrieval with a two-pass dynamic-time-warping lower bound
- On the information in extreme measurements for parameter estimation
- Robust online monitoring of signal temporal logic
- Optimal algorithms for running max and min filters on random inputs
- Calculating Max and Min with exemplary sketch algorithm in data stream management system
- On fast running max-min filtering
- Greedily computing associative aggregations on sliding windows
- Mining of extended signal temporal logic specifications with ParetoLib 2.0
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757091)
