Johnson, David S. The NP-completeness column: An ongoing guide. XVI. (English) Zbl 0608.68032 J. Algorithms 6, 434-451 (1985). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{D. S. Johnson}, J. Algorithms 6, 434--451 (1985; Zbl 0608.68032) Full Text: DOI
Knuth, Donald E. Dynamic Huffman coding. (English) Zbl 0606.94007 J. Algorithms 6, 163-180 (1985). MSC: 94A45 68P05 68R10 PDF BibTeX XML Cite \textit{D. E. Knuth}, J. Algorithms 6, 163--180 (1985; Zbl 0606.94007) Full Text: DOI
Edelsbrunner, H. Computing the extreme distances between two convex polygons. (English) Zbl 0604.68079 J. Algorithms 6, 213-224 (1985). MSC: 68R99 52A10 68Q25 PDF BibTeX XML Cite \textit{H. Edelsbrunner}, J. Algorithms 6, 213--224 (1985; Zbl 0604.68079) Full Text: DOI
Kantor, William M. Polynomial-time algorithms for finding elements of prime order and Sylow subgroups. (English) Zbl 0604.20001 J. Algorithms 6, 478-514 (1985). Reviewer: G.Butler MSC: 20-04 68Q25 20B35 20D20 20F05 20D06 PDF BibTeX XML Cite \textit{W. M. Kantor}, J. Algorithms 6, 478--514 (1985; Zbl 0604.20001) Full Text: DOI
Bender, Edward A.; Wilf, Herbert S. A theoretical analysis of backtracking in the graph coloring problem. (English) Zbl 0601.68039 J. Algorithms 6, 275-282 (1985). MSC: 68R10 68Q25 05C15 PDF BibTeX XML Cite \textit{E. A. Bender} and \textit{H. S. Wilf}, J. Algorithms 6, 275--282 (1985; Zbl 0601.68039) Full Text: DOI
Farber, Martin; Keil, J. Mark Domination in permutation graphs. (English) Zbl 0598.05056 J. Algorithms 6, 309-321 (1985). Reviewer: M.M.Sysło MSC: 05C70 68Q25 PDF BibTeX XML Cite \textit{M. Farber} and \textit{J. M. Keil}, J. Algorithms 6, 309--321 (1985; Zbl 0598.05056) Full Text: DOI
Knuth, Donald E. An analysis of optimum caching. (English) Zbl 0594.68016 J. Algorithms 6, 181-199 (1985). MSC: 68P05 68N25 PDF BibTeX XML Cite \textit{D. E. Knuth}, J. Algorithms 6, 181--199 (1985; Zbl 0594.68016) Full Text: DOI
Bagchi, A.; Srimani, P. K. Weighted heuristic search in networks. (English) Zbl 0593.90079 J. Algorithms 6, 550-576 (1985). MSC: 90C35 68Q25 PDF BibTeX XML Cite \textit{A. Bagchi} and \textit{P. K. Srimani}, J. Algorithms 6, 550--576 (1985; Zbl 0593.90079) Full Text: DOI
Yao, Andrew C. On optimal arrangements of keys with double hashing. (English) Zbl 0593.68076 J. Algorithms 6, 253-264 (1985). MSC: 68P20 68R10 68Q25 68P10 PDF BibTeX XML Cite \textit{A. C. Yao}, J. Algorithms 6, 253--264 (1985; Zbl 0593.68076) Full Text: DOI
Stout, Quentin F. Pyramid computer solutions of the closest pair problem. (English) Zbl 0593.68061 J. Algorithms 6, 200-212 (1985). MSC: 68T10 68Q80 68Q25 PDF BibTeX XML Cite \textit{Q. F. Stout}, J. Algorithms 6, 200--212 (1985; Zbl 0593.68061) Full Text: DOI
Proskurowski, Andrzej; Ruskey, Frank Binary tree Gray codes. (English) Zbl 0593.68050 J. Algorithms 6, 225-238 (1985). MSC: 68R10 05-04 PDF BibTeX XML Cite \textit{A. Proskurowski} and \textit{F. Ruskey}, J. Algorithms 6, 225--238 (1985; Zbl 0593.68050) Full Text: DOI
Gavril, Fanica; Schönheim, Johanan Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs. (English) Zbl 0593.68048 J. Algorithms 6, 239-252 (1985). MSC: 68R10 05C05 PDF BibTeX XML Cite \textit{F. Gavril} and \textit{J. Schönheim}, J. Algorithms 6, 239--252 (1985; Zbl 0593.68048) Full Text: DOI
Hassin, Refael; Megiddo, Nimrod An optimal algorithm for finding all the jumps of a monotone step-function. (English) Zbl 0593.68037 J. Algorithms 6, 265-274 (1985). MSC: 68Q25 68P10 91A05 PDF BibTeX XML Cite \textit{R. Hassin} and \textit{N. Megiddo}, J. Algorithms 6, 265--274 (1985; Zbl 0593.68037) Full Text: DOI
Bollobás, Béla; Simon, Istvan Repeated random insertion into a priority queue. (English) Zbl 0592.68022 J. Algorithms 6, 466-477 (1985). MSC: 68P05 68W99 68P10 PDF BibTeX XML Cite \textit{B. Bollobás} and \textit{I. Simon}, J. Algorithms 6, 466--477 (1985; Zbl 0592.68022) Full Text: DOI
Domanski, B.; Anshel, M. The complexity of Dehn’s algorithm for word problems in groups. (English) Zbl 0591.20037 J. Algorithms 6, 543-549 (1985). Reviewer: L.A.Bokut’ MSC: 20F10 03D15 03D40 PDF BibTeX XML Cite \textit{B. Domanski} and \textit{M. Anshel}, J. Algorithms 6, 543--549 (1985; Zbl 0591.20037) Full Text: DOI
Johnson, David S. The NP-completeness column: An ongoing guide. (English) Zbl 0588.68020 J. Algorithms 6, 291-305 (1985). MSC: 68Q25 05C45 PDF BibTeX XML Cite \textit{D. S. Johnson}, J. Algorithms 6, 291--305 (1985; Zbl 0588.68020) Full Text: DOI
Dobkin, David P.; Munro, J. Ian Efficient uses of the past. (English) Zbl 0584.68100 J. Algorithms 6, 455-465 (1985). MSC: 68P20 68P05 PDF BibTeX XML Cite \textit{D. P. Dobkin} and \textit{J. I. Munro}, J. Algorithms 6, 455--465 (1985; Zbl 0584.68100) Full Text: DOI
Edelsbrunner, Herbert; Overmars, Mark H. Batched dynamic solutions to decomposable searching problems. (English) Zbl 0584.68076 J. Algorithms 6, 515-542 (1985). MSC: 68P10 68P20 68Q25 PDF BibTeX XML Cite \textit{H. Edelsbrunner} and \textit{M. H. Overmars}, J. Algorithms 6, 515--542 (1985; Zbl 0584.68076) Full Text: DOI Link
Megiddo, Nimrod Partitioning with two lines in the plane. (English) Zbl 0582.51013 J. Algorithms 6, 430-433 (1985). Reviewer: F.Plastria MSC: 51M15 51-04 68Q25 51M05 68W99 PDF BibTeX XML Cite \textit{N. Megiddo}, J. Algorithms 6, 430--433 (1985; Zbl 0582.51013) Full Text: DOI
Irving, Robert W. An efficient algorithm for the ”stable roommates” problem. (English) Zbl 0581.05001 J. Algorithms 6, 577-595 (1985). MSC: 05A05 05C70 68R99 PDF BibTeX XML Cite \textit{R. W. Irving}, J. Algorithms 6, 577--595 (1985; Zbl 0581.05001) Full Text: DOI
Linial, N.; Saks, M. Searching ordered structures. (English) Zbl 0578.68050 J. Algorithms 6, 86-103 (1985). Reviewer: A.Soil MSC: 68P10 68Q25 PDF BibTeX XML Cite \textit{N. Linial} and \textit{M. Saks}, J. Algorithms 6, 86--103 (1985; Zbl 0578.68050) Full Text: DOI
Alekseyev, Valery B. On the complexity of some algorithms of matrix multiplication. (English) Zbl 0577.68059 J. Algorithms 6, 71-85 (1985). Reviewer: M.Zimand MSC: 68Q25 68W30 PDF BibTeX XML Cite \textit{V. B. Alekseyev}, J. Algorithms 6, 71--85 (1985; Zbl 0577.68059) Full Text: DOI
Dobkin, David P.; Kirkpatrick, David G. A linear algorithm for determining the separation of convex polyhedra. (English) Zbl 0577.52004 J. Algorithms 6, 381-392 (1985). Reviewer: J.-E.Martinez-Legaz MSC: 52Bxx 52A40 52-04 PDF BibTeX XML Cite \textit{D. P. Dobkin} and \textit{D. G. Kirkpatrick}, J. Algorithms 6, 381--392 (1985; Zbl 0577.52004) Full Text: DOI
Klee, Victor; Laskowski, Michael C. Finding the smallest triangles containing a given convex polygon. (English) Zbl 0577.52003 J. Algorithms 6, 359-375 (1985). Reviewer: J.-E.Martinez-Legaz MSC: 52A10 52-04 52Bxx PDF BibTeX XML Cite \textit{V. Klee} and \textit{M. C. Laskowski}, J. Algorithms 6, 359--375 (1985; Zbl 0577.52003) Full Text: DOI
Poblete, Patricio V.; Munro, J. Ian The analysis of a Fringe heuristic for binary search trees. (English) Zbl 0576.68052 J. Algorithms 6, 336-350 (1985). MSC: 68P10 68P20 68R10 68P05 PDF BibTeX XML Cite \textit{P. V. Poblete} and \textit{J. I. Munro}, J. Algorithms 6, 336--350 (1985; Zbl 0576.68052) Full Text: DOI
Szymanski, Thomas G. Hash table reorganization. (English) Zbl 0576.68051 J. Algorithms 6, 322-335 (1985). MSC: 68P10 68P20 68P05 PDF BibTeX XML Cite \textit{T. G. Szymanski}, J. Algorithms 6, 322--335 (1985; Zbl 0576.68051) Full Text: DOI
Er, M. C. The complexity of the generalized cyclic Towers of Hanoi problem. (English) Zbl 0576.68036 J. Algorithms 6, 351-358 (1985). MSC: 68Q25 PDF BibTeX XML Cite \textit{M. C. Er}, J. Algorithms 6, 351--358 (1985; Zbl 0576.68036) Full Text: DOI
Nakayama, Hiroyuki; Nishizeki, Takao; Saito, Nobuji Lower bounds for combinatorial problems on graphs. (English) Zbl 0576.68035 J. Algorithms 6, 393-399 (1985). MSC: 68Q25 68R10 90C35 PDF BibTeX XML Cite \textit{H. Nakayama} et al., J. Algorithms 6, 393--399 (1985; Zbl 0576.68035) Full Text: DOI
Noshita, Kohei A theorem on the expected complexity of Dijkstra’s shortest path algorithm. (English) Zbl 0576.68034 J. Algorithms 6, 400-408 (1985). MSC: 68Q25 68R10 05C38 05C35 PDF BibTeX XML Cite \textit{K. Noshita}, J. Algorithms 6, 400--408 (1985; Zbl 0576.68034) Full Text: DOI
Borwein, Peter B. On the complexity of calculating factorials. (English) Zbl 0576.68027 J. Algorithms 6, 376-380 (1985). MSC: 68Q25 68W30 PDF BibTeX XML Cite \textit{P. B. Borwein}, J. Algorithms 6, 376--380 (1985; Zbl 0576.68027) Full Text: DOI
Itai, Alon; Rodeh, Michael Scheduling transmissions in a network. (English) Zbl 0576.68021 J. Algorithms 6, 409-429 (1985). MSC: 68M20 90B10 90B35 68Q25 PDF BibTeX XML Cite \textit{A. Itai} and \textit{M. Rodeh}, J. Algorithms 6, 409--429 (1985; Zbl 0576.68021) Full Text: DOI
Devroye, Luc The expected length of the longest probe sequence for bucket searching when the distribution is not uniform. (English) Zbl 0571.68047 J. Algorithms 6, 1-9 (1985). MSC: 68P10 PDF BibTeX XML Cite \textit{L. Devroye}, J. Algorithms 6, 1--9 (1985; Zbl 0571.68047) Full Text: DOI
Tamminen, Markku Two levels are as good as any. (English) Zbl 0567.68036 J. Algorithms 6, 138-144 (1985). Reviewer: W.Janko MSC: 68P10 68Q25 PDF BibTeX XML Cite \textit{M. Tamminen}, J. Algorithms 6, 138--144 (1985; Zbl 0567.68036) Full Text: DOI
Ukkonen, Esko Finding approximate patterns in strings. (English) Zbl 0566.68072 J. Algorithms 6, 132-137 (1985). Reviewer: A.Soil MSC: 68T10 68Q25 68Q45 PDF BibTeX XML Cite \textit{E. Ukkonen}, J. Algorithms 6, 132--137 (1985; Zbl 0566.68072) Full Text: DOI
Miller, Z.; Orlin, J. B. NP-completeness for minimizing maximum edge length in grid embeddings. (English) Zbl 0563.68058 J. Algorithms 6, 10-16 (1985). MSC: 68R10 68Q25 05C10 PDF BibTeX XML Cite \textit{Z. Miller} and \textit{J. B. Orlin}, J. Algorithms 6, 10--16 (1985; Zbl 0563.68058) Full Text: DOI
Baker, Brenda S. A new proof for the first-fit decreasing bin-packing algorithm. (English) Zbl 0563.68042 J. Algorithms 6, 49-70 (1985). Reviewer: J.Błażewicz MSC: 68Q25 05B40 PDF BibTeX XML Cite \textit{B. S. Baker}, J. Algorithms 6, 49--70 (1985; Zbl 0563.68042) Full Text: DOI
Swart, Garret Finding the convex hull facet by facet. (English) Zbl 0563.68041 J. Algorithms 6, 17-48 (1985). Reviewer: M.Frumkin MSC: 68Q25 52Bxx PDF BibTeX XML Cite \textit{G. Swart}, J. Algorithms 6, 17--48 (1985; Zbl 0563.68041) Full Text: DOI
Johnson, David S. The NP-completeness column: an ongoing guide. XIV. (English) Zbl 0562.68032 J. Algorithms 6, 145-159 (1985). MSC: 68Q25 00A07 68R10 94C15 PDF BibTeX XML Cite \textit{D. S. Johnson}, J. Algorithms 6, 145--159 (1985; Zbl 0562.68032) Full Text: DOI
Anstee, R. P. An algorithmic proof of Tutte’s f-factor theorem. (English) Zbl 0562.05038 J. Algorithms 6, 112-131 (1985). Reviewer: B.Zelinka MSC: 05C70 68R10 PDF BibTeX XML Cite \textit{R. P. Anstee}, J. Algorithms 6, 112--131 (1985; Zbl 0562.05038) Full Text: DOI
Ó’Dunlaing, Colm; Yap, Chee K. A ”retraction” method for planning the motion of a disc. (English) Zbl 0556.68051 J. Algorithms 6, 104-111 (1985). MSC: 68T40 PDF BibTeX XML Cite \textit{C. Ó'Dunlaing} and \textit{C. K. Yap}, J. Algorithms 6, 104--111 (1985; Zbl 0556.68051) Full Text: DOI