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=299
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Erratum to ''Expressiveness of matchgates''
Leslie G. Valiant
Theoretical Computer Science
299
(1), 2003, pp. 795
The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantifications
Bruno Courcelle
Theoretical Computer Science
299
(1-3), 2003, pp. 1-36
PAC learning of probability distributions over a discrete domain
Letizia Magnoni
,
Massimo Mirolli
,
Franco Montagna
,
Giulia Simi
Theoretical Computer Science
299
(1-3), 2003, pp. 37-63
Complexity of perceptron recognition for a class of geometric patterns
Julio Aracena
,
Eric Goles
Theoretical Computer Science
299
(1-3), 2003, pp. 65-79
Algebraic testing and weight distributions of codes
M. Kiwi
Theoretical Computer Science
299
(1-3), 2003, pp. 81-106
A survey on multi-loop networks
F.K. Hwang
Theoretical Computer Science
299
(1-3), 2003, pp. 107-121
On a conjecture on bidimensional words
Chiara Epifanio
,
Michel Koskas
,
Filippo Mignosi
Theoretical Computer Science
299
(1-3), 2003, pp. 123-150
Optimal three-dimensional orthogonal graph drawing in the general position model
David R. Wood
Theoretical Computer Science
299
(1-3), 2003, pp. 151-178
Structuring the elementary components of graphs having a perfect internal matching
Miklós Bartha
,
Miklós Krész
Theoretical Computer Science
299
(1-3), 2003, pp. 179-210
Approximation algorithms for NMR spectral peak assignment
Zhi-Zhong Chen
,
Tao Jiang
,
Guohui Lin
,
Jianjun Wen
,
Dong Xu
,
Jinbo Xu
,
Ying Xu
Theoretical Computer Science
299
(1-3), 2003, pp. 211-229
Fringe analysis of synchronized parallel insertion algorithms in 2-3 trees
R. Baeza-Yates
,
J. Gabarró
,
X. Messeguer
Theoretical Computer Science
299
(1-3), 2003, pp. 231-271
An efficient
k
nearest neighbors searching algorithm for a query line
Subhas C. Nandy
,
Sandip Das
,
Partha P. Goswami
Theoretical Computer Science
299
(1-3), 2003, pp. 273-288
Diffusion without false rumors: On propagating updates in a Byzantine environment
Dahlia Malkhi
,
Yishay Mansour
,
Michael K. Reiter
Theoretical Computer Science
299
(1-3), 2003, pp. 289-306
Alternating and empty alternating auxiliary stack automata
Markus Holzer
,
Pierre McKenzie
Theoretical Computer Science
299
(1-3), 2003, pp. 307-326
On omega context free languages which are Borel sets of infinte rank
Olivier Finkel
Theoretical Computer Science
299
(1-3), 2003, pp. 327-346
Towards a language theory for infinite
N
-free pomsets
Dietrich Kuske
Theoretical Computer Science
299
(1-3), 2003, pp. 347-386
Approximate pattern matching and transitive closure logics
Kjell Lemström
,
Lauri Hella
Theoretical Computer Science
299
(1-3), 2003, pp. 387-412
Presburger liveness verification of discrete timed automata
Zhe Dang
,
Pierluigi San Pietro
,
Richard A. Kemmerer
Theoretical Computer Science
299
(1-3), 2003, pp. 413-438
Lower bounds for on-line single-machine scheduling
Leah Epstein
,
Rob van Stee
Theoretical Computer Science
299
(1-3), 2003, pp. 439-450
Protocol insecurity with a finite number of sessions and composed keys is
NP
-complete
Michaël Rusinowitch
,
Mathieu Turuani
Theoretical Computer Science
299
(1-3), 2003, pp. 451-475
Cellular automata and strongly irreducible shifts of finite type
Francesca Fiorenzi
Theoretical Computer Science
299
(1-3), 2003, pp. 477-493
Breaking DES using
P
systems
Shankara Narayanan Krishna
,
Raghavan Rama
Theoretical Computer Science
299
(1-3), 2003, pp. 495-508
A new regular grammar pattern matching algorithm
Bruce W. Watson
Theoretical Computer Science
299
(1-3), 2003, pp. 509-521
Number-conserving cellular automata I: Decidability
Bruno Durand
,
Enrico Formenti
,
Zsuzsanna Róka
Theoretical Computer Science
299
(1-3), 2003, pp. 523-535
Towards optimal lower bounds for clique and chromatic number
Lars Engebretsen
,
Jonas Holmerin
Theoretical Computer Science
299
(1-3), 2003, pp. 537-584
Seiten 1
2
>