On the public citation graph

https://doi.org/10.2139/ssrn.4570992

0 signed · 11 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/bf01553887openalex-extracted
A new algorithm for scheduling periodic, real-time tasks
inferredcites →https://doi.org/10.1109/90.234856openalex-extracted
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
inferredcites →https://doi.org/10.1109/90.298432openalex-extracted
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
inferredcites →https://doi.org/10.1109/90.477714openalex-extracted
Delay guarantee of virtual clock server
inferredcites →https://doi.org/10.1109/90.649569openalex-extracted
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
inferredcites →https://doi.org/10.1109/90.650142openalex-extracted
Hashed and hierarchical timing wheels: efficient data structures for implementing a timer facility
inferredcites →https://doi.org/10.1109/infcom.1994.337677openalex-extracted
A self-clocked fair queueing scheme for broadband applications
inferredcites →https://doi.org/10.1109/infcom.1996.497885openalex-extracted
WF/sup 2/Q: worst-case fair weighted fair queueing
inferredcites →https://doi.org/10.1145/2534169.2486031openalex-extracted
pFabric
inferredcites →https://doi.org/10.1145/2934872.2934899openalex-extracted
Programmable Packet Scheduling at Line Rate
inferredcites →https://doi.org/10.1145/63039.63045openalex-extracted
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
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.