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
[1]
Hilfe
Suche: Journal=Theory of Computing Systems AND Volume=44
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A Kleene theorem for weighted tree automata over distributive multioperator monoids
Zoltán Fülöp
,
Andreas Maletti
,
Heiko Vogler
Theory of Computing Systems
44
(3), 2009, pp. 455-499
Query evaluation on a database given by a random graph
Nilesh Dalvi
Theory of Computing Systems
44
(4), 2009, pp. 503-532
Database query processing using finite cursor machines
Martin Grohe
,
Yuri Gurevich
,
Dirk Leinders
,
Nicole Schweikardt
,
Jerzy Tyszkiewicz
,
Jan Van den Bussche
Theory of Computing Systems
44
(4), 2009, pp. 533-560
Axiomatizing the logical core of XPath 2.0
Balder ten Cate
,
Maarten Marx
Theory of Computing Systems
44
(4), 2009, pp. 561-589
Structural recursion as a query language on lists and ordered trees
Edward L. Robertson
,
Lawrence V. Saxton
,
Dirk Van Gucht
,
Stijn Vansummeren
Theory of Computing Systems
44
(4), 2009, pp. 590-619
Comparing universal covers in polynomial time
Jiȓí Fiala
,
Daniël Paulusma
Theory of Computing Systems
44
(4), 2009, pp. 620-635
Modulo constraints and the complexity of typechecking XML views
Jerzy Marcinkowski
,
Piotr Wieczorek
Theory of Computing Systems
44
(4), 2009, pp. 620-652
Self-referential justifications in epistemic logic
Roman Kuznets
Theory of Computing Systems
44
(4), 2009, pp. 636-661
Undirectional Lambek grammars in polynomial time
Yury Savateev
Theory of Computing Systems
44
(4), 2009, pp. 662-672
A semantic proof of polytime soundness of light affine logic
Ugo Dal Lago
,
Martin Hofmann
Theory of Computing Systems
44
(4), 2009, pp. 673-689
Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reuctions
Markus Bläser
,
Holger Dell
,
Johann A. Makowsky
Theory of Computing Systems
44
(4), 2009, pp. 690-706
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
Marius Zimand
Theory of Computing Systems
44
(4), 2009, pp. 707-722
Simple and improved parameterized algorithms for multiterminal cuts
Mingyu Xiao
Theory of Computing Systems
44
(4), 2009, pp. 723-736
Logic and rational languages of words inexed by linear orderings
Nicolas Bedon
,
Alexis Bès
,
Olivier Carton
,
Chloé Rispal
Theory of Computing Systems
44
(4), 2009, pp. 737-760
On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
Uffe Flarup
,
Laurent Lyaudet
Theory of Computing Systems
44
(4), 2009, pp. 761-791
Seiten
<
1
2