An application of -ary trees to the design of data structures for geometric searching problems
M. Talamo, G. Gambosi (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “A partially persistent data structure for the set-union problem”
An application of -ary trees to the design of data structures for geometric searching problems
A probabilistic analysis of a new satisfiability algorithm
B. Apolloni, S. Di Gregorio (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Optimal tour planning with specified nodes
Gilbert Laporte, Hélène Mercure, Yves Norbert (1984)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On an evaluation function for heuristic search as a path problem
Ľudovít Molnár (1971)
Kybernetika
Similarity:
Rebalancing operations for deletions in AVL-trees
Athanasios K. Tsakalidis (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On context constrained squares and repetitions in a string
A. Apostolico (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: