DOIAbstract
AbstractIn this paper we consider three types of parameters which characterize the computational complexity of algorithms working on recursive trees. We deal with the path lengths, the degree path lengths and the mean path lengths
AbstractIn this paper we consider three types of parameters which characterize the computational complexity of algorithms working on recursive trees. We deal with the path lengths, the degree path lengths and the mean path lengths
AbstractThis paper investigates in terms of Kolmogorov complexity the differences between the inform...
ABSTRACT: The random recursive tree is a combinatorial structure used to model a variety of applicat...
AbstractThis article investigates algorithmic learning, in the limit, of correct programs for recurs...
AbstractIn this paper we consider three types of parameters which characterize the computational com...
In this work we count the number of structures resulting from the application of different kinds of ...
Typically there are significant differences between the initial formulation of an algorithm and its ...
Typically there are significant differences between the initial formulation of an algorithm and its ...
The symbolic computations of recursive programmes were investigated with the aim of study of complex...
AbstractThe performance of several tree traversal algorithms may be described in terms of various no...
In this work we are concerned with recursive trees and linear preferential attachment trees. These a...
ABSTRACT. We show that an algorithmic construction of sequences of recursive trees leads to a direct...
AbstractThe main goal of this paper is to compare recursive algorithms such as Turing machines with ...
The main goal of this paper is to compare recursive algorithms such as Turing machines with such sup...
AbstractA recursive labeling of a tree T with M vertices is any assignment of the labels 1, 2,…, M t...
AbstractWe study the parameterized complexity of two families of problems: the bounded length disjoi...
AbstractThis paper investigates in terms of Kolmogorov complexity the differences between the inform...
ABSTRACT: The random recursive tree is a combinatorial structure used to model a variety of applicat...
AbstractThis article investigates algorithmic learning, in the limit, of correct programs for recurs...
AbstractIn this paper we consider three types of parameters which characterize the computational com...
In this work we count the number of structures resulting from the application of different kinds of ...
Typically there are significant differences between the initial formulation of an algorithm and its ...
Typically there are significant differences between the initial formulation of an algorithm and its ...
The symbolic computations of recursive programmes were investigated with the aim of study of complex...
AbstractThe performance of several tree traversal algorithms may be described in terms of various no...
In this work we are concerned with recursive trees and linear preferential attachment trees. These a...
ABSTRACT. We show that an algorithmic construction of sequences of recursive trees leads to a direct...
AbstractThe main goal of this paper is to compare recursive algorithms such as Turing machines with ...
The main goal of this paper is to compare recursive algorithms such as Turing machines with such sup...
AbstractA recursive labeling of a tree T with M vertices is any assignment of the labels 1, 2,…, M t...
AbstractWe study the parameterized complexity of two families of problems: the bounded length disjoi...
AbstractThis paper investigates in terms of Kolmogorov complexity the differences between the inform...
ABSTRACT: The random recursive tree is a combinatorial structure used to model a variety of applicat...
AbstractThis article investigates algorithmic learning, in the limit, of correct programs for recurs...
Add to ORKG