Theoretical Computer Science, Volume 370

Volume 370, Numbers 1-3, February 2007

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

• Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
  Improved hardness amplification in NP. 293-298
  Electronic Edition (link) BibTeX
• Sun-Yuan Hsieh:
  Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species. 299-308
  Electronic Edition (link) BibTeX