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=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Trimming of graphs, with application to point labeling
Thomas Erlebach
,
Thomas Hagerup
,
Klaus Jansen
,
Moritz Minzlaff
,
Alexander Wolff
Theory of Computing Systems
47
(3), 2010, pp. 613-636
Trimmed Moebius inversion and graphs of bounded degree
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Kolvisto
Theory of Computing Systems
47
(3), 2010, pp. 637-654
The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
Thomas Thierauf
,
Fabian Wagner
Theory of Computing Systems
47
(3), 2010, pp. 655-673
Connecting polygonizations via stretches and twangs
Mirela Damian
,
Robin Flatland
,
Joseph O'Rourke
,
Suneeta Ramaswami
Theory of Computing Systems
47
(3), 2010, pp. 674-695
Model checking games for the quantitative
\mu
-calculus
Diana Fischer
,
Erich Grädel
,
Łukasz Kaiser
Theory of Computing Systems
47
(3), 2010, pp. 696-719
Limit complexities revisited
Laurent Bienvenu
,
Andrej Muchnik
,
Alexander Shen
,
Nikolay Vereshchagin
Theory of Computing Systems
47
(3), 2010, pp. 720-736
Deterministically isolating a perfect matching in bipartite planar graphs
Samir Datta
,
Raghav Kulkarni
,
Sambuddha Roy
Theory of Computing Systems
47
(3), 2010, pp. 737-757
Lexicographic decomposition of
k
-valued transducers
Jacques Sakarovitch
,
Rodrigo de Souza
Theory of Computing Systems
47
(3), 2010, pp. 758-785
Quantum search with variable times
Andris Ambainis
Theory of Computing Systems
47
(3), 2010, pp. 786-807
Distributed approximation of capacitated dominating sets
Fabian Kuhn
,
Thomas Moscibroda
Theory of Computing Systems
47
(4), 2010, pp. 811-836
Strong-diameter decompositions of minor free graphs
Ittai Abraham
,
Cyril Gavoille
,
Dahlia Malkhi
,
Udi Wiedr
Theory of Computing Systems
47
(4), 2010, pp. 837-855
Approximation algorithms for multiprocessor scheduling under uncertainty
Guolong Lin
,
Rajmohan Rajaraman
Theory of Computing Systems
47
(4), 2010, pp. 856-877
The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and experimental evaluation
Rezaul Alam Chowdhury
,
Vijaya Ramachandran
Theory of Computing Systems
47
(4), 2010, pp. 878-919
Local MST computation with short advice
Pierre Fraigniaud
,
Amos Korman
,
Emmanuelle Lebhar
Theory of Computing Systems
47
(4), 2010, pp. 920-933
Optimal sparse matrix dense vector multiplication in the I/O-model
Michael A. Bender
,
Gerth Stlting Brodal
,
Rolf Fagerberg
,
Riko Jacob
,
Elias Vicari
Theory of Computing Systems
47
(4), 2010, pp. 934-962
Seiten
<
1
2