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=62
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The strong equivalence of ET0L grammars
Gabriel Istrate
Information Processing Letters
62
(4), 1997, pp. 171-176
Cancellation is exponentially powerful for computing the determinant
Rimli Sengupta
Information Processing Letters
62
(4), 1997, pp. 177-181
Unification for infinite sets of equations between finite terms
Wan Fokkink
Information Processing Letters
62
(4), 1997, pp. 183-188
A conference key distribution system for the star configuration based on the discrete logarithm problem
Shouichi Hirose
,
Katsuo Ikeda
Information Processing Letters
62
(4), 1997, pp. 189-192
Maintaining transitive closure in first order after node-set and edge-set deletions
Guozhu Dong
,
Chaoyi Pang
Information Processing Letters
62
(4), 1997, pp. 193-199
Node-to-set disjoint paths problem in star graphs
Qian-Ping Gu
,
Shietung Peng
Information Processing Letters
62
(4), 1997, pp. 201-207
Complexity and dimension
Felipe Cucker
,
Pascal Koiran
,
Martín Matamala
Information Processing Letters
62
(4), 1997, pp. 209-212
Average competitive ratios of on-line spanning trees
Feng Bao
,
Aohan Mei
,
Yoshihide Igarashi
Information Processing Letters
62
(4), 1997, pp. 213-216
A polynomial-time algorithm for knapsack with divisible item sizes
W.F.J. Verhaegh
,
E.H.L. Aarts
Information Processing Letters
62
(4), 1997, pp. 217-221
Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa
Md. Mozammel Huq Azad Khan
,
Md. Shamsul Alam
Information Processing Letters
62
(5), 1997, pp. 223-230
Spanners of de Bruijn and Kautz graphs
Rabah Harbane
,
Carles Padró
Information Processing Letters
62
(5), 1997, pp. 231-236
Spanners of underlying graphs of iterated line digraphs
Rabah Harbane
,
Carles Padró
Information Processing Letters
62
(5), 1997, pp. 237-244
An optimal algorithm for realizing a Delaunay triangulation
Timothy Lambert
Information Processing Letters
62
(5), 1997, pp. 245-250
On the Clark-Jacob version of SPLICE/AS
James W. Gray III
Information Processing Letters
62
(5), 1997, pp. 251-254
On keys and normal forms
Wai Yin Mok
Information Processing Letters
62
(5), 1997, pp. 255-258
Compressibility and uniform complexity
Montserrat Hermo
Information Processing Letters
62
(5), 1997, pp. 259-264
On decision trees for orthants
V.A. Vassiliev
Information Processing Letters
62
(5), 1997, pp. 265-268
A verification algorithm for inheritance hierarchies in object-oriented databases
Anna Formica
,
Michele Missikoff
Information Processing Letters
62
(5), 1997, pp. 269-279
An
O(n)
time algorithm for maximum matching in
P_4
-tidy graphs
J.L. Fouquet
,
I. Parfenoff
,
H. Thuillier
Information Processing Letters
62
(6), 1997, pp. 281-287
On some factorizations of infinite words by elements of codes
J. Justin
,
G. Pirillo
Information Processing Letters
62
(6), 1997, pp. 289-294
A note on optical routing on trees
S. Ravi Kumar
,
Rina Panigrahy
,
Alexander Russell
,
Ravi Sundaram
Information Processing Letters
62
(6), 1997, pp. 295-300
An improved lower bound for load balancing of tasks with unknown duration
Yuan Ma
,
Serge Plotkin
Information Processing Letters
62
(6), 1997, pp. 301-303
Systematic debugging method for attribute grammar description
Masataka Sassa
,
Takuya Ookubo
Information Processing Letters
62
(6), 1997, pp. 305-313
A linear-time algorithm for four-partitioning four-connected planar graphs
Shin-ichi Nakano
,
Md. Saidur Rahman
,
Takao Nishizeki
Information Processing Letters
62
(6), 1997, pp. 315-322
A parallel algorithm for solving the coloring problem on trapezoid graphs
Shin-ichi Nakayama
,
Shigeru Masuyama
Information Processing Letters
62
(6), 1997, pp. 323-327
Seiten
<
1
2
3
>