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=460
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lowness for bounded randomness
Rod Downey
,
Keng Meng Ng
Theoretical Computer Science
460
, 2012, pp. 1-9
Combination of parallel machine scheduling and vertex cover
Zhenbo Wang
,
Zhenhua Cui
Theoretical Computer Science
460
, 2012, pp. 10-15
Reversible iterative graph processes
Mitre C. Dourado
,
Lucia Draque Penso
,
Dieter Rautenbach
,
Jayme L. Szwarcfiter
Theoretical Computer Science
460
, 2012, pp. 16-25
Maximum regular induced subgraphs in
2P_3
-free graphs
Vadim V. Lozin
,
Raffaele Mosca
Theoretical Computer Science
460
, 2012, pp. 26-33
Fault tolerance in
k
-ary
n
-cube networks
Shiying Wang
,
Guozhen Zhang
,
Kai Feng
Theoretical Computer Science
460
, 2012, pp. 34-41
Minimal cost reconfiguration of data placement in a storage area network
Hadas Shachnai
,
Gal Tamir
,
Tami Tamir
Theoretical Computer Science
460
, 2012, pp. 42-53
Computability on random events and variables in a computable probability space
Yongcheng Wu
Theoretical Computer Science
460
, 2012, pp. 54-69
On the complexity of the highway problem
Khaled Elbassioni
,
Rajiv Raman
,
Saurabh Ray
,
René Sitters
Theoretical Computer Science
460
, 2012, pp. 70-77
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
Jia Lee
,
Rui-Long Yang
,
Kenichi Morita
Theoretical Computer Science
460
, 2012, pp. 78-88
Lower bound for balanced sets
Zhivko Nedev
Theoretical Computer Science
460
, 2012, pp. 89-93
Extracting string motif bases for quorum higher than two
Simona E. Rombo
Theoretical Computer Science
460
, 2012, pp. 94-103