On the public citation graph

Latin squares for parallel array access

0 signed · 78 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.1016/0020-0190(80)90115-5openalex-snapshot
Conflict-free access of arrays — a counter example
inferredcites →https://doi.org/10.1016/0097-3165(74)90053-3openalex-snapshot
A simple method for constructing doubly diagonalized Latin squares
inferredcites →https://doi.org/10.1016/0097-3165(79)90027-xopenalex-snapshot
Crisscross Latin squares
inferredcites →https://doi.org/10.1016/0166-218x(92)90139-2openalex-snapshot
Perfect latin squares
inferredcites →https://doi.org/10.1016/c2014-0-03412-0openalex-snapshot
Latin Squares and their Applications
inferredcites →https://doi.org/10.1109/2.35195openalex-snapshot
Visualization: expanding scientific and engineering research opportunities
inferredcites →https://doi.org/10.1109/2.35198openalex-snapshot
Acquisition and representation of 2D and 3D data from turbulent flows and flames
inferredcites →https://doi.org/10.1109/5.9655openalex-snapshot
Recent advances in magnetic resonance
inferredcites →https://doi.org/10.1109/cvpr.1989.37825openalex-snapshot
3D edge detection using recursive filtering: application to scanner images
inferredcites →https://doi.org/10.1109/isca.1988.5233openalex-snapshot
Scrambled storage for parallel memory systems
inferredcites →https://doi.org/10.1109/isca.1989.714526openalex-snapshot
A Dynamic Storage Scheme For Conflict-free Vector Access
inferredcites →https://doi.org/10.1109/isca.1989.714575openalex-snapshot
Perfect Latin Squares And Parallel Array Access
inferredcites →https://doi.org/10.1109/t-c.1971.223171openalex-snapshot
The Organization and Use of Parallel Memories
inferredcites →https://doi.org/10.1109/t-c.1975.224157openalex-snapshot
Access and Alignment of Data in an Array Processor
inferredcites →https://doi.org/10.1109/tc.1968.229159openalex-snapshot
ILLIAC IV Software and Application Programming
inferredcites →https://doi.org/10.1109/tc.1977.5009297openalex-snapshot
The Multidimensional Access Memory in STARAN
inferredcites →https://doi.org/10.1109/tc.1978.1675045openalex-snapshot
Memory Systems for Image Processing
inferredcites →https://doi.org/10.1109/tc.1978.1675122openalex-snapshot
Theoretical Limitations on the Efficient Use of Parallel Memories
inferredcites →https://doi.org/10.1109/tc.1978.1675164openalex-snapshot
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
inferredcites →https://doi.org/10.1109/tc.1981.1675791openalex-snapshot
A Self-Routing Benes Network and Parallel Permutation Algorithms
inferredcites →https://doi.org/10.1109/tc.1982.1676020openalex-snapshot
The Prime Memory System for Array Access
inferredcites →https://doi.org/10.1109/tc.1987.1676887openalex-snapshot
On Linear Skewing Schemes and d-Ordered Vectors
inferredcites →https://doi.org/10.1145/633625.52427openalex-snapshot
Scrambled storage for parallel memory systems
inferredcites →https://doi.org/10.1145/74925.74934openalex-snapshot
A dynamic storage scheme for conflict-free vector access
inferredcites →https://doi.org/10.1145/74925.74967openalex-snapshot
Perfect Latin squares and parallel array access
inferredcites →https://doi.org/10.2307/2003526openalex-snapshot
Mathematical Theory of Connecting Networks and Telephone Traffic
inferredcites →https://doi.org/10.2307/2343633openalex-snapshot
Mathematical Theory of Connecting Networks and Telephone Traffic.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1426openalex-snapshot
Multiple Templates Access of Trees in Parallel Memory Systems
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1638openalex-snapshot
Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates
inferred← citeshttps://doi.org/10.1006/jpdc.2002.1860openalex-snapshot
Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_35openalex-snapshot
Mappings for Conflict-Free Access of Paths in Elementary Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_66openalex-snapshot
Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_100openalex-snapshot
Visual Data Rectangular Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_125openalex-snapshot
c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories
inferred← citeshttps://doi.org/10.1007/978-3-540-73625-7_29openalex-snapshot
Parallel Memory Architecture for TTA Processor
inferred← citeshttps://doi.org/10.1007/bfb0045066openalex-snapshot
Conflict-free access to templates of trees and hypercubes in parallel memory systems
inferred← citeshttps://doi.org/10.1007/s10619-006-9362-5openalex-snapshot
Efficient parallel processing of range queries through replicated declustering
inferred← citeshttps://doi.org/10.1007/s11265-005-4962-2openalex-snapshot
On Design of Parallel Memory Access Schemes for Video Coding
inferred← citeshttps://doi.org/10.1007/s11265-008-0173-yopenalex-snapshot
Parallel Memory Architecture for Application-Specific Instruction-Set Processors
inferred← citeshttps://doi.org/10.1016/0306-4379(96)00024-5openalex-snapshot
Partitioning similarity graphs: A framework for declustering problems
inferred← citeshttps://doi.org/10.1016/b978-0-444-63555-6.50014-3openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.is.2005.06.001openalex-snapshot
Data space mapping for efficient I/O in large multi-dimensional databases
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.06.004openalex-snapshot
Conflict-free star-access in parallel memory systems
inferred← citeshttps://doi.org/10.1016/j.micpro.2004.06.007openalex-snapshot
Automatic mapping of C to FPGAs with the DEFACTO compilation and synthesis system
inferred← citeshttps://doi.org/10.1016/s0020-0255(03)00181-6openalex-snapshot
(Almost) Optimal parallel block access for range queries
inferred← citeshttps://doi.org/10.1023/a:1019269409432openalex-snapshot
A Hypergraph Based Approach to Declustering Problems
inferred← citeshttps://doi.org/10.1109/71.995820openalex-snapshot
Optimal tree access by elementary and composite templates in parallel memory systems
inferred← citeshttps://doi.org/10.1109/72.557697openalex-snapshot
A parallel processing VLSI BAM engine
inferred← citeshttps://doi.org/10.1109/apccas.2008.4746335openalex-snapshot
Multi-access memory architecture for image applications with multiple interested regions
inferred← citeshttps://doi.org/10.1109/ats.2007.48openalex-snapshot
Fast and Low Cost HW Bit Map for Memory Test Based on Residue Polynomial System over GF(2)
inferred← citeshttps://doi.org/10.1109/cgo.2004.1281682openalex-snapshot
Custom data layout for memory parallelism
inferred← citeshttps://doi.org/10.1109/icces.2010.5674848openalex-snapshot
Accelerated access to visual data in multimedia applications
inferred← citeshttps://doi.org/10.1109/iccsit.2009.5234772openalex-snapshot
A partially adaptive routing algorithm for Benes network on chip
inferred← citeshttps://doi.org/10.1109/icdcs.2008.72openalex-snapshot
Multi-Site Retrieval of Declustered Data
inferred← citeshttps://doi.org/10.1109/icde.1995.380370openalex-snapshot
A similarity graph-based approach to declustering problems and its application towards parallelizing grid files
inferred← citeshttps://doi.org/10.1109/icpp.1994.130openalex-snapshot
Module Partitioning and Interlaced Data Placement Schemes to Reduce Conflicts in Interleaved Memories
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924972openalex-snapshot
Optimal tree access by elementary and composite templates in parallel memory systems
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302970openalex-snapshot
Star-coloring of graphs for conflict-free access to parallel memory systems
inferred← citeshttps://doi.org/10.1109/ipps.1994.288310openalex-snapshot
Latin cubes and parallel array access
inferred← citeshttps://doi.org/10.1109/ipps.1997.580980openalex-snapshot
Multiple templates access of trees in parallel memory systems
inferred← citeshttps://doi.org/10.1109/ipps.1998.669955openalex-snapshot
Toward a universal mapping algorithm for accessing trees in parallel memory systems
inferred← citeshttps://doi.org/10.1109/ipps.1999.760475openalex-snapshot
Shuffle memory system
inferred← citeshttps://doi.org/10.1109/iscas.2000.857189openalex-snapshot
Parallel, memory access schemes for H.263 encoder
inferred← citeshttps://doi.org/10.1109/nas.2008.42openalex-snapshot
Rectangularly Multi-Module Memory System with Table-Based Dynamic Addressing Scheme
inferred← citeshttps://doi.org/10.1109/spdp.1994.346145openalex-snapshot
Conflict-free data access of arrays and trees in parallel memory systems
inferred← citeshttps://doi.org/10.1109/tc.2010.48openalex-snapshot
A Graphics Parallel Memory Organization Exploiting Request Correlations
inferred← citeshttps://doi.org/10.1109/tmm.2005.864345openalex-snapshot
Multimedia rectangularly addressable memory
inferred← citeshttps://doi.org/10.1109/tpds.2007.1024openalex-snapshot
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories
inferred← citeshttps://doi.org/10.1109/tpds.2007.1082openalex-snapshot
Analysis and Comparison of Replicated Declustering Schemes
inferred← citeshttps://doi.org/10.1109/tpds.2011.177openalex-snapshot
Equivalent Disk Allocations
inferred← citeshttps://doi.org/10.1109/vetecs.2010.5494235openalex-snapshot
A Framework for Topology-Transparent Scheduling in Wireless Networks
inferred← citeshttps://doi.org/10.1145/1391469.1391585openalex-snapshot
A practical approach of memory access parallelization to exploit multiple off-chip DDR memories
inferred← citeshttps://doi.org/10.1145/1629075.1629077openalex-snapshot
Divide-and-conquer scheme for strictly optimal retrieval of range queries
inferred← citeshttps://doi.org/10.1145/2491472.2491474openalex-snapshot
Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays
inferred← citeshttps://doi.org/10.1145/263580.263641openalex-snapshot
Conflict-free template access in k-ary and binomial trees
inferred← citeshttps://doi.org/10.14288/1.0167154openalex-snapshot
Broadening the applicability of FPGA-based soft vector processors
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2008.02015openalex-snapshot
An Efficient Conflict-Free Parallel Memory Scheme for Image Applications with Multiple Interested Regions
inferred← citeshttps://doi.org/10.5555/977395.977674openalex-snapshot
Custom data layout for memory parallelism
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.