Theoretical Computer Science

There are several problems in the theory of online computation where tight lower bounds on the competitive ratio are unknown and expected to be difficult to describe in a short form. A good example is the Online Bin Stretching problem, ...

Boolean functions have important applications in information technology and computer science. Certificate complexity is an important combinatorial measure of Boolean function complexity. In this paper, we first introduce many concise ...

This paper considers scheduling jobs online on m identical machines such that the jobs can be parallelized across the machines. Two models of parallelizability are considered, one is the speed-up curves model, and the other is the ...

Traditional online algorithms are designed to make decisions online in the face of uncertainty to perform well compared to the optimal offline algorithm for the worst-case inputs. On the other hand, machine learning algorithms try to ...

The k-ary n-cubes are a generalization of the hypercubes to alphabets of cardinality k, with k ≥ 2. More precisely, a k-ary n-cube is a graph with k n vertices associated to the k-ary words of length n. Given a k-ary word f, the k-ary ...

The unfolding angle of Heighway's dragon curve, which is the most famous in the family of dragon curves, is 90°. We consider dragon curves whose unfolding angles are greater than 90°. In the doctoral thesis of R. Albers it is proved ...

Bell and Shallit recently introduced the Lie complexity of an infinite word s as the function counting for each length the number of conjugacy classes of words whose elements are all factors of s. They proved, using algebraic ...

The online car-sharing problem finds many real-world applications. The problem, proposed by Luo, Erlebach and Xu in 2018, mainly focuses on an online model in which there are two locations: 0 and 1, and k total cars. Each request which ...

Consider an ordinal tree T on n nodes, each of which is assigned a category from an alphabet [ σ ] = { 1 , 2 , … , σ }. We preprocess the tree T in order to support categorical path counting queries, which ask for the number of ...

Each positive increasing integer sequence { a n } n ≥ 0 can serve as a numeration system to represent each non-negative integer by means of suitable coefficient strings. We analyse the case of k-generalized Fibonacci sequences leading ...