Finding shuffle words that represent optimal scheduling of shared memory access

In the present paper, we introduce and study the problem of computing, for any given nite set of words, a shu e word with a minimum so-called scope coincidence degree. The scope coincidence degree is the maximum number of di erent symbols that parenthesise any position in the shu e word. This proble...

Full description

Bibliographic Details

Main Authors:	Daniel Reidenbach, Markus L. Schmid
Format:	Default Article
Published:	2013
Subjects:	Theory of computation not elsewhere classified Other information and computing sciences not elsewhere classified untagged Computation Theory and Mathematics Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/12757
Tags:	Add Tag No Tags, Be the first to tag this record!