Вы здесь

Главная

дерево

Связанные издания:

Rabin Tree Automata and Finite Monoids
Random Generation of Colored Trees
Random sprouts as Internet models. and Polya processes
rdp - An Iterator-Based Recursive Descent Parser Generator with Tree Promotion Operators
Reasoning about Knowledge on Computation Trees
Regular Tree Languages without Unary Symbols Are Star-Free
Relating Hierarchies of Word and Tree Automata
Relations and Kleene Algebra in Computer Science: Proc./9th Intl Conference on Relational Methods in CS & 4th Intl WS RelMiCS/AKA 2006. Manchester, UK, Aug/Sep 2006
Relaxed Balance for Search Trees with Local Rebalancing
Reusing Batch Parsers as Incremental Parsers
Rewriting and Tree Automata
Safety Verification of Ada Programs Using Software Fault Trees
Search-Tree Visualization
Set-Based Analysis for Logic Programming and Tree Automata
SF-Tree: An Efficient and Flexible Structure for Estimating Selectivity of Simple Path Expressions with Statistical Accuracy Guarantee
SGML/HyTime Repositories: Requirements and Data Modelling Using Object-Oriented Database Concepts
Shape Analysis of Single-Parent Heaps
Simple Parallel Algorithms for the Replacement Edge Problem and Related Problems on Spanning Trees
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
Solving a Unification Problem under Constrained Substitutions Using Tree Automata
Solving Queries by Tree Projections
Solving Systems of Set Constraints using Tree Automata
Some Results on Top-context-free Tree Languages
Sorting and Searching on the Word RAM
Spatial Joins and R-trees
Specification and Implementation of a Tree-Abiding Interface for Ada
Specifying Decision-Making Processes
State Complexity of SBTA Languages
State of the Art in Parallel Search Techniques for Discrete Optimization Problems
Statistics on Random Trees
Storage utilization in B-trees with a generalized overflow technique
S*-Tree: An Improved S+-Tree for Coloured Images
Structured Numbers. Properties of a Hierarchy of Operations on Binary Trees
Symbolic Constraints and Tree Automata
Synchronisation Trees
Synchronization Barrier and Related Tools for Shared Memory Parallel Programming
Synthesis of O(lg n) Testable Trees
Synthesized and Inherited Functions
Taking Random Walks to Grow Trees in Hypercubes
TAPSOFT 91: Proc./Intern. Joint Conf. Theory and Practice of Software Development, Brighton, UK, April 1991. Vol.1
TAX: A Tree Algebra for XML
Terminological Database Design: An Approach Based on the Use of Conceptual Graphs
The analysis of heuristics for search trees
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
The Construction of Optimal Multiway Search Trees and the Monotonicity Principle
The Delta Operation: From Strings to Trees to Strings
The Distribution of Heights of Binary Trees and Other Simple Trees
The Dual Structure of Ordered Trees
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable