On the public citation graph

Finding Graph Matchings in Data Streams

0 signed · 184 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1997.1545openalex-snapshot
The Space Complexity of Approximating the Frequency Moments
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-46541-3_16openalex-snapshot
An Approximate L p-Difference Algorithm for Massive Data Streams
inferredcites →https://doi.org/10.1007/3-540-49116-3_24openalex-snapshot
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_46openalex-snapshot
On Graph Problems in a Semi-streaming Model
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_2openalex-snapshot
Improved Linear Time Approximation Algorithms for Weighted Matchings
inferredcites →https://doi.org/10.1016/0304-3975(80)90061-4openalex-snapshot
Selection and sorting with limited storage
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.013openalex-snapshot
On graph problems in a semi-streaming model
inferredcites →https://doi.org/10.1016/s0304-3975(02)00569-8openalex-snapshot
On finding common neighborhoods in massive graphs
inferredcites →https://doi.org/10.1090/dimacs/050/05openalex-snapshot
Computing on data streams
inferredcites →https://doi.org/10.1109/sfcs.1975.5openalex-snapshot
An O (N2.5) algorithm for maximum matching in general graphs
inferredcites →https://doi.org/10.1109/sfcs.1980.12openalex-snapshot
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
inferredcites →https://doi.org/10.1109/sfcs.2000.892124openalex-snapshot
Clustering data streams
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/s0097539799361701openalex-snapshot
An Approximate L 1 -Difference Algorithm for Massive Data Streams
inferredcites →https://doi.org/10.1561/9781933019604openalex-snapshot
Data Streams: Algorithms and Applications
inferredcites →https://doi.org/10.5555/1070432.1070537openalex-snapshot
Graph distances in the streaming model: the value of space
inferredcites →https://doi.org/10.5555/320176.320229openalex-snapshot
Data structures for weighted matching and nearest common ancestors with linking
inferredcites →https://doi.org/10.5555/644108.644147openalex-snapshot
Pass efficient algorithms for approximating large matrices
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
inferredcites →https://doi.org/10.7282/t3222z7wopenalex-snapshot
Approximation Schemes For Maximum Cardinality Matching

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.21450openalex-snapshot
Real‐time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_184openalex-snapshot
Graph Mining on Streams
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0openalex-snapshot
Managing and Mining Graph Data
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_13openalex-snapshot
A Survey on Streaming Algorithms for Massive Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_2openalex-snapshot
Graph Data Management and Mining: A Survey of Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_15openalex-snapshot
Semi-streaming Algorithms for Submodular Matroid Intersection
inferred← citeshttps://doi.org/10.1007/978-3-032-06706-7_14openalex-snapshot
Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
inferred← citeshttps://doi.org/10.1007/978-3-032-08560-3_33openalex-snapshot
Edge Arrival Online Matching: The Power of Free Disposal on Acyclic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_18openalex-snapshot
Submodular Maximization Meets Streaming: Matchings, Matroids, and More
inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_11openalex-snapshot
Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_42openalex-snapshot
Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_61openalex-snapshot
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_27openalex-snapshot
Graph Sparsification in the Semi-streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_43openalex-snapshot
Sparse Cut Projections in Graph Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_44openalex-snapshot
Bipartite Graph Matchings in the Semi-streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_28openalex-snapshot
Dynamic Approximate Vertex Cover and Maximum Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-19754-3_20openalex-snapshot
Computing Strongly Connected Components in the Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_22openalex-snapshot
Matching in Bipartite Graph Streams in a Small Number of Passes
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_32openalex-snapshot
Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_42openalex-snapshot
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_26openalex-snapshot
Space-Constrained Interval Selection
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_20openalex-snapshot
Maximum Matching in Semi-streaming with Few Passes
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_29openalex-snapshot
Dynamic Graphs in the Sliding-Window Model
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_38openalex-snapshot
Semi-Streaming Set Cover
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_22openalex-snapshot
Online Bipartite Matching with Decomposable Weights
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_26openalex-snapshot
Streaming Algorithms for Submodular Function Maximization
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_23openalex-snapshot
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_28openalex-snapshot
On Randomized Algorithms for Matching in the Online Preemptive Model
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_70openalex-snapshot
Maximum Matching in Turnstile Streams
inferred← citeshttps://doi.org/10.1007/s00224-021-10065-6openalex-snapshot
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization
inferred← citeshttps://doi.org/10.1007/s00224-023-10155-7openalex-snapshot
Improved Bounds for Matching in Random-Order Streams
inferred← citeshttps://doi.org/10.1007/s00446-020-00371-6openalex-snapshot
Communication complexity of approximate maximum matching in the message-passing model
inferred← citeshttps://doi.org/10.1007/s00453-010-9438-5openalex-snapshot
Weighted Matching in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.1007/s00453-011-9556-8openalex-snapshot
Bipartite Matching in the Semi-streaming Model
inferred← citeshttps://doi.org/10.1007/s00453-016-0138-7openalex-snapshot
Superlinear Lower Bounds for Multipass Graph Processing
inferred← citeshttps://doi.org/10.1007/s00453-018-0449-yopenalex-snapshot
Structural Results on Matching Estimation with Applications to Streaming
inferred← citeshttps://doi.org/10.1007/s00453-019-00593-6openalex-snapshot
Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models
inferred← citeshttps://doi.org/10.1007/s00453-023-01190-4openalex-snapshot
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
inferred← citeshttps://doi.org/10.1007/s00453-024-01272-xopenalex-snapshot
Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
inferred← citeshttps://doi.org/10.1007/s10107-015-0900-7openalex-snapshot
Submodular maximization meets streaming: matchings, matroids, and more
inferred← citeshttps://doi.org/10.1007/s10107-022-01858-9openalex-snapshot
Semi-streaming algorithms for submodular matroid intersection
inferred← citeshttps://doi.org/10.1007/s10878-020-00641-wopenalex-snapshot
Online maximum matching with recourse
inferred← citeshttps://doi.org/10.1007/s40305-024-00543-2openalex-snapshot
An Improved Space Semi-Streaming Algorithm for Submodular Maximization under b-Matching Constraint
inferred← citeshttps://doi.org/10.1016/j.ic.2012.10.006openalex-snapshot
Linear programming in the semi-streaming model with application to the maximum matching problem
inferred← citeshttps://doi.org/10.1016/j.ic.2017.12.002openalex-snapshot
Improved bounds for randomized preemptive online matching
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.11.001openalex-snapshot
Streaming algorithm for graph spanners—single pass and constant processing time per edge
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.10.017openalex-snapshot
Intractability of min- and max-cut in streaming graphs
inferred← citeshttps://doi.org/10.1109/ccc.2013.37openalex-snapshot
Superlinear Lower Bounds for Multipass Graph Processing
inferred← citeshttps://doi.org/10.1109/focs.2010.70openalex-snapshot
Approximating Maximum Weight Matching in Near-Linear Time
inferred← citeshttps://doi.org/10.1109/focs.2019.00096openalex-snapshot
Exponentially Faster Massively Parallel Maximal Matching
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00040openalex-snapshot
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00041openalex-snapshot
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00058openalex-snapshot
Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00095openalex-snapshot
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time
inferred← citeshttps://doi.org/10.1109/icdmw.2016.0092openalex-snapshot
Finding Large Matchings in Semi-Streaming
inferred← citeshttps://doi.org/10.1137/070683155openalex-snapshot
Graph Distances in the Data-Stream Model
inferred← citeshttps://doi.org/10.1137/1.9781611972795.60openalex-snapshot
On Maximum Coverage in the Streaming Model & Application to Multi-topic Blog-Watch
inferred← citeshttps://doi.org/10.1137/1.9781611973105.121openalex-snapshot
Better bounds for matchings in the streaming model
inferred← citeshttps://doi.org/10.1137/1.9781611973730.82openalex-snapshot
Parameterized Streaming: Maximal Matching and Vertex Cover
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch92openalex-snapshot
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
inferred← citeshttps://doi.org/10.1137/1.9781611974782.113openalex-snapshot
On Estimating Maximum Matching Size in Graph Streams
inferred← citeshttps://doi.org/10.1137/1.9781611974782.140openalex-snapshot
A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.1137/1.9781611974782.67openalex-snapshot
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
inferred← citeshttps://doi.org/10.1137/1.9781611975482.178openalex-snapshot
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
inferred← citeshttps://doi.org/10.1137/1.9781611975482.98openalex-snapshot
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975482.99openalex-snapshot
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
inferred← citeshttps://doi.org/10.1137/1.9781611975994.108openalex-snapshot
Approximate Maximum Matching in Random Streams
inferred← citeshttps://doi.org/10.1137/1.9781611976465.114openalex-snapshot
Streaming Submodular Matching Meets the Primal-Dual Method
inferred← citeshttps://doi.org/10.1137/1.9781611977073.29openalex-snapshot
Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch5openalex-snapshot
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
inferred← citeshttps://doi.org/10.1137/100801901openalex-snapshot
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
inferred← citeshttps://doi.org/10.1137/21m1417740openalex-snapshot
Almost Optimal SuperConstant-Pass Streaming Lower Bounds for Reachability
inferred← citeshttps://doi.org/10.1145/1376916.1376928openalex-snapshot
Estimating PageRank on graph streams
inferred← citeshttps://doi.org/10.1145/1388240.1388242openalex-snapshot
Theory research at Google
inferred← citeshttps://doi.org/10.1145/1644015.1644021openalex-snapshot
Trading off space for passes in graph streaming problems
inferred← citeshttps://doi.org/10.1145/1806689.1806753openalex-snapshot
Maintaining a large matching and a small vertex cover
inferred← citeshttps://doi.org/10.1145/1970392.1970397openalex-snapshot
Estimating PageRank on graph streams
inferred← citeshttps://doi.org/10.1145/2213556.2213560openalex-snapshot
Graph sketches
inferred← citeshttps://doi.org/10.1145/2601412openalex-snapshot
Evolutionary Network Analysis
inferred← citeshttps://doi.org/10.1145/2627692.2627694openalex-snapshot
Graph stream algorithms
inferred← citeshttps://doi.org/10.1145/2755573.2755586openalex-snapshot
Access to Data and Number of Iterations
inferred← citeshttps://doi.org/10.1145/2886102openalex-snapshot
Space-Constrained Interval Selection
inferred← citeshttps://doi.org/10.1145/2957322openalex-snapshot
Semi-Streaming Set Cover
inferred← citeshttps://doi.org/10.1145/3087556.3087581openalex-snapshot
Randomized Composable Coresets for Matching and Vertex Cover
inferred← citeshttps://doi.org/10.1145/3087556.3087601openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/3154855openalex-snapshot
Access to Data and Number of Iterations
inferred← citeshttps://doi.org/10.1145/3159652.3159674openalex-snapshot
Streaming Link Prediction on Dynamic Attributed Networks
inferred← citeshttps://doi.org/10.1145/3188745.3188764openalex-snapshot
Round compression for parallel matching algorithms
inferred← citeshttps://doi.org/10.1145/3188745.3188858openalex-snapshot
How to match when all vertices arrive online
inferred← citeshttps://doi.org/10.1145/3212734.3212743openalex-snapshot
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
inferred← citeshttps://doi.org/10.1145/3230819openalex-snapshot
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
inferred← citeshttps://doi.org/10.1145/3274668openalex-snapshot
A (2+ϵ)-Approximation for Maximum Weight Matching in the Semi-streaming Model
inferred← citeshttps://doi.org/10.1145/3289602.3293916openalex-snapshot
Substream-Centric Maximum Matchings on FPGA
inferred← citeshttps://doi.org/10.1145/3293611.3331603openalex-snapshot
Weighted Matchings via Unweighted Augmentations
inferred← citeshttps://doi.org/10.1145/3293611.3331609openalex-snapshot
Massively Parallel Computation of Matching and MIS in Sparse Graphs
inferred← citeshttps://doi.org/10.1145/3294052.3319701openalex-snapshot
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives
inferred← citeshttps://doi.org/10.1145/3313276.3316361openalex-snapshot
Polynomial pass lower bounds for graph streaming algorithms
inferred← citeshttps://doi.org/10.1145/3328526.3329604openalex-snapshot
Prophet Inequality for Bipartite Matching
inferred← citeshttps://doi.org/10.1145/3377871openalex-snapshot
Substream-Centric Maximum Matchings on FPGA
inferred← citeshttps://doi.org/10.1145/3390890openalex-snapshot
Fully Online Matching
inferred← citeshttps://doi.org/10.1145/3406325.3451038openalex-snapshot
Almost optimal super-constant-pass streaming lower bounds for reachability
inferred← citeshttps://doi.org/10.1145/3529228openalex-snapshot
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching
inferred← citeshttps://doi.org/10.1145/3617360openalex-snapshot
Exponentially Faster Massively Parallel Maximal Matching
inferred← citeshttps://doi.org/10.1145/3618260.3649629openalex-snapshot
Approximate Earth Mover’s Distance in Truly-Subquadratic Time
inferred← citeshttps://doi.org/10.1145/3694906.3743312openalex-snapshot
A framework for boosting matching approximation: parallel, distributed, and dynamic
inferred← citeshttps://doi.org/10.1145/3758324openalex-snapshot
Online Coalition Formation under Random Arrival or Coalition Dissolution
inferred← citeshttps://doi.org/10.1145/3798129.3800811openalex-snapshot
Semi-streaming Matching in a Single Pass: A New Framework for Lower Bounds via Blueprints
inferred← citeshttps://doi.org/10.1287/moor.2022.1251openalex-snapshot
Prophet Inequality for Bipartite Matching: Merits of Being Simple and Nonadaptive
inferred← citeshttps://doi.org/10.14279/depositonce-3125openalex-snapshot
The Power of Recourse in Online Optimization: Robust Solutions for Scheduling, Matroid and MST Problems
inferred← citeshttps://doi.org/10.14778/2140436.2140442openalex-snapshot
Densest subgraph in streaming and MapReduce
inferred← citeshttps://doi.org/10.14778/2735496.2735504openalex-snapshot
Event pattern matching over graph streams
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8666openalex-snapshot
On the Social Welfare of Mechanisms for Repeated Batch Matching
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10623openalex-snapshot
Market Pricing for Data Streams
inferred← citeshttps://doi.org/10.17877/de290r-17161openalex-snapshot
On graph algorithms for large-scale graphs
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2017.15openalex-snapshot
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2020.22openalex-snapshot
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches
inferred← citeshttps://doi.org/10.4230/lipics.disc.2018.6openalex-snapshot
Distributed Approximate Maximum Matching in the CONGEST Model
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.37openalex-snapshot
Distributed Maximum Matching Verification in CONGEST
inferred← citeshttps://doi.org/10.4230/lipics.esa.2017.29openalex-snapshot
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.52openalex-snapshot
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.74openalex-snapshot
Online Stochastic Matching with Edge Arrivals
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2018.62openalex-snapshot
Impatient Online Matching
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2476openalex-snapshot
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.389openalex-snapshot
Improved Bounds for Online Preemptive Matching
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2015.460openalex-snapshot
Communication Complexity of Approximate Matching in Distributed Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0709.3384openalex-snapshot
Weighted Matching in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.48550/arxiv.0805.1213openalex-snapshot
Online Ad Slotting With Cancellations
inferred← citeshttps://doi.org/10.48550/arxiv.1104.2315openalex-snapshot
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4058openalex-snapshot
Laminar Families and Metric Embeddings: Non-bipartite Maximum Matching Problem in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.48550/arxiv.1112.0184openalex-snapshot
Maximum Matching in Semi-Streaming with Few Passes
inferred← citeshttps://doi.org/10.48550/arxiv.1201.6567openalex-snapshot
Densest Subgraph in Streaming and MapReduce
inferred← citeshttps://doi.org/10.48550/arxiv.1202.4326openalex-snapshot
Space-Constrained Interval Selection
inferred← citeshttps://doi.org/10.48550/arxiv.1307.4359openalex-snapshot
Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1309.2038openalex-snapshot
Submodular Maximization Meets Streaming: Matchings, Matroids, and More
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6763openalex-snapshot
Semi-Streaming Set Cover
inferred← citeshttps://doi.org/10.48550/arxiv.1405.0093openalex-snapshot
Parameterized Streaming Algorithms for Vertex Cover
inferred← citeshttps://doi.org/10.48550/arxiv.1412.8615openalex-snapshot
On Randomized Algorithms for Matching in the Online Preemptive Model
inferred← citeshttps://doi.org/10.48550/arxiv.1504.08024openalex-snapshot
Streaming Algorithms for Submodular Function Maximization
inferred← citeshttps://doi.org/10.48550/arxiv.1505.01460openalex-snapshot
Maximum Matching in Turnstile Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1505.01467openalex-snapshot
Tight Bounds for Linear Sketches of Approximate Matchings
inferred← citeshttps://doi.org/10.48550/arxiv.1505.01731openalex-snapshot
Kernelization via Sampling with Applications to Dynamic Graph Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1505.02019openalex-snapshot
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1604.07467openalex-snapshot
Estimating Weighted Matchings in $o(n)$ Space
inferred← citeshttps://doi.org/10.48550/arxiv.1702.02559openalex-snapshot
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1705.08242openalex-snapshot
Randomized Composable Coresets for Matching and Vertex Cover
inferred← citeshttps://doi.org/10.48550/arxiv.1807.06701openalex-snapshot
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1807.08745openalex-snapshot
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
inferred← citeshttps://doi.org/10.48550/arxiv.1807.09302openalex-snapshot
Metric Sublinear Algorithms via Linear Sampling
inferred← citeshttps://doi.org/10.48550/arxiv.1906.01993openalex-snapshot
Distributed Weighted Matching via Randomized Composable Coresets
inferred← citeshttps://doi.org/10.48550/arxiv.2005.00417openalex-snapshot
Improved Bound for Matching in Random-Order Streams
inferred← citeshttps://doi.org/10.48550/arxiv.2009.13409openalex-snapshot
Constructing Large Matchings via Query Access to a Maximal Matching Oracle
inferred← citeshttps://doi.org/10.48550/arxiv.2010.14684openalex-snapshot
Substream-Centric Maximum Matchings on FPGA
inferred← citeshttps://doi.org/10.48550/arxiv.2102.06939openalex-snapshot
Optimal Streaming Algorithms for Graph Matching
inferred← citeshttps://doi.org/10.48550/arxiv.2102.08476openalex-snapshot
Maximum Coverage in the Data Stream Model: Parameterized and Generalized
inferred← citeshttps://doi.org/10.48550/arxiv.2103.07027openalex-snapshot
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
inferred← citeshttps://doi.org/10.48550/arxiv.2108.07187openalex-snapshot
A Two-Pass Lower Bound for Semi-Streaming Maximum Matching
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0608066openalex-snapshot
k-Connectivity in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.5555/1496770.1496907openalex-snapshot
An online mechanism for ad slot reservations with cancellations
inferred← citeshttps://doi.org/10.5555/2095116.2095156openalex-snapshot
Analyzing graph structure via linear measurements
inferred← citeshttps://doi.org/10.5555/2343896.2343984openalex-snapshot
On the social welfare of mechanisms for repeated batch matching
inferred← citeshttps://doi.org/10.5555/2627817.2627938openalex-snapshot
Better bounds for matchings in the streaming model
inferred← citeshttps://doi.org/10.70675/09c6b43dzd511z4bccz957ez939beb960300openalex-snapshot
Online computation beyond standard models
inferred← citeshttps://doi.org/10.7275/6050904.0openalex-snapshot
Streaming Algorithms Via Reductions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.