Energy efficient sorting, selection and searching
From MaRDI portal
Recommendations
- Energy-efficient algorithms
- Combinatorial search from an energy perspective
- Selecting energy efficient inputs using graph structure
- A data structure for efficiently managing a set of energy functions
- Energy-efficient wireless information retrieval
- Optimal selection and sorting via dynamic programming
- Energy Efficient and Scalable Search in Dense Wireless Sensor Networks
- An optimally efficient selection algorithm
- Energy consumption of group search on a line
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 41025 (Why is no real title available?)
- scientific article; zbMATH DE number 7650297 (Why is no real title available?)
- Algorithms for the Generalized Sorting Problem
- Approximate minimum selection with unreliable comparisons
- Computing with Noisy Information
- Energy-efficient algorithms
- Inversions from sorting with distance-based errors
- Irreversibility and Heat Generation in the Computing Process
- Optimal sorting with persistent comparison errors
- Quicksort with Unreliable Comparisons: A Probabilistic Analysis
- Sorting and searching in faulty memories
- Structural filtering: a paradigm for efficient and exact geometric programs
- Time/Space Trade-Offs for Reversible Computation
Cited in
(2)
This page was built for publication: Energy efficient sorting, selection and searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091161)
