Вы здесь

Главная

дерево

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

1-2 Brother Trees or AVL Trees Revisited
1-Bounded TWA Cannot Be Determinized
2-3 Brother Trees
Acceptance Trees for Probabilistic Processes
Access Method Concurrency with Recovery
A Characterization of digital search trees from the successful search viewpoint
A Comparison of Iterative and Defined Classes of Search Trees
A Comparison of the Decision Table and Tree
A Cost Model for Spatial Intersection Queries on RI-Trees
A Decision Tree Compilation Algorithm for FCP( ,:,?)
A Domain-Specific Language for Regular Sets of Strings and Trees
A Dynamic Storage Allocation Algorithm Suitable for File Structures
A Feature Constraint System for Logic Programming with Entailment
A General Criterion for Avoiding Infinite Unfolding during Partial Deduction of Logic Programs
A Hierarchy of Deterministic Top-down Tree Transformations
A Lattice of Abstract Graphs
Algebraic Foundations in Computer Science: Essays Dedicated to Symeon Bozapalidis on the Occasion of His Retirement
Algebraic Informatics: Proc./Third International Conference, CAI 2009, Thessaloniki, Grees, May 2009
Algorithms and Data Structures: Proc./11th International Symposium, WADS 2009, Banff, Canada, August 2009
Algorithms and Data Structures: Proc./9th International Workshop, WADS 2005. Waterloo, Canada, August 2005
Algorithms and Data Structures: Proc./Third Workshop, WADS 93. Montreal, Canada, August 1993
Algorithms for Creating Indexes for Very Large Tables Without Qulescing Updates
Algorithm Theory - SWAT 2006: Proc./10th International Workshop on Algorithm Theory. Riga, Latvia, July 2006
Algorithm Theory - SWAT 2014: Proc./14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2014
A Linear Algorithm for Copying Binary Trees Using Bounded Workspace
Alternatives to the B+ -tree
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues
An Algorithm for Cost-Delay Balanced Trees and Its Application to Wide Area Network Multicast
Analytic Variations on the Common Subexpression Problem
An Automatic Test Data Generation System Based on the Integrated Classification-Tree Methodology
An Efficient Algorithm for Edge-Ranking Trees
An Efficient Implementation of Parallel A
An Explanation of Splaying
An Implementation Technique for a Class of Bottom-Up Procedures
A Note on Graftings, Rotations, and Distances in Binary Trees
A note on the subtree isomorphism for order and relate problems
Another Kind of Modular Attribute Grammars
An Overview of Door Attribute Grammars
A Parallelization Framework for Recursive Tree Programs
A Parallel Tree N-body Code for Heterogeneous Clusters
A Pattern Matching Compiler for Multiple Target Languages
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design
A Propositional Dense Time Logic
A Qualitative Comparison Study of Data Structures for Large Line Segment Databases
A Simple, Efficient, and Flexible Implementation of Flexible Arrays
A Simplification Method using BDD for Majority-voting Classifiers
A solution to the concurrent deletion problem for B-trees
A Survey of Tree Transductions
Asymptotically Optimal Communication Algorithms on Faulty Folded Peterson Networks
A Systematic Analysis of Splaying