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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The reconstruction of polyominoes from their orthogonal projections
Gerhard J. Woeginger
Information Processing Letters
77
(5-6), 2001, pp. 225-229
On generating
k
-ary trees in computer representation
Limin Xiang
,
Kazuo Ushijima
,
Changjie Tang
Information Processing Letters
77
(5-6), 2001, pp. 231-238
Some undecidable problems for parallel communicating finite automata systems
Carlos Martín-Vide
,
Victor Mitrana
Information Processing Letters
77
(5-6), 2001, pp. 239-245
On local modularity variants and
\Pi
-institutions
Paulo A.S. Veloso
,
Sheila R.M. Veloso
Information Processing Letters
77
(5-6), 2001, pp. 247-253
A Sperner lemma complete for PPA
Michelangelo Grigni
Information Processing Letters
77
(5-6), 2001, pp. 255-259
Robot localization in a grid
Chinda Wongngamnit
,
Dana Angluin
Information Processing Letters
77
(5-6), 2001, pp. 261-267
Factorization of de Bruijn digraphs by cycle-rooted trees
Hiroyuki Kawei
,
Naohiro Fujikake
,
Yukio Shibata
Information Processing Letters
77
(5-6), 2001, pp. 269-275
A new graph characteristic and its application to numerical computability
Frank Harary
,
Vladik Kreinovich
,
Luc Longpré
Information Processing Letters
77
(5-6), 2001, pp. 277-282
A minimal property for characterizing deadlock-free programs
Vicent Cholvi
,
Pablo Boronat
Information Processing Letters
77
(5-6), 2001, pp. 283-290
Seiten
<
1
2
3
4
5
6