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=1983
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
NP
-completeness of finding the chromatic index of regular graphs
Daniel Leven
,
Zvi Galil
Journal of Algorithms
4
, 1983, pp. 35-44
The
NP
-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
4
, 1983, pp. 87-100
Shifting algorithms for tree partitioning with general weighting functions
Ronald I. Becker
,
Yehoshua Perl
Journal of Algorithms
4
, 1983, pp. 101-120
Efficient algorithms for computing the maximum distance between two finite planar sets
Binay K. Bhattacharya
,
Godfried T. Toussaint
Journal of Algorithms
4
, 1983, pp. 121-136
Certain systems of bilinear forms whose minimal algorithms are all quadratic
Ephraim Feig
Journal of Algorithms
4
, 1983, pp. 137-149
On the generation of all topological sortings
Alan D. Kalvin
,
Yaakov L. Varol
Journal of Algorithms
4
, 1983, pp. 150-162
Computing normalizers in permutation groups
Gregory Butler
Journal of Algorithms
4
, 1983, pp. 163-175
The
NP
-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
4
, 1983, pp. 189-203
The random selection of unlabeled graphs
John D. Dixon
,
Herbert S. Wilf
Journal of Algorithms
4
, 1983, pp. 205-213
Random spanning tree
A. Guénoche
Journal of Algorithms
4
, 1983, pp. 214-220
A formal account of some elementary continued fraction algorithms
W.M. Beynon
Journal of Algorithms
4
, 1983, pp. 221-240
Multiterminal flows in outerplanar networks
T.C. Hu
,
M.T. Shing
Journal of Algorithms
4
, 1983, pp. 241-261
An
O(n\log m)
algorithm for the Josephus problem
Errol L. Lloyd
Journal of Algorithms
4
, 1983, pp. 262-270
An algorithm for parallel evaluation of functions
Eliezer L. Lozinskii
Journal of Algorithms
4
, 1983, pp. 271-281
On the minimum number of additions required to compute a quadratic form
C. Pandu Rangan
Journal of Algorithms
4
, 1983, pp. 282-285
The
NP
-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
4
, 1983, pp. 286-300
The complexity of finding generalized paths in tournaments
Pavol Hell
,
Moshe Rosenfeld
Journal of Algorithms
4
, 1983, pp. 303-309
Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
Hiroshi Imai
,
Takao Asano
Journal of Algorithms
4
, 1983, pp. 310-323
Finding the convex hull of a simple polygon
Ronald L. Graham
,
F. Frances Yao
Journal of Algorithms
4
, 1983, pp. 324-331
Fast compact prime number sieves (among others)
Paul Pritchard
Journal of Algorithms
4
, 1983, pp. 332-344
The
NP
-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
4
, 1983, pp. 397-411