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=123
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Note on the cyclic towers of Hanoi
Jean-Paul Allouche
Theoretical Computer Science
123
(1), 1994, pp. 3-7
Finite labelling problem in event structures
Marc Roland Assous
,
Vincent Bouchitté
,
Christine Charretton
,
Brigitte Rozoy
Theoretical Computer Science
123
(1), 1994, pp. 9-19
Sur une conjecture d'Yves Métivier
A. Bertrand
Theoretical Computer Science
123
(1), 1994, pp. 21-30
A natural semantics of first-order type dependency
Claude Bertrand
Theoretical Computer Science
123
(1), 1994, pp. 31-53
Quelques procédés engendrant des suites infinies
F. Blanchard
,
S. Fabre
Theoretical Computer Science
123
(1), 1994, pp. 55-60
Symbolic representation of piecewise linear functions on the unit interval and application to discrepancy
Jean-Pierre Borel
Theoretical Computer Science
123
(1), 1994, pp. 61-87
Le nombre de posets à isomorphie près ayant 12 éléments
Claude Chaunier
,
Nik Lygerōs
Theoretical Computer Science
123
(1), 1994, pp. 89-94
An upper bound on the average number of iterations of the LLL algorithm
Hervé Daudé
,
Brigitte Vallée
Theoretical Computer Science
123
(1), 1994, pp. 95-115
Sketches and parametrization
Dominique Duval
,
Pascale Sénéchaud
Theoretical Computer Science
123
(1), 1994, pp. 117-130
Méthodes quasi-Monte-Carlo multidimensionnelles
Henri Faure
Theoretical Computer Science
123
(1), 1994, pp. 131-137
Multliple returns under a bounded number of iterations
Zbigniew S. Kowalski
Theoretical Computer Science
123
(1), 1994, pp. 139-144
Sur l'équation de Catalan, II
M. Mignotte
Theoretical Computer Science
123
(1), 1994, pp. 145-149
A linear algorithm to tile the trapezes with
h_m
and
v_n
Eric Rémila
Theoretical Computer Science
123
(1), 1994, pp. 151-165
Coexistence of uniquely ergodic subsystems of interval mappings
Xiangdong Ye
Theoretical Computer Science
123
(1), 1994, pp. 167-181
Deciding bisimilarity of normed context-free processes is in
\Sigma^p_2
Dung T. Huynh
,
Lu Tian
Theoretical Computer Science
123
(2), 1994, pp. 183-197
A universal cellular automaton in quasi-linear time and its S-m-n form
Bruno Martin
Theoretical Computer Science
123
(2), 1994, pp. 199-237
Equations and monoid varieties of dot-depth one and two
F. Blanchet-Sadri
Theoretical Computer Science
123
(2), 1994, pp. 239-258
Atomic semicommutations
M. Clerbout
,
D. Gonzalez
Theoretical Computer Science
123
(2), 1994, pp. 259-272
The word problem for inverse monoids presented by one idempotent relator
Jean-Camille Birget
,
Stuart W. Margolis
,
John C. Meakin
Theoretical Computer Science
123
(2), 1994, pp. 273-289
Mellin transforms and asymptotics: Digital sums
Philippe Flajolet
,
Peter Grabner
,
Peter Kirschenhofer
,
Helmut Prodinger
,
Robert F. Tichy
Theoretical Computer Science
123
(2), 1994, pp. 291-314
On
\Pi_2
theories of hp-T degrees of low sets
Kunimasa Aoki
,
Juichi Shinoda
,
Teruko Tsuda
Theoretical Computer Science
123
(2), 1994, pp. 315-327
The Othello game on an
n \times n
board is PSPACE-complete
Shigeki Iwata
,
Takumi Kasai
Theoretical Computer Science
123
(2), 1994, pp. 329-340
Finite games for a predicate logic without contractions
Daniel Mey
Theoretical Computer Science
123
(2), 1994, pp. 341-349
Double dipping: The case of the missing binomial coefficient identities
Grahame Bennett
Theoretical Computer Science
123
(2), 1994, pp. 351-375
Optimal bounds for the change-making problem
Dexter Kozen
,
Shmuel Zaks
Theoretical Computer Science
123
(2), 1994, pp. 377-388
Seiten 1
2
>