The following pages link to (Q3425115):
Displaying 50 items.
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
- Triangle counting in dynamic graph streams (Q334947) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Streaming algorithms for language recognition problems (Q391078) (← links)
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292) (← links)
- Optimal sampling from sliding windows (Q414877) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- Adaptively learning probabilistic deterministic automata from data streams (Q479463) (← links)
- Boosting distinct random sampling for basic counting on the union of distributed streams (Q497679) (← links)
- In-network estimation of frequency moments (Q531120) (← links)
- Sorting and selection on dynamic data (Q541657) (← links)
- Sleeping on the job: energy-efficient and robust broadcast for radio networks (Q644799) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- A general method for estimating correlated aggregates over a data stream (Q747615) (← links)
- Approximation of function evaluation over sequence arguments via specialized data structures (Q897968) (← links)
- New results for finding common neighborhoods in massive graphs in the data stream model (Q955006) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- Sorting streamed multisets (Q975507) (← links)
- Deterministic \(k\)-set structure (Q975518) (← links)
- The frequent items problem, under polynomial decay, in the streaming model (Q986537) (← links)
- Two improved range-efficient algorithms for \(F_0\) estimation (Q1007249) (← links)
- New bounds on classical and quantum one-way communication complexity (Q1029354) (← links)
- Weighted random sampling with a reservoir (Q1045927) (← links)
- Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing (Q1648406) (← links)
- Permuted function matching (Q1675783) (← links)
- Interval selection in the streaming model (Q1676325) (← links)
- Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- FANCFIS: fast adaptive neuro-complex fuzzy inference system (Q1726368) (← links)
- Approximating frequent items in asynchronous data stream over a sliding window (Q1736485) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- From approximate balls to approximate ellipses (Q1955552) (← links)
- Transfer estimation of evolving class priors in data stream classification (Q1957879) (← links)
- Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing (Q2006439) (← links)
- Distributed mining of time-faded heavy hitters (Q2054052) (← links)
- Almost-smooth histograms and sliding-window graph algorithms (Q2088588) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm (Q2141175) (← links)
