A nonexhaustive algorithm, linear with respect to memory, for solving a two-dimensional interval search problem
È. È. Gasanov, A. N. Erokhin

References
1.	Gasanov E. E., Kuznetsova I. V., “O funktsionalnoi slozhnosti dvumernoi zadachi intervalnogo poiska”, Diskretnaya matematika, 14:1 (2002), 114–141
2.	Gasanov E. E., “O lineinom po pamyati neperebornom algoritme dvumernogo intervalnogo poiska”, Tezisy dokladov XIII Mezhdunarodnoi konferentsii “Problemy teoreticheskoi kibernetiki”, Kazan, 2002, 44
3.	Gasanov E. E, Kudryavtsev V. B., Teoriya khraneniya i poiska informatsii, Fizmatlit, Moskva, 2002
4.	Gasanov E. E., “Ob odnoi matematicheskoi modeli informatsionnogo poiska”, Diskretnaya matematika, 3:2 (1991), 69–76
5.	Gasanov E. E., “Mgnovenno reshaemye zadachi poiska”, Diskretnaya matematika, 8:3 (1996), 119–134