Some very effective methods of searching in tables
Aplikace matematiky (1969)
- Volume: 14, Issue: 1, page 1-14
- ISSN: 0862-7940
Access Full Article
top
Abstract
topHow to cite
topKrál, Jaroslav. "Some very effective methods of searching in tables." Aplikace matematiky 14.1 (1969): 1-14. <http://eudml.org/doc/14573>.
@article{Král1969,
abstract = {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.},
author = {Král, Jaroslav},
journal = {Aplikace matematiky},
keywords = {computer science and automata},
language = {eng},
number = {1},
pages = {1-14},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Some very effective methods of searching in tables},
url = {http://eudml.org/doc/14573},
volume = {14},
year = {1969},
}
TY - JOUR
AU - Král, Jaroslav
TI - Some very effective methods of searching in tables
JO - Aplikace matematiky
PY - 1969
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 14
IS - 1
SP - 1
EP - 14
AB - 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.
LA - eng
KW - computer science and automata
UR - http://eudml.org/doc/14573
ER -
References
top- Г. M. Аделъсон-Велъский E. M. Ландис, Один алгоритм организации информации, ДАН 146, № 2, (1962). (1962) Zbl1226.30001
- А. П. Ершов Г. И. Кожухин И. В. Поттосин, Обзор особенностей альфа-транслятора, Альфа система автоматизации программирования под редакцией А. П. Ершова, Новосибирск 1965 (the English translation of this paper is in J. of ACM, Jan. 1966). (1965) Zbl1225.00032
- W. W. Peterson, Adressing for random-access storage, IBM J. Res. and Devel. 4, No 4, (1957). (1957) MR0085633
- 3. К. Иванова, О выборе функции расстоновки для организации табличных просмотров, Отчет ВЦ СО АН СССР, Новосибирск 1961. (1961) Zbl1160.68305
- К. И. Курбаков, Способ адресации, использующий сжатые коды слов в качестве адресов памяти, ДАН 163, № 4, 841-844 (1965). (1965) Zbl1099.01519
- Shay G., Raver N., A method for key-to-address transformation, IBM J. Res. and Devel. 7, 121-132, No 2, (1963). (1963)
- Л. А. Хиздер, Некоторые свойства диадических деревев, Ж. В. M. M. Ф. 6, 389-394, № 2 (1956). (1956) Zbl0995.90522
- W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, J. Willey, New York 1950. (1950) Zbl0039.13201
- R. Morris, 10.1145/362851.362882, Comm. of ACM 11, 38-44, No. 1, (1968). (1968) DOI10.1145/362851.362882
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.