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=Inf.~Process.~Lett. AND Volume=98
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved generalized Atkin algorithm for computing square roots in finite fields
Fanyu Kong
,
Zhun Cai
,
Jia Yu
,
Daxing Li
Information Processing Letters
98
(1), 2006, pp. 1-5
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
Henrik Brosenne
,
Matthias Homeister
,
Stephan Waack
Information Processing Letters
98
(1), 2006, pp. 6-10
Using postdomination to reduce space requirements of data flow analysis
C. Bernardeschi
,
G. Lettieri
,
L. Martini
,
P. Masci
Information Processing Letters
98
(1), 2006, pp. 11-18
Fraction interpolation walking a Farey tree
Marc Mosko
,
J.J. Garcia-Luna-Aceves
Information Processing Letters
98
(1), 2006, pp. 19-23
Optimal 2-constraint satisfaction via sum-product algorithms
Mikko Koivisto
Information Processing Letters
98
(1), 2006, pp. 24-28
Approximating minimum coloring and maximum independent set in dotted interval graphs
Minghui Jiang
Information Processing Letters
98
(1), 2006, pp. 29-33
A simple algorithm for in-place merging
Jing-Chao Chen
Information Processing Letters
98
(1), 2006, pp. 34-40
Low-complex dynamic programming algorithm for hardware/software partitioning
Jigang Wu
,
Thambipillai Srikanthan
Information Processing Letters
98
(2), 2006, pp. 41-46
Test suite oscillations
Borislav Nikolik
Information Processing Letters
98
(2), 2006, pp. 47-55
Applying adaptive test cases to nondeterministic implementations
R.M. Hierons
Information Processing Letters
98
(2), 2006, pp. 56-60
On the complexity of extension checking in default logic
Paolo Liberatore
Information Processing Letters
98
(2), 2006, pp. 61-65
Construction of Aho Corasick automaton in linear time for integer alphabets
Shiri Dori
,
Gad M. Landau
Information Processing Letters
98
(2), 2006, pp. 66-72
Single machine scheduling with batch-dependent setup times
Gur Mosheiov
,
Daniel Oron
Information Processing Letters
98
(2), 2006, pp. 73-78
The diameter of Hanoi graphs
Daniel Berend
,
Amir Sapir
Information Processing Letters
98
(2), 2006, pp. 79-85
The pair completion algorithm for the homogeneous set sandwich problem
Claudson Bornstein
,
Celina M.H. de Figueiredo
,
Vinícius G.P. de Sá
Information Processing Letters
98
(3), 2006, pp. 87-91
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
98
(3), 2006, pp. 92-95
Vertex rankings of chordal graphs and weighted trees
Dariusz Dereniowski
,
Adam Nadolski
Information Processing Letters
98
(3), 2006, pp. 96-100
\Delta
-list vertex coloring in linear time
San Skulrattanakulchai
Information Processing Letters
98
(3), 2006, pp. 101-106
Adaptive general perfectly periodic scheduling
Shailesh Patil
,
Vijay K. Garg
Information Processing Letters
98
(3), 2006, pp. 107-114
Depth of nodes in random recursive
k
-ary trees
Mehri Javanian
,
Mohammad Q. Vahidi-Asl
Information Processing Letters
98
(3), 2006, pp. 115-118
QoS based resource scheduling by computational economy in computational grid
Li Chunlin
,
Li Layuan
Information Processing Letters
98
(3), 2006, pp. 119-126
Smaller superconcentrators of density 28
Uwe Schöning
Information Processing Letters
98
(4), 2006, pp. 127-129
Improved algorithm for the symmetry number problem on trees
Yijie Han
Information Processing Letters
98
(4), 2006, pp. 130-132
Structure and linear time recognition of 3-leaf powers
Andreas Brandstädt
,
Van Bang Le
Information Processing Letters
98
(4), 2006, pp. 133-138
Finding routes in anonymous sensor networks
Renato C. Dutra
,
Valmir C. Barbosa
Information Processing Letters
98
(4), 2006, pp. 139-144
Seiten 1
2
>