Information storage and search complexity theory
From MaRDI portal
Publication:2453382
Recommendations
Cites work
- scientific article; zbMATH DE number 3133101 (Why is no real title available?)
- scientific article; zbMATH DE number 3839327 (Why is no real title available?)
- scientific article; zbMATH DE number 4037201 (Why is no real title available?)
- scientific article; zbMATH DE number 20618 (Why is no real title available?)
- scientific article; zbMATH DE number 1320677 (Why is no real title available?)
- scientific article; zbMATH DE number 647637 (Why is no real title available?)
- scientific article; zbMATH DE number 3802822 (Why is no real title available?)
- scientific article; zbMATH DE number 1889083 (Why is no real title available?)
- A constant, in the worst case, algorithm to search for identical objects
- A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
- Algebraic theory of information search
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- An Algorithm for Finding Nearest Neighbors
- An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form
- Analysis of range searches in quad trees
- Average complexity of searching for identical objects in random nonuniform databases
- Dynamic databases with optimal in order time complexity
- Efficient worst-case data structures for range searching
- Instantly solvable search problems
- Modelling and search complexity in multiprocessor Systems
- On a one-dimensional interval search problem
- On the analysis of fuzzy information graphs
- On the complexity of decoding Boolean cube splitting into cube faces
- On the functional complexity of a two-dimensional interval search problem
- Optimal Retrieval Algorithms for Small Region Queries
- The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
Cited in
(12)- A new model \(K*TDG\) for complex data flow polynomial and its search algorithm
- scientific article; zbMATH DE number 2032365 (Why is no real title available?)
- Information retrieval with unambiguous output
- Content search through comparisons
- Identification Rate, Search and Memory Complexity Tradeoff: Fundamental Limits
- Information-Theoretic Caching: Sequential Coding for Computing
- scientific article; zbMATH DE number 1889083 (Why is no real title available?)
- scientific article; zbMATH DE number 647637 (Why is no real title available?)
- Solution of the problem of the optimal synthesis of information graphs for basic information search problems.
- Information retrieval and the average number of input clues
- Fundamental limits for information retrieval
- A theory of information with special application to search problems
This page was built for publication: Information storage and search complexity theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453382)
