On the public citation graph

On mapping processes to processors in distributed systems

0 signed · 46 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/bfb0066442openalex-snapshot

On covering the points of a graph with point disjoint paths

inferredcites →https://doi.org/10.1016/0743-7315(87)90018-9openalex-snapshot

On mapping parallel algorithms into parallel architectures

inferredcites →https://doi.org/10.1016/s0065-2458(08)60033-9openalex-snapshot

The Structure of Parallel Algorithms

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

Task Allocation in Distributed Data Processing

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

Introduction to the configurable, highly parallel computer

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/robot.1985.1087229openalex-snapshot

Warp as a machine for low-level vision

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

Optimal Sorting Algorithms for Parallel Computers

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

Hypertree: A Multiprocessor Interconnection Topology

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

On the Mapping Problem

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

Systolic Processing and an Implementation for Signal and Image Processing

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

Quotient Networks

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

Reducing the Diameters of Computer Networks

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

Optimal Graph Algorithms on a Fixed-Size Linear Array

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

Multiprocessor Scheduling with the Aid of Network Flow Algorithms

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

Augmentation Problems

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

The Planar Hamiltonian Circuit Problem is NP-Complete

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

The cosmic cube

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

Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization

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.3230200106openalex-snapshot

Approximation algorithms for covering a graph by vertex‐disjoint paths of maximum total weight

inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_14openalex-snapshot

Parameterizing Path Partitions

inferred← citeshttps://doi.org/10.1007/978-3-642-12165-4_25openalex-snapshot

Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-76265-9_5openalex-snapshot

Parallel Machines and Languages

inferred← citeshttps://doi.org/10.1007/bf02110309openalex-snapshot

Replicated module allocation in LAN-based concurrent processing systems

inferred← citeshttps://doi.org/10.1007/bfb0032924openalex-snapshot

Mapping graphs onto a partially reconfigurable architecture

inferred← citeshttps://doi.org/10.1016/0020-0190(92)90103-3openalex-snapshot

An approximation algorithm for the asymmetric travelling salesman problem with distances one and two

inferred← citeshttps://doi.org/10.1016/0166-218x(94)00142-zopenalex-snapshot

Path covering problems and testing of printed circuits

inferred← citeshttps://doi.org/10.1016/0304-3975(91)90159-yopenalex-snapshot

Optimal covering of cacti by vertex-disjoint paths

inferred← citeshttps://doi.org/10.1016/j.aml.2010.11.030openalex-snapshot

Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2005.07.002openalex-snapshot

Solving the path cover problem on circular-arc graphs by using an approximation algorithm

inferred← citeshttps://doi.org/10.1016/j.dam.2007.06.001openalex-snapshot

Finding a minimum path cover of a distance-hereditary graph in polynomial time

inferred← citeshttps://doi.org/10.1016/j.jpdc.2024.104887openalex-snapshot

Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.023openalex-snapshot

On the k-path cover problem for cacti

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.022openalex-snapshot

An efficient algorithm to construct disjoint path covers of DCell networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115029openalex-snapshot

Parameterizing path partitions

inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00287-3openalex-snapshot

Differential approximation results for the traveling salesman and related problems

inferred← citeshttps://doi.org/10.1017/s1446181100013894openalex-snapshot

Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow

inferred← citeshttps://doi.org/10.1109/icsmc.1998.726476openalex-snapshot

Dynamic load balancing with token-passing in a distributed system

inferred← citeshttps://doi.org/10.1145/158439.158908openalex-snapshot

Models of machines and computation for mapping in multicomputers

inferred← citeshttps://doi.org/10.11606/t.45.2019.tde-08112019-153707openalex-snapshot

Covering graphs by nontrivial paths

inferred← citeshttps://doi.org/10.15760/etd.6418openalex-snapshot

Mapping Programs to Parallel Architectures in the Real World

inferred← citeshttps://doi.org/10.30108/jcut.200809.0021openalex-snapshot

A Linear-Time Algorithm for the Terminal Path Cover Problem in Trees

inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5262openalex-snapshot

New Techniques in Scene Understanding and Parallel Image Processing.

inferred← citeshttps://doi.org/10.3844/ajassp.2010.428.433openalex-snapshot

Load Balancing of Distributed Systems Based on Multiple Ant Colonies Optimization

inferred← citeshttps://doi.org/10.4036/iis.2002.63openalex-snapshot

Improved Approximation Lower Bounds for TSP with Distances One and Two

inferred← citeshttps://doi.org/10.5120/10540-4675openalex-snapshot

Comparative Analysis of Various Evolutionary Techniques of Load Balancing: A Review

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.