Volume 237; Issue 1-2

Theoretical Computer Science

Volume 237; Issue 1-2
1

On the rigidity of Vandermonde matrices

Satyanarayana V. Lokam
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 86 KB
english, 2000
2

A space lower bound for st-connectivity on node-named JAGs

Chung Keung Poon
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 166 KB
english, 2000
3

On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem

U.K. Sarkar
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 108 KB
english, 2000
5

Series–parallel languages and the bounded-width property

K Lodaya, P Weil
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 278 KB
english, 2000
6

Index

Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 48 KB
english, 2000
7

Resource bounded randomness and computational complexity

Yongge Wang
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 165 KB
english, 2000
8

Decomposition of a hypergraph by partial-edge separators

Francesco Mario Malvestuto, Marina Moscarini
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 223 KB
english, 2000
9

Reductions and functors from problems to word problems

Jean-Camille Birget
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 193 KB
english, 2000
11

Some APX-completeness results for cubic graphs

Paola Alimonti, Viggo Kann
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 122 KB
english, 2000
12

On the computational power of context-free PC grammar systems

Niculae Mandache
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 132 KB
english, 2000
13

A shrinking lemma for random forbidding context languages

Andries van der Walt, Sigrid Ewert
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 107 KB
english, 2000
14

Asymptotically efficient in-place merging

Viliam Geffert, Jyrki Katajainen, Tomi Pasanen
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 184 KB
english, 2000
15

Leftmove-bounded picture languages

Changwook Kim, Ivan Hal Sudborough
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 134 KB
english, 2000
17

The Steiner tree problem for terminals on the boundary of a rectilinear polygon

Siu-Wing Cheng
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 233 KB
english, 2000
18

Fast pattern matching in indexed texts

Jean Senellart
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 309 KB
english, 2000
19

Fibonacci arrays and their two-dimensional repetitions

Alberto Apostolico, Valentin E. Brimkov
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 111 KB
english, 2000
20

Quantum automata and quantum grammars

Cristopher Moore, James P. Crutchfield
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 213 KB
english, 2000
21

Realtime subshifts

Petr Kůrka, Alejandro Maass
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 177 KB
english, 2000
22

Terminating left-hand sides of scattered context productions M. Nivat

Alexander Meduna
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 72 KB
english, 2000
23

The monadic second-order logic of graphs XII: planar graphs and planar maps

Bruno Courcelle
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 289 KB
english, 2000
24

On the bottleneck counting argument

Janos Simon, Shi-Chun Tsai
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 98 KB
english, 2000
25

The intersection of retracts of A∗

James A. Anderson
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 89 KB
english, 2000
26

On Hadamard square roots of unity

B. Litow
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 93 KB
english, 2000
27

Complexity of path discovery game problems

Hiroaki Tohyama, Akeo Adachi
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 551 KB
english, 2000
28

Improved approximate pattern matching on hypertext

Gonzalo Navarro
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 102 KB
english, 2000
29

A variant of inductive counting

Viliam Geffert
Journal:
Theoretical Computer Science
Year:
2000
Language:
english
File:
PDF, 100 KB
english, 2000