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=59
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A linear time algorithm for the bootleneck biconnected spanning subgraph problem
Gurmeet Singh Manku
Information Processing Letters
59
(1), 1996, pp. 1-7
An
O(|V|*|E|)
algorithm for finding immediate multiple-vertex dominators
Stephen Alstrup
,
Jens Clausen
,
Kristian Jrgensen
Information Processing Letters
59
(1), 1996, pp. 9-11
Decidability results concerning
k
-limited ED0L systems
Dietmar Wätjen
,
Heike Spilker
Information Processing Letters
59
(1), 1996, pp. 13-17
Exact VC-dimension of Boolean monomials
Thomas Natschläger
,
Michael Schmitt
Information Processing Letters
59
(1), 1996, pp. 19-20
Fast and practical approximate string matching
Ricardo A. Baeza-Yates
,
Chris H. Perleberg
Information Processing Letters
59
(1), 1996, pp. 21-27
On the number of ANDs versus the number of ORs in monotone Boolean circuits
Uri Zwick
Information Processing Letters
59
(1), 1996, pp. 29-30
A simple scheme to construct
k
-coteries with
O(\sqrt{N})
Yu-chen Kuo
,
Shing-Tsaan Huang
Information Processing Letters
59
(1), 1996, pp. 31-36
A subexponential exact learning algorithm for DNF using equivalence queries
Nader H. Bshouty
Information Processing Letters
59
(1), 1996, pp. 37-39
On the number of small cuts in a graph
Monika Henzinger
,
David P. Williamson
Information Processing Letters
59
(1), 1996, pp. 41-44
A frame for general divide-and-conquer recurrences
Xiaodong Wang
,
Qingxiang Fu
Information Processing Letters
59
(1), 1996, pp. 45-51
Maintaining a topological order under edge insertions
Alberto Marchetti-Spaccamela
,
Umberto Nanni
,
Hans Rohnert
Information Processing Letters
59
(1), 1996, pp. 53-58
A note on approximation of the vertex cover and feedback vertex set problems - Unified approach
Toshihiro Fujito
Information Processing Letters
59
(2), 1996, pp. 59-63
Parallel lossless image compression using Huffman and arithmetic coding
Paul G. Howard
,
Jeffrey Scott Vitter
Information Processing Letters
59
(2), 1996, pp. 65-73
A lower bound technique for the size of nondeterministic finite automata
Ian Glaister
,
Jeffrey Shallit
Information Processing Letters
59
(2), 1996, pp. 75-77
A space-efficient fast prime number sieve
Brian Dunten
,
Julie Jones
,
Jonathan Sorenson
Information Processing Letters
59
(2), 1996, pp. 79-84
Optimal broadcasting in the back to back
d
-ary trees
Dominique Barth
Information Processing Letters
59
(2), 1996, pp. 85-89
On-line longest fragment first parsing algorithm
Hideo Nagumo
,
Mi Lu
,
Karan Watson
Information Processing Letters
59
(2), 1996, pp. 91-96
Tree 3-spanners on interval, permutation and regular bipartite graphs
M.S. Madanlal
,
G. Venkatesan
,
C. Pandu Rangan
Information Processing Letters
59
(2), 1996, pp. 97-102
A linear time algorithm for finding all hinge vertices of a permutation graph
Ting-Yem Ho
,
Yue-Li Wang
,
Ming-Tsan Juan
Information Processing Letters
59
(2), 1996, pp. 103-107
Semantics-based transaction management for multidatabase systems
Soon M. Chung
,
Pyeong S. Mah
Information Processing Letters
59
(2), 1996, pp. 109-115
Optimal parallel selection in sorted matrices
Hong Shen
,
Sarnath Ramnath
Information Processing Letters
59
(3), 1996, pp. 117-122
Matching nuts and bolts faster
Noga Alon
,
Phillip G. Bradford
,
Rudolf Fleischer
Information Processing Letters
59
(3), 1996, pp. 123-127
Splicing systems with targets are computationally universal
Gheorghe Păun
Information Processing Letters
59
(3), 1996, pp. 129-133
Denotational linear time semantics and sequential composition
Christel Baier
,
Mila E. Majster-Cederbaum
Information Processing Letters
59
(3), 1996, pp. 135-143
An efficient distributed algorithm for centering a spanning tree of a biconnected graph
R.F.M. Aranha
,
C. Pandu Rangan
Information Processing Letters
59
(3), 1996, pp. 145-150
Seiten 1
2
3
>