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=270
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Oliver Matz
Theoretical Computer Science
270
(1-2), 2002, pp. 1-70
Searching games with errors - fifty years of coping with liars
Andrzej Pelc
Theoretical Computer Science
270
(1-2), 2002, pp. 71-109
Some permutation routing algorithms for low-dimensional hypercubes
F.K. Hwang
,
Y.C. Yao
,
B. Dasgupta
Theoretical Computer Science
270
(1-2), 2002, pp. 111-124
Inheritance of workflows: An approach to tackling problems related to change
W.M.P. van der Aalst
,
T. Basten
Theoretical Computer Science
270
(1-2), 2002, pp. 125-203
Calculs sur les structures de langage dénombrable
Ménard Bourgade
Theoretical Computer Science
270
(1-2), 2002, pp. 205-222
Rstriction categories I: Categories of partial maps
J.R.B. Cockett
,
Stephen Lack
Theoretical Computer Science
270
(1-2), 2002, pp. 223-259
The drawability problem for minimum weight triangulation
William Lenhart
,
Giuseppe Liotta
Theoretical Computer Science
270
(1-2), 2002, pp. 261-286
Control structures in hypothesis spaces: The influence on learning
John Case
,
Sanjay Jain
,
Mandayam Suraj
Theoretical Computer Science
270
(1-2), 2002, pp. 287-308
Deterministic parallel backtrack search
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Theoretical Computer Science
270
(1-2), 2002, pp. 309-324
On-line load balancing of temporary tasks revisited
Tak-Wah Lam
,
Hing-Fung Ting
,
Kar-Keung To
,
Wai-Ha Wong
Theoretical Computer Science
270
(1-2), 2002, pp. 325-340
On the design of efficient ATM routing schemes
Luca Becchetti
,
Paola Bertolazzi
,
Carlo Gaibisso
,
Giorgio Gambosi
Theoretical Computer Science
270
(1-2), 2002, pp. 341-359
Edge coloring of bipartite graphs with constraints
Ioannis Caragiannis
,
Christos Kaklamanis
,
Pino Persiano
Theoretical Computer Science
270
(1-2), 2002, pp. 361-399
Partial words and a theorem of Fine and Wilf revisited
F. Blanchet-Sadri
,
Robert A. Hegstrom
Theoretical Computer Science
270
(1-2), 2002, pp. 401-419
Time-minimal paths amidst moving obstacles in three dimensions
Kikuo Fujimura
Theoretical Computer Science
270
(1-2), 2002, pp. 421-440
The stack-size of tries: A combinatorial study
Markus E. Nebel
Theoretical Computer Science
270
(1-2), 2002, pp. 441-461
Associative language descriptions
Alessandra Cherubini
,
Stefano Crespi Reghizzi
,
Pierluigi San Pietro
Theoretical Computer Science
270
(1-2), 2002, pp. 463-491
Decision lists and related Boolean functions
Thomas Eiter
,
Toshihide Ibaraki
,
Kazuhisa Makino
Theoretical Computer Science
270
(1-2), 2002, pp. 493-524
Asymptotic behavior in a heap model with two pieces
Jean Mairesse
,
Laurent Vuillon
Theoretical Computer Science
270
(1-2), 2002, pp. 525-560
A priori optimization for the probabilistic maximum independent set problem
Cécile Murat
,
Vangelis Th. Paschos
Theoretical Computer Science
270
(1-2), 2002, pp. 561-590
Computational complexity of some problems involving congruences on algebras
Clifford Bergman
,
Giora Slutzki
Theoretical Computer Science
270
(1-2), 2002, pp. 591-608
Decision tree approximations of Boolean functions
Dinesh Mehta
,
Vijay Raghavan
Theoretical Computer Science
270
(1-2), 2002, pp. 609-623
On the complexity of recognizing the Hilbert basis of a linear diophantine system
Arnaud Durand
,
Miki Hermann
,
Laurent Juban
Theoretical Computer Science
270
(1-2), 2002, pp. 625-642
Approximating algebraic functions by means of rational ones
E. Pergola
,
R. Pinzani
,
S. Rinaldi
Theoretical Computer Science
270
(1-2), 2002, pp. 643-657
On two-sided infinite fixed points of morphisms
Jeffrey Shallit
,
Ming-wei Wang
Theoretical Computer Science
270
(1-2), 2002, pp. 659-675
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Antonín Kuc̑era
,
Richard Mayr
Theoretical Computer Science
270
(1-2), 2002, pp. 677-700
Seiten 1
2
>