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=174
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finite acceptance of infinite words
Igor Litovsky
,
Ludwig Steiger
Theoretical Computer Science
174
(1-2), 1997, pp. 1-21
Hierarchically specified unit disk graphs
Madhav V. Marathe
,
Venkatesh Radhakrishnan
,
Harry B. Hunt III
,
S.S. Ravi
Theoretical Computer Science
174
(1-2), 1997, pp. 23-65
Representation of computations in concurrent automata by dependence orders
Felipe Bracho
,
Manfred Droste
,
Dietrich Kuske
Theoretical Computer Science
174
(1-2), 1997, pp. 67-96
On winning strategies in Ehrenfeucht-Fraïssé games
Sanjeev Arora
,
Ronald Fagin
Theoretical Computer Science
174
(1-2), 1997, pp. 97-121
Computing with truly asynchronous threshold logic networks
Pekka Orponen
Theoretical Computer Science
174
(1-2), 1997, pp. 123-136
On the computational power of depth-2 circuits with threshold and modulo gates
Matthias Krause
,
Pavel Pudlák
Theoretical Computer Science
174
(1-2), 1997, pp. 137-156
Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
Paola Favati
,
Grazia Lotti
,
Luciano Margara
Theoretical Computer Science
174
(1-2), 1997, pp. 157-170
Echanges de trois intervalles et suites minimales
Marie-Line Santini-Bouchard
Theoretical Computer Science
174
(1-2), 1997, pp. 171-191
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
Piotr Berman
,
Andrzej Lingas
Theoretical Computer Science
174
(1-2), 1997, pp. 193-202
On topological dynamics of Turing machines
Petr Kůrka
Theoretical Computer Science
174
(1-2), 1997, pp. 203-216
Verifying identical communicating processes is undecidable
Alain Finkel
,
Pierre McKenzie
Theoretical Computer Science
174
(1-2), 1997, pp. 217-230
On an effective hierarchy of communicating processes: Separation principle and testing
John Mullins
Theoretical Computer Science
174
(1-2), 1997, pp. 231-246
The arithmetic of reversed positional games
Yõhei Yamasaki
Theoretical Computer Science
174
(1-2), 1997, pp. 247-249
Learning approximately regular languages with reversible languages
Satoshi Kobayashi
,
Takashi Yokomori
Theoretical Computer Science
174
(1-2), 1997, pp. 251-257
Various hierarchies of
\omega
-regular sets
Nobuyuki Takahashi
Theoretical Computer Science
174
(1-2), 1997, pp. 259-268
The undecidability of some equivalence problems concerning ngsm's and finite substitutions
P. Turakainen
Theoretical Computer Science
174
(1-2), 1997, pp. 269-274
The end of pumping?
Guo-Qiang Zhang
,
E. Rodney Canfield
Theoretical Computer Science
174
(1-2), 1997, pp. 275-279