Suchergebnisse - "Graph Streaming Algorithms"

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms von Assadi, Sepehr, Raz, Ran

“… We prove that any two-pass graph streaming algorithm for the s-t reachability problem in n -vertex directed graphs requires near-quadratic space of n^{2-o(1)} bits …”
Volltext

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms von Assadi, Sepehr, Raz, Ran

“… We prove that any two-pass graph streaming algorithm for the \(s\)-\(t\) reachability problem in \(n …”
Volltext

Polynomial Pass Lower Bounds for Graph Streaming Algorithms von Assadi, Sepehr, Chen, Yu, Khanna, Sanjeev

“… We present new lower bounds that show that a polynomial number of passes are necessary for solving some fundamental graph problems in the streaming model of …”
Volltext

Projections, Extractors, and Streaming Lower Bounds von Nagargoje, Vishvajeet

“… In Part I, we study the theory of randomness extractors in the context of structured sources and their connections with structural results in discrete product …”
Volltext

Space-Efficient Algorithms and Verification Schemes for Graph Streams von Ghosh, Prantar

“… Structured data-sets are often easy to represent using graphs. The prevalence of massive data-sets in the modern world gives rise to big graphs such as web …”
Volltext

Communication Complexity: For Coding, Commerce, and Currents von Saxena, Raghuvansh R

“… Since its introduction in Yao's seminal paper [Yao79], communication complexity has revolutionized theoretical computer science. Indeed, not only has …”
Volltext

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy von Assadi, Sepehr, Ghosh, Prantar, Loff, Bruno, Mittal, Parth, Mukhopadhyay, Sagnik

“… The following question arises naturally in the study of graph streaming algorithms …”
Volltext

Approximately Counting Subgraphs in Data Streams von Fichtenberger, Hendrik, Pan, Peng

“… -time graph algorithms in the query access model to constant-pass sublinear-space graph streaming algorithms …”
Volltext

Promised streaming algorithms and finding pseudo-repetitions von Tiseanu, Catalin-Stefan

“… In this work we study two particular types of streaming variants: promised graph streaming algorithms and combinatorial queries on large words. We give an Ω(n …”
Volltext

Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma von Assadi, Sepehr, Vishvajeet, N

“… We study space-pass tradeoffs in graph streaming algorithms for parameter estimation and property testing problems such as estimating the size of maximum matchings and maximum cuts, weight of minimum …”
Volltext

Testable Bounded Degree Graph Properties Are Random Order Streamable von Monemizadeh, Morteza, Muthukrishnan, S, Pan, Peng, Sohler, Christian

“… We study which property testing and sublinear time algorithms can be transformed into graph streaming algorithms for random order streams …”
Volltext