- L'ubomíra Balková, Edita Pelantová:
A note on symmetries in the Rauzy graph and factor frequencies. Theor. Comput. Sci. 410(27-29): 2779-2783 (2009) - Jørgen Bang-Jensen, Matthias Kriesell:
Disjoint directed and undirected paths and cycles in digraphs. Theor. Comput. Sci. 410(47-49): 5138-5144 (2009) - Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed scaling with a solar cell. Theor. Comput. Sci. 410(45): 4580-4587 (2009) - Roberto Barbuti:
Giorgio Levi in Pisa. Theor. Comput. Sci. 410(46): 4603-4604 (2009) - Roberto Barbuti, Giulio Caravagna, Andrea Maggiolo-Schettini, Paolo Milazzo:
An intermediate language for the stochastic simulation of biological systems. Theor. Comput. Sci. 410(33-34): 3085-3109 (2009) - Jiri Barnat, Lubos Brim, Ivana Cerná, Sven Drazan, Jana Fabriková, David Safránek:
On algorithmic analysis of transcriptional regulation by LTL model checking. Theor. Comput. Sci. 410(33-34): 3128-3148 (2009) - Ezio Bartocci, Flavio Corradini, Maria Rita Di Berardini, Emilia Entcheva, Scott A. Smolka, Radu Grosu:
Modeling and simulation of cardiac tissue using hybrid I/O automata. Theor. Comput. Sci. 410(33-34): 3149-3165 (2009) - Surender Baswana, Vishrut Goyal, Sandeep Sen:
All-pairs nearly 2-approximate shortest paths in I time. Theor. Comput. Sci. 410(1): 84-93 (2009) - Giovanni Battaglia, Davide Cangelosi, Roberto Grossi, Nadia Pisanti:
Masking patterns in sequences: A new class of motif discovery with don't cares. Theor. Comput. Sci. 410(43): 4327-4340 (2009) - Tugkan Batu, Petra Berenbrink, Christian Sohler:
A sublinear-time approximation scheme for bin packing. Theor. Comput. Sci. 410(47-49): 5082-5092 (2009) - Pawel Baturo, Wojciech Rytter:
Compressed string-matching in standard Sturmian words. Theor. Comput. Sci. 410(30-32): 2804-2810 (2009) - Daniel Bayer, Van Bang Le, H. N. de Ridder:
Probe threshold and probe trivially perfect graphs. Theor. Comput. Sci. 410(47-49): 4812-4822 (2009) - Rida A. Bazzi, Young-ri Choi, Mohamed G. Gouda:
Hop chains: Secure routing and the establishment of distinct identities. Theor. Comput. Sci. 410(6-7): 467-480 (2009) - Marie-Pierre Béal, Dominique Perrin:
Completing codes in a sofic shift. Theor. Comput. Sci. 410(43): 4423-4431 (2009) - Romain Beauxis, Catuscia Palamidessi:
Probabilistic and nondeterministic aspects of anonymity. Theor. Comput. Sci. 410(41): 4006-4025 (2009) - Florent Becker:
Pictures worth a thousand tiles, a geometrical programming language for self-assembly. Theor. Comput. Sci. 410(16): 1495-1515 (2009) - Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri:
Matrix columns allocation problems. Theor. Comput. Sci. 410(21-23): 2174-2183 (2009) - Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
Optimally competitive list batching. Theor. Comput. Sci. 410(38-40): 3631-3639 (2009) - Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough:
A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. 410(8-10): 711-717 (2009) - Nikola Benes, Jan Kretínský, Kim Guldstrand Larsen, Jirí Srba:
On determinism in modal transition systems. Theor. Comput. Sci. 410(41): 4026-4043 (2009) - Petra Berenbrink, Colin Cooper, Zengjian Hu:
Energy efficient randomised communication in unknown AdHoc networks. Theor. Comput. Sci. 410(27-29): 2549-2561 (2009) - Anne Bergeron, Julia Mixtacki, Jens Stoye:
A new linear time algorithm to compute the genomic distance via the double cut and join distance. Theor. Comput. Sci. 410(51): 5300-5316 (2009) - Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker:
Meadows and the equational specification of division. Theor. Comput. Sci. 410(12-13): 1261-1271 (2009) - Jean Berstel, Luc Boasson, Olivier Carton:
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410(30-32): 2811-2822 (2009) - Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410(45): 4554-4570 (2009) - Nadja Betzler, Johannes Uhlmann:
Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52): 5425-5442 (2009) - Olaf Beyersdorff, Johannes Köbler, Jochen Messner:
Nondeterministic functions and the existence of optimal proof systems. Theor. Comput. Sci. 410(38-40): 3839-3855 (2009) - Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese:
Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci. 410(52): 5515-5528 (2009) - Philippe Bidinger, Adriana B. Compagnoni:
Pict correctness revisited. Theor. Comput. Sci. 410(2-3): 114-127 (2009) - Franziska Biegler, Mark Daley, Markus Holzer, Ian McQuillan:
On the uniqueness of shuffle on words and finite languages. Theor. Comput. Sci. 410(38-40): 3711-3724 (2009)