Geodesic
Some very effective methods of searching in tables
Applications of Mathematics, Tome 14 (1969) no. 1, pp. 1-14
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

In this paper several methods for constructing tables without repetition of items are studied from the probabilstic point of view. Formulae for expected values of the number of examinations of the kind "is $x$ placed in cell $T_i$ in a table $T$?" are given. The situation when a table $T$ is placed on a backing store of a computer and segmented is also considered. Described methods are very useful in many systems of information processing.
In this paper several methods for constructing tables without repetition of items are studied from the probabilstic point of view. Formulae for expected values of the number of examinations of the kind "is $x$ placed in cell $T_i$ in a table $T$?" are given. The situation when a table $T$ is placed on a backing store of a computer and segmented is also considered. Described methods are very useful in many systems of information processing.
DOI : 10.21136/AM.1969.103203
Classification : 68-00
Keywords: computer science and automata 
@article{10_21136_AM_1969_103203,
     author = {Kr\'al, Jaroslav},
     title = {Some very effective methods of searching in tables},
     journal = {Applications of Mathematics},
     pages = {1--14},
     year = {1969},
     volume = {14},
     number = {1},
     doi = {10.21136/AM.1969.103203},
     mrnumber = {0241019},
     zbl = {0185.43502},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1969.103203/}
}
TY  - JOUR
AU  - Král, Jaroslav
TI  - Some very effective methods of searching in tables
JO  - Applications of Mathematics
PY  - 1969
SP  - 1
EP  - 14
VL  - 14
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1969.103203/
DO  - 10.21136/AM.1969.103203
LA  - en
ID  - 10_21136_AM_1969_103203
ER  - 
%0 Journal Article
%A Král, Jaroslav
%T Some very effective methods of searching in tables
%J Applications of Mathematics
%D 1969
%P 1-14
%V 14
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1969.103203/
%R 10.21136/AM.1969.103203
%G en
%F 10_21136_AM_1969_103203
Král, Jaroslav. Some very effective methods of searching in tables. Applications of Mathematics, Tome 14 (1969) no. 1, pp. 1-14. doi: 10.21136/AM.1969.103203

[1] Г. M. Аделъсон-Велъский E. M. Ландис: Один алгоритм организации информации. ДАН 146, № 2, (1962). | Zbl

[2] А. П. Ершов Г. И. Кожухин И. В. Поттосин: Обзор особенностей альфа-транслятора. Альфа система автоматизации программирования под редакцией А. П. Ершова, Новосибирск 1965 (the English translation of this paper is in J. of ACM, Jan. 1966). | Zbl

[3] W. W. Peterson: Adressing for random-access storage. IBM J. Res. and Devel. 4, No 4, (1957). | MR

[4] 3. К. Иванова: О выборе функции расстоновки для организации табличных просмотров. Отчет ВЦ СО АН СССР, Новосибирск 1961. | Zbl

[5] К. И. Курбаков: Способ адресации, использующий сжатые коды слов в качестве адресов памяти. ДАН 163, № 4, 841-844 (1965). | Zbl

[6] Shay G., Raver N.: A method for key-to-address transformation. IBM J. Res. and Devel. 7, 121-132, No 2, (1963).

[7] Л. А. Хиздер: Некоторые свойства диадических деревев. Ж. В. M. M. Ф. 6, 389-394, № 2 (1956). | Zbl

[8] W. Feller: An Introduction to Probability Theory and its Applications. Vol. 1, J. Willey, New York 1950. | Zbl

[9] R. Morris: Scatter storage techniques. Comm. of ACM 11, 38-44, No. 1, (1968). | DOI

Cité par Sources :