Mapping Computation with No Memory

DOI10.1007/978-3-642-03745-0_15MaRDI QIDQ3184759zbMATH OpenOpenAlexFDO

Authors Serge Burckel, Emeric Gioan, Emmanuel Thomé

Publication date 22 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-00395080/file/ark__67375_HCB-M15JG9FH-0.pdf

zbMATH Keywords

Boolean mappingbutterflycircuit designlinear mappingmapping computationmemory optimizationmultistage interconnection networkprocessor optimizationprogram designrearrangeability

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 2040917
• Computation with no memory, and rearrangeable multicast networks
• Computing in matrix groups without memory
• Efficient exact computation of iterated maps
• scientific article; zbMATH DE number 4055009
• Memoryless computation: new results, constructions, and extensions
• scientific article; zbMATH DE number 4179292
• Memory-efficient fixpoint computation
• ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES

Cited in

(8)

• Sequential computation of linear Boolean mappings
• Sequentialization and procedural complexity in automata networks
• On simulation in automata networks
• Complete simulation of automata networks
• A glimpse of complex maps with memory
• Memoryless computation: new results, constructions, and extensions
• Computing in permutation groups without memory
• Computation with no memory, and rearrangeable multicast networks

This page was built for publication: Mapping Computation with No Memory

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