Statman, R. Worst case exponential lower bounds for input resolution with paramodulation. (English) Zbl 0484.68071 SIAM J. Comput. 9, 104-110 (1980). MSC: 68T15 68Q25 68Q05 PDF BibTeX XML Cite \textit{R. Statman}, SIAM J. Comput. 9, 104--110 (1980; Zbl 0484.68071) Full Text: DOI
Bloom, Stephen L.; Elgot, Calvin C.; Wright, Jesse B. Vector iteration in pointed iterative theories. (English) Zbl 0461.68047 SIAM J. Comput. 9, 525-540 (1980). MSC: 68Q99 18C10 68Q60 05C05 PDF BibTeX XML Cite \textit{S. L. Bloom} et al., SIAM J. Comput. 9, 525--540 (1980; Zbl 0461.68047) Full Text: DOI
Rabin, Michael O. Probabilistic algorithms in finite fields. (English) Zbl 0461.12012 SIAM J. Comput. 9, 273-280 (1980). MSC: 11T06 11K16 68Q25 11T55 12-04 PDF BibTeX XML Cite \textit{M. O. Rabin}, SIAM J. Comput. 9, 273--280 (1980; Zbl 0461.12012) Full Text: DOI
Lipton, Richard J.; Tarjan, Robert Endre Applications of a planar separator theorem. (English) Zbl 0456.68077 SIAM J. Comput. 9, 615-627 (1980). MSC: 68R10 05C70 68Q25 PDF BibTeX XML Cite \textit{R. J. Lipton} and \textit{R. E. Tarjan}, SIAM J. Comput. 9, 615--627 (1980; Zbl 0456.68077) Full Text: DOI
Gilbert, John R.; Lengauer, Thomas; Tarjan, Robert Endre The pebbling problem is complete in polynomial space. (English) Zbl 0456.68045 SIAM J. Comput. 9, 513-524 (1980). MSC: 68Q25 68R99 91A05 PDF BibTeX XML Cite \textit{J. R. Gilbert} et al., SIAM J. Comput. 9, 513--524 (1980; Zbl 0456.68045) Full Text: DOI
Morgera, Salvatore D. Efficient synthesis and implementation of large discrete Fourier transformations. (English) Zbl 0456.65077 SIAM J. Comput. 9, 251-272 (1980). MSC: 65T40 68Q25 42A10 65F30 PDF BibTeX XML Cite \textit{S. D. Morgera}, SIAM J. Comput. 9, 251--272 (1980; Zbl 0456.65077) Full Text: DOI
Ehrig, Hartmut; Rosen, Barry K. The mathematics of record handling. (English) Zbl 0455.68021 SIAM J. Comput. 9, 441-469 (1980). MSC: 68P05 68R10 PDF BibTeX XML Cite \textit{H. Ehrig} and \textit{B. K. Rosen}, SIAM J. Comput. 9, 441--469 (1980; Zbl 0455.68021) Full Text: DOI
Schönhage, A. Storage modification machines. (English) Zbl 0454.68034 SIAM J. Comput. 9, 490-508 (1980). MSC: 68Q05 68W99 PDF BibTeX XML Cite \textit{A. Schönhage}, SIAM J. Comput. 9, 490--508 (1980; Zbl 0454.68034) Full Text: DOI
Bloom, Stephen L.; Elgot, Calvin C.; Wright, Jesse B. Solutions of the iteration equation and extensions of the scalar iteration operation. (English) Zbl 0454.18011 SIAM J. Comput. 9, 25-45 (1980). MSC: 18C10 68Q60 PDF BibTeX XML Cite \textit{S. L. Bloom} et al., SIAM J. Comput. 9, 25--45 (1980; Zbl 0454.18011) Full Text: DOI
Babai, Laszlo; Erdős, Paul; Selkow, Stanley M. Random graph isomorphism. (English) Zbl 0454.05038 SIAM J. Comput. 9, 628-635 (1980). MSC: 05C35 68W10 PDF BibTeX XML Cite \textit{L. Babai} et al., SIAM J. Comput. 9, 628--635 (1980; Zbl 0454.05038) Full Text: DOI
Hartmanis, J. On the succinctness of different representations of languages. (English) Zbl 0453.68054 SIAM J. Comput. 9, 114-120 (1980). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. Hartmanis}, SIAM J. Comput. 9, 114--120 (1980; Zbl 0453.68054) Full Text: DOI
Parker, D. Stott jun. Conditions for optimality of the Huffman algorithm. (English) Zbl 0453.68035 SIAM J. Comput. 9, 470-489 (1980); erratum ibid. 27, No. 1, 317 (1998). MSC: 68R10 68W99 94A15 94A17 94A24 PDF BibTeX XML Cite \textit{D. S. Parker jun.}, SIAM J. Comput. 9, 470--489 (1980; Zbl 0453.68035) Full Text: DOI
Jaffe, Jeffrey M. Bounds on the scheduling of typed task systems. (English) Zbl 0453.68004 SIAM J. Comput. 9, 541-551 (1980). MSC: 68M20 90B35 68Q25 PDF BibTeX XML Cite \textit{J. M. Jaffe}, SIAM J. Comput. 9, 541--551 (1980; Zbl 0453.68004) Full Text: DOI
Tucker, Alan An efficient test for circular-arc graphs. (English) Zbl 0453.05054 SIAM J. Comput. 9, 1-24 (1980). MSC: 05C75 68W99 68Q25 68R10 PDF BibTeX XML Cite \textit{A. Tucker}, SIAM J. Comput. 9, 1--24 (1980; Zbl 0453.05054) Full Text: DOI
Beyer, Terry; Hedetniemi, Sandra Mitchell Constant time generation of rooted trees. (English) Zbl 0453.05020 SIAM J. Comput. 9, 706-712 (1980). MSC: 05C05 PDF BibTeX XML Cite \textit{T. Beyer} and \textit{S. M. Hedetniemi}, SIAM J. Comput. 9, 706--712 (1980; Zbl 0453.05020) Full Text: DOI
George, Alan; Liu, Joseph W. H. An optimal algorithm for symbolic factorization of symmetric matrices. (English) Zbl 0452.68049 SIAM J. Comput. 9, 583-593 (1980). MSC: 68W30 15A23 15A06 65F30 68Q25 PDF BibTeX XML Cite \textit{A. George} and \textit{J. W. H. Liu}, SIAM J. Comput. 9, 583--593 (1980; Zbl 0452.68049) Full Text: DOI
Joichi, J. T.; White, Dennis E.; Williamson, S. G. Combinatorial Gray codes. (English) Zbl 0452.05009 SIAM J. Comput. 9, 130-141 (1980). MSC: 05A99 94B05 PDF BibTeX XML Cite \textit{J. T. Joichi} et al., SIAM J. Comput. 9, 130--141 (1980; Zbl 0452.05009) Full Text: DOI
Ja’Ja’, Joseph On the complexity of bilinear forms with commutativity. (English) Zbl 0451.68035 SIAM J. Comput. 9, 713-728 (1980). MSC: 68Q25 15A63 15A72 65F30 PDF BibTeX XML Cite \textit{J. Ja'Ja'}, SIAM J. Comput. 9, 713--728 (1980; Zbl 0451.68035) Full Text: DOI
Seroussi, Gadiel; Lempel, Abraham Factorization of symmetric matrices and trace-orthogonal bases in finite fields. (English) Zbl 0451.15012 SIAM J. Comput. 9, 758-767 (1980). MSC: 15B33 15A23 PDF BibTeX XML Cite \textit{G. Seroussi} and \textit{A. Lempel}, SIAM J. Comput. 9, 758--767 (1980; Zbl 0451.15012) Full Text: DOI
Corneil, D. G.; Kirkpatrick, D. G. A theoretical analysis of various heuristics for the graph isomorphism problem. (English) Zbl 0451.05043 SIAM J. Comput. 9, 281-297 (1980). MSC: 05C99 05-04 PDF BibTeX XML Cite \textit{D. G. Corneil} and \textit{D. G. Kirkpatrick}, SIAM J. Comput. 9, 281--297 (1980; Zbl 0451.05043) Full Text: DOI
Weide, Bruce W. Random graphs and graph optimization problems. (English) Zbl 0449.05063 SIAM J. Comput. 9, 552-557 (1980). MSC: 05C99 PDF BibTeX XML Cite \textit{B. W. Weide}, SIAM J. Comput. 9, 552--557 (1980; Zbl 0449.05063) Full Text: DOI
Plaisted, David A. The application of multivariate polynomials to inference rules and partial tests for unsatisfiability. (English) Zbl 0448.68022 SIAM J. Comput. 9, 698-705 (1980). MSC: 68T15 68Q25 03F20 03B05 90C05 03B35 03D15 PDF BibTeX XML Cite \textit{D. A. Plaisted}, SIAM J. Comput. 9, 698--705 (1980; Zbl 0448.68022) Full Text: DOI
Rosen, Barry K. Monoids for rapid data flow analysis. (English) Zbl 0448.68007 SIAM J. Comput. 9, 159-196 (1980). MSC: 68Q60 PDF BibTeX XML Cite \textit{B. K. Rosen}, SIAM J. Comput. 9, 159--196 (1980; Zbl 0448.68007) Full Text: DOI
Lee, D. T.; Wong, C. K. Voronoi diagrams in \(L_1(L_\infty)\) metrics with 2-dimensional storage applications. (English) Zbl 0447.68111 SIAM J. Comput. 9, 200-211 (1980). MSC: 68P20 68Q25 68R10 68R99 68U99 PDF BibTeX XML Cite \textit{D. T. Lee} and \textit{C. K. Wong}, SIAM J. Comput. 9, 200--211 (1980; Zbl 0447.68111) Full Text: DOI
Flajolet, P.; Ramshaw, Lyle A note on Gray code and odd-even merge. (English) Zbl 0447.68083 SIAM J. Comput. 9, 142-158 (1980). MSC: 68R99 PDF BibTeX XML Cite \textit{P. Flajolet} and \textit{L. Ramshaw}, SIAM J. Comput. 9, 142--158 (1980; Zbl 0447.68083) Full Text: DOI
Hwang, F. K. Optimal merging of 3 elements with n elements. (English) Zbl 0447.68082 SIAM J. Comput. 9, 298-320 (1980). MSC: 68R99 06A05 PDF BibTeX XML Cite \textit{F. K. Hwang}, SIAM J. Comput. 9, 298--320 (1980; Zbl 0447.68082) Full Text: DOI
Baker, Brenda S.; Coffman, E. G. jun.; Rivest, Ronald L. Orthogonal packings in two dimensions. (English) Zbl 0447.68080 SIAM J. Comput. 9, 846-855 (1980). MSC: 68R99 68M20 05B40 PDF BibTeX XML Cite \textit{B. S. Baker} et al., SIAM J. Comput. 9, 846--855 (1980; Zbl 0447.68080) Full Text: DOI
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.; Tarjan, R. E. Performance bounds for level-oriented two-dimensional packing algorithms. (English) Zbl 0447.68079 SIAM J. Comput. 9, 808-826 (1980). MSC: 68R99 05B40 PDF BibTeX XML Cite \textit{E. G. Coffman jun.} et al., SIAM J. Comput. 9, 808--826 (1980; Zbl 0447.68079) Full Text: DOI
Yao, Andrew C.; Rivest, Ronald L. On the polyhedral decision problem. (English) Zbl 0447.68076 SIAM J. Comput. 9, 343-347 (1980). MSC: 68R99 68Q25 PDF BibTeX XML Cite \textit{A. C. Yao} and \textit{R. L. Rivest}, SIAM J. Comput. 9, 343--347 (1980; Zbl 0447.68076) Full Text: DOI
Majster, Mila E.; Reiser, Angelika Efficient on-line construction and correction of position trees. (English) Zbl 0447.68072 SIAM J. Comput. 9, 785-807 (1980). MSC: 68R10 05-04 PDF BibTeX XML Cite \textit{M. E. Majster} and \textit{A. Reiser}, SIAM J. Comput. 9, 785--807 (1980; Zbl 0447.68072) Full Text: DOI
Nassimi, David; Sahni, Sartaj Finding connected components and connected ones on a mesh-connected parallel computer. (English) Zbl 0447.68070 SIAM J. Comput. 9, 744-757 (1980). MSC: 68R10 05C40 68Q25 68N99 PDF BibTeX XML Cite \textit{D. Nassimi} and \textit{S. Sahni}, SIAM J. Comput. 9, 744--757 (1980; Zbl 0447.68070) Full Text: DOI
Gurari, Eitan M.; Ibarra, Oscar H. Path systems: Constructions, solutions and applications. (English) Zbl 0447.68049 SIAM J. Comput. 9, 348-374 (1980). MSC: 68Q99 68Q05 68Q25 PDF BibTeX XML Cite \textit{E. M. Gurari} and \textit{O. H. Ibarra}, SIAM J. Comput. 9, 348--374 (1980; Zbl 0447.68049) Full Text: DOI
Kintala, Chandra M. R.; Fischer, Patrick C. Refining nondeterminism in relativized polynomial-time bounded computations. (English) Zbl 0447.68044 SIAM J. Comput. 9, 46-53 (1980). MSC: 68Q05 68Q25 PDF BibTeX XML Cite \textit{C. M. R. Kintala} and \textit{P. C. Fischer}, SIAM J. Comput. 9, 46--53 (1980; Zbl 0447.68044) Full Text: DOI
Wong, C. K.; Easton, M. C. An efficient method for weighted sampling without replacement. (English) Zbl 0447.68040 SIAM J. Comput. 9, 111-113 (1980). MSC: 68Q25 62D05 PDF BibTeX XML Cite \textit{C. K. Wong} and \textit{M. C. Easton}, SIAM J. Comput. 9, 111--113 (1980; Zbl 0447.68040) Full Text: DOI
Hunt, H. B. III; Constable, R. L.; Sahni, S. On the computational complexity of program scheme equivalence. (English) Zbl 0447.68038 SIAM J. Comput. 9, 396-416 (1980). MSC: 68Q25 68Q60 PDF BibTeX XML Cite \textit{H. B. Hunt III} et al., SIAM J. Comput. 9, 396--416 (1980; Zbl 0447.68038) Full Text: DOI
Aspvall, Bengt; Shiloach, Yossi A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. (English) Zbl 0447.68036 SIAM J. Comput. 9, 827-845 (1980). MSC: 68Q25 90C05 PDF BibTeX XML Cite \textit{B. Aspvall} and \textit{Y. Shiloach}, SIAM J. Comput. 9, 827--845 (1980; Zbl 0447.68036) Full Text: DOI
Pippenger, Nicholas On the evaluation of powers and monomials. (English) Zbl 0447.68035 SIAM J. Comput. 9, 230-250 (1980). MSC: 68Q25 PDF BibTeX XML Cite \textit{N. Pippenger}, SIAM J. Comput. 9, 230--250 (1980; Zbl 0447.68035) Full Text: DOI
Dobkin, David; Lipton, Richard J. Addition chain methods for the evaluation of specific polynomials. (English) Zbl 0447.68034 SIAM J. Comput. 9, 121-125 (1980). MSC: 68Q25 68W30 PDF BibTeX XML Cite \textit{D. Dobkin} and \textit{R. J. Lipton}, SIAM J. Comput. 9, 121--125 (1980; Zbl 0447.68034) Full Text: DOI
Brent, R. P.; Traub, J. F. On the complexity of composition and generalized composition of power series. (English) Zbl 0447.68033 SIAM J. Comput. 9, 54-66 (1980). MSC: 68Q25 68W30 13F25 PDF BibTeX XML Cite \textit{R. P. Brent} and \textit{J. F. Traub}, SIAM J. Comput. 9, 54--66 (1980; Zbl 0447.68033) Full Text: DOI
Bloom, Stephen L.; Tindell, Ralph Compatible orderings on the metric theory of trees. (English) Zbl 0447.05026 SIAM J. Comput. 9, 683-691 (1980). MSC: 05C05 06A06 PDF BibTeX XML Cite \textit{S. L. Bloom} and \textit{R. Tindell}, SIAM J. Comput. 9, 683--691 (1980; Zbl 0447.05026) Full Text: DOI
Stockmeyer, Paul K.; Yao, F. Frances On the optimality of linear merge. (English) Zbl 0446.68059 SIAM J. Comput. 9, 85-90 (1980). MSC: 68R99 PDF BibTeX XML Cite \textit{P. K. Stockmeyer} and \textit{F. F. Yao}, SIAM J. Comput. 9, 85--90 (1980; Zbl 0446.68059) Full Text: DOI
Shiloach, Yossi A multi-terminal minimum cut algorithm for planar graphs. (English) Zbl 0446.68055 SIAM J. Comput. 9, 219-224 (1980). MSC: 68R10 05C99 PDF BibTeX XML Cite \textit{Y. Shiloach}, SIAM J. Comput. 9, 219--224 (1980; Zbl 0446.68055) Full Text: DOI
Galil, Zvi Finding the vertex connectivity of graphs. (English) Zbl 0446.68053 SIAM J. Comput. 9, 197-199 (1980). MSC: 68R10 05C40 05-04 PDF BibTeX XML Cite \textit{Z. Galil}, SIAM J. Comput. 9, 197--199 (1980; Zbl 0446.68053) Full Text: DOI
Babai, Laszlo On the complexity of canonical labeling of strongly regular graphs. (English) Zbl 0446.68052 SIAM J. Comput. 9, 212-216 (1980). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{L. Babai}, SIAM J. Comput. 9, 212--216 (1980; Zbl 0446.68052) Full Text: DOI
Guibas, Leo J.; Odlyzko, Andrew M. A new proof of the linearity of the Boyer-Moore string searching algorithm. (English) Zbl 0446.68050 SIAM J. Comput. 9, 672-682 (1980). MSC: 68P10 68P20 PDF BibTeX XML Cite \textit{L. J. Guibas} and \textit{A. M. Odlyzko}, SIAM J. Comput. 9, 672--682 (1980; Zbl 0446.68050) Full Text: DOI
Rytter, Wojciech A correct preprocessing algorithm for Boyer-Moore string-searching. (English) Zbl 0446.68049 SIAM J. Comput. 9, 509-512 (1980). MSC: 68P10 68P20 PDF BibTeX XML Cite \textit{W. Rytter}, SIAM J. Comput. 9, 509--512 (1980; Zbl 0446.68049) Full Text: DOI
Brown, Mark R.; Tarjan, Robert E. Design and analysis of a data structure for representing sorted lists. (English) Zbl 0446.68047 SIAM J. Comput. 9, 594-614 (1980). MSC: 68P10 PDF BibTeX XML Cite \textit{M. R. Brown} and \textit{R. E. Tarjan}, SIAM J. Comput. 9, 594--614 (1980; Zbl 0446.68047) Full Text: DOI
Hirschberg, D. S. On the complexity of searching a set of vectors. (English) Zbl 0446.68046 SIAM J. Comput. 9, 126-129 (1980). MSC: 68P10 68Q25 PDF BibTeX XML Cite \textit{D. S. Hirschberg}, SIAM J. Comput. 9, 126--129 (1980; Zbl 0446.68046) Full Text: DOI
Galil, Zvi; Seiferas, Joel Saving space in fast string-matching. (English) Zbl 0446.68041 SIAM J. Comput. 9, 417-438 (1980). MSC: 68Q25 68Q05 68P10 68T10 68P20 PDF BibTeX XML Cite \textit{Z. Galil} and \textit{J. Seiferas}, SIAM J. Comput. 9, 417--438 (1980; Zbl 0446.68041) Full Text: DOI
Book, Ronald V.; Brandenburg, Franz-Josef Equality sets and complexity classes. (English) Zbl 0446.68040 SIAM J. Comput. 9, 729-743 (1980). MSC: 68Q25 68Q45 PDF BibTeX XML Cite \textit{R. V. Book} and \textit{F.-J. Brandenburg}, SIAM J. Comput. 9, 729--743 (1980; Zbl 0446.68040) Full Text: DOI
Bini, Dario; Lotti, Grazia; Romani, Francesco Approximate solutions for the bilinear form computational problem. (English) Zbl 0446.68035 SIAM J. Comput. 9, 692-697 (1980). MSC: 68Q25 65F99 65F30 PDF BibTeX XML Cite \textit{D. Bini} et al., SIAM J. Comput. 9, 692--697 (1980; Zbl 0446.68035) Full Text: DOI
Pan, V. Ya. New fast algorithms for matrix operations. (English) Zbl 0446.68034 SIAM J. Comput. 9, 321-342 (1980). MSC: 68Q25 65F30 PDF BibTeX XML Cite \textit{V. Ya. Pan}, SIAM J. Comput. 9, 321--342 (1980; Zbl 0446.68034) Full Text: DOI
Winograd, S. On multiplication of polynomials modulo a polynomial. (English) Zbl 0446.68032 SIAM J. Comput. 9, 225-229 (1980). MSC: 68Q25 12E05 PDF BibTeX XML Cite \textit{S. Winograd}, SIAM J. Comput. 9, 225--229 (1980; Zbl 0446.68032) Full Text: DOI
Cho, Yookun; Sahni, Sartaj Bounds for list schedules on uniform processors. (English) Zbl 0446.68025 SIAM J. Comput. 9, 91-103 (1980). MSC: 68M20 68N25 PDF BibTeX XML Cite \textit{Y. Cho} and \textit{S. Sahni}, SIAM J. Comput. 9, 91--103 (1980; Zbl 0446.68025) Full Text: DOI
Apt, Krzysztof R.; Meertens, Lambert G. L. T. Completeness with finite systems of intermediate assertions for recursive program schemes. (English) Zbl 0446.68009 SIAM J. Comput. 9, 665-671 (1980). MSC: 68Q60 68Q65 PDF BibTeX XML Cite \textit{K. R. Apt} and \textit{L. G. L. T. Meertens}, SIAM J. Comput. 9, 665--671 (1980; Zbl 0446.68009) Full Text: DOI
Tai, Kuo-Chung Predictors of context-free grammars. (English) Zbl 0445.68065 SIAM J. Comput. 9, 653-664 (1980). MSC: 68N20 68Q45 PDF BibTeX XML Cite \textit{K.-C. Tai}, SIAM J. Comput. 9, 653--664 (1980; Zbl 0445.68065) Full Text: DOI
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. (English) Zbl 0445.68054 SIAM J. Comput. 9, 558-565 (1980). MSC: 68R99 68R10 68Q25 68W99 PDF BibTeX XML Cite \textit{E. L. Lawler} et al., SIAM J. Comput. 9, 558--565 (1980; Zbl 0445.68054) Full Text: DOI
Yao, Andrew Chi-Chih Bounds on selection networks. (English) Zbl 0445.68045 SIAM J. Comput. 9, 566-582 (1980). MSC: 68P10 68Q25 PDF BibTeX XML Cite \textit{A. C. C. Yao}, SIAM J. Comput. 9, 566--582 (1980; Zbl 0445.68045) Full Text: DOI
Cook, Stephen A.; Rackoff, Charles W. Space lower bounds for maze threadability on restricted machines. (English) Zbl 0445.68038 SIAM J. Comput. 9, 636-652 (1980). MSC: 68Q45 68Q05 68Q25 68R10 PDF BibTeX XML Cite \textit{S. A. Cook} and \textit{C. W. Rackoff}, SIAM J. Comput. 9, 636--652 (1980; Zbl 0445.68038) Full Text: DOI
Feldman, Jerome A.; Nigam, Anil A model and proof technique for message-based systems. (English) Zbl 0442.68015 SIAM J. Comput. 9, 768-784 (1980). MSC: 68N25 PDF BibTeX XML Cite \textit{J. A. Feldman} and \textit{A. Nigam}, SIAM J. Comput. 9, 768--784 (1980; Zbl 0442.68015) Full Text: DOI
Reif, John H. Code motion. (English) Zbl 0437.68005 SIAM J. Comput. 9, 375-395 (1980). MSC: 68Q60 PDF BibTeX XML Cite \textit{J. H. Reif}, SIAM J. Comput. 9, 375--395 (1980; Zbl 0437.68005) Full Text: DOI
Hennessy, M. C. B. The semantics of call-by-value and call-by-name in a nondeterministic environment. (English) Zbl 0437.68002 SIAM J. Comput. 9, 67-84 (1980). MSC: 68N01 68Q60 PDF BibTeX XML Cite \textit{M. C. B. Hennessy}, SIAM J. Comput. 9, 67--84 (1980; Zbl 0437.68002) Full Text: DOI