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=457
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Vicente Acuña
,
Etienne Birmelé
,
Ludovic Cottret
,
Pierluigi Crescenzi
,
Fabien Jourdan
,
Vincent Lacroix
,
Alberto Marchetti-Spaccamela
,
Andrea Marino
,
Paulo Vieira Milreu
,
Marie-France Sagot
,
Leen Stougie
Theoretical Computer Science
457
, 2012, pp. 1-9
Optimal gathering in radio grids with interference
Jean-Claude Bermond
,
Joseph G. Peters
Theoretical Computer Science
457
, 2012, pp. 10-26
On suffix extensions in suffix trees
Dany Breslauer
,
Giuseppe F. Italiano
Theoretical Computer Science
457
, 2012, pp. 27-34
Several semi-online scheduling problems on two identical machines with combined information
Qian Cao
,
T.C.E. Cheng
,
Guohua Wan
,
Yi Li
Theoretical Computer Science
457
, 2012, pp. 35-44
On communication protocols that compute almost privately
Marco Comi
,
Bhaskar DasGupta
,
Michael Schapira
,
Venkatakumar Srinivasan
Theoretical Computer Science
457
, 2012, pp. 45-58
A ``thermodynamic'' approach to multi-robot cooperative localization
Yotam Elor
,
Alfred M. Bruckstein
Theoretical Computer Science
457
, 2012, pp. 59-75
Two-robot source seeking with point measurements
Yotam Elor
,
Alfred M. Bruckstein
Theoretical Computer Science
457
, 2012, pp. 76-85
Computing vertex-surjective homomorphisms to partially reflexive trees
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Theoretical Computer Science
457
, 2012, pp. 86-100
The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited
Daniel S. Graça
,
Ning Zhong
,
H.S. Dumas
Theoretical Computer Science
457
, 2012, pp. 101-110
Learning in the limit with lattice-structured hypothesis spaces
Jeffrey Heinz
,
Anna Kasprzik
,
Timo Kötzing
Theoretical Computer Science
457
, 2012, pp. 111-127
Burrows-Wheeler transformations and de Bruijn words
Peter M. Higgins
Theoretical Computer Science
457
, 2012, pp. 128-136
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs
Riko Jacob
,
Stephan Ritscher
,
Christian Scheideler
,
Stefan Schmid
Theoretical Computer Science
457
, 2012, pp. 137-148
Parsing Boolean grammars over a one-letter alphabet using online convolution
Alexander Okhotin
,
Christian Reitwießner
Theoretical Computer Science
457
, 2012, pp. 149-157
The 2-surviving rate of planar graphs without 4-cycles
Weifan Wang
,
Jiangxu Kong
,
Lianzhu Zhang
Theoretical Computer Science
457
, 2012, pp. 158-165
Maximal pattern complexity, dual system and pattern recognition
Yu-Mei Xue
,
Teturo Kamae
Theoretical Computer Science
457
, 2012, pp. 166-173
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
Junling Yuan
,
Wenhua Li
,
Jinjiang Yuan
Theoretical Computer Science
457
, 2012, pp. 174-180