On the public citation graph

Min-Energy Voltage Allocation for Tree-Structured Tasks

0 signed · 27 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.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1109/focs.2004.24openalex-snapshot
Dynamic Speed Scaling to Manage Energy and Temperature
inferredcites →https://doi.org/10.1109/focs.2004.50openalex-snapshot
Optimal Power-Down Strategies
inferredcites →https://doi.org/10.1109/sfcs.1995.492493openalex-snapshot
A scheduling model for reduced CPU energy
inferredcites →https://doi.org/10.1145/1013235.1013261openalex-snapshot
Dynamic voltage scaling for systemwide energy minimization in real-time embedded systems
inferredcites →https://doi.org/10.1145/1053271.1053280openalex-snapshot
Optimal voltage allocation techniques for dynamically variable voltage processors
inferredcites →https://doi.org/10.1145/774572.774679openalex-snapshot
A realistic variable voltage scheduling model for real-time applications
inferredcites →https://doi.org/10.1145/775832.775867openalex-snapshot
Optimal voltage allocation techniques for dynamically variable voltage processors
inferredcites →https://doi.org/10.1145/860176.860183openalex-snapshot
On energy-optimal voltage scheduling for fixed-priority hard real-time systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.21474openalex-snapshot
Routing and scheduling for energy and delay minimization in the powerdown model
inferred← citeshttps://doi.org/10.1007/11549345_56openalex-snapshot
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
inferred← citeshttps://doi.org/10.1007/11671411_24openalex-snapshot
Speed Scaling of Tasks with Precedence Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_34openalex-snapshot
Scheduling for Speed Bounded Processors
inferred← citeshttps://doi.org/10.1007/s00224-007-9070-1openalex-snapshot
Speed Scaling of Tasks with Precedence Constraints
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.12.009openalex-snapshot
Rate-adaptive weighted fair queueing for energy-aware scheduling
inferred← citeshttps://doi.org/10.1073/pnas.0510886103openalex-snapshot
Discrete and continuous min-energy schedules for variable voltage processors
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483427openalex-snapshot
Energy-delay tradeoffs in a load-balanced router
inferred← citeshttps://doi.org/10.1109/ciss.2012.6310761openalex-snapshot
Scheduling algorithms for optimizing the tradeoffs between delay, queue size and energy
inferred← citeshttps://doi.org/10.1109/focs.2010.61openalex-snapshot
Minimum-Cost Network Design with (Dis)economies of Scale
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462071openalex-snapshot
Routing for Energy Minimization in the Speed Scaling Model
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462279openalex-snapshot
Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model
inferred← citeshttps://doi.org/10.1109/tnet.2011.2159864openalex-snapshot
Routing for Power Minimization in the Speed Scaling Model
inferred← citeshttps://doi.org/10.1145/1367064.1367078openalex-snapshot
Getting the best response for your erg
inferred← citeshttps://doi.org/10.1145/1378533.1378580openalex-snapshot
Competitive non-migratory scheduling for flow time and energy
inferred← citeshttps://doi.org/10.2172/1018729openalex-snapshot
Recovery Act: Energy Efficiency of Data Networks through Rate Adaptation (EEDNRA) - Final Technical Report
inferred← citeshttps://doi.org/10.32657/10356/54996openalex-snapshot
High level thermal-aware scheduling for multiprocessors
inferred← citeshttps://doi.org/10.4086/toc.2012.v008a009openalex-snapshot
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.