On the public citation graph
Access to Data and Number of Iterations
0 signed · 51 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/game.1999.0740openalex-snapshot
Regret in the On-Line Decision Problem
inferredcites →https://doi.org/10.1006/inco.1994.1009openalex-snapshot
The Weighted Majority Algorithm
inferredcites →https://doi.org/10.1007/11538462_15openalex-snapshot
Finding Graph Matchings in Data Streams
inferredcites →https://doi.org/10.1007/3-540-48777-8_24openalex-snapshot
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-13123-8_6openalex-snapshot
Efficient Primal-Dual Graph Algorithms for MapReduce
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_44openalex-snapshot
Bipartite Graph Matchings in the Semi-streaming Model
inferredcites →https://doi.org/10.1007/bf01758778openalex-snapshot
A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph
inferredcites →https://doi.org/10.1007/s10107-004-0552-5openalex-snapshot
Smooth minimization of non-smooth functions
inferredcites →https://doi.org/10.1016/0041-5553(77)90174-4openalex-snapshot
Convergence rate of the game processes for solving matrix games
inferredcites →https://doi.org/10.1016/0167-6377(95)00032-0openalex-snapshot
A sublinear-time randomized approximation algorithm for matrix games
inferredcites →https://doi.org/10.1016/j.ic.2012.10.006openalex-snapshot
Linear programming in the semi-streaming model with application to the maximum matching problem
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.1109/ccc.2013.37openalex-snapshot
Superlinear Lower Bounds for Multipass Graph Processing
inferredcites →https://doi.org/10.1109/focs.2010.70openalex-snapshot
Approximating Maximum Weight Matching in Near-Linear Time
inferredcites →https://doi.org/10.1137/s1052623403425629openalex-snapshot
Prox-Method with Rate of Convergence O (1/ t ) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
inferredcites →https://doi.org/10.1145/1007352.1007382openalex-snapshot
Solving fractional packing problems in O ast (1/ε) iterations
inferredcites →https://doi.org/10.1145/1250790.1250879openalex-snapshot
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
inferredcites →https://doi.org/10.1145/167088.167211openalex-snapshot
A parallel approximation algorithm for positive linear programming
inferredcites →https://doi.org/10.1145/1993636.1993647openalex-snapshot
A general framework for graph sparsification
inferredcites →https://doi.org/10.1145/237814.237827openalex-snapshot
Approximating s-t minimum cuts in Õ ( n 2 ) time
inferredcites →https://doi.org/10.1145/2611462.2611493openalex-snapshot
On the power of the congested clique model
inferredcites →https://doi.org/10.1287/moor.20.2.257openalex-snapshot
Fast Approximation Algorithms for Fractional Packing and Covering Problems
inferredcites →https://doi.org/10.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferredcites →https://doi.org/10.4230/lipics.stacs.2008.1312openalex-snapshot
Weighted Matching in the Semi-Streaming Model
inferredcites →https://doi.org/10.4230/lipics.stacs.2010.2476openalex-snapshot
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.iopenalex-snapshot
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents
inferredcites →https://doi.org/10.48550/arxiv.1212.6925openalex-snapshot
Superlinear lower bounds for multipass graph processing
inferredcites →https://doi.org/10.48550/arxiv.1306.5003openalex-snapshot
A Local Computation Approximation Scheme to Maximum Matching
inferredcites →https://doi.org/10.5555/1283383.1283398openalex-snapshot
Efficient algorithms for computing all low s-t edge connectivities and related problems
inferredcites →https://doi.org/10.5555/2095116.2095156openalex-snapshot
Analyzing graph structure via linear measurements
inferredcites →https://doi.org/10.5555/2627817.2627938openalex-snapshot
Better bounds for matchings in the streaming model
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_3openalex-snapshot
Distributed Algorithms for Matching in Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_24openalex-snapshot
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions
inferred← citeshttps://doi.org/10.1007/s00446-021-00418-2openalex-snapshot
Equivalence classes and conditional hardness in massively parallel computations
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.1109/focs.2018.00070openalex-snapshot
Parallel Graph Connectivity in Log Diameter Rounds
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.1137/1.9781611977073.29openalex-snapshot
Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space
inferred← citeshttps://doi.org/10.1145/3293611.3331603openalex-snapshot
Weighted Matchings via Unweighted Augmentations
inferred← citeshttps://doi.org/10.1145/3323165.3323202openalex-snapshot
Dynamic Algorithms for the Massively Parallel Computation Model
inferred← citeshttps://doi.org/10.1145/3350755.3400230openalex-snapshot
Unconditional Lower Bounds for Adaptive Massively Parallel Computation
inferred← citeshttps://doi.org/10.1145/3519935.3520039openalex-snapshot
Deterministic (1+ 𝜀 )-approximate maximum matching with poly(1/ 𝜀 ) passes in the semi-streaming model and beyond
inferred← citeshttps://doi.org/10.1145/3564246.3585110openalex-snapshot
On Regularity Lemma and Barriers in Streaming and Dynamic Matching
inferred← citeshttps://doi.org/10.1145/3618260.3649763openalex-snapshot
O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set
inferred← citeshttps://doi.org/10.1145/3662158.3662770openalex-snapshot
Streaming Graph Algorithms in the Massively Parallel Computation Model
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.14openalex-snapshot
Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity
inferred← citeshttps://doi.org/10.48550/arxiv.2001.01146openalex-snapshot
New lower bounds for Massively Parallel Computation from query complexity
inferred← citeshttps://doi.org/10.70675/4798deadzb5fcz4c8cz8355z2bca7671686dopenalex-snapshot
Modèle de calcul massivement parallèle en MapReduce pour quelques problèmes en théorie des automates
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.