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=322
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Well-behaved principles alternative to bounded induction
Zofia Adamowicz
,
Leszek Aleksander Koƚodziejczyk
Theoretical Computer Science
322
(1), 2004, pp. 5-16
A strong induction scheme that leads to polynomially computable realizations
Anatoly Petrivich Beltiukov
Theoretical Computer Science
322
(1), 2004, pp. 17-39
On the complexity of decision using destinies in
H
-bounded structures
A. Chateau
Theoretical Computer Science
322
(1), 2004, pp. 41-67
Closure properties of locally finite
\omega
-languages
Olivier Finkel
Theoretical Computer Science
322
(1), 2004, pp. 69-84
Recursion and topology on
2^{\le \omega}
for possibly infinite computations
Verónica Becher
,
Serge Grigorieff
Theoretical Computer Science
322
(1), 2004, pp. 85-136
Arithmetical definability and computational complexity
Yassine Hachaïchi
Theoretical Computer Science
322
(1), 2004, pp. 137-146
Three-variable statements of set-pairing
Andrea Formisano
,
Eugenio G. Omodeo
,
Alberto Policriti
Theoretical Computer Science
322
(1), 2004, pp. 147-173
Winning strategies for infinite games: From large cardinals to computer science extended abstract
Jean-Pierre Ressayre
Theoretical Computer Science
322
(1), 2004, pp. 175-179
EMSO-logic and automata related to homogeneous flow event structures
K. Shahbazyan
,
Yu. Shoukourian
Theoretical Computer Science
322
(1), 2004, pp. 181-201
Subset sum ''cubes'' and the complexity of primality testing
Alan R. Woods
Theoretical Computer Science
322
(1), 2004, pp. 203-219
On some generalizations of the primitive recursive arithmetic
I.D. Zaslavsky
Theoretical Computer Science
322
(1), 2004, pp. 221-230
On limit cycles of monotone functions with symmetric connection graph
Julio Aracena
,
Jacques Demongeot
,
Eric Goles
Theoretical Computer Science
322
(2), 2004, pp. 237-244
Student admissions and faculty recruitment
Mourad Baïou
,
Michel Balinski
Theoretical Computer Science
322
(2), 2004, pp. 245-265
Dynamics of a class of ants on a one-dimensional lattice
A. Gajardo
,
E. Goles
Theoretical Computer Science
322
(2), 2004, pp. 267-283
Folding and tiling
Eric Goles
Theoretical Computer Science
322
(2), 2004, pp. 285-296
Genetic algorithms for the imitation of genomic styles in protein backtranslation
Andrés Moreira
Theoretical Computer Science
322
(2), 2004, pp. 297-312
The cyclic genetic code as a constraint satisfaction problem
Georges Weil
,
Kamel Heus
,
Thomas Faraut
,
Jacques Demongeot
Theoretical Computer Science
322
(2), 2004, pp. 313-334
Real-time recognition of languages on an two-dimensional Archimedean thread
M. Delorme
,
J. Mazoyer
Theoretical Computer Science
322
(2), 2004, pp. 335-354
Cellular automata and communication complexity
Christoph Dürr
,
Ivan Rapaport
,
Guillaume Theyssier
Theoretical Computer Science
322
(2), 2004, pp. 355-368
Dynamic of cyclic automata over
Z^2
Martín Matamala
,
Eduardo Moreno
Theoretical Computer Science
322
(2), 2004, pp. 369-381
Sandpile models and lattices: A comprehensive survey
Éric Goles
,
Matthieu Latapy
,
Clémence Magnien
,
Michel Morvan
,
Ha Duong Phan
Theoretical Computer Science
322
(2), 2004, pp. 383-407
The lattice structure of the set of domino tilings of a polygon
Eric Rémila
Theoretical Computer Science
322
(2), 2004, pp. 409-422
Private authentication
Martín Abadi
,
Cédric Fournet
Theoretical Computer Science
322
(3), 2004, pp. 427-476
On the expressive power of movement and restriction in pure mobile ambients
Nadia Busi
,
Gianluigi Zavattaro
Theoretical Computer Science
322
(3), 2004, pp. 477-515
A spatial logic for concurrency - II
Luís Caires
,
Luca Cardelli
Theoretical Computer Science
322
(3), 2004, pp. 517-565
Seiten 1
2
>