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=421
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Column subset selection via sparse approximation of SVD
A. Çivril
,
M. Magdon-Ismail
Theoretical Computer Science
421
, 2012, pp. 1-14
Bounding prefix transposition distance for strings and permutations
Bhadrachalam Chitturi
,
I. Hal Sudborough
Theoretical Computer Science
421
, 2012, pp. 15-24
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Harold Connamacher
Theoretical Computer Science
421
, 2012, pp. 25-55
Complexity of approximating the vertex centroid of a polyhedron
Khaled Elbassioni
,
Hans Raj Tiwary
Theoretical Computer Science
421
, 2012, pp. 56-61
Fault tolerance in bubble-sort graph networks
Shiying Wang
,
Yuxing Yang
Theoretical Computer Science
421
, 2012, pp. 62-69
Winning strategies for aperiodic subtraction games
Alan Guo
Theoretical Computer Science
421
, 2012, pp. 70-73