On the public citation graph
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms
0 signed · 37 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.1007/978-3-540-70575-8_34openalex-snapshot
Scheduling for Speed Bounded Processors
inferredcites →https://doi.org/10.1007/978-3-540-87744-8_54openalex-snapshot
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_27openalex-snapshot
Scalably Scheduling Power-Heterogeneous Processors
inferredcites →https://doi.org/10.1007/978-3-642-38016-7_15openalex-snapshot
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
inferredcites →https://doi.org/10.1007/978-3-642-40450-4_64openalex-snapshot
Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_4openalex-snapshot
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems
inferredcites →https://doi.org/10.1007/s00453-019-00583-8openalex-snapshot
Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems
inferredcites →https://doi.org/10.1109/sfcs.1977.24openalex-snapshot
Probabilistic computations: Toward a unified measure of complexity
inferredcites →https://doi.org/10.1137/08072125xopenalex-snapshot
Speed Scaling for Weighted Flow Time
inferredcites →https://doi.org/10.1145/1290672.1290686openalex-snapshot
Energy-efficient algorithms for flow time minimization
inferredcites →https://doi.org/10.1145/1536414.1536506openalex-snapshot
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
inferredcites →https://doi.org/10.1145/1639562.1639576openalex-snapshot
Optimal speed scaling under arbitrary power functions
inferredcites →https://doi.org/10.1145/2213977.2213992openalex-snapshot
Online matching with concave returns
inferredcites →https://doi.org/10.1145/3033274.3085109openalex-snapshot
Convex Program Duality, Fisher Markets, and Nash Social Welfare
inferredcites →https://doi.org/10.1561/0400000024openalex-snapshot
The Design of Competitive Online Algorithms via a Primal—Dual Approach
inferredcites →https://doi.org/10.1561/9781601982179openalex-snapshot
The Design of Competitive Online Algorithms via a Primal—Dual Approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.07.044openalex-snapshot
Dynamic batching of online arrivals to leverage economies of scale
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9682957openalex-snapshot
Online Job Scheduling on a Single Machine with General Cost Functions
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155523openalex-snapshot
Is Deadline Oblivious Scheduling Efficient for Controlling Real-Time Traffic in Cellular Downlink Systems?
inferred← citeshttps://doi.org/10.1109/infocomwkshps50562.2020.9162855openalex-snapshot
Edge Emergency Demand Response Control via Scheduling in Cloudlet Cluster
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834434openalex-snapshot
Scheduling Group Tests over Time
inferred← citeshttps://doi.org/10.1109/tnet.2020.2993142openalex-snapshot
Multiple Server SRPT With Speed Scaling Is Competitive
inferred← citeshttps://doi.org/10.1109/tnet.2022.3142091openalex-snapshot
Speed Scaling on Parallel Servers With MapReduce Type Precedence Constraints
inferred← citeshttps://doi.org/10.1109/tsg.2022.3179251openalex-snapshot
An Online Scheduling Algorithm for a Community Energy Storage System
inferred← citeshttps://doi.org/10.1137/1.9781611976465.167openalex-snapshot
Online Generalized Network Design Under (Dis)Economies of Scale
inferred← citeshttps://doi.org/10.1145/3392142openalex-snapshot
Mechanism Design for Online Resource Allocation
inferred← citeshttps://doi.org/10.1145/3529113.3529128openalex-snapshot
Speed Scaling with Multiple Servers under a Sum-Power Constraint
inferred← citeshttps://doi.org/10.1145/3717823.3718217openalex-snapshot
Tight Results for Online Convex Paging
inferred← citeshttps://doi.org/10.1186/s13638-020-01789-zopenalex-snapshot
Emergency demand response in edge computing
inferred← citeshttps://doi.org/10.1287/moor.2022.1349openalex-snapshot
Online Generalized Network Design Under (Dis)Economies of Scale
inferred← citeshttps://doi.org/10.1287/opre.2022.2321openalex-snapshot
An Optimal Control Framework for Online Job Scheduling with General Cost Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04498openalex-snapshot
Speed Scaling with Tandem Servers
inferred← citeshttps://doi.org/10.48550/arxiv.2004.09640openalex-snapshot
Mechanism Design for Online Resource Allocation: A Unified Approach
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.