Publication:4945538
From MaRDI portal
zbMath0947.68052MaRDI QIDQ4945538
Sridhar Rajagopalan, Prabhakar Raghavan, Monika R. Henzinger
Publication date: 23 March 2000
68Q25: Analysis of algorithms and problem complexity
Related Items
Graph Connectivity in Log Steps Using Label Propagation, Depth First Search in the Semi-streaming Model, Optimal lower bounds for matching and vertex cover in dynamic graph streams, Real-Time Streaming Multi-Pattern Search for Constant Alphabet, Unnamed Item, Streaming deletion problems Parameterized by vertex cover, Efficient optimally lazy algorithms for minimal-interval semantics, Superlinear lower bounds for multipass graph processing, Adapting parallel algorithms to the W-stream model, with applications to graph problems, Streaming techniques and data aggregation in networks of tiny artefacts, Best-order streaming model, Sleeping on the job: energy-efficient and robust broadcast for radio networks, Statistical estimation with bounded memory, A black box for online approximate pattern matching, New results for finding common neighborhoods in massive graphs in the data stream model, Main-memory triangle computations for very large (sparse (power-law)) graphs, Streaming algorithm for graph spanners-single pass and constant processing time per edge, Sketching information divergences, Dynamic graph stream algorithms in \(o(n)\) space, Streaming pattern matching with \(d\) wildcards, Structural results on matching estimation with applications to streaming, On finding common neighborhoods in massive graphs., Finding frequent items in data streams, Intractability of min- and max-cut in streaming graphs, From approximate balls to approximate ellipses, Dynamic data structures for timed automata acceptance, A greedy algorithm for finding maximum spanning trees in infinite graphs, Streaming deletion problems parameterized by vertex cover, On-line motif detection in time series with SwiftMotif, Database query processing using finite cursor machines, An external-memory algorithm for string graph construction, Tight lower bounds for query processing on streaming and external memory data, Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models, Weighted matching in the semi-streaming model, Finding longest increasing and common subsequences in streaming data, Incremental algorithms for facility location and \(k\)-median, Faster core-set constructions and data-stream algorithms in fixed dimensions, A way for low ranking matrices and its stochastic computations using Monte Carlo method, On graph problems in a semi-streaming model, Single Pass Spectral Sparsification in Dynamic Streams, Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem, Sublinear Estimation of Weighted Matchings in Dynamic Data Streams, A Black Box for Online Approximate Pattern Matching
