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 Volume=104
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Commutativity of quantum weakest preconditions
Mingsheng Ying
,
Jianxin Chen
,
Yuan Feng
,
Runyao Duan
Information Processing Letters
104
(4), 2007, pp. 152-158
Bounding component sizes of two-connected Steiner networks
K. Hvam
,
L. Reinhardt
,
P. Winter
,
M. Zachariasen
Information Processing Letters
104
(5), 2007, pp. 159-163
A note on emptiness for alternating finite automata with a one-letter alphabet
Petr Janc̑ar
,
Zdenȇk Sawa
Information Processing Letters
104
(5), 2007, pp. 164-167
On estimating the time taken to rectify faults in a software package during the system testing phase
Rahul Roy
,
Amitava Bagchi
Information Processing Letters
104
(5), 2007, pp. 168-172
Approximating the minmax rooted-tree cover in a tree
Hiroshi Nagamochi
,
Kohei Okada
Information Processing Letters
104
(5), 2007, pp. 173-178
On insecurity of Naor-Pinkas' distributed oblivious transfer
Hossein Ghodosi
Information Processing Letters
104
(5), 2007, pp. 179-182
Cryptanalysis of an involutional block cipher using cellular automata
Jaechul Sung
,
Deukjo Hong
,
Seokhie Hong
Information Processing Letters
104
(5), 2007, pp. 183-185
New length bounds for cycle bases
Michael Elkin
,
Christian Liebchen
,
Romeo Rizzi
Information Processing Letters
104
(5), 2007, pp. 186-193
Some observations on
LR
-like parsing with delayed reduction
E. Bertsch
,
M.-J. Nederhof
Information Processing Letters
104
(6), 2007, pp. 195-199
Canonical density control
Alon Itai
,
Irit Katriel
Information Processing Letters
104
(6), 2007, pp. 200-204
Optimal implementations of UPGMA and other common clustering algorithms
Ilan Gronau
,
Shlomo Moran
Information Processing Letters
104
(6), 2007, pp. 205-210
Cycles passing through prescribed edges in a hypercube with some faulty edges
Xie-Bin Chen
Information Processing Letters
104
(6), 2007, pp. 211-215
Simulated annealing versus metropolis for a TSP instance
Klaus Meer
Information Processing Letters
104
(6), 2007, pp. 216-219
Note on covering monotone orthogonal polygons with star-shaped polygons
Andrzej Lingas
,
Agnieszka Wasylewicz
,
Paweƚ Żyliński
Information Processing Letters
104
(6), 2007, pp. 220-227
Subtree filament graphs are subtree overlap graphs
Jessica Enright
,
Lorna Stewart
Information Processing Letters
104
(6), 2007, pp. 228-232
Seiten
<
1
2