Information storage and search complexity theory

DOI10.1007/S10958-010-9973-2zbMATH Open1288.68045OpenAlexW2049229511MaRDI QIDQ2453382FDOQ2453382

Authors: El'yar E. Gasanov 

Publication date: 6 June 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-010-9973-2

Recommendations

• Solution of the problem of the optimal synthesis of information graphs for basic information search problems.
• scientific article; zbMATH DE number 1988012
• scientific article; zbMATH DE number 2032365
• scientific article; zbMATH DE number 1889083
• Fundamental limits for information retrieval

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Database theory (68P15)

Cites Work

• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• An Algorithm for Finding Nearest Neighbors
• Efficient worst-case data structures for range searching
• A constant, in the worst case, algorithm to search for identical objects
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
• Algebraic theory of information search
• Analysis of range searches in quad trees
• A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
• Optimal Retrieval Algorithms for Small Region Queries
• Average complexity of searching for identical objects in random nonuniform databases
• Instantly solvable search problems
• On the complexity of decoding Boolean cube splitting into cube faces
• Dynamic databases with optimal in order time complexity
• Title not available (Why is that?)
• The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modelling and search complexity in multiprocessor Systems
• On the functional complexity of a two-dimensional interval search problem
• On the analysis of fuzzy information graphs
• An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form
• On a one-dimensional interval search problem

Cited In (12)

• A new model \(K*TDG\) for complex data flow polynomial and its search algorithm
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)