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=416
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Flavio D'Alessandro
,
Benedetto Intrigila
,
Stefano Varricchio
Theoretical Computer Science
416
, 2012, pp. 1-16
On Müller context-free grammars
Zoltán Ésik
,
Szabolcs Iván
Theoretical Computer Science
416
, 2012, pp. 17-32
Renewal theory in the analysis of tries and strings
Svante Janson
Theoretical Computer Science
416
, 2012, pp. 33-54
Approximating fault-tolerant Group-Steiner problems
Rohit Khandekar
,
Guy Kortsarz
,
Zeev Nutov
Theoretical Computer Science
416
, 2012, pp. 55-64
The surviving rate of planar graphs
Jiangxu Kong
,
Weifan Wang
,
Xuding Zhu
Theoretical Computer Science
416
, 2012, pp. 65-70
Language equations with complementation: Expressive power
Alexander Okhotin
,
Oksana Yakimova
Theoretical Computer Science
416
, 2012, pp. 71-86
A linear time approximation algorithm for permutation flow shop scheduling
Marcus Poggi
,
David Sotelo
Theoretical Computer Science
416
, 2012, pp. 87-94