We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the g...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boons...
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on mobile computing devices or by disabled users), by ta...