[图书][B] Combinatorial species and tree-like structures

F Bergeron, G Labelle, P Leroux - 1998 - books.google.com
The combinatorial theory of species, introduced by Joyal in 1980, provides a unified
understanding of the use of generating functions for both labelled and unlabelled structures …

Графы в программировании: обработка, визуализация и применение

ВН Касьянов, ВА Евстигнеев - 2003 - elibrary.ru
Книга содержит систематическое и полное изложение фундаментальных основ
современных компьютерных технологий, связанных с применением теории графов …

[图书][B] Handbook of algorithms and data structures: in Pascal and C

GH Gonnet, R Baeza-Yates - 1991 - dl.acm.org
Like the first edition, this second edition is a fine resource book that can be valuable to
teachers and learners of computer science as well as to computer science researchers and …

Dense multiway trees

K Culik, T Ottmann, D Wood - ACM Transactions on Database Systems …, 1981 - dl.acm.org
B-trees of order m are a “balanced” class of m-ary trees, which have applications in the
areas of file organization. In fact, they have been the only choice when balanced multiway …

[图书][B] Теория графов: алгоритмы обработки деревьев

ВА Евстигнеев, ВН Касьянов - 1994 - elibrary.ru
Книга представляет собой справочник программиста по алгоритмам обработки
деревьев-важного для программирования класса графов. Наряду с описанием …

Fringe analysis revisited

RA Baeza-Yates - ACM Computing Surveys (CSUR), 1995 - dl.acm.org
Fringe analysis is a technique used to study the average behavior of search trees. In this
paper we survey the main results regarding this technique, and we improve a previous …

Automatic functional correctness proofs for functional search trees

T Nipkow - International Conference on Interactive Theorem …, 2016 - Springer
In a new approach, functional correctness specifications of insert/update and delete
operations on search trees are expressed on the level of lists by means of an inorder …

Object-based and image-based object representations

H Samet - ACM Computing Surveys (CSUR), 2004 - dl.acm.org
An overview is presented of object-based and image-based representations of objects by
their interiors. The representations are distinguished by the manner in which they can be …

Multidimensional height-balanced trees

Vaishnavi - IEEE Transactions on Computers, 1984 - ieeexplore.ieee.org
A new multidimensional balanced tree structure is presented for the efficient management of
multidimensional data. It is shown that the data structure can be used to manage a set of n k …

Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent dictionaries.

L Bougé, J Gabarro, X Messeguer, N Schabanel - 1998 - hal-lara.archives-ouvertes.fr
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees).
Such a rebalancing may for instance be necessary after successive insertions and deletions …