@article{Parchmann/79,
AUTHOR = {Parchmann, R.},
TITLE = {Control system model for critically timed sources},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {1-5},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
NOTE = {see Corrigendum in J. ACM 27, 402},
}
@article{Smith/79,
AUTHOR = {Smith, A.J.},
TITLE = {Characterizing the storage process and its effect on the update of main memory by write through},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {6-27},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gupta/79,
AUTHOR = {Gupta, U.},
TITLE = {Bounds on storage for consecutive retrieval},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {28-36},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mendelzon/79,
AUTHOR = {Mendelzon, A.O.},
TITLE = {On axiomatizing multivalued dependencies in relational databases},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {37-44},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Reiss/79a,
AUTHOR = {Reiss, S.P.},
TITLE = {Security in databases; a combinatorial study},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {45-57},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Galil-Megiddo/79,
AUTHOR = {Galil, Z. and Megiddo, N.},
TITLE = {A fast selection algorithm and the problem of optimum distribution of effort},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {58-64},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lemme-Rice/79,
AUTHOR = {Lemme, J.M. and Rice, J.R.},
TITLE = {Speedup in parallel algorithms for adaptive quadrature},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {65-71},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Rodrigue-Madsen-Karush/79,
AUTHOR = {Rodrigue, G.H. and Madsen, N.K. and Karush, J.I.},
TITLE = {Odd-even reduction for banded linear equations},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {72-81},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fishman-Moore/79,
AUTHOR = {Fishman, G.S. and Moore, L.R.},
TITLE = {Estimating the mean of a correlated binary sequence with an application to discrete event simulation},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {82-94},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Papadimitriou/79b,
AUTHOR = {Papadimitriou, C.H.},
TITLE = {Optimality of the fast Fourier transform},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {95-102},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Savitch-Stimson/79,
AUTHOR = {Savitch, W.J. and Stimson, M.J.},
TITLE = {Time bounded random access machines with parallel processing},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {103-118},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Cherniavsky-Kamin/79,
AUTHOR = {Cherniavsky, J.C. and Kamin, S.N.},
TITLE = {A complete and consistent Hoare axiomatics for a simple programming language},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {119-128},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Clarke/79,
AUTHOR = {Clarke, E.M., Jr.},
TITLE = {Programming language constructs for which it is impossible to obtain good Hoare axiom systems},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {129-147},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Beery-Levy/79,
AUTHOR = {Beery, G. and L{\'e}vy, J.-J.},
TITLE = {Minimal and optimal computations of recursive programs},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {148-176},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hwang/79,
AUTHOR = {Hwang, F.K.},
TITLE = {An O$(n\log n)$ algorithm for rectilinear minimal spanning trees},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {177-182},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lueker-Booth/79,
AUTHOR = {Lueker, G.S. and Booth, K.S.},
TITLE = {A linear time algorithm for deciding interval graph isomorphism},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {183-195},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bolour/79,
AUTHOR = {Bolour, A.},
TITLE = {Optimality properties of multiple-key hashing functions},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {196-210},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Brown-Tarjan/79,
AUTHOR = {Brown, M.R. and Tarjan, R.E.},
TITLE = {A fast merging algorithm},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {211-226},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fussenegger-Gabow/79,
AUTHOR = {Fussenegger, F. and Gabow, H.N.},
TITLE = {A counting approach to lower bounds for selection problems},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {227-238},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kacewicz/79,
AUTHOR = {Kacewicz, B.},
TITLE = {Integrals with a kernel in the solution of nonlinear equations in $N$ dimensions},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {239-249},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Traub-Wozniakowski/79,
AUTHOR = {Traub, J.F. and Wo{\'z}niakowski, H.},
TITLE = {Convergence and complexity of Newton iteration for operator equations},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {250-258},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gelenbe/79,
AUTHOR = {Gelenbe, E.},
TITLE = {On the optimum checkpoint interval},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {259-270},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Iglehart-Lewis/79,
AUTHOR = {Iglehart, D.I. and Lewis, P.A.W.},
TITLE = {Regenerative simulation with internal controls},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {271-282},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kowaltowski/79,
AUTHOR = {Kowaltowski, T.},
TITLE = {Data structures and correctness of programs},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {283-301},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Milne-Milner/79,
AUTHOR = {Milne, G. and Milner, R.},
TITLE = {Concurrent processes and their syntax},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {302-321},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Rosen/79,
AUTHOR = {Rosen, B.K.},
TITLE = {Data flow analysis for procedural languages},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {322-344},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Culik/79,
AUTHOR = {Culik II, K.},
TITLE = {A purely homomorphic characterization of recursively enumerable sets},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {345-350},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Shostak/79,
AUTHOR = {Shostak, R.E.},
TITLE = {A practical decision procedure for arithmetic with function symbols},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {351-360},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Pippenger-Fischer/79,
AUTHOR = {Pippenger, N. and Fischer, M.J.},
TITLE = {Relations among complexity measures},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {361-384},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Henschen/79,
AUTHOR = {Henschen, L.J.},
TITLE = {Theorem proving by covering expressions},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {385-400},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Cohen-Hickey/79,
AUTHOR = {Cohen, J. and Hickey, T.},
TITLE = {Two algorithms for determining volumes of convex polyhedra},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {401-414},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lee-Preparata/79,
AUTHOR = {Lee, D.T. and Preparata, F.P.},
TITLE = {An optimal algorithm for finding the kernel of a polygon},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {415-421},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Tai/79,
AUTHOR = {Tai, K.-C.},
TITLE = {The tree-to-tree correction problem},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {422-433},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Manacher/79,
AUTHOR = {Manacher, G.K.},
TITLE = {Significant improvements to the Hwang-Lin merging algorithm},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {434-440},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Manacher/79a,
AUTHOR = {Manacher, G.K.},
TITLE = {The Ford-Johnson sorting algorithm is not optimal},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {441-456},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Strong-Markowsky-Chandra/79,
AUTHOR = {Strong, H.R. and Markowsky, G. and Chandra, A.K.},
TITLE = {Search within a page},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {457-482},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bui/79,
AUTHOR = {Bui, T.D.},
TITLE = {Some A-stable and L-stable methods for the numerical integration of stiff ordinary differential equations},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {483-493},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Skeel/79,
AUTHOR = {Skeel, R.D.},
TITLE = {Scaling for numerical stability in Gaussian elimination},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {494-526},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Werschulz/79a,
AUTHOR = {Werschulz, A.G.},
TITLE = {Maximal order and order of information for numerical quadrature},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {527-537},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Frederickson/79,
AUTHOR = {Frederickson, G.N.},
TITLE = {Approximation algorithms for some postman problems},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {538-554},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Baker-Kosaraju/79,
AUTHOR = {Baker, B.S. and Kosaraju, S.R.},
TITLE = {A comparison of multilevel break and next statements},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {555-566},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gurari-Ibarra/79,
AUTHOR = {Gurari, E.M. and Ibarra, O.H.},
TITLE = {An $NP$-complete number-theoretic problem},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {567-581},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kedem/79,
AUTHOR = {Kedem, Z.M.},
TITLE = {Combining dimensionality and rate of growth arguments for establishing lower bounds on the number of multiplications and divisions},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {582-602},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Beyer-Jones-Mitchell/79,
AUTHOR = {Beyer, T. and Jones, W. and Mitchell, S.},
TITLE = {Linear algorithms for isomorphism of maximal outerplanar graphs},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {603-610},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gross-Rosen/79,
AUTHOR = {Gross, J.L. and Rosen, R.H.},
TITLE = {A linear time planarity algorithm for 2-complexes},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {611-617},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yannakakis/79,
AUTHOR = {Yannakakis, M.},
TITLE = {The effect of a connectivity requirement on the complexity of maximum subgraph problems},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {618-630},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Papadimitriou/79a,
AUTHOR = {Papadimitriou, C.H.},
TITLE = {The serializability of concurrent database updates},
JOURNAL = {J. ACM},
VOLUME = {26},
NUMBER = {4},
PAGES = {631-653},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mendelson-Yechiali/79,
AUTHOR = {Mendelson, H. and Yechiali, U.},
TITLE = {Performance measures for ordered lists in random-access files},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {654-667},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Rosenberg/79a,
AUTHOR = {Rosenberg, A.L.},
TITLE = {Encoding data structures in trees},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {668-689},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Tarjan/79a,
AUTHOR = {Tarjan, Robert E.},
TITLE = {Applications of path compression on balanced trees},
JOURNAL = {J. ACM},
VOLUME = {26},
NUMBER = {4},
PAGES = {690-715},
YEAR = {1979, October},
KEYWORDS = {balanced trees, dominators, equivalence relation, global flow analysis, graph algorithms},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bustoz-Feldstein-Goodman-Linnainmaa/79,
AUTHOR = {Bustoz, J. and Feldstein, A. and Goodman, R. and Linnainmaa, S.},
TITLE = {Improved trailing digits estimates applied to optimal computer arithmetic},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {716-730},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Butcher/79,
AUTHOR = {Butcher, J.C.},
TITLE = {A transformed implicit Runge-Kutta method},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {731-738},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Johnson-Miller-Minnihan-Wrathall/79,
AUTHOR = {Johnson, D.B. and Miller, W. and Minnihan, B. and Wrathall, C.},
TITLE = {Reducibility among floating-point graphs},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {739-760},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bhat-Nance/79,
AUTHOR = {Bhat, U.N. and Nance, R.E.},
TITLE = {An evaluation of CPU efficiency under dynamic quantum allocation},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {761-778},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Noetzel/79,
AUTHOR = {Noetzel, A.S.},
TITLE = {A generalized queueing discipline for product form network solutions},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {779-793},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Milner/79,
AUTHOR = {Milner, R.},
TITLE = {Flowgraphs and flow algebras},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {794-818},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Logrippo/79,
AUTHOR = {Logrippo, L.},
TITLE = {Renamings, maximal parallelism, and space-time tradeoff in program schemata},
JOURNAL = {J. ACM},
VOLUME = {26},
PAGES = {819-833},
YEAR = {1979},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}