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=426-427
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some results on approximate 1-median selection in metric spaces
Ching-Lueh Chang
Theoretical Computer Science
426-427
, 2012, pp. 1-12
The connected
P
-center problem on block graphs with forbidden vertices
William Chung-Kung Yen
Theoretical Computer Science
426-427
, 2012, pp. 13-24
New algorithms on wavelet trees and applications to information retrieval
Travis Gagie
,
Gonzalo Navarro
,
Simon J. Puglisi
Theoretical Computer Science
426-427
, 2012, pp. 25-41
On algebra of languages representable by vertex-labeled graphs
Igor Grunsky
,
Igor Potapov
,
Elena Pryanichnikova
Theoretical Computer Science
426-427
, 2012, pp. 42-48
Inverse Hamiltonian Cycle
and inverse 3
Dimensional Matching
are coNP-complete
Harald Hempel
,
Michael Krüger
Theoretical Computer Science
426-427
, 2012, pp. 49-65
On demand string sorting over unbounded alphabets
Carmel Kent
,
Moshe Lewenstein
,
Dafna Sheinwald
Theoretical Computer Science
426-427
, 2012, pp. 66-74
Arboricity,
h
-index, and dynamic algorithms
Min Chih Lin
,
Francisco J. Soulignac
,
Jayme L. Szwarcfiter
Theoretical Computer Science
426-427
, 2012, pp. 75-90
A public key cryptosystem based on three new provable problems
Shenghui Su
,
Shuwang Lü
Theoretical Computer Science
426-427
, 2012, pp. 91-117