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=42
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Traffic engineering of management flows by link augmentations on confluent trees
Randeep Bhatia
,
Nicole Immorlica
,
Tracy Kimbrel
,
Vahab S. Mirrokni
,
Joseph (Seffi) Naor
,
Baruch Schieber
Theory of Computing Systems
42
(1), 2008, pp. 2-26
Collaborate with strangers to find own preferences
Baruch Awerbuch
,
Yossi Azar
,
Zvi Lotker
,
Boaz Patt-Shamir
,
Mark R. Tuttle
Theory of Computing Systems
42
(1), 2008, pp. 27-41
Adaptive energy management for incremental deployment of heterogeneous wireless sensors
Ioannis Chatzigiannakis
,
Athanasios Kinalis
,
Sotiris Nikoletseas
Theory of Computing Systems
42
(1), 2008, pp. 42-72
Processor efficient parallel matching
Piotr Sankowski
Theory of Computing Systems
42
(1), 2008, pp. 73-90
Selfish routing with incomplete information
Martin Gairing
,
Burkhard Monien
,
Karsten Tiemann
Theory of Computing Systems
42
(1), 2008, pp. 91-130
Partial bi-immunity, scaled dimension, and
NP
-completeness
John M. Hitchcock
,
A. Pavan
,
N.V. Vinodchandran
Theory of Computing Systems
42
(2), 2008, pp. 131-142
A generalization of magic squares with applications to digital halftoning
Boris Aronov
,
Tetsuo Asano
,
Yosuke Kikuchi
,
Subhas C. Nandy
,
Shinji Sasahara
,
Takeaki Uno
Theory of Computing Systems
42
(2), 2008, pp. 143-156
Storage products and linear control of derivations
Christian Wartena
Theory of Computing Systems
42
(2), 2008, pp. 157-186
A revised transformation protocol for unconditionally secure secret key exchange
Koichi Koizumi
,
Takaaki Mizuki
,
Takao Nishizeki
Theory of Computing Systems
42
(2), 2008, pp. 187-221
Efficient algorithms for anonymous byzantine agreement
Michael Okun
,
Amnon Barak
Theory of Computing Systems
42
(2), 2008, pp. 222-238
Complexity of clausal constraints over chains
Nadia Creignou
,
Miki Hermann
,
Andrei Krokhin
,
Gernot Salzer
Theory of Computing Systems
42
(2), 2008, pp. 239-255
Languages of dot-depth 3/2
Christian Glaßer
,
Heinz Schmitz
Theory of Computing Systems
42
(2), 2008, pp. 256-286
Grasp and delivery for moving objects on broken lines
Yuichi Asahiro
,
Eiji Miyano
,
Shinichi Shimoirisa
Theory of Computing Systems
42
(3), 2008, pp. 289-305
Logical equivalence for subtyping object and recursive types
Steffen van Bakel
,
Ugo de'Liguoro
Theory of Computing Systems
42
(3), 2008, pp. 306-348
Improved algorithms for polynomial-time decay andtime-decay with additive error
Tsvi Kopelowitz
,
Ely Porat
Theory of Computing Systems
42
(3), 2008, pp. 349-365
Model checking abilities of agents: A closer look
Wojciech Jamroga
,
Jürgen Dix
Theory of Computing Systems
42
(3), 2008, pp. 366-410
A new combinatorial approach to sequence comparison
S. Mantaci
,
A. Restivo
,
G. Rosone
,
M. Sciortino
Theory of Computing Systems
42
(3), 2008, pp. 411-429
Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
Leah Epstein
,
Arik Ganot
Theory of Computing Systems
42
(4), 2008, pp. 431-449
Synthesis of autosymmetric functions in a new three-level form
Anna Bernasconi
,
Valentina Ciriani
,
Fabrizio Luccio
,
Linda Pagli
Theory of Computing Systems
42
(4), 2008, pp. 450-464
On ``exploiting'' node-heterogeneous clusters optimally
Micah Adler
,
Ying Gong
,
Arnold L. Rosenberg
Theory of Computing Systems
42
(4), 2008, pp. 465-487
On the complexity of 2-monotone restarting automata
Tomasz Jurdziński
,
Friedrich Otto
,
Frantis̑ek Mráz
,
Martin Plátek
Theory of Computing Systems
42
(4), 2008, pp. 488-518
Store-and-forward multicast routing on the mesh
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Theory of Computing Systems
42
(4), 2008, pp. 519-535
Pattern matching and membership for hierarchical message sequence charts
Blaise Genest
,
Anca Muscholl
Theory of Computing Systems
42
(4), 2008, pp. 536-567
Provably fast training algorithms for support vector machines
José L. Balcázar
,
Yang Dai
,
Junichi Tanaka
,
Osamu Watanabe
Theory of Computing Systems
42
(4), 2008, pp. 568-595
Relations between average-case and worst-case complexity
A. Pavan
,
N.V. Vinodchandran
Theory of Computing Systems
42
(4), 2008, pp. 596-607
Seiten 1
2
>