|
|
Journals in DBLP
- Angelo Monti, Adriano Peron
Systolic tree omega-Languages: the operational and the logical view. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:1-18 [Journal]
- Kosaburo Hashiguchi
New upper bounds to the limitedness of distance automata. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:19-32 [Journal]
- Tatsuya Akutsu, Magnús M. Halldórsson
On the approximation of largest common subtrees and largest common point sets. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:33-50 [Journal]
- Denis Robilliard, David Simplot
Undecidability of existential properties in picture languages. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:51-74 [Journal]
- Pascal Caron, Djelloul Ziadi
Characterization of Glushkov automata. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:75-90 [Journal]
- R. J. Gardner, Peter Gritzmann, D. Prangenberg
On the computational complexity of determining polyatomic structures by X-rays. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:91-106 [Journal]
- Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
On computing graph minor obstruction sets. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:107-127 [Journal]
- Yasuo Kawahara, Masao Mori
A small final coalgebra theorem. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:129-145 [Journal]
- Gianpiero Cattaneo, Enrico Formenti, Giovanni Manzini, Luciano Margara
Ergodicity, transitivity, and regularity for linear cellular automata over Zm. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:147-164 [Journal]
- Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
Efficient collective communication in optical networks. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:165-189 [Journal]
- Alexandre V. Evfimievski
A probabilistic algorithm for updating files over a communication link. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:191-199 [Journal]
- Alberto Del Lungo, Francesco Del Ristoro, Jean-Guy Penaud
Left ternary trees and non-separable rooted planar maps. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:201-215 [Journal]
- Christian Germain, Jean Marcel Pallo
Langages rationnels définis avec une concaténation non-associative. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:217-231 [Journal]
- Alexander Moshe Rabinovich
Star free expressions over the reals. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:233-245 [Journal]
- Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
On the cost of recomputing: Tight bounds on pebbling with faults. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:247-261 [Journal]
- James Gary Propp
Three-player impartial games. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:263-278 [Journal]
- Taishin Y. Nishida, Arto Salomaa
On slender 0L languages. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:279-286 [Journal]
- Eric Goles Ch., Erich Prisner
Source reversal and chip firing on graphs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:287-295 [Journal]
- Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
A sublinear parallel algorithm for stable matching. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:297-308 [Journal]
- Marek Karpinski, Alfred J. van der Poorten, Igor Shparlinski
Zero testing of p-adic and modular polynomials. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:309-317 [Journal]
- Bala Kalyanasundaram, Kirk Pruhs
An optimal deterministic algorithm for online b-matching. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:319-325 [Journal]
|
