On the public citation graph

Proof of the Density Threshold Conjecture for Pinwheel Scheduling

0 signed · 28 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/bf01187034openalex-snapshot

Schedulers for larger classes of pinwheel instances

inferredcites →https://doi.org/10.1007/bf01940883openalex-snapshot

Proportionate Progress: A Notion of Fairness in Resource Allocation

inferredcites →https://doi.org/10.1007/pl00009181openalex-snapshot

A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound

inferredcites →https://doi.org/10.1007/s00186-005-0443-4openalex-snapshot

Generalized Pinwheel Problem

inferredcites →https://doi.org/10.1007/s00453-002-0938-9openalex-snapshot

Pinwheel Scheduling: Achievable Densities

inferredcites →https://doi.org/10.1016/0012-365x(82)90030-9openalex-snapshot

On discount residue classes

inferredcites →https://doi.org/10.1016/0012-365x(92)90454-nopenalex-snapshot

On disjoint residue classes

inferredcites →https://doi.org/10.1016/0167-6377(83)90044-5openalex-snapshot

On a periodic maintenance problem

inferredcites →https://doi.org/10.1016/0304-3975(92)90365-mopenalex-snapshot

Pinwheel scheduling with two distinct numbers

inferredcites →https://doi.org/10.1016/j.jcss.2023.103476openalex-snapshot

Perpetual maintenance of machines with different urgency requirements

inferredcites →https://doi.org/10.1016/j.orl.2021.07.001openalex-snapshot

A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem

inferredcites →https://doi.org/10.1016/j.tcs.2020.07.037openalex-snapshot

Simple strategies versus optimal schedules in multi-agent patrolling

inferredcites →https://doi.org/10.1055/a-2273-3872openalex-snapshot

Trainieren Sie sich glücklich

inferredcites →https://doi.org/10.1109/12.144627openalex-snapshot

General schedulers for the pinwheel problem based on double-integer reduction

inferredcites →https://doi.org/10.1109/12.709381openalex-snapshot

Pfair scheduling of generalized pinwheel task systems

inferredcites →https://doi.org/10.1137/1.9781611977042.8openalex-snapshot

Towards the 5/6-Density Conjecture of Pinwheel Scheduling

inferredcites →https://doi.org/10.1137/s009753970240447xopenalex-snapshot

Windows Scheduling Problems for Broadcast Systems

inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

inferredcites →https://doi.org/10.1287/opre.1110.0919openalex-snapshot

Charlemagne's Challenge: The Periodic Latency Problem

inferredcites →https://doi.org/10.48550/arxiv.2003.12460openalex-snapshot

An enhanced pinwheel algorithm for the bamboo garden trimming problem

What points at this work

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

inferred← citeshttps://doi.org/10.5281/zenodo.23097936zenodo-depositor-declared

inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_12openalex-snapshot

Pinwheel Covering

inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_21openalex-snapshot

Perpetual Scheduling with Explorable Uncertainty

inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_45openalex-snapshot

Pinwheel Scheduling with Real Periods

inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_46openalex-snapshot

Limitations of Density-Based Heuristics and an Alternative Approach for Pinwheel Scheduling with Durations

inferred← citeshttps://doi.org/10.1007/978-981-96-0668-9_23openalex-snapshot

Perpetual Scheduling Under Frequency Constraints

inferred← citeshttps://doi.org/10.2139/ssrn.6193154openalex-snapshot

Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems

inferred← citeshttps://doi.org/10.23919/wiopt71098.2026.11568165openalex-snapshot

Utility Maximization in Wireless Backhaul Networks with Service Guarantees

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.