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=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding a minimum feedback arc set in reducible flow graphs
Vijaya Ramachandran
Journal of Algorithms
9
, 1988, pp. 299-313
Stability in circular arc graphs
Martin Charles Golumbic
,
Peter L. Hammer
Journal of Algorithms
9
, 1988, pp. 314-320
A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm
Alejandro A. Schäffer
Journal of Algorithms
9
, 1988, pp. 321-342
Solution to a linear diophantine equation for nonnegative integers
Harold Greenberg
Journal of Algorithms
9
, 1988, pp. 343-353
Addition requirements for matrix and transposed matrix products
Michael Kaminski
,
David G. Kirkpatrick
,
Nader H. Bshouty
Journal of Algorithms
9
, 1988, pp. 354-364
Probabilistic computation of integer polynomial GCDs
A. Schönhage
Journal of Algorithms
9
, 1988, pp. 365-371
On rectangular visibility
Mark H. Overmars
,
Derick Wood
Journal of Algorithms
9
, 1988, pp. 372-390
Factoring polynomials over finite fields
Lajos Rónyai
Journal of Algorithms
9
, 1988, pp. 391-400
Diameters of weighted double loop networks
Ying Cheng
,
Frank K. Hwang
Journal of Algorithms
9
, 1988, pp. 401-410
Algorithms for two bottleneck optimization problems
Harold N. Gabow
,
Robert E. Tarjan
Journal of Algorithms
9
, 1988, pp. 411-417
The concave least-weight subsequence problem revisited
Robert Wilber
Journal of Algorithms
9
, 1988, pp. 418-425
The
NP
-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
9
, 1988, pp. 426-444
Solving the two-dimensional findpath problem using a line-triangle representation of the robot
B.K. Bhattacharya
,
J. Zorbas
Journal of Algorithms
9
, 1988, pp. 449-469
A contraction algorithm for finding small cycle cutsets
Hanoch Levy
,
David W. Low
Journal of Algorithms
9
, 1988, pp. 470-493
Zero divisors in quaternion algebras
Lajos Rónyai
Journal of Algorithms
9
, 1988, pp. 494-506
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
J. Cheriyan
,
S.N. Maheshwari
Journal of Algorithms
9
, 1988, pp. 507-537
On the complexity of searching game trees and other recursion trees
Ingo Althöfer
Journal of Algorithms
9
, 1988, pp. 538-567
Fault tolerant distributed majority commitment
Reuven Bar-Yehuda
,
Shay Kutten
Journal of Algorithms
9
, 1988, pp. 568-582
An algorithm for the Lorenz measure in locational decisions on trees
Oded Maimon
Journal of Algorithms
9
, 1988, pp. 583-596
On a conjecture by Plaisted and Hong
S. Olariu
,
S. Toida
,
M. Zubair
Journal of Algorithms
9
, 1988, pp. 597-598