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=Theory of Computing Systems AND YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multi-linearity self-testing with relative error
Frédéric Magniez
Theory of Computing Systems
38
(5), 2005, pp. 573-591
Hierarchy among automata on linear orderings
Véronique Bruyère
,
Olivier Carton
Theory of Computing Systems
38
(5), 2005, pp. 593-621
New graph classes of bounded clique-width
Andreas Brandstädt
,
Feodor F. Dragan
,
Hoàng-Oanh Le
,
Raffaele Mosca
Theory of Computing Systems
38
(5), 2005, pp. 623-645
Tractable fragments of Presburger arithmetic
K. Subramani
Theory of Computing Systems
38
(5), 2005, pp. 647-668
A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
Beate Bollig
,
Philipp Woelfel
Theory of Computing Systems
38
(6), 2005, pp. 671-685
Structure-preserving hierarchical decompositions
Irene Finocchi
,
Rossella Petreschi
Theory of Computing Systems
38
(6), 2005, pp. 687-700
Closure properties of real number classes under CBV functions
Xizhong Zheng
,
Robert Rettinger
,
Romain Gengler
Theory of Computing Systems
38
(6), 2005, pp. 701-729
Resource bounds and subproblem independence
Richard E. Stearns
,
Harry B. Hunt III
Theory of Computing Systems
38
(6), 2005, pp. 731-761
Improved approximations for weighted and unweighted graph problems
Marc Demange
,
Vangelis Paschos
Theory of Computing Systems
38
(6), 2005, pp. 763-787
Seiten
<
1
2