Sciweavers

EJC
2016
10 years 1 months ago
Complexity of short rectangles and periodicity
The Morse-Hedlund Theorem states that a bi-infinite sequence η in a finite alphabet is periodic if and only if there exists n ∈ N such that the block complexity function Pη(n...
Van Cyr, Bryna Kra
EJC
2016
10 years 1 months ago
First-fit coloring on interval graphs has performance ratio at least 5
First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neigh...
Hal A. Kierstead, David A. Smith, William T. Trott...
EJC
2016
10 years 1 months ago
Constructions of transitive latin hypercubes
A function
Denis S. Krotov, Vladimir N. Potapov
EDBT
2016
ACM
33views Database» more  EDBT 2016»
10 years 1 months ago
Double Chain-Star: an RDF indexing scheme for fast processing of SPARQL joins
State of the art RDF stores often rely on exhaustive indexing and sequential (self-)joins for SPARQL query processing. However, query execution is dependent on, and often limited ...
EDBT
2016
ACM
41views Database» more  EDBT 2016»
10 years 1 months ago
Providing Serializability for Pregel-like Graph Processing Systems
There is considerable interest in the design and development of distributed systems that can execute algorithms to process large graphs. Serializability guarantees that parallel e...