Energy-Efficient Algorithms

DOI10.1145/2840728.2840756zbMath1334.68293arXiv1605.08448OpenAlexW2293411184MaRDI QIDQ2800581

Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi, Erik D. Demaine

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.08448

zbMATH Keywords

algorithmsLandauer's principlereversible computingmodels of computation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

The stochastic thermodynamics of computation ⋮ Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms ⋮ Energy efficient sorting, selection and searching ⋮ Saving memory space in deep neural networks by recomputing: a survey ⋮ Energy efficient sorting, selection and searching ⋮ PSPACE-completeness of reversible deterministic systems

This page was built for publication: Energy-Efficient Algorithms