Sciweavers

Share
TCS
2016
3 years 2 months ago
Computing maximal cliques in link streams
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...
Jordan Viard, Matthieu Latapy, Clémence Mag...
TCS
2016
3 years 2 months ago
On 2-protected nodes in random digital trees
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...
Michael Fuchs 0001, C.-K. Lee, G.-R. Yu
TCS
2016
3 years 2 months ago
Changing of the guards: Strip cover with duty cycling
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 ...
Amotz Bar-Noy, Ben Baumer, Dror Rawitz
TCS
2016
3 years 2 months ago
A calculus and logic of bunched resources and processes
Abstract. Mathematical modelling and simulation modelling are fundamental tools of engineering, science, and social sciences such as economics, and provide decision-support tools i...
Gabrielle Anderson, David J. Pym
TCS
2016
3 years 2 months ago
Load rebalancing games in dynamic systems with migration costs
We consider the following dynamic load balancing game: Given an initial assignment of jobs to identical parallel machines, the system is modified; specifically, some machines ar...
Sofia Belikovetsky, Tami Tamir
TCS
2016
3 years 2 months ago
Convex p-partitions of bipartite graphs
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 fixed p ≥ 1, all partitions of the verte...
Luciano N. Grippo, Martín Matamala, Mart&ia...
TCS
2016
3 years 2 months ago
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
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...
Hélio B. Macêdo Filho, Raphael C. S. ...
TCS
2016
3 years 2 months ago
On the state complexity of closures and interiors of regular languages with subwords and superwords
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...
Prateek Karandikar, Matthias Niewerth, Philippe Sc...
TCS
2016
3 years 2 months ago
Average-case complexity of the min-sum matrix product problem
rder Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou and Maksym Zavershynskyi 3D rectangulations and geometric matrix multiplication. Peter Floderus...
Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Ya...
TCS
2016
3 years 2 months ago
Card-based protocols for securely computing the conjunction of multiple variables
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 different colors, we can commit a secret bit to a...
Takaaki Mizuki
books