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=409
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The pruning-grafting lattice of binary trees
J.L. Baril
,
J.M. Pallo
Theoretical Computer Science
409
(3), 2008, pp. 382-393
Algorithms for subsequence combinatorics
Cees Elzinga
,
Sven Rahmann
,
Hui Wang
Theoretical Computer Science
409
(3), 2008, pp. 394-404
A quadratic identity for the number of perfect matchings of plane graphs
Weigen Yan
,
Fuji Zhang
Theoretical Computer Science
409
(3), 2008, pp. 405-410
Simulating one-reversal multicounter machines by partially blind multihead finite automata
Alan Deckelbaum
Theoretical Computer Science
409
(3), 2008, pp. 411-416
Minimum-cost delegation in service composition
Cagdas E. Gerede
,
Oscar H. Ibarra
,
Bala Ravikumar
,
Jianwen Su
Theoretical Computer Science
409
(3), 2008, pp. 417-431
Long binary patterns are Abelian 2-avoidable
James D. Currie
,
Terry I. Visentin
Theoretical Computer Science
409
(3), 2008, pp. 432-437
Generalized LCS
Amihood Amir
,
Tzvika Hartman
,
Oren Kapah
,
B. Riva Shalom
,
Dekel Tsur
Theoretical Computer Science
409
(3), 2008, pp. 438-449
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Ping-Ying Tsai
,
Jung-Sheng Fu
,
Gen-Huey Chen
Theoretical Computer Science
409
(3), 2008, pp. 450-460
A palindromization map for the free group
Christian Kassel
,
Christophe Reutenauer
Theoretical Computer Science
409
(3), 2008, pp. 461-470
Expanders and time-restricted branching programs
Stasys Jukna
Theoretical Computer Science
409
(3), 2008, pp. 471-476
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
Xiaojun Shen
,
Jianyu Lou
,
Weifa Liang
,
Junzhou Luo
Theoretical Computer Science
409
(3), 2008, pp. 477-485
Fast and compact regular expression matching
Philip Bille
,
Martin Farach-Colton
Theoretical Computer Science
409
(3), 2008, pp. 486-496
Paths and trails in edge-colored graphs
A. Abouelaoualim
,
K.Ch. Das
,
L. Faria
,
Y. Manoussakis
,
C. Martinhon
,
R. Saad
Theoretical Computer Science
409
(3), 2008, pp. 497-510
On weighted balls-into-bins games
Petra Berenbrink
,
Tom Friedetzky
,
Zengjian Hu
,
Russell Martin
Theoretical Computer Science
409
(3), 2008, pp. 511-520
Dynamic bin packing of unit fractions items
Joseph Wun-Tat Chan
,
Tak-Wah Lam
,
Prudence W.H. Wong
Theoretical Computer Science
409
(3), 2008, pp. 521-529
Strategic attack on the shrinking generator
A. Fúster-Sabater
,
P. Caballero-Gil
Theoretical Computer Science
409
(3), 2008, pp. 530-536
Rational subsets of partially reversible monoids
Pedro V. Silva
Theoretical Computer Science
409
(3), 2008, pp. 537-548
Structural Presburger digit vector automata
Jérôme Leroux
Theoretical Computer Science
409
(3), 2008, pp. 549-556
Playing with Conway's problem
Emmanuel Jeandel
,
Nicolas Ollinger
Theoretical Computer Science
409
(3), 2008, pp. 557-564
Generating all permutations by context-free grammars in Greibach normal form
Peter R.J. Asveld
Theoretical Computer Science
409
(3), 2008, pp. 565-577
Quasiperiodic and Lyndon Episturmian words
Amy Glen
,
Florence Levé
,
Gwénaël Richomme
Theoretical Computer Science
409
(3), 2008, pp. 578-600
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
Anne Berry
,
Elias Dahlhaus
,
Pinar Heggernes
,
Geneviève Simonet
Theoretical Computer Science
409
(3), 2008, pp. 601-616
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
Maurice J. Jansen
,
Kenneth W. Regan
Theoretical Computer Science
409
(3), 2008, pp. 617-622
Seiten
<
1
2