On the public citation graph

On the number of acceptable task assignments in distributed computing systems

0 signed · 36 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.1002/jgt.3190010410openalex-snapshot
The graph isomorphism disease
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1016/c2009-0-22048-4openalex-snapshot
Inequalities - Theory of Majorization and Its Applications
inferredcites →https://doi.org/10.1109/mc.1980.1653419openalex-snapshot
Task Allocation in Distributed Data Processing
inferredcites →https://doi.org/10.1109/mc.1982.1654050openalex-snapshot
Heuristic Models of Task Assignment Scheduling in Distributed Systems
inferredcites →https://doi.org/10.1109/proc.1981.12145openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1109/tc.1979.1675348openalex-snapshot
Assignment of Tasks in a Distributed Processor System with Limited Memory
inferredcites →https://doi.org/10.1109/tc.1981.1675756openalex-snapshot
On the Mapping Problem
inferredcites →https://doi.org/10.1109/tc.1985.1676563openalex-snapshot
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion
inferredcites →https://doi.org/10.1109/tc.1987.1676960openalex-snapshot
Task Allocation and Precedence Relations for Distributed Real-Time Systems
inferredcites →https://doi.org/10.1137/0209025openalex-snapshot
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
inferredcites →https://doi.org/10.1145/2465.2467openalex-snapshot
The cosmic cube
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2307/2287859openalex-snapshot
Inequalities: Theory of Majorization and its Applications.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.4330070506openalex-snapshot
Task assignment using a problem‐space genetic algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00039-2openalex-snapshot
An efficient load distribution strategy for a distributed linear network of processors with communication delays
inferred← citeshttps://doi.org/10.1016/b978-0-444-81784-6.50078-6openalex-snapshot
Heuristic Algorithms for Task Assignment of Parallel Programs
inferred← citeshttps://doi.org/10.1080/00207160.2013.772985openalex-snapshot
Task swapping networks in distributed systems
inferred← citeshttps://doi.org/10.1080/17445760.2014.997729openalex-snapshot
Representations of task assignments in distributed systems using Young tableaux and symmetric groups
inferred← citeshttps://doi.org/10.1109/12.55689openalex-snapshot
Minimal order loop-free routing strategy
inferred← citeshttps://doi.org/10.1109/7.381944openalex-snapshot
Multi-installment load distribution in tree networks with delays
inferred← citeshttps://doi.org/10.1109/71.296323openalex-snapshot
A framework for mapping periodic real-time applications on multicomputers
inferred← citeshttps://doi.org/10.1109/71.674315openalex-snapshot
Optimizing computing costs using divisible load analysis
inferred← citeshttps://doi.org/10.1109/90.491013openalex-snapshot
On the hardness of approximating optimum schedule problems in store and forward networks
inferred← citeshttps://doi.org/10.1109/empdp.1993.336372openalex-snapshot
On the use of communication graphs in automatic mapping
inferred← citeshttps://doi.org/10.1109/empdp.1999.746675openalex-snapshot
An approach to mapping parallel programs on hypercube multiprocessors
inferred← citeshttps://doi.org/10.1109/hicss.1997.667421openalex-snapshot
A neural network approach for dynamic load balancing in homogeneous distributed systems
inferred← citeshttps://doi.org/10.1109/infcom.1994.337560openalex-snapshot
Optimum schedule problems in store and forward networks
inferred← citeshttps://doi.org/10.1109/iros.1992.587356openalex-snapshot
The Segmented Bus: A Dynamically Segmentable Interprocessor Communication Network For Intelligent Mobile Robot Systems
inferred← citeshttps://doi.org/10.1109/pdcat.2012.29openalex-snapshot
A QoS Scheduling Scheme with Availability Constraint in Distributed Systems
inferred← citeshttps://doi.org/10.1109/ssst.1991.138612openalex-snapshot
Concurrent program execution
inferred← citeshttps://doi.org/10.1109/superc.1990.130114openalex-snapshot
A network-topology independent task allocation strategy for parallel computers
inferred← citeshttps://doi.org/10.31274/rtd-180813-9550openalex-snapshot
The assignment problem in distributed computing
inferred← citeshttps://doi.org/10.5555/110382.110619openalex-snapshot
A network-topology independent task allocation strategy for parallel computers
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.