On the public citation graph

Online Sorting Buffers on Line

0 signed · 24 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.1007/11523468_51openalex-snapshot
Reordering Buffer Management for Non-uniform Cost Models
inferredcites →https://doi.org/10.1007/11671411_6openalex-snapshot
Exploiting Locality: Approximating Sorting Buffers
inferredcites →https://doi.org/10.1007/3-540-45749-6_71openalex-snapshot
Online Scheduling for Sorting Buffers
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_23openalex-snapshot
A Constant Approximation Algorithm for Sorting Buffers
inferredcites →https://doi.org/10.1007/s00453-001-0071-1openalex-snapshot
New Algorithms for Disk Scheduling
inferredcites →https://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1109/sfcs.1998.743496openalex-snapshot
The finite capacity dial-a-ride problem
inferredcites →https://doi.org/10.1137/s0097539701392056openalex-snapshot
Algorithms for Capacitated Vehicle Routing
inferredcites →https://doi.org/10.1145/780542.780608openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11764298_17openalex-snapshot
Evaluation of Online Strategies for Reordering Buffers
inferred← citeshttps://doi.org/10.1007/11940128_10openalex-snapshot
Offline Sorting Buffers on Line
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_56openalex-snapshot
Improved Online Algorithms for the Sorting Buffer Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_60openalex-snapshot
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities
inferred← citeshttps://doi.org/10.1007/s00224-011-9346-3openalex-snapshot
Buffer Management for Colored Packets with Deadlines
inferred← citeshttps://doi.org/10.1007/s00450-011-0180-2openalex-snapshot
An overview of some results for reordering buffers
inferred← citeshttps://doi.org/10.1145/1250790.1250871openalex-snapshot
Reordering buffers for general metric spaces
inferred← citeshttps://doi.org/10.1145/1412700.1412719openalex-snapshot
SIGACT news online algorithms column 13
inferred← citeshttps://doi.org/10.1145/1498698.1564503openalex-snapshot
Evaluation of online strategies for reordering buffers
inferred← citeshttps://doi.org/10.1145/1583991.1584068openalex-snapshot
Buffer management for colored packets with deadlines
inferred← citeshttps://doi.org/10.1145/1644015.1644030openalex-snapshot
Improved online algorithms for the sorting buffer problem on line metrics
inferred← citeshttps://doi.org/10.1145/2663347openalex-snapshot
An Improved Competitive Algorithm for Reordering Buffer Management
inferred← citeshttps://doi.org/10.1145/3055399.3055475openalex-snapshot
Online Service with Delay
inferred← citeshttps://doi.org/10.1145/3197406.3197418openalex-snapshot
The reordering buffer problem on the line revisited
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.87openalex-snapshot
Generalized Reordering Buffer Management
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.