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=Theor.~Comput.~Sci. AND Volume=417
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting and sampling minimum
(s,t)
-cuts in weighted planar graphs in polynomial time
Ivona Bezáková
,
Adam J. Friedlander
Theoretical Computer Science
417
, 2012, pp. 2-11
Improved approximability and non-approximability results for graph diameter decreasing problems
Davide Bilò
,
Luciano Gualà
,
Guido Proietti
Theoretical Computer Science
417
, 2012, pp. 12-22
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Nader H. Bshouty
,
Hanna Mazzawi
Theoretical Computer Science
417
, 2012, pp. 23-35
Counting classes and the fine structure between NC
^1
and L
Samir Datta
,
Meena Mahajan
,
B.V. Raghavendra Rao
,
Michael Thomas
,
Heribert Vollmer
Theoretical Computer Science
417
, 2012, pp. 36-49
Average complexity of Moore's and Hopcroft's algorithms
Julien David
Theoretical Computer Science
417
, 2012, pp. 50-65
Improved simulation of nondeterministic Turing machines
Subrahmanyam Kalyanasundaram
,
Richard J. Lipton
,
Kenneth W. Regan
,
Farbod Shokrieh
Theoretical Computer Science
417
, 2012, pp. 66-73
Strong normalization of ML
^F
via a calculus of coercions
Giulio Manzonetto
,
Paolo Tranquilli
Theoretical Computer Science
417
, 2012, pp. 74-94
Faster approximation schemes and parameterized algorithms on (odd-)
H
-minor-free graphs
Siamak Tazari
Theoretical Computer Science
417
, 2012, pp. 95-107