- Franziska Biegler, Kai Salomaa:
On the synchronized derivation depth of context-free grammars. Theor. Comput. Sci. 410(35): 3198-3208 (2009) - Davide Bilò
, Luciano Gualà
, Guido Proietti
:
Dynamic mechanism design. Theor. Comput. Sci. 410(17): 1564-1572 (2009) - Marek Tomasz Biskup, Wojciech Plandowski:
Shortest synchronizing strings for Huffman codes. Theor. Comput. Sci. 410(38-40): 3925-3941 (2009) - Francine Blanchet-Sadri, Raphaël M. Jungers, Justin Palumbo:
Testing avoidability on sets of partial words is hard. Theor. Comput. Sci. 410(8-10): 968-972 (2009) - Francine Blanchet-Sadri, Robert Mercas
, Geoffrey Scott:
A generalization of Thue freeness for partial words. Theor. Comput. Sci. 410(8-10): 793-800 (2009) - Markus Bläser, Andreas Meyer de Voltaire:
Semisimple algebras of almost minimal rank over the reals. Theor. Comput. Sci. 410(50): 5202-5214 (2009) - Johannes Blömer, Stefanie Naewe:
Sampling methods for shortest vectors, closest vectors and successive minima. Theor. Comput. Sci. 410(18): 1648-1665 (2009) - Vincent D. Blondel, Julien Cassaigne, Raphaël M. Jungers:
On the number of alpha-power-free binary words for 2alpha<=7/3. Theor. Comput. Sci. 410(30-32): 2823-2833 (2009) - Hans-Joachim Böckenhauer
, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith:
Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. 410(36): 3428-3435 (2009) - Hans-Joachim Böckenhauer
, Joachim Kneis, Joachim Kupke:
Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410(21-23): 2241-2249 (2009) - Sebastian Böcker
, Sebastian Briesemeister, Quang Bao Anh Bui, Anke Truß:
Going weighted: Parameterized algorithms for cluster editing. Theor. Comput. Sci. 410(52): 5467-5480 (2009) - Chiara Bodei
:
A Control Flow Analysis for Beta-binders with and without static compartments. Theor. Comput. Sci. 410(33-34): 3110-3127 (2009) - Manuel Bodirsky
, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal infinite-valued constraint languages. Theor. Comput. Sci. 410(18): 1684-1693 (2009) - Frank S. de Boer:
A shared-variable concurrency analysis of multi-threaded object-oriented programs. Theor. Comput. Sci. 410(2-3): 128-141 (2009) - Bernard Boigelot, Julien Brusten:
A generalization of Cobham's theorem to automata over real numbers. Theor. Comput. Sci. 410(18): 1694-1703 (2009) - Filippo Bonchi
, Ugo Montanari:
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves. Theor. Comput. Sci. 410(41): 4044-4066 (2009) - Paola Bonizzoni
, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Foreword. Theor. Comput. Sci. 410(4-5): 283-284 (2009) - Marcello M. Bonsangue
, Einar Broch Johnsen
, Amy L. Murphy, Jan Vitek:
Preface. Theor. Comput. Sci. 410(2-3): 113 (2009) - Paul S. Bonsma, Luis Cereceda:
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor. Comput. Sci. 410(50): 5215-5226 (2009) - Henning Bordihn, Markus Holzer
, Martin Kutrib
:
Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009) - Annalisa Bossi:
S-semantics for logic programming: A retrospective look. Theor. Comput. Sci. 410(46): 4692-4703 (2009) - Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci. 410(21-23): 2184-2195 (2009) - Mathilde Bouvel, Dominique Rossin:
A variant of the tandem duplication - random loss model of genome rearrangement. Theor. Comput. Sci. 410(8-10): 847-858 (2009) - Simone Bova, Franco Montagna:
The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete. Theor. Comput. Sci. 410(12-13): 1143-1158 (2009) - Andreas Brandstädt, Van Bang Le:
Simplicial powers of graphs. Theor. Comput. Sci. 410(52): 5443-5454 (2009) - Robert Brijder
, Hendrik Jan Hoogeboom
:
Perfectly quilted rectangular snake tilings. Theor. Comput. Sci. 410(16): 1486-1494 (2009) - Anne Broadbent, Elham Kashefi:
Parallelizing quantum circuits. Theor. Comput. Sci. 410(26): 2489-2510 (2009) - Hajo Broersma
, Matthew Johnson
, Daniël Paulusma
:
Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009) - Yuriy Brun
, Dustin Reishus:
Path finding in the tile assembly model. Theor. Comput. Sci. 410(15): 1461-1472 (2009) - Janusz A. Brzozowski, Stavros Konstantinidis
:
State-complexity hierarchies of uniform languages of alphabet-size length. Theor. Comput. Sci. 410(35): 3223-3235 (2009)