On the public citation graph

Reordering Buffer Management for Non-uniform Cost Models

0 signed · 53 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/3-540-45749-6openalex-snapshot
Algorithms — ESA 2002
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/b95852openalex-snapshot
LATIN 2004 : theoretical informatics : 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004 : proceedings
inferredcites →https://doi.org/10.1007/s002240000100openalex-snapshot
Competitive Analysis of On-Line Disk Scheduling
inferredcites →https://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot
Competitive paging algorithms
inferredcites →https://doi.org/10.1016/j.tcs.2004.05.016openalex-snapshot
Combining request scheduling with web caching
inferredcites →https://doi.org/10.1080/00207540310001646821openalex-snapshot
A sequential ordering problem in automotive paint shops
inferredcites →https://doi.org/10.1145/1007912.1007925openalex-snapshot
New results on web caching with request reordering
inferredcites →https://doi.org/10.1145/361268.361278openalex-snapshot
A comparative analysis of disk scheduling policies

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11671411_6openalex-snapshot
Exploiting Locality: Approximating Sorting Buffers
inferred← citeshttps://doi.org/10.1007/11672142_48openalex-snapshot
Online Sorting Buffers on Line
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-1-4939-2864-4_502openalex-snapshot
Scheduling with a Reordering Buffer
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_22openalex-snapshot
Online Service with Delay on a Line
inferred← citeshttps://doi.org/10.1007/978-3-319-08001-7_12openalex-snapshot
Reordering Buffer Management with Advice
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-642-27848-8_502-1openalex-snapshot
Scheduling with a Reordering Buffer
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_15openalex-snapshot
A Bicriteria Approximation for the Reordering Buffer Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_39openalex-snapshot
Online Stochastic Reordering Buffer Scheduling
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/978-3-662-47672-7_7openalex-snapshot
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_59openalex-snapshot
Run Generation Revisited: What Goes Up May or May Not Come Down
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.1007/s10951-016-0487-8openalex-snapshot
Reordering buffer management with advice
inferred← citeshttps://doi.org/10.1016/j.dam.2012.02.005openalex-snapshot
NP-hardness of the sorting buffer problem on the uniform metric
inferred← citeshttps://doi.org/10.1016/j.jda.2006.08.001openalex-snapshot
Exploiting locality: approximating sorting buffers
inferred← citeshttps://doi.org/10.1016/j.jda.2008.08.002openalex-snapshot
Online and offline algorithms for the sorting buffers problem on the line metric
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.077openalex-snapshot
A note on sorting buffers offline
inferred← citeshttps://doi.org/10.1109/focs.2019.00012openalex-snapshot
Polylogarithmic Guarantees for Generalized Reordering Buffer Management
inferred← citeshttps://doi.org/10.1137/1.9781611973105.70openalex-snapshot
A Constant Factor Approximation Algorithm for Reordering Buffer Management
inferred← citeshttps://doi.org/10.1137/1.9781611974782.79openalex-snapshot
Reordering Buffers with Logarithmic Diameter Dependency for Trees
inferred← citeshttps://doi.org/10.1137/20m1326167openalex-snapshot
Almost Tight Bounds for Reordering Buffer Management
inferred← citeshttps://doi.org/10.1142/1181openalex-snapshot
Algorithms and Complexity
inferred← citeshttps://doi.org/10.1145/1122480.1122499openalex-snapshot
2005
inferred← citeshttps://doi.org/10.1145/1250790.1250871openalex-snapshot
Reordering buffers for general metric spaces
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/1993636.1993717openalex-snapshot
Almost tight bounds for reordering buffer management
inferred← citeshttps://doi.org/10.1145/2213977.2214031openalex-snapshot
Optimal online buffer scheduling for block devices
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.22215/etd/2015-10855openalex-snapshot
Experimental Evaluation of Reordering Buffer Management Algorithms
inferred← citeshttps://doi.org/10.4086/toc.2010.v006a002openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.87openalex-snapshot
Generalized Reordering Buffer Management
inferred← citeshttps://doi.org/10.48550/arxiv.1009.4355openalex-snapshot
The Sorting Buffer Problem is NP-hard
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06501openalex-snapshot
Run Generation Revisited: What Goes Up May or May Not Come Down
inferred← citeshttps://doi.org/10.48550/arxiv.2105.10689openalex-snapshot
An Algorithm for Reordering Buffer Management Problem and Experimental Evaluations on Discrete Distributions
inferred← citeshttps://doi.org/10.5555/1873601.1873603openalex-snapshot
An improved competitive algorithm for 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.