Skip to main navigation
Skip to search
Skip to main content
NYU Scholars Home
Help & FAQ
Home
Profiles
Research units
Research output
Search by expertise, name or affiliation
Improved Bounds for Matching in Random-Order Streams
Aaron Bernstein
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Improved Bounds for Matching in Random-Order Streams'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximate Matching
100%
2-approximation
100%
Streaming Model
100%
Semi-streaming
100%
Approximation Ratio
50%
Greedy Algorithm
50%
Bipartite Graph
50%
Better Approximation
50%
Space Constraints
50%
Space Use
50%
Maximum Matching
50%
Maximum Cardinality Matching
50%
Mathematics
Edge
100%
Random Order
100%
Approximates
75%
Open Question
25%
Greedy Algorithm
25%
Bipartite Graph
25%
Cardinality
25%
Computer Science
Approximation (Algorithm)
100%
Approximate Matching
50%
Approximation Ratio
25%
Cardinality
25%
Space Requirement
25%
Bipartite Graph
25%
Maximum Matching
25%
Greedy Algorithm
25%