Add to ORKGIn this work we count the number of structures resulting from the application of different kinds of structure modifying algorithms on binary treesPostprint (published version
AbstractWe study the computational complexity and approximation of several problems arising in the c...
Cicalese F, Jacobs T, Laber ES, Molinaro M. On the Complexity of Searching in Trees: Average-case Mi...
SIGLETIB: RN 3147 (84) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
AbstractIn this paper we consider three types of parameters which characterize the computational com...
This paper presents the space complexity analysis of the Binary Tree Roll algorithm. The space compl...
The tree structures are getting more and more important in the modern computer systems. Especially i...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of...
Accumulations are higher-order operations on structured objects; they leave the shape of an object u...
AbstractAccumulations are higher-order operations on structured objects; they leave the shape of an ...
This paper deals with the average complexity of Robinson's unification algorithm, for a simple case ...
AbstractThis paper introduces a new complexity measure for binary sequences, the tree complexity. Th...
The well known binary search method can be described as the process of identifying some marked node ...
This thesis presents an investigation into the properties of various algebras of trees. In particula...
International audienceWe prove that the average complexity of the pairwise ordered tree alignment al...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
AbstractWe study the computational complexity and approximation of several problems arising in the c...
Cicalese F, Jacobs T, Laber ES, Molinaro M. On the Complexity of Searching in Trees: Average-case Mi...
SIGLETIB: RN 3147 (84) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
AbstractIn this paper we consider three types of parameters which characterize the computational com...
This paper presents the space complexity analysis of the Binary Tree Roll algorithm. The space compl...
The tree structures are getting more and more important in the modern computer systems. Especially i...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of...
Accumulations are higher-order operations on structured objects; they leave the shape of an object u...
AbstractAccumulations are higher-order operations on structured objects; they leave the shape of an ...
This paper deals with the average complexity of Robinson's unification algorithm, for a simple case ...
AbstractThis paper introduces a new complexity measure for binary sequences, the tree complexity. Th...
The well known binary search method can be described as the process of identifying some marked node ...
This thesis presents an investigation into the properties of various algebras of trees. In particula...
International audienceWe prove that the average complexity of the pairwise ordered tree alignment al...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
AbstractWe study the computational complexity and approximation of several problems arising in the c...
Cicalese F, Jacobs T, Laber ES, Molinaro M. On the Complexity of Searching in Trees: Average-case Mi...
SIGLETIB: RN 3147 (84) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...