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=306
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Go polynomials of a graph
G.E. Farr
Theoretical Computer Science
306
(1-3), 2003, pp. 1-18
Closure and decidability properties of some language classes with respect to ciliate bio-operations
Mark Daley
,
Oscar H. Ibarra
,
Lila Kari
Theoretical Computer Science
306
(1-3), 2003, pp. 19-38
Function-dependent teams in eco-grammar systems
Dietmar Wätjen
Theoretical Computer Science
306
(1-3), 2003, pp. 39-53
The full Steiner tree problem
Chin Lung Lu
,
Chuan Yi Tang
,
Richard Chia-Tung Lee
Theoretical Computer Science
306
(1-3), 2003, pp. 55-67
Private computation using a PEZ dispenser
József Balogh
,
János A. Csirik
,
Yuval Ishai
,
Eyal Kushilevitz
Theoretical Computer Science
306
(1-3), 2003, pp. 69-84
Regular closed sets of permutations
M.H. Albert
,
M.D. Atkinson
,
N. Rus̑kuc
Theoretical Computer Science
306
(1-3), 2003, pp. 85-100
Watson-Crick D0L systems: Generative power and undecidable problems
Petr Sosík
Theoretical Computer Science
306
(1-3), 2003, pp. 101-112
A new algorithm for regularizing one-letter context-free grammars
Ştefan Andrei
,
Salvador Valerio Cavadini
,
Wei-Ngan Chin
Theoretical Computer Science
306
(1-3), 2003, pp. 113-122
Completion of codes with finite bi-decoding delays
Liang Zhang
,
K.P. Shum
,
Shou-Li Peng
Theoretical Computer Science
306
(1-3), 2003, pp. 123-137
Non-cryptographic primitive for pseudorandom permutation
Tetsu Iwata
,
Tomonobu Yoshino
,
Kaoru Kurosawa
Theoretical Computer Science
306
(1-3), 2003, pp. 139-154
An algebraic characterization of deterministic regular languages over infinite alphabets
Nissim Francez
,
Michael Kaminski
Theoretical Computer Science
306
(1-3), 2003, pp. 155-175
Almost complete sets
Klaus Ambos-Spies
,
Wolfgang Merkle
,
Jan Reimann
,
Sebastiaan A. Terwijn
Theoretical Computer Science
306
(1-3), 2003, pp. 177-194
Lorentz gas cellular automata on graphs
L.A. Bunimovich
,
D.M. Kreslavskiy
Theoretical Computer Science
306
(1-3), 2003, pp. 195-221
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels
Annalisa De Bonis
,
Ugo Vaccaro
Theoretical Computer Science
306
(1-3), 2003, pp. 223-243
The word problem for
1 LC
congruences is
NP
-hard
Laurent Rosaz
Theoretical Computer Science
306
(1-3), 2003, pp. 245-268
Global convergence for evolution strategies in spherical problems: Some simple proofs and difficulties
Alexis Bienvenüe
,
Olivier François
Theoretical Computer Science
306
(1-3), 2003, pp. 269-289
On a modular domination game
Sylvain Gravier
,
Mehdi Mhalla
,
Eric Tannier
Theoretical Computer Science
306
(1-3), 2003, pp. 291-303
More on weighted servers or Fifo is better than Lru
Leah Epstein
,
Csanád Imreh
,
Rob van Stee
Theoretical Computer Science
306
(1-3), 2003, pp. 305-317
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
Eric Angel
,
Evripidis Bampis
,
Alexander Kononov
Theoretical Computer Science
306
(1-3), 2003, pp. 319-338
The complexity of makespan minimization for pipeline transportation
Ruy Luiz Milidiú
,
Artur Alves Pessoa
,
Eduardo Sany Laber
Theoretical Computer Science
306
(1-3), 2003, pp. 339-351
Exponential transients in continuous-time Liapunov systems
Jiȓí S̑íma
,
Pekka Orponen
Theoretical Computer Science
306
(1-3), 2003, pp. 353-372
Reducing NFAs by invariant equivalences
Lucian Ilie
,
Sheng Yu
Theoretical Computer Science
306
(1-3), 2003, pp. 373-390
The stable marriage problem with restricted pairs
Vânia M.F. Dias
,
Guilherme D. da Fonseca
,
Celina M.H. de Figueiredo
,
Jayme L. Szwarcfiter
Theoretical Computer Science
306
(1-3), 2003, pp. 391-405
On the complexity of finding common approximate substrings
Patricia A. Evans
,
Andrew D. Smith
,
H. Todd Wareham
Theoretical Computer Science
306
(1-3), 2003, pp. 407-430
Approximability results for stable marriage problems with ties
Magnús M. Halldórsson
,
Robert W. Irving
,
Kazuo Iwama
,
David F. Manlove
,
Shuichi Miyazaki
,
Yasufumi Morita
,
Sandy Scott
Theoretical Computer Science
306
(1-3), 2003, pp. 431-447
Seiten 1
2
>