An energy complexity model for algorithms

DOI10.1145/2422436.2422470MaRDI QIDQ2986878zbMATH OpenOpenAlexFDO

Authors Swapnoneel Roy, Atri Rudra, Akshat Verma

Publication date 16 May 2017

Published in Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

energy-efficient algorithmsparallel disk I/O model

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Energy-efficient algorithms
• Towards an energy complexity of computation
• Algorithms for parallel memory, I: Two-level memories
• Algorithms for energy management (invited talk)
• Computational proof as experiment: probabilistic algorithms from a thermodynamic perspective

Cites work

• A model of interactive teaching
• A theory of goal-oriented communication
• A theory of the learnable
• Algorithmic Learning Theory
• Derandomizing polynomial identity tests means proving circuit lower bounds
• scientific article; zbMATH DE number 3154781 (Why is no real title available?)
• scientific article; zbMATH DE number 67625 (Why is no real title available?)
• scientific article; zbMATH DE number 67631 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• Learning from different teachers
• Measuring teachability using variants of the teaching dimension
• Models of cooperative teaching and learning
• Occam's razor
• On specifying Boolean functions by labelled examples
• On the complexity of teaching
• On the limits of efficient teachability
• On the power of inductive inference from good examples
• Pseudorandom generators for space-bounded computation
• Recent Developments in Algorithmic Teaching
• Teachability in computational learning
• Teaching a smarter learner.
• Teaching Randomized Learners

Cited in

(7)

• Towards an energy complexity of computation
• Energy-efficient algorithms
• On characterizing the data access complexity of programs
• Energy Arguments in the Theory of Algorithms
• scientific article; zbMATH DE number 1760031 (Why is no real title available?)
• Computational proof as experiment: probabilistic algorithms from a thermodynamic perspective
• Energy efficient sorting, selection and searching

This page was built for publication: An energy complexity model for algorithms

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