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=410
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic matrix rank
Gudmund Skovbjerg Frandsen
,
Peter Frands Frandsen
Theoretical Computer Science
410
(41), 2009, pp. 4085-4093
Causal Message Sequence Charts
Thomas Gazagnaire
,
Blaise Genest
,
Loïc Hélouët
,
P.S. Thiagarajan
,
Shaofa Yang
Theoretical Computer Science
410
(41), 2009, pp. 4094-4110
Deciding branching time properties for asynchronous programs
Rohit Chadha
,
Mahesh Viswanathan
Theoretical Computer Science
410
(42), 2009, pp. 4169-4179
Pedagogical second-order
\lambda
-calculus
Loïc Colson
,
David Michel
Theoretical Computer Science
410
(42), 2009, pp. 4190-4203
A direct proof of the confluence of combinatory strong reduction
René David
Theoretical Computer Science
410
(42), 2009, pp. 4204-4215
On-the-fly
TCTL
model checking for time Petri nets
Rachid Hadjidj
,
Hanifa Boucheneb
Theoretical Computer Science
410
(42), 2009, pp. 4241-4261
Robustness of temporal logic specifications for continuous-time signals
Georgios E. Fainekos
,
George J. Pappas
Theoretical Computer Science
410
(42), 2009, pp. 4262-4291
Interchange rearrangement: The element-cost model
Oren Kapah
,
Gad M. Landau
,
Avivit Levy
,
Nitsan Oz
Theoretical Computer Science
410
(43), 2009, pp. 4315-4326
Masking patterns in sequences: A new class of motif discovery with don't cares
Giovanni Battaglia
,
Davide Cangelosi
,
Roberto Grossi
,
Nadia Pisanti
Theoretical Computer Science
410
(43), 2009, pp. 4327-4340
The subsequence composition of a string
Alberto Apostolico
,
Fabio Cunial
Theoretical Computer Science
410
(43), 2009, pp. 4360-4371
Circular Sturmian words and Hopcroft's algorithm
G. Castiglione
,
A. Restivo
,
M. Sciortino
Theoretical Computer Science
410
(43), 2009, pp. 4372-4381
Efficient computations of
l_1
and
l_\infty
rearrangement distances
Amihood Amir
,
Yonatan Aumann
,
Piotr Indyk
,
Avivit Levy
,
Ely Porat
Theoretical Computer Science
410
(43), 2009, pp. 4382-4390
Suffix tree characterization of maximal motifs in biological sequences
Maria Federico
,
Nadia Pisanti
Theoretical Computer Science
410
(43), 2009, pp. 4391-4401
Rank/select on dynamic compressed sequences and applications
Rodrigo González
,
Gonzalo Navarro
Theoretical Computer Science
410
(43), 2009, pp. 4414-4422
Completing codes in a sofic shift
Marie-Pierre Béal
,
Dominique Perrin
Theoretical Computer Science
410
(43), 2009, pp. 4423-4431
On the size of Boyer-Moore automata
Ricardo Baeza-Yates
,
Véronique Bruyère
,
Olivier Delgrange
,
Rodrigo Scheihing
Theoretical Computer Science
410
(43), 2009, pp. 4432-4443
On the complexity of 2D discrete fixed point problem
Xi Chen
,
Xiaotie Deng
Theoretical Computer Science
410
(44), 2009, pp. 4448-4456
Optimal resilient sorting and searching in the presence of memory faults
Irene Finocchi
,
Fabrizio Grandoni
,
Giuseppe F. Italiano
Theoretical Computer Science
410
(44), 2009, pp. 4457-4470
A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
Kamalika Chaudhuri
,
Satish Rao
,
Samantha Riesenfeld
,
Kunal Talwar
Theoretical Computer Science
410
(44), 2009, pp. 4489-4503
Approximation algorithms for orthogonal packing problems for hypercubes
Rolf Harren
Theoretical Computer Science
410
(44), 2009, pp. 4504-4532
On the minimum hitting set of bundles problem
Eric Angel
,
Evripidis Bampis
,
Laurent Gourvès
Theoretical Computer Science
410
(45), 2009, pp. 4534-4542
Approximating maximum edge 2-coloring in simple graphs via local improvement
Zhi-Zhong Chen
,
Ruka Tanahashi
Theoretical Computer Science
410
(45), 2009, pp. 4543-4553
Fixed-parameter algorithms for Kemeny rankings
Nadja Betzler
,
Michael R. Fellows
,
Jiong Guo
,
Rolf Niedermeier
,
Frances A. Rosamond
Theoretical Computer Science
410
(45), 2009, pp. 4554-4570
Minimum leaf out-branching and related problems
Gregory Gutin
,
Igor Razgon
,
Eun Jung Kim
Theoretical Computer Science
410
(45), 2009, pp. 4571-4579
Speed scaling with a solar cell
Nikhil Bansal
,
Ho-Leung Chan
,
Kirk Pruhs
Theoretical Computer Science
410
(45), 2009, pp. 4580-4587
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>