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 YEAR=1984
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
J.Y.-T. Leung
Journal of Algorithms
5
(1), 1984, pp. 22-35
An
O(N^2)
algorithm for coloring perfect planar graphs
A. Tucker
,
D. Wilson
Journal of Algorithms
5
(1), 1984, pp. 60-68
Optimal binary split trees
S.-H.S. Huang
,
C.K. Wong
Journal of Algorithms
5
(1), 1984, pp. 69-79
Efficient algorithms for a family of matroid intersection problems
H.N. Gabow
,
R.E. Tarjan
Journal of Algorithms
5
(1), 1984, pp. 80-131
Problems
Leo J. Guibas
Journal of Algorithms
5
, 1984, pp. 145-146
The
NP
-completeness column: An ongoing guide
D.S. Johnson
Journal of Algorithms
5
(1), 1984, pp. 147-160
Heuristic matching for graphs satisfying the triangle inequality
D.A. Plaisted
Journal of Algorithms
5
(2), 1984, pp. 163-179
Finding the number of factors of a polynomial
P.J. Weinberger
Journal of Algorithms
5
(2), 1984, pp. 180-186
A linear algorithm for nonhomogeneous spectra of numbers
M. Boshernitzan
,
A.S. Fraenkel
Journal of Algorithms
5
(2), 1984, pp. 187-198
Optimal algorithms to compute the closure of a set of iso-rectangles
E. Soisalon-Soininen
,
D. Wood
Journal of Algorithms
5
(2), 1984, pp. 199-214
Characterizations of totally balanced matrices
R.P. Anstee
,
M. Farber
Journal of Algorithms
5
(2), 1984, pp. 215-230
Generating random regular graphs
N.C. Wormald
Journal of Algorithms
5
(2), 1984, pp. 247-280
An efficient algorithm for generating all
k
-subsets (
1\leq k\leq m\leq n
) of the set
\{1,2,\ldots,n\}
in lexicographical order
I. Semba
Journal of Algorithms
5
(2), 1984, pp. 281-283
The NP-completeness column: An ongoing guide
D.S. Johnson
Journal of Algorithms
5
(2), 1984, pp. 284-299
An optimal contour algorithm for iso-oriented rectangles
R.H. Güting
Journal of Algorithms
5
(3), 1984, pp. 303-326
On symmetric algorithms for bilinear forms over finite fields
G. Seroussi
,
A. Lempel
Journal of Algorithms
5
(3), 1984, pp. 327-344
A non-factorial algorithm for canonical numbering of a graph
D. Corneil
,
M. Goldberg
Journal of Algorithms
5
(3), 1984, pp. 345-362
Short monotone formulae for the majority function
L.G. Valiant
Journal of Algorithms
5
(3), 1984, pp. 363-366
Optimum split trees
Y. Perl
Journal of Algorithms
5
(3), 1984, pp. 367-374
Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations
P. Rosenstiehl
,
R.E. Tarjan
Journal of Algorithms
5
(3), 1984, pp. 375-390
A separator theorem for graphs of bounded genus
J.R. Gilbert
,
J.P. Hutchinson
,
R.E. Tarjan
Journal of Algorithms
5
(3), 1984, pp. 391-407
An
O(n\log n)
algorithm for finding all repetitions in a string
M.G. Main
,
R.J. Lorentz
Journal of Algorithms
5
(3), 1984, pp. 422-432
The NP-completeness column: An ongoing guide
D.S. Johnson
Journal of Algorithms
5
(3), 1984, pp. 433-447
The analysis of linear probing sort by the use of a new mathematical transform
G.H. Gonnet
,
J.I. Munro
Journal of Algorithms
5
(4), 1984, pp. 451-470
Multiplying Schur functions
J.B. Remmel
,
R. Whitney
Journal of Algorithms
5
(4), 1984, pp. 471-487
Seiten 1
2
>