Pages that link to "Item:Q1384531"
From MaRDI portal
The following pages link to Size-estimation framework with applications to transitive closure and reachability (Q1384531):
Displaying 30 items.
- d-k-min-wise independent family of hash functions (Q340570) (← links)
- Computing rarity on uncertain data (Q350968) (← links)
- Optimal sampling from sliding windows (Q414877) (← links)
- A unified scheme for generalizing cardinality estimators to sum aggregation (Q477684) (← links)
- Efficient processing of substring match queries with inverted variable-length gram indexes (Q508702) (← links)
- In-network estimation of frequency moments (Q531120) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
- Exponential time improvement for min-wise based algorithms (Q716331) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Spatially-decaying aggregation over a network (Q878748) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Analysis and application of adaptive sampling (Q1394792) (← links)
- Generalized substring selectivity estimation (Q1394798) (← links)
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- Simple multi-party set reconciliation (Q2075624) (← links)
- Better size estimation for sparse matrix products (Q2249750) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- Algorithms and estimators for summarization of unaggregated data streams (Q2453543) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- (Q4761355) (← links)
- (Q5136262) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)
- (Q5743420) (← links)
- On approximate range counting and depth (Q5902137) (← links)
- A fully dynamic algorithm for maintaining the transitive closure (Q5917499) (← links)
- Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892) (← links)
