On the public citation graph
https://doi.org/10.4086/toc.2012.v008a009
0 signed · 32 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/11533719_30openalex-snapshot
Min-Energy Voltage Allocation for Tree-Structured Tasks
inferredcites →https://doi.org/10.1007/978-3-540-78773-0_21openalex-snapshot
Average Rate Speed Scaling
inferredcites →https://doi.org/10.1016/j.tcs.2009.07.004openalex-snapshot
Speed scaling with a solar cell
inferredcites →https://doi.org/10.1073/pnas.0510886103openalex-snapshot
Discrete and continuous min-energy schedules for variable voltage processors
inferredcites →https://doi.org/10.1109/40.888701openalex-snapshot
Power-aware microarchitecture: design and modeling challenges for next-generation microprocessors
inferredcites →https://doi.org/10.1109/focs.2004.24openalex-snapshot
Dynamic Speed Scaling to Manage Energy and Temperature
inferredcites →https://doi.org/10.1109/sfcs.1995.492493openalex-snapshot
A scheduling model for reduced CPU energy
inferredcites →https://doi.org/10.1137/050629434openalex-snapshot
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
inferredcites →https://doi.org/10.1137/08072125xopenalex-snapshot
Speed Scaling for Weighted Flow Time
inferredcites →https://doi.org/10.1145/1053271.1053280openalex-snapshot
Optimal voltage allocation techniques for dynamically variable voltage processors
inferredcites →https://doi.org/10.1145/1067309.1067324openalex-snapshot
Algorithmic problems in power management
inferredcites →https://doi.org/10.1145/1206035.1206038openalex-snapshot
Speed scaling to manage energy and temperature
inferredcites →https://doi.org/10.1145/1243401.1243411openalex-snapshot
Competitive online scheduling for server systems
inferredcites →https://doi.org/10.1145/1248377.1248424openalex-snapshot
Speed scaling on parallel processors
inferredcites →https://doi.org/10.1145/860176.860183openalex-snapshot
On energy-optimal voltage scheduling for fixed-priority hard real-time systems
inferredcites →https://doi.org/10.5353/th_b3955827openalex-snapshot
Energy efficient online deadline scheduling
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-319-18263-6_10openalex-snapshot
Energy-Efficient Algorithms for Non-preemptive Speed-Scaling
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_4openalex-snapshot
Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines
inferred← citeshttps://doi.org/10.1007/978-3-642-45046-4_12openalex-snapshot
Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling
inferred← citeshttps://doi.org/10.1007/s00453-019-00596-3openalex-snapshot
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State
inferred← citeshttps://doi.org/10.1007/s10878-013-9618-8openalex-snapshot
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.001openalex-snapshot
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.03.001openalex-snapshot
On multi-processor speed scaling with migration
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.020openalex-snapshot
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115488openalex-snapshot
Competitive mechanisms for energy-efficient cloud computing
inferred← citeshttps://doi.org/10.1137/1.9781611973730.74openalex-snapshot
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State
inferred← citeshttps://doi.org/10.1145/3210377.3210402openalex-snapshot
Online Non-preemptive Scheduling on Unrelated Machines with Rejections
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.39openalex-snapshot
A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing
inferred← citeshttps://doi.org/10.48550/arxiv.1504.03586openalex-snapshot
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
inferred← citeshttps://doi.org/10.70675/9a1ad7d5z09bdz45ebz99d2zc89c616b22c1openalex-snapshot
Job scheduling in order to aggregate energy consumption and quality of service : optimization and game theory
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.