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=580
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Privacy-preserving encryption scheme using DNA parentage test
Clémentine Gritti
,
Willy Susilo
,
Thomas Plantard
,
Khin Than Win
Theoretical Computer Science
580
, 2015, pp. 1-13
Graphical limit sets for general cellular automata
Johannes Müller
,
Hengrui Jiang
Theoretical Computer Science
580
, 2015, pp. 14-27
Scheduling games on uniform machines with activation cost
Fang Xie
,
Zhe Xu
,
Yuzhong Zhang
,
Qingguo Bai
Theoretical Computer Science
580
, 2015, pp. 28-35
Single-machine batch scheduling of linear deteriorating jobs
Min Ji
,
Qinyun Yang
,
Danli Yao
,
T.C.E. Cheng
Theoretical Computer Science
580
, 2015, pp. 36-49
Backbone coloring of planar graphs for
C8
-free or
C9
-free
Yuehua Bu
,
Xudong Bao
Theoretical Computer Science
580
, 2015, pp. 50-58
Enumeration of BC-subtrees of trees
Yu Yang
,
Hongbo Liu
,
Hua Wang
,
Scott Makeig
Theoretical Computer Science
580
, 2015, pp. 59-74
Finding and enumerating large intersections
Peter Damaschke
Theoretical Computer Science
580
, 2015, pp. 75-82
Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs
Gabriel Istrate
Theoretical Computer Science
580
, 2015, pp. 83-93
Fault tolerant additive and
(\mu,\alpha)
-spanners
Gilad Braunschvig
,
Shiri Chechik
,
David Peleg
,
Adam Sealfon
Theoretical Computer Science
580
, 2015, pp. 94-100
Non-deterministic graph searching in trees
Omid Amini
,
David Coudert
,
Nicolas Nisse
Theoretical Computer Science
580
, 2015, pp. 101-121