@article{Bui/77,
AUTHOR = {Bui, T.D.},
TITLE = {Errata and comments on a paper by J.R. Cash},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {623},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Johnson/77,
AUTHOR = {Johnson, D.B.},
TITLE = {Efficient algorithms for shortest paths in sparse networks},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {1-13},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Wilhelm/77,
AUTHOR = {Wilhelm, N.C.},
TITLE = {A general model for the performance of disk systems},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {14-31},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Horvath-Lam-Sethi/77,
AUTHOR = {Horvath, E.C. and Lam, S. and Sethi, R.},
TITLE = {A level algorithm for preemptive scheduling},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {32-43},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Burstall-Darlington/77,
AUTHOR = {Burstall, R.M. and Darlington, J.},
TITLE = {A transformation system for developing recursive programs},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {44-67},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Goguen-Thatcher-Wagner-Wright/77,
AUTHOR = {Goguen, J.A. and Thatcher, J.W. and Wagner, E.G. and Wright, J.B.},
TITLE = {Initial algebra semantics and continuous algebras},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {68-97},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Baker/77,
AUTHOR = {Baker, B.S.},
TITLE = {An algorithm for structuring flowgraphs},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {98-120},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Loveman/77,
AUTHOR = {Loveman, D.B.},
TITLE = {Program improvement by source-to-source transformation},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {121-145},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Aho-Johnson-Ullman/77,
AUTHOR = {Aho, A.V. and Johnson, S.C. and Ullman, J.D.},
TITLE = {Code generation for expressions with common subexpressions},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {146-160},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Summers/77,
AUTHOR = {Summers, P.D.},
TITLE = {A methodology for LISP program construction from examples},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {161-176},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{de_Champeaux-Sint/77,
AUTHOR = {de Champeaux, D. and Sint, L.},
TITLE = {An improved bidirectional heuristic search algorithm},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {177-191},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Boesch-Gimpel/77,
AUTHOR = {Boesch, F.T. and Gimpel, J.F.},
TITLE = {Covering the points of a digraph with point-disjoint paths and its application to code optimization},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {192-198},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Rosenberg-Stockmeyer/77a,
AUTHOR = {Rosenberg, A.L. and Stockmeyer, L.J.},
TITLE = {Hashing schemes for extendible arrays},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {199-221},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Brandwajn/77,
AUTHOR = {Brandwajn, A.},
TITLE = {A queueing model of multiprogrammed computer systems under full load conditions},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {222-240},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hofri/77,
AUTHOR = {Hofri, M.},
TITLE = {On certain output-buffer management techniques -- a stochastic model},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {241-249},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chandy-Howard-Towsley/77,
AUTHOR = {Chandy, K.M. and Howard, J.H., Jr. and Towsley, D.F.},
TITLE = {Product form and local balance in queueing networks},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {250-263},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ibaraki/77,
AUTHOR = {Ibaraki, T.},
TITLE = {The power of dominance relations in branch-and-bound algorithms},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {264-279},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ibarra-Kim/77,
AUTHOR = {Ibarra, O.H. and Kim, C.E.},
TITLE = {Heuristic algorithms for scheduling independent tasks on nonidentical processors},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {280-289},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hehner/77,
AUTHOR = {Hehner, E.C.R.},
TITLE = {Information content of programs and operation encoding},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {290-297},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Davis/77,
AUTHOR = {Davis, P.J.},
TITLE = {Proof, completeness, transcendentals, and sampling},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {298-310},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fiduccia-Zalcstein/77,
AUTHOR = {Fiduccia, C.M. and Zalcstein, Y.},
TITLE = {Algebras having linear multiplicative complexities},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {311-331},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hopcroft-Paul-Valiant/77,
AUTHOR = {Hopcroft, J. and Paul, W. and Valiant, L.},
TITLE = {On time versus space},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {332-337},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Jones-Muchnick/77,
AUTHOR = {Jones, N.D. and Muchnick, S.S.},
TITLE = {Even simple programs are hard to analyze},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {338-352},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ballantyne-Bledsoe/77,
AUTHOR = {Ballantyne, A.M. and Bledsoe, W.W.},
TITLE = {Automatic proofs of theorems in analysis using nonstandard techniques},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {353-374},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fayolle-Gelenbe-Labetoulle/77,
AUTHOR = {Fayolle, G. and Gelenbe, E. and Labetoulle, J.},
TITLE = {Stability and optimal control of the packet switching broadcast channel},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {375-386},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hunt-Rosenkrantz/77,
AUTHOR = {Hunt III, H.B. and Rosenkrantz, D.J.},
TITLE = {On equivalence and containment problems for formal languages},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {387-396},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Attar-Fraenkel/77,
AUTHOR = {Attar, R. and Fraenkel, S.},
TITLE = {Local feedback in full-text retrieval systems},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {397-417},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bookstein-Kraft/77,
AUTHOR = {Bookstein, A. and Kraft, D.},
TITLE = {Operations research applied to document indexing and retrieval decisions},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {418-427},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Comer-Sethi/77,
AUTHOR = {Comer, D. and Sethi, R.},
TITLE = {The complexity of trie index construction},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {428-440},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hwang-Yao/77,
AUTHOR = {Hwang, K. and Yao, S.B.},
TITLE = {Optimal batched searching of tree structured files in multiprocessor computer systems},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {441-454},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lipton-Snyder/77,
AUTHOR = {Lipton, R.J. and Snyder, L.},
TITLE = {A linear time algorithm for deciding subject security},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {455-464},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lin-Rardin/77,
AUTHOR = {Lin, B.W.Y. and Rardin, R.L.},
TITLE = {Development of a parametric generating procedure for integer programming test problems},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {465-472},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kou/77,
AUTHOR = {Kou, L.T.},
TITLE = {On live-dead analysis for global data flow problems},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {473-483},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Reynolds/77,
AUTHOR = {Reynolds, J.C.},
TITLE = {Semantics of the domain of flow diagrams},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {484-503},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Wegbreit/77,
AUTHOR = {Wegbreit, B.},
TITLE = {Complexity of synthesizing inductive assertions},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {504-512},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hyafil-Kung/77,
AUTHOR = {Hyafil, L. and Kung, H.T.},
TITLE = {The complexity of parallel evaluation of linear recurrences},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {513-521},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lipton-Zalcstein/77,
AUTHOR = {Lipton, R.J. and Zalcstein, Y.},
TITLE = {Word problems solvable in logspace},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {522-526},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Shostak/77a,
AUTHOR = {Shostak, R.E.},
TITLE = {On the SUP-INF method for proving Presburger formulas},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {529-543},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{DeMillo-Vairavan-Sycara-Cyranski/77,
AUTHOR = {DeMillo, R.A. and Vairavan, K. and Sycara-Cyranski, E.},
TITLE = {A study of schedules as models of synchronous parallel computation},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {544-565},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Maekawa/77,
AUTHOR = {Maekawa, M.},
TITLE = {Queueing models for computer systems connected by a communication line},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {566-582},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lynch/77,
AUTHOR = {Lynch, N.},
TITLE = {Log space recognition and translation of parenthesis languages},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {583-590},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yu-Luk/77,
AUTHOR = {Yu, C.T. and Luk, W.S.},
TITLE = {Analysis of effectiveness of retrieval in clustered files},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {607-622},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sahasrabudhe-Kulkarni/77,
AUTHOR = {Sahasrabudhe, S.E. and Kulkarni, A.D.},
TITLE = {On solving Fredholm integral equations of the first kind},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {624-629},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kinariwala-Rao/77,
AUTHOR = {Kinariwala, B. and Rao, A.G.},
TITLE = {Flow switching approach to the maximum flow problem: I},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {630-645},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Omahen/77,
AUTHOR = {Omahen, K.J.},
TITLE = {Capacity bounds for multiresource queues},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {646-663},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hirschberg/77,
AUTHOR = {Hirschberg, D.S.},
TITLE = {Algorithms for the longest common subsequence problem},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {664-675},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kumar_Das/77,
AUTHOR = {Kumar Das, S.},
TITLE = {A machine representation of finite $T_0$ topologies},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {676-692},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Young/77,
AUTHOR = {Young, P.},
TITLE = {Optimization among provably equivalent programs},
JOURNAL = {J. ACM},
VOLUME = {24},
PAGES = {693-700},
YEAR = {1977},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}