Вы здесь

Главная

дерево

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

A Theory of Transactions on Recoverable Search Trees
A Tree-Based Mergesort
Attributed Tree Grammars
Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems
Automata, Languages and Programming: Part I: Proc./36th International Colloquium, ICALP 2009. Rhodes, Greece, July 2009
Automated Technology for Verification and Analysis: Proc./12th International Symposium, ATVA 2014, Sydney,NSW,Australia, November 2014
Automatically Generating Information from a Z Specification to Support the Classification Tree Method
Axiomatizing the Equational Theory of Regular Tree Languages
Balanced Distributed Seach Trees Do Not Exist
Better Algorithms for the Pathwidth and Treewidth of Graphs
Bit-Tree. A Data Structure for Fast File Processing
Bottom-up Tree Rewriting Tool MBURG
Branching Time Temporal Logic and Amorphous Tree Automata
B-Tree Filer
Building Optimal Binary Search Trees from Sorted Values in O(N) Time
Burg - Fast Optimal Instruction Selection and Tree Parsing
Calculating a Functional Module for Binary Search Trees
Causality-Based Testing in Time Petri Nets
Causal Trees: Interleaving + Causality
Checking Spanning Trees for Optimally Using Associative Parallel Processors and Its Visualization
Chromatic binary search trees. A structure for concurrent rebalancing
Combinatorial Pattern Matching: Proc./7th Annual Symp., CPM 96. Laguna Beach, California, June 1996
Compact Balanced Tries
Complement Problems and Tree Automata in AC-like Theories
Computational Geometry and Graphs: Revised Selected Papers/ Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 2012
Computers and Games: Revised Selected Papers/9th International Conference, CG 2016, Leiden, The Netherlands, June 2016
Computer Science - Theory and Applications: Proc./5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 2010
Computing Average Path Lengths of Binary Search Trees
Computing the All-Pairs Longest Chains in the Plane
Concurrent Accesses to R-Trees
Constraint Satisfaction for Reconciling Heterogeneous Tree Databases
Constraint Search Trees
Constraint Trees
Data Structures and Algorithms for Disjoint Set Union Problems
Decidability of Equivalence for Deterministic Synchronized Tree Automata
Decidability of Equivalence for Linear Letter to Letter Top-down Tree Transducers
Decision-Theoretic Troubleshooting
Decoupling Source Trees into Build-Level Components
Definability in the Homomorphic Quasiorder of Finite Labeled Forests
Dense Multiway Trees
Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees
Directional Type Checking for Logic Programs: Beyond Discriminative Types
Discrete Algorithmic Mathematics
Discs and other Related Data Structures
Distance Browsing in Spatial Databases
Distributed Algorithms for Finding Central Path in Tree Networks
Distributed Computing: Proc./27th International Symposium, DISC 2013, Jerusalem, Israel, October 2013
Distributing a Search Tree Among a Growing Number of Processors
Does Transitivity Help? On the Complexity of Poset Properties
Dynamic Interpolation Search