On the public citation graph
Efficient algorithms for a class of partitioning problems
0 signed · 34 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.1994.1126openalex-snapshot
Rectilinear Partitioning of Irregular Data Parallel Computations
inferredcites →https://doi.org/10.1007/978-1-4613-2003-6openalex-snapshot
Assignment Problems in Parallel and Distributed Computing
inferredcites →https://doi.org/10.1007/bf01407812openalex-snapshot
Approximate algorithms for partitioning problems
inferredcites →https://doi.org/10.1016/0020-0190(92)90054-yopenalex-snapshot
Mapping a chain task to chained processors
inferredcites →https://doi.org/10.1016/0165-6074(83)90206-5openalex-snapshot
A multiprocessor system for simulating data transmission systems (MUPSI)
inferredcites →https://doi.org/10.1109/12.75137openalex-snapshot
Partitioning problems in parallel, pipeline, and distributed computing
inferredcites →https://doi.org/10.1109/12.76406openalex-snapshot
Improved algorithms for mapping pipelined and parallel computations
inferredcites →https://doi.org/10.5555/62972.63015openalex-snapshot
iWarp: an integrated solution to high-speed parallel computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470558027.ch15openalex-snapshot
Hypergraph‐Based Dynamic Partitioning and Load Balancing
inferred← citeshttps://doi.org/10.1006/jpdc.1993.1117openalex-snapshot
Efficient Algorithms for Mapping and Partitioning a Class of Parallel Computations
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1126openalex-snapshot
Rectilinear Partitioning of Irregular Data Parallel Computations
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1106openalex-snapshot
Automated Parallelization of Timed Petri-Net Simulations
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1596openalex-snapshot
Optimal Use of Mixed Task and Data Parallelism for Pipelined Computations
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_5openalex-snapshot
Object Oriented Mathematical Modelling and Compilation to Parallel Code
inferred← citeshttps://doi.org/10.1007/978-3-540-72584-8_78openalex-snapshot
Mapping Pipeline Skeletons onto Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1007/978-3-540-76888-3_50openalex-snapshot
Smart Distribution of Bio-signal Processing Tasks in M-Health
inferred← citeshttps://doi.org/10.1007/978-3-540-77255-2_74openalex-snapshot
Context Aware Body Area Networks for Telemedicine
inferred← citeshttps://doi.org/10.1007/s00453-008-9229-4openalex-snapshot
Complexity Results for Throughput and Latency Optimization of Replicated and Data-parallel Workflows
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90054-yopenalex-snapshot
Mapping a chain task to chained processors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.05.003openalex-snapshot
Fast optimal load balancing algorithms for 1D partitioning
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.11.004openalex-snapshot
Mapping pipeline skeletons onto heterogeneous platforms
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.04.011openalex-snapshot
A repartitioning hypergraph model for dynamic load balancing
inferred← citeshttps://doi.org/10.1109/71.877776openalex-snapshot
Distributed multimedia application configuration management
inferred← citeshttps://doi.org/10.1109/clustr.2007.4629276openalex-snapshot
Complexity Results for Throughput and Latency Optimization of Replicated and Data-parallel Workflows
inferred← citeshttps://doi.org/10.1109/clustr.2007.4629278openalex-snapshot
Multi-criteria Scheduling of Pipeline Workflows
inferred← citeshttps://doi.org/10.1109/edtc.1996.494341openalex-snapshot
Recursive bipartitioning of signal flow graphs for programmable video signal processors
inferred← citeshttps://doi.org/10.1109/hcw.1997.581416openalex-snapshot
Optimal task assignment in heterogeneous computing systems
inferred← citeshttps://doi.org/10.1109/hipc.1997.634497openalex-snapshot
Sparse matrix decomposition with optimal load balancing
inferred← citeshttps://doi.org/10.1109/inmic.2003.1416687openalex-snapshot
Effective load balancing in distributed video-on demand multimedia system
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370327openalex-snapshot
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
inferred← citeshttps://doi.org/10.1109/sasp.2011.5941072openalex-snapshot
Customized MPSoC synthesis for task sequence
inferred← citeshttps://doi.org/10.18419/opus-2410openalex-snapshot
Task allocation in distributed multimedia systems based on the host-satellite model
inferred← citeshttps://doi.org/10.3990/1.9789036530262openalex-snapshot
Task distribution based adaptation in mobile patient monitoring systems
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.