On the public citation graph

Branch-and-bound and backtrack search on mesh-connected arrays of processors

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.1007/bf01199431openalex-snapshot
Ueber die stetige Abbildung einer Line auf ein Fl�chenst�ck
inferredcites →https://doi.org/10.1007/bf01199438openalex-snapshot
Sur une courbe, qui remplit toute une aire plane
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1109/sfcs.1988.21963openalex-snapshot
Take a walk, grow a tree
inferredcites →https://doi.org/10.1145/113379.113383openalex-snapshot
Optimal speedup for backtrack search on a butterfly network
inferredcites →https://doi.org/10.1145/12130.12156openalex-snapshot
An optimal sorting algorithm for mesh connected computers
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1145/62212.62240openalex-snapshot
A randomized parallel branch-and-bound procedure
inferredcites →https://doi.org/10.1145/72935.72959openalex-snapshot
Dynamic tree embeddings in butterflies and hypercubes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-61440-0_162openalex-snapshot
Fast deterministic backtrack search
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_1openalex-snapshot
Two Motivating Examples: Sequential Orders on Quadtrees and Multidimensional Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_10openalex-snapshot
Parallelisation with Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_11openalex-snapshot
Locality Properties of Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_12openalex-snapshot
Sierpinski Curves on Triangular and Tetrahedral Meshes
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_13openalex-snapshot
Case Study: Cache Efficient Algorithms for Matrix Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_14openalex-snapshot
Case Study: Numerical Simulation on Spacetree Grids Using Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_15openalex-snapshot
Further Applications of Space-Filling Curves: References and Readings
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_2openalex-snapshot
How to Construct Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_3openalex-snapshot
Grammar-Based Description of Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_4openalex-snapshot
Arithmetic Representation of Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_5openalex-snapshot
Approximating Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_6openalex-snapshot
Sierpinski Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_7openalex-snapshot
Further Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_8openalex-snapshot
Space-Filling Curves in 3D
inferred← citeshttps://doi.org/10.1007/978-3-642-31046-1_9openalex-snapshot
Refinement Trees and Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_63openalex-snapshot
Space-Efficient Parallel Algorithms for Combinatorial Search Problems
inferred← citeshttps://doi.org/10.1007/bfb0036198openalex-snapshot
Towards optimal locality in mesh-indexings
inferred← citeshttps://doi.org/10.1007/bfb0097994openalex-snapshot
Deterministic branch-and-bound on distributed memory machines
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.09.007openalex-snapshot
Space-efficient parallel algorithms for combinatorial search problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00326-7openalex-snapshot
Towards optimal locality in mesh-indexings
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00039-3openalex-snapshot
An empirical study of dynamic scheduling on rings of processors
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00386-8openalex-snapshot
Deterministic parallel backtrack search
inferred← citeshttps://doi.org/10.1109/71.790599openalex-snapshot
Optimal clustering of tree-sweep computations for high-latency parallel environments
inferred← citeshttps://doi.org/10.1142/s0129054199000289openalex-snapshot
DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES
inferred← citeshttps://doi.org/10.21236/ad1003173openalex-snapshot
Integrating the Nqueens Algorithm into a Parameterized Benchmark Suite
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.627openalex-snapshot
Communication Lower Bounds for Distributed-Memory Computations
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.