Titlebook: LATIN 2010: Theoretical Informatics; 9th Latin American S Alejandro López-Ortiz Conference proceedings 2010 Springer-Verlag Berlin Heidelbe

Modify

Optimal Succinctness for Range Minimum Queries,cess . into a scheme of size 2.?+?.(.) bits that allows to answer range minimum queries on . in constant time. This space is asymptotically optimal in the important setting where access to . is not permitted after the preprocessing step. Our scheme can be computed in linear time, using only .?+?.(.)

Scintigraphy

confederacy

Radix Cross-Sections for Length Morphisms,s rational. This property no longer holds if the image of the function is a subset of a free monoid with two or more generators..The proof is based on several results on finite automata, such as the lexicographic selection of synchronous relations and the iterative decomposition of unary rational se