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=583
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
Adrien Richard
Theoretical Computer Science
583
, 2015, pp. 1-26
Computability aspects for 1st-order partial differential equations via characteristics
Shu-Ming Sun
,
Ning Zhong
Theoretical Computer Science
583
, 2015, pp. 27-39
Node replacement graph grammars with dynamic node relabeling
Changwook Kim
,
Mahiro Ando
Theoretical Computer Science
583
, 2015, pp. 40-50
Finding median in read-only memory on integer input
Timothy M. Chan
,
J. Ian Munro
,
Venkatesh Raman
Theoretical Computer Science
583
, 2015, pp. 51-56
Single-machine batch scheduling with job processing time compatibility
Shisheng Li
,
T.C.E. Cheng
,
C.T. Ng
,
Jinjiang Yuan
Theoretical Computer Science
583
, 2015, pp. 57-66
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
Youjun Chen
,
Lingfa Lu
,
Jinjiang Yuan
Theoretical Computer Science
583
, 2015, pp. 67-77
DFA minimization: Double reversal versus split minimization algorithms
Pedro García
,
Damián López
,
Manuel Vrga}|, Manuel V\'a}zquez de arga}|
Theoretical Computer Science
583
, 2015, pp. 78-85
Exploiting non-constant safe memory in resilient algorithms and data structures
Lorenzo De Stefani
,
Francesco Silvestri
Theoretical Computer Science
583
, 2015, pp. 86-97