Experiments with trees for the storage and retrieval of future events. Approximate storage utilization of B-trees. Set-theoretic problems of null completion in relational databases. Batched search of index sequential files. On the calculation of control transition probabilities in a program.
Gaussian elimination is optimal for solving linear equations in dimension two.
Yoshito Hanatani and Ronald Fagin . A simple characterization of database dependency implication. On recurrent and recursive interconnection patterns. Equivalent approximation algorithms for node cover. Kunio Aizawa and Akira Nakamura .