Lattice computers for approximating Euclidean space

DOI10.1145/363647.363688zbMATH Open1320.68030OpenAlexW2055630415MaRDI QIDQ2947005FDOQ2947005

Authors: Dayanand S. Rajan, Anil M. Shende, John Case 

Publication date: 20 September 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/363647.363688

Recommendations

• Root Lattices are Efficiently Generated
• scientific article; zbMATH DE number 1504656
• Shaped lattice graphs as models of the multiprocessor computer systems
• scientific article; zbMATH DE number 18652
• An alternative mapping of 3-D space onto processor arrays

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical problems of computer architecture (68M07) Machine vision and scene understanding (68T45)

Cited In (3)

• Title not available (Why is that?)
• Computing efficiently the lattice width in any dimension
• Title not available (Why is that?)

This page was built for publication: Lattice computers for approximating Euclidean space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947005)