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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Relational data base design using refinement rules”
An application of -ary trees to the design of data structures for geometric searching problems
Implementing term rewriting by jungle evaluation
Berthold Hoffmann, Detlef Plump (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Post grammars as a programming language description tool
Paul Feautrier (1975)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Retrieving library functions by unifying types modulo linear isomorphism
M. Rittri (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Theory as basis for advances in hypermedia
H. Maurer, F. Kappe (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
An Overview of Some Truth Maintenance Systems
Mladen Stanojević, Dušan Velašević (1995)
The Yugoslav Journal of Operations Research
Similarity:
An imperative language based on distributive categories II
Wafaa Khalil, R. F. C. Walters (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Logic and functional programming by retractions : operational semantics
M. Bellia (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: