 | A.P.Pinchuk, K.V.Shvachko,
Maintaining Dictionaries: Space-Saving Modifications of B-Trees.
In Proceedings of International Conference on Database Theory'92, Berlin. Lecture Notes in
Computer Science, vol.646, pp.421-435, 1992. |
| K.V.Shvachko,
Space-Saving Modifications of B-Trees.
In Proceedings of Symposium on Computer Systems and Applied Mathematics, St.Petersburg,
Russia, p.214, 1993. |
| K.V.Shvachko,
S(1)-Trees: Space Saving Generalization of B-Trees with 1/2 Utilization.
Unpublished, 1994.
|
| K.V.Shvachko,
Optimal Representation of Dynamic Dictionaries by Balanced Trees.
In Proceedings of XI International Conference on Logic, Methodology, and Philosophy of
Science, Obninsk, Russia, v.2, pp.181-186, 1995 (in Russian). |
| K.V.Shvachko.
Space Saving Generalization of B-Trees with 2/3 Utilization.
Computers and Mathematics with Applications, vol.30, No.7, 1995, pp.47-66.
|
| K.V.Shvachko,
A Hierarchy of Weight Balanced Trees.
In Proceedings of II International Conference on Mathematical Algorithms, N.Novgorod,
Russia, 1995. |
| K.V.Shvachko,
A development of efficient data structure research methods based on balanced trees.
techincal report, RFBR project grant N 96-01-01005, 1998 (in Russian).
|
| K.V.Shvachko,
Use of Balanced Trees for Compact Representation of Data.
submitted to Artificial Inteligence News, 1997 (in Russian).
Abstract in English
|
|
K.V.Shvachko,
S(b)-Tree Library: an Efficient Way of Indexing Data.
In Proceedings of
DIMACS Workshop on External Memory Algorithms and Visualization'98,
Rutgers University, NJ. 1998.
|
|
