Quotient Networks
From MaRDI portal
Publication:3953148
DOI10.1109/TC.1982.1675994zbMath0491.68021OpenAlexW2296592722MaRDI QIDQ3953148
John P. Fishburn, Raphael Ari Finkel
Publication date: 1982
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1982.1675994
Related Items (12)
On mapping processes to processors in distributed systems ⋮ The file distribution problem for processor networks ⋮ A size-independent systolic array for matrix triangularization and eigenvalue computation ⋮ The complexity of finding uniform emulations on fixed graphs ⋮ Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} ⋮ Uniform homomorphisms of de Bruijn and Kautz networks ⋮ The complexity of finding uniform emulations on paths and ring networks ⋮ Algebraic specification of interconnection network relationships by permutation voltage graph mappings ⋮ Uniform emulations of Cartesian-product and Cayley graphs ⋮ Building heaps in parallel ⋮ On tree-partition-width ⋮ Deterministic sorting in nearly logarithmic time on the hypercube and related computers
This page was built for publication: Quotient Networks
