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=J. Algorithms AND Volume=16
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improving greedy algorithms by lookahead-search
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. DeSarkar
Journal of Algorithms
16
(1), 1994, pp. 1-23
A deterministic method for computing splitting elements in simple algebras over
Q
Lajos Rónyai
Journal of Algorithms
16
(1), 1994, pp. 24-32
Approximate tree matching in the presence of variable length don't cares
Kaizhong Zhang
,
Dennis Shasha
,
Jason T.L. Wang
Journal of Algorithms
16
(1), 1994, pp. 33-66
A general method and a master theorem for divide-and-conquer recurrences with applications
Rakesh M. Verma
Journal of Algorithms
16
(1), 1994, pp. 67-79
The algorithmic aspects of the regularity lemma
N. Alon
,
R.A. Duke
,
H. Lefmann
,
V. Rödl
,
R. Yuster
Journal of Algorithms
16
(1), 1994, pp. 80-109
Two fast GCD algorithms
Jonathan Sorenson
Journal of Algorithms
16
(1), 1994, pp. 110-144
An
O(n^2)
algorithm for undirected split decomposition
Tze-Heng Ma
,
Jeremy Spinrad
Journal of Algorithms
16
(1), 1994, pp. 145-160
Fastest pattern matching in strings
Livio Colussi
Journal of Algorithms
16
(2), 1994, pp. 163-189
A simpler parallel algorithm for graph connectivity
Kazuo Iwama
,
Yahiko Kambayashi
Journal of Algorithms
16
(2), 1994, pp. 190-217
A polynomial time algorithm for unidimensional unfolding representations
Jean-Paul Doignon
,
Jean-Claude Falmagne
Journal of Algorithms
16
(2), 1994, pp. 218-233
Generosity helps or an 11-competitive algorithm for three servers
Marek Chrobak
,
Lawrence L. Larmore
Journal of Algorithms
16
(2), 1994, pp. 234-263
Recognition of circle graphs
Jeremy Spinrad
Journal of Algorithms
16
(2), 1994, pp. 264-282
An
O(n^2)
divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs
Andrzej Ehrenfeucht
,
Harold N. Gabow
,
Ross M. McConnell
,
Stephen J. Sullivan
Journal of Algorithms
16
(2), 1994, pp. 283-294
Faster parallel string matching via larger deterministic samples
Tal Goldberg
,
Uri Zwick
Journal of Algorithms
16
(2), 1994, pp. 295-308
The minimal Euclidean norm of an algebraic number is effectively computable
Michael Filaseta
,
M.L. Robinson
,
Ferrell S. Wheeler
Journal of Algorithms
16
(2), 1994, pp. 309-333
Logarithmic depth circuits for Hermite interpolation
Wayne Eberly
Journal of Algorithms
16
(3), 1994, pp. 335-360
On the complexity of certified write-all algorithms
Charles Martel
,
Ramesh Subramonian
Journal of Algorithms
16
(3), 1994, pp. 361-387
Tree compatibility and inferring evolutionary history
Tandy J. Warnow
Journal of Algorithms
16
(3), 1994, pp. 388-407
Parametric problems on graphs of bounded tree-width
David Fernández-Baca
,
Giora Slutzki
Journal of Algorithms
16
(3), 1994, pp. 408-430
Minimizing maximum weighted error for imprecise computation tasks
Kevin I.-J. Ho
,
Joseph Y-T. Leung
,
W-D. Wei
Journal of Algorithms
16
(3), 1994, pp. 431-452
Some efficient algorithms for permutation graphs
Oscar H. Ibarra
,
Qi Zheng
Journal of Algorithms
16
(3), 1994, pp. 453-469
Bounded tree-width and LOGCFL
Egon Wanke
Journal of Algorithms
16
(3), 1994, pp. 470-491