Journals in DBLP
François Nicolas , Eric Rivals Longest common subsequence problem for unoriented and cyclic strings. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:1-18 [Journal ] Jin Wook Kim , Kunsoo Park An efficient alignment algorithm for masked sequences. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:19-33 [Journal ] Anahí Gajardo , Jacques Mazoyer One Head Machines from a symbolic approach. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:34-47 [Journal ] Jeremy Avigad , Yimu Yin Quantifier elimination for the reals with a predicate for the powers of two. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:48-59 [Journal ] Christian Glaßer , Alan L. Selman , Liyu Zhang Canonical disjoint NP-pairs of propositional proof systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:60-73 [Journal ] Vassilis Giakoumakis , Stephan Olariu All minimal prime extensions of hereditary classes of graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:74-93 [Journal ] Shane Saunders , Tadao Takaoka Solving shortest paths efficiently on nearly acyclic directed graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:94-109 [Journal ] Yo-Sub Han , Derick Wood Obtaining shorter regular expressions from finite-state automata. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:110-120 [Journal ] Jun-Jie Pan , Gerard J. Chang Induced-path partition on graphs with special blocks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:121-130 [Journal ] Jorge Almeida , Marc Zeitoun An automata-theoretic approach to the word problem for omega -terms over R. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:131-169 [Journal ] Peter Leupold Languages generated by iterated idempotency. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:170-185 [Journal ] Dario Catalano , Rosario Gennaro Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:186-200 [Journal ] Andrea Frosini , Maurice Nivat Binary matrices under the microscope: A tomographical problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:201-217 [Journal ] L. Sunil Chandran , L. Shankar Ram On the relationship between ATSP and the cycle cover problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:218-228 [Journal ] Andreas Brandstädt , Van Bang Le , Suhail Mahfud New applications of clique separator decomposition for the Maximum Weight Stable Set problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:229-239 [Journal ] Yongxi Cheng , Xi Chen , Yiqun Lisa Yin On searching a table consistent with division poset. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:240-253 [Journal ] Boaz Patt-Shamir A note on efficient aggregate queries in sensor networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:254-264 [Journal ] Markus Kuba , Alois Panholzer The left-right-imbalance of binary search trees. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:265-278 [Journal ] Andrzej Pelc , David Peleg Feasibility and complexity of broadcasting with random transmission failures. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:279-292 [Journal ] Chi-Jen Lu , Shi-Chun Tsai , Hsin-Lung Wu Improved hardness amplification in NP. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:293-298 [Journal ] Sun-Yuan Hsieh Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:370, n:1-3, pp:299-308 [Journal ]