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=88
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient algorithm for Horn description
Jean-Jacques Hébrard
,
Bruno Zanuttini
Information Processing Letters
88
(4), 2003, pp. 177-182
Improvement of the Miyazaki-Takaragi threshold digital signature scheme
Tzong-Sun Wu
,
Chien-Lung Hsu
,
Han-Yu Lin
,
Po-Sheng Huang
Information Processing Letters
88
(4), 2003, pp. 183-186
Distributed algorithms for finding and maintaining a
k
-tree core in a dynamic network
Saurabh Srivastava
,
R.K. Ghosh
Information Processing Letters
88
(4), 2003, pp. 187-194
Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
Jianjun Zhou
,
Martin Müller
Information Processing Letters
88
(4), 2003, pp. 195-200
Erratum to ''Digital signature algorithm for securing digital identities''
Taekyoung Kwon
Information Processing Letters
88
(4), 2003, pp. 201-202
A new differential LSI space-based probabilistic document classifier
Liang Chen
,
Naoyuki Tokuda
,
Akira Nagai
Information Processing Letters
88
(5), 2003, pp. 203-212
Complexity classes and fragments of
C
Lars Kristiansen
,
Paul J. Voda
Information Processing Letters
88
(5), 2003, pp. 213-218
The complexity of economic equilibria for house allocation markets
Sándor P. Fekete
,
Martin Skutella
,
Gerhard J. Woeginger
Information Processing Letters
88
(5), 2003, pp. 219-223
Salembier's min-tree algorithm turned into breadth first search
Wim H. Hesselink
Information Processing Letters
88
(5), 2003, pp. 225-229
A new approach for approximating node deletion problems
Michael Okun
,
Amnon Barak
Information Processing Letters
88
(5), 2003, pp. 231-236
Estimating network size from local information
Keren Horowitz
,
Dahlia Malkhi
Information Processing Letters
88
(5), 2003, pp. 237-243
A topological characterization of random sequences
Cristian S. Calude
,
Solomon Marcus
,
Ludwig Staiger
Information Processing Letters
88
(5), 2003, pp. 245-250
Bounding restricted rotation distance
Sean Cleary
,
Jennifer Taback
Information Processing Letters
88
(5), 2003, pp. 251-256
Erratum to ''A note on monotone complexity and the rank of matrices''
Anna Gál
,
Pavel Pudlák
Information Processing Letters
88
(5), 2003, pp. 257-257
Sparse LCS common substring alignment
Gad M. Landau
,
Baruch Schieber
,
Michal Ziv-Ukelson
Information Processing Letters
88
(6), 2003, pp. 259-270
A fault-tolerant wormhole routing scheme for torus networks with nonconvex faults
Jau-Der Shih
Information Processing Letters
88
(6), 2003, pp. 271-278
Estimating the result size of a query to velocity skewed moving objects
Yong-Jin Choi
,
Ho-Hyun Park
,
Chin-Wan Chung
Information Processing Letters
88
(6), 2003, pp. 279-285
Edge-pancyclicity of recursive circulants
Toru Araki
Information Processing Letters
88
(6), 2003, pp. 287-292
On the security of cryptosystem using automorphism groups
Seong-Hun Paeng
Information Processing Letters
88
(6), 2003, pp. 293-298
A constructive count of rotation symmetric functions
Pantelimon Stȃnicȃ
,
Subhamoy Maitra
Information Processing Letters
88
(6), 2003, pp. 299-304
Some optimization problems on weak-bisplit graphs
Jean-Marie Vanherpe
Information Processing Letters
88
(6), 2003, pp. 305-310
Seiten
<
1
2