Volume 240; Issue 2

Theoretical Computer Science

Volume 240; Issue 2
1

Index

Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 45 KB
english, 2000
2

Index

Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 95 KB
english, 2000
3

Editorial

Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 30 KB
english, 2000
4

Resolution of Hartmanis’ conjecture for NL-hard sparse sets

Jin-Yi Cai, D. Sivakumar
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 121 KB
english, 2000
5

Inferring evolutionary trees with strong combinatorial evidence

Vincent Berry, Olivier Gascuel
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 225 KB
english, 2000
6

A selected tour of the theory of identification matrices

Lin Chen
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 141 KB
english, 2000
7

Can large fanin circuits perform reliable computations in the presence of faults?

Rüdiger Reischuk
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 140 KB
english, 2000
8

Repetitiveness of languages generated by morphisms

Yuji Kobayashi, Friedrich Otto
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 312 KB
english, 2000
9

Spring algorithms and symmetry

Peter Eades, Xuemin Lin
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 243 KB
english, 2000
10

Algorithms for generalized vertex-rankings of partial k-trees

Md.Abul Kashem, Xiao Zhou, Takao Nishizeki
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 314 KB
english, 2000
11

Edge and node searching problems on trees

Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 142 KB
english, 2000