Article
Licensed
Unlicensed
Requires Authentication
A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
-
E. E. Gasanov
Published/Copyright:
October 1, 2004
We suggest an algorithm to solve a two-dimensional interval search problem which is characterised by the memory consumed of order k, the average search time (without the time needed to output the answer) of order √k, where k is the database size.
Published Online: 2004-10-01
Published in Print: 2004-10-01
Copyright 2004, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Analysis of randomised rounding for integer programs
- Homomorphic relations of algebras with a scheme of operators
- On the connection between the eigen-vectors of weighted graphs and their subgraphs
- The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
- Properties of systems of defining relations for automata
- Random free trees and forests with constraints on multiplicities of vertices
- On the complexity of Boolean functions with small number of ones
- A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
Articles in the same Issue
- Analysis of randomised rounding for integer programs
- Homomorphic relations of algebras with a scheme of operators
- On the connection between the eigen-vectors of weighted graphs and their subgraphs
- The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
- Properties of systems of defining relations for automata
- Random free trees and forests with constraints on multiplicities of vertices
- On the complexity of Boolean functions with small number of ones
- A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
