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=215
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Length of prime implicants and number of solutions of random CNF formulae
Y. Boufkhad
,
O. Dubois
Theoretical Computer Science
215
(1-2), 1999, pp. 1-30
Caractérisation des
N
-écritures et application à l'étude des suites de complexité ultimement
n+c^{ste}
Gilles Didier
Theoretical Computer Science
215
(1-2), 1999, pp. 31-49
Exploration of
NP
-hard enumeration problems by simulated annealing - The spectrum values of permanents
Yaghout Nourani
,
Bjarne Andresen
Theoretical Computer Science
215
(1-2), 1999, pp. 51-68
An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
Djelloul Ziadi
,
Jean-Marc Champarnaud
Theoretical Computer Science
215
(1-2), 1999, pp. 69-87
Fast
RNC
and
NC
algorithms for maximal path sets
Ryuhei Uehara
,
Zhi-Zhong Chen
,
Xin He
Theoretical Computer Science
215
(1-2), 1999, pp. 89-98
Synchronization languages
Mireille Clerbout
,
Yves Roos
,
Isabelle Ryl
Theoretical Computer Science
215
(1-2), 1999, pp. 99-121
Recognizing median graphs in subquadratic time
Johann Hagauer
,
Wilfried Imrich
,
Sandi Klavz̑ar
Theoretical Computer Science
215
(1-2), 1999, pp. 123-136
Scheduling inverse trees under the communication model of the LogP-machine
Martin Middendorf
,
Wolf Löwe
,
Wolf Zimmermann
Theoretical Computer Science
215
(1-2), 1999, pp. 137-168
Decidability problems in grammar systems
Valeria Mihalache
Theoretical Computer Science
215
(1-2), 1999, pp. 169-189
Deterministic generalized automata
Dora Giammarresi
,
Rosa Montalbano
Theoretical Computer Science
215
(1-2), 1999, pp. 191-208
Scheduling parallel tasks with individual deadlines
Oh-Heum Kwon
,
Kyung-Yong Chwa
Theoretical Computer Science
215
(1-2), 1999, pp. 209-223
On the complexity of deadlock detection in families of planar nets
Bruno Durand
,
Anne-Cécile Fabret
Theoretical Computer Science
215
(1-2), 1999, pp. 225-237
Pushdown cellular automata
Martin Kutrib
Theoretical Computer Science
215
(1-2), 1999, pp. 239-261
Exact performance equivalence: An equivalence relation for stochastic automata
Peter Buchholz
Theoretical Computer Science
215
(1-2), 1999, pp. 263-287
Elimination of parameters in the polynomial hierarchy
Pascal Koiran
Theoretical Computer Science
215
(1-2), 1999, pp. 289-304
A two-person game on graphs where each player tries to encircle his opponent's men
Thomas Andreae
,
Felix Hartenstein
,
Andrea Wolter
Theoretical Computer Science
215
(1-2), 1999, pp. 305-323
An example of an indexed language of intermediate growth
R.I. Grigorchuk
,
A. Machì
Theoretical Computer Science
215
(1-2), 1999, pp. 325-327
A proof of Choffrut's theorem on subsequential functions
Véronique Bruyère
,
Christoph Reutenauer
Theoretical Computer Science
215
(1-2), 1999, pp. 329-335
Fusion trees can be implemented with
AC_0
instructions only
Arne Andersson
,
Peter Bro Miltersen
,
Mikkel Thorup
Theoretical Computer Science
215
(1-2), 1999, pp. 337-344
A minimal code list
Herbert Fischer
,
Harley Flanders
Theoretical Computer Science
215
(1-2), 1999, pp. 345-348
On the computational completeness of context-free parallel communicating grammar systems
Erzsébet Csuhaj-Varjú
,
György Vaszil
Theoretical Computer Science
215
(1-2), 1999, pp. 349-358
Fixed topology Steiner trees and spanning forests
Lusheng Wang
,
Xiaohua Jia
Theoretical Computer Science
215
(1-2), 1999, pp. 359-370
Singularity analysis and asymptotics of Bernoulli sums
Philippe Flajolet
Theoretical Computer Science
215
(1-2), 1999, pp. 371-381
Some results about centralized PC grammar systems
Jean-Michel Autebert
Theoretical Computer Science
215
(1-2), 1999, pp. 383-398