We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
This paper documents an experiment designed to show the value of simulation in understanding the relationship between production run lengths and overall supply chain performance. ...
David J. Parsons, Robin J. Clark, Kevin L. Payette
This paper introduces an extension of recurrence analysis to symbolic sequences. Heuristic arguments based on Shannon-McMillan-Breiman theorem suggest several relations between th...
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Background: The advent of pyrophosphate sequencing makes large volumes of sequencing data available at a lower cost than previously possible. However, the short read lengths are d...