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 Volume=37
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Axiomatising tree-interpretable structures
Achim Blumensath
Theory of Computing Systems
37
(1), 2004, pp. 3-27
Games with uniqueness properties
Shin Aida
,
Marcel Crasmaru
,
Kenneth Regan
,
Osamu Watanabe
Theory of Computing Systems
37
(1), 2004, pp. 29-47
Labeling schemes for dynamic tree networks
Amos Korman
,
David Peleg
,
Yoav Rodeh
Theory of Computing Systems
37
(1), 2004, pp. 49-75
How many missing answers can be tolerated by query learners?
Hans Ulrich Simon
Theory of Computing Systems
37
(1), 2004, pp. 77-94
Comparing verboseness for finite automata and Turing machines
Till Tantau
Theory of Computing Systems
37
(1), 2004, pp. 95-109
Nesting until and since in linear temporal logic
Denis Thérien
,
Thomas Wilke
Theory of Computing Systems
37
(1), 2004, pp. 111-131
Existential and positive theories of equations in graph products
Volker Diekert
,
Markus Lohrey
Theory of Computing Systems
37
(1), 2004, pp. 133-156
Generalized model-checking over locally tree-decomposable classes
Markus Frick
Theory of Computing Systems
37
(1), 2004, pp. 157-191
Learnability and definability in trees and similar structures
Martin Grohe
,
Gy. Turán
Theory of Computing Systems
37
(1), 2004, pp. 193-220
Quantum and approximate privacy
Hartmut Klauck
Theory of Computing Systems
37
(1), 2004, pp. 221-246
Characterizations of classes of graphs recognizable by local computations
Emmanuel Godard
,
Yves Métivier
,
Anca Muscholl
Theory of Computing Systems
37
(2), 2004, pp. 249-293
A note on
N
-body computations with cutoffs
Marc Snir
Theory of Computing Systems
37
(2), 2004, pp. 295-318
Extra processors versus future information in optimal deadline scheduling
Chiu-Yuen Koo
,
Tak-Wah Lam
,
Tsuen-Wan ''Johnny'' Ngan
,
Kar-Keung To
Theory of Computing Systems
37
(3), 2004, pp. 323-341
Congestion, dilation, and energy in radio networks
Friedhelm Meyer auf der Heide
,
Christian Schindelhauer
,
Klaus Volbert
,
Matthias Grünewald
Theory of Computing Systems
37
(3), 2004, pp. 343-370
Õ(congestion + dilation) hot-potato routing on leveled networks
Costas Busch
Theory of Computing Systems
37
(3), 2004, pp. 371-396
The lazy adversary conjecture fails
Enoch Peserico
Theory of Computing Systems
37
(3), 2004, pp. 397-403
Distributed object location in a dynamic network
Kirsten Hildrum
,
John D. Kubiatowicz amd Satosj Rap amd Ben Y. Zhao
Theory of Computing Systems
37
(3), 2004, pp. 405-440
Nearest common ancestors: A survey and a new algorithm for a distributed environment
Stephen Alstrup
,
Cyril Gavoille
,
Haim Kaplan
,
Theis Rauhe
Theory of Computing Systems
37
(3), 2004, pp. 441-456
Distributed streams algorithms for sliding windows
Phillip B. Gibbons
,
Srikanta Tirthapura
Theory of Computing Systems
37
(3), 2004, pp. 457-478
Determinization of transducers over infinite words: The general case
Marie-Pierre Béal
,
Olivier Carton
Theory of Computing Systems
37
(4), 2004, pp. 483-502
A simple boosting algorithm using multi-way branching decision trees
Kohei Hatano
Theory of Computing Systems
37
(4), 2004, pp. 503-518
Quadratic sequential computations of Boolean mappings
Serge Burckel
,
Marianne Morillon
Theory of Computing Systems
37
(4), 2004, pp. 519-525
An optimal parallel co-connectivity algorithm
Ka Wong Chong
,
Stavros D. Nikolopoulos
,
Leonidas Palios
Theory of Computing Systems
37
(4), 2004, pp. 527-546
Generalized diameters of the mesh of trees
Wei-Mei Chen
,
Gen-Huey Chen
,
D. Frank Hsu
Theory of Computing Systems
37
(4), 2004, pp. 547-556
Periodic gossiping in commuted networks
Dominique Barth
,
Pascal Berthomé
Theory of Computing Systems
37
(5), 2004, pp. 559-584
Seiten 1
2
>