Join Our Newsletter

TCS

2016

3 years 2 months ago
2016

A link stream is a collection of triplets (t, u, v) indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to s...

TCS

2016

3 years 2 months ago
2016

In this paper, we consider the number of 2-protected nodes in random digital trees. Results for the mean and variance of this number for tries have been obtained by Gaither, Homma...

TCS

2016

3 years 2 months ago
2016

The notion of duty cycling is common in problems which seek to maximize the lifetime of a wireless sensor network. In the duty cycling model, sensors are grouped into shifts that ...

TCS

2016

3 years 2 months ago
2016

Abstract. Mathematical modelling and simulation modelling are fundamental tools of engineering, science, and social sciences such as economics, and provide decision-support tools i...

TCS

2016

3 years 2 months ago
2016

We consider the following dynamic load balancing game: Given an initial assignment of jobs to identical parallel machines, the system is modiﬁed; speciﬁcally, some machines ar...

TCS

2016

3 years 2 months ago
2016

A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for ﬁxed p ≥ 1, all partitions of the verte...

TCS

2016

3 years 2 months ago
2016

A clique of a graph is a maximal set of vertices of size at least 2 that induces a complete graph. A k-clique-colouring of a graph is a colouring of the vertices with at most k co...

TCS

2016

3 years 2 months ago
2016

The downward and upward closures of a regular language L are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interior...

TCS

2016

3 years 2 months ago
2016

rder Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou and Maksym Zavershynskyi 3D rectangulations and geometric matrix multiplication. Peter Floderus...

TCS

2016

3 years 2 months ago
2016

Consider a deck of real cards with faces that are either black or red and backs that are all identical. Then, using two cards of diﬀerent colors, we can commit a secret bit to a...