default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 233
Volume 233, Numbers 1-2, 28 February 2000
- Angelo Monti, Adriano Peron:
Systolic tree omega-Languages: the operational and the logical view. 1-18 - Kosaburo Hashiguchi:
New upper bounds to the limitedness of distance automata. 19-32 - Tatsuya Akutsu
, Magnús M. Halldórsson:
On the approximation of largest common subtrees and largest common point sets. 33-50 - Denis Robilliard, David Simplot:
Undecidability of existential properties in picture languages. 51-74 - Pascal Caron, Djelloul Ziadi:
Characterization of Glushkov automata. 75-90 - R. J. Gardner, Peter Gritzmann, Dieter Prangenberg:
On the computational complexity of determining polyatomic structures by X-rays. 91-106 - Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston:
On computing graph minor obstruction sets. 107-127 - Yasuo Kawahara, Masao Mori:
A small final coalgebra theorem. 129-145 - Gianpiero Cattaneo, Enrico Formenti, Giovanni Manzini, Luciano Margara:
Ergodicity, transitivity, and regularity for linear cellular automata over Zm. 147-164 - Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro:
Efficient collective communication in optical networks. 165-189 - Alexandre V. Evfimievski:
A probabilistic algorithm for updating files over a communication link. 191-199 - Alberto Del Lungo, Francesco Del Ristoro, Jean-Guy Penaud:
Left ternary trees and non-separable rooted planar maps. 201-215 - Christian Germain, Jean Marcel Pallo:
Langages rationnels définis avec une concaténation non-associative. 217-231 - Alexander Moshe Rabinovich:
Star free expressions over the reals. 233-245 - Yonatan Aumann, Judit Bar-Ilan, Uriel Feige:
On the cost of recomputing: Tight bounds on pebbling with faults. 247-261 - James Gary Propp:
Three-player impartial games. 263-278 - Taishin Y. Nishida, Arto Salomaa:
On slender 0L languages. 279-286 - Eric Goles Ch., Erich Prisner:
Source reversal and chip firing on graphs. 287-295 - Tomás Feder, Nimrod Megiddo, Serge A. Plotkin:
A sublinear parallel algorithm for stable matching. 297-308 - Marek Karpinski, Alfred J. van der Poorten, Igor E. Shparlinski:
Zero testing of p-adic and modular polynomials. 309-317 - Bala Kalyanasundaram, Kirk Pruhs:
An optimal deterministic algorithm for online b-matching. 319-325
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-02 21:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
