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