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