@article{Cody-Coffman/76a,
AUTHOR = {Cody, R.A. and Coffman, E.G., Jr.},
TITLE = {Errata},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {572},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Aho-Hirschberg-Ullman/76,
AUTHOR = {Aho, A.V. and Hirschberg, D.S. and Ullman, J.D.},
TITLE = {Bounds on the complexity of the longest common subsequence problem},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {1},
PAGES = {1-12},
YEAR = {1976, January},
KEYWORDS = {longest common subsequence, algorithm, computational complexity, file comparison, molecular evolution},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Wong-Chandra/76,
AUTHOR = {Wong, C.K. and Chandra, A.K.},
TITLE = {Bounds for the string editing problem},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {13-16},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mickunas/76,
AUTHOR = {Mickunas, M.D.},
TITLE = {On the complete covering problem for LR (k) grammars},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {17-30},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ullmann/76,
AUTHOR = {Ullmann, J.R.},
TITLE = {An algorithm for subgraph isomorphism},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {31-42},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Garey-Johnson/76a,
AUTHOR = {Garey, M.R. and Johnson, D.S.},
TITLE = {The complexity of near-optimal graph coloring},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {43-49},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Wagner/76,
AUTHOR = {Wagner, Robert A.},
TITLE = {A shortest path algorihm for edge-sparse graphs},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {1},
PAGES = {50-57},
YEAR = {1976, January},
KEYWORDS = {shortest paths, shortest network paths, graph theory, network theory},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Martelli/76,
AUTHOR = {Martelli, Alberto},
TITLE = {A Gaussian elimination algorithm for the enumeration of cut sets in a graph},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {1},
PAGES = {58-73},
YEAR = {1976, January},
KEYWORDS = {graph theory, cut set enumeration, regular algebra, Gaussian elimination},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Deo/76,
AUTHOR = {Deo, Narsingh},
TITLE = {Note on Hopcroft and Tarjan's planarity algorithm},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {1},
PAGES = {74-75},
YEAR = {1976, January},
KEYWORDS = {algorithm, complexity, depth-first search, embedding, genus, graph, palm tree, planarity, spanning tree},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yu-Salton/76,
AUTHOR = {Yu, C.T. and Salton, G.},
TITLE = {Precision weighting -- an effective automatic indexing method},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {76-88},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Crump/76,
AUTHOR = {Crump, K.S.},
TITLE = {Numerical inversion of Laplace transforms using a Fourier series approximation},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {89-96},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Potier-Gelenbe-Lenfant/76,
AUTHOR = {Potier, D. and Gelenbe, E. and Lenfant, J.},
TITLE = {Adaptive allocation of central processing unit quanta},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {97-102},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Cody-Coffman/76,
AUTHOR = {Cody, R.A. and Coffman, E.G., Jr.},
TITLE = {Record allocation for minimizing expected retrieval costs on drum-like storage devices},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {103-115},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sahni/76,
AUTHOR = {Sahni, Sartaj},
TITLE = {Algorithms for scheduling independent tasks},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {1},
PAGES = {116-127},
YEAR = {1976, January},
KEYWORDS = {job scheduling, mean flow time, weighted mean flow time, finish time, sequencing with deadlines},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fagin-Easton/76,
AUTHOR = {Fagin, R. and Easton, M.C.},
TITLE = {The independence of miss ratio on page size},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {128-146},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hirschberg-Wong/76,
AUTHOR = {Hirschberg, D.S. and Wong, C.K.},
TITLE = {A polynomial-time algorithm for the knapsack problem with two variables},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {147-154},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Harris/76,
AUTHOR = {Harris, B.},
TITLE = {A code for the transportation problem of linear programming},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {155-157},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kam-Ullman/76,
AUTHOR = {Kam, J.B. and Ullman, J.D.},
TITLE = {Global data flow analysis and iterative algorithms},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {158-171},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Graham-Wegman/76,
AUTHOR = {Graham, Susan L. and Wegman, Mark},
TITLE = {A fast and usually linear algorithm for global flow analysis},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {1},
PAGES = {172-202},
YEAR = {1976, January},
KEYWORDS = {global flow analysis, data flow, code optimization, common subexpression elimination, live-dead analysis},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hoffmann-Landweber/76,
AUTHOR = {Hoffmann, C.M. and Landweber, L.H.},
TITLE = {A completeness theorem for straight-line programs with structured variables},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {203-220},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gabow/76b,
AUTHOR = {Gabow, Harold N.},
TITLE = {An efficient implementation of Edmonds' algorithm for maximum matching on graphs},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {2},
PAGES = {221-234},
YEAR = {1976, April},
KEYWORDS = {graph algorithm, matching on a graph, maximum matching, augmenting path, labeling technique},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Larson/76,
AUTHOR = {Larson, R.G.},
TITLE = {Efficiency of computation of Cayley tables of 2-groups},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {235-241},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Brent/76,
AUTHOR = {Brent, R.P.},
TITLE = {Fast multiple-precision evaluation of elementary functions},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {242-251},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kung/76,
AUTHOR = {Kung, H.T.},
TITLE = {New algorithms and lower bounds for the parallel evaluation of certain rational expressions and recurrences},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {2},
PAGES = {252-261},
YEAR = {1976, April},
KEYWORDS = {parallel algorithms, lower bounds, parallel evaluation, rational expressions, recurrence problem},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{McCreight/76,
AUTHOR = {McCreight, Edward M.},
TITLE = {A space-economical suffix tree construction algorithm},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {2},
PAGES = {262-272},
YEAR = {1976, April},
KEYWORDS = {pattern matching algorithms, searching, search trees, context seaach, substring search},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yu-Luk-Cheung/76,
AUTHOR = {Yu, C.T. and Luk, W.S. and Cheung, T.Y.},
TITLE = {A statistical model for relevance feedback in information retrieval},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {273-286},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Feldstein-Goodman/76,
AUTHOR = {Feldstein, A. and Goodman, R.},
TITLE = {Convergence estimates for the distribution of trailing digits},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {287-297},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fraser/76,
AUTHOR = {Fraser, D.},
TITLE = {Array permutation by index-digit permutation},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {298-309},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Pagano/76,
AUTHOR = {Pagano, M.},
TITLE = {On the linear convergence of a covariance factorization algorithm},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {310-316},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Horowitz-Sahni/76,
AUTHOR = {Horowitz, Ellis and Sahni, Sartaj},
TITLE = {Exact and approximate algorithms for scheduling nonidentical processors},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {2},
PAGES = {317-327},
YEAR = {1976, April},
KEYWORDS = {scheduling independent tasks, uniform processors, unrelated processors, finish time},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Konheim-Reiser/76,
AUTHOR = {Konheim, A.G. and Reiser, M.},
TITLE = {A queueing model with finite waiting room and blocking},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {328-341},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Price/76,
AUTHOR = {Price, T.G.},
TITLE = {A note on the effect on the central processor service time distribution on processor utilization in multiprogrammed computer systems},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {342-346},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Iglehart/76,
AUTHOR = {Iglehart, D.L.},
TITLE = {Simulating stable stochastic systems, VI: Quantile estimation},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {347-360},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Rider/76,
AUTHOR = {Rider, K.L.},
TITLE = {A simple approximation to the average queue size in the time-dependent M/M/1 queue},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {361-367},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Horowitz-Pavlidis/76,
AUTHOR = {Horowitz, S.L. and Pavlidis, T.},
TITLE = {Picture segmentation by a tree traversal algorithm},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {368-388},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Wegbreit-Spitzen/76,
AUTHOR = {Wegbreit, B. and Spitzen, J.M.},
TITLE = {Proving properties of complex data structures},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {389-397},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Joyner/76,
AUTHOR = {Joyner, W.H., Jr.},
TITLE = {Resolution strategies as decision procedures},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {398-417},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chang-Korsh/76,
AUTHOR = {Chang, L. and Korsh, J.F.},
TITLE = {Canonical coin changing and greedy solutions},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {418-422},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Pippenger-Valiant/76,
AUTHOR = {Pippenger, Nicholas and Valiant, Leslie G.},
TITLE = {Shifting graphs and their applications},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {3},
PAGES = {423-432},
YEAR = {1976, July},
KEYWORDS = {graph theory, paths, computational complexity, monotone network, shifting, comparator network},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Schmidt-Druffel/76,
AUTHOR = {Schmidt, Douglas C. and Druffel, Larry E.},
TITLE = {A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {3},
PAGES = {433-445},
YEAR = {1976},
KEYWORDS = {backtrack programming, digraph, distance matrix, isomorphism, partitioning},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Slater/76,
AUTHOR = {Slater, P.J.},
TITLE = {R-domination in graphs},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {446-450},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Burge/76,
AUTHOR = {Burge, W.H.},
TITLE = {An analysis of binary search trees formed from sequences of nondistinct keys},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {451-454},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Cash/76,
AUTHOR = {Cash, J.R.},
TITLE = {Semi-implicit Runge-Kutta procedures with error estimates for the numerical integration of stiff systems of ordinary differential equations},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {455-460},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Garey-Johnson/76,
AUTHOR = {Garey, M.R. and Johnson, D.S.},
TITLE = {Scheduling tasks with nonuniform deadlines on two processors},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {3},
PAGES = {461-467},
YEAR = {1976, July},
KEYWORDS = {multiprocessor systems, task sequencing, scheduling algorithms, NP-complete problems},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Phuong/76,
AUTHOR = {Phuong, T.H.},
TITLE = {Solution of integer programs with a quadratic objective function},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {468-474},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Srinivasan/76,
AUTHOR = {Srinivasan, V.},
TITLE = {Linear programming computational procedures for ordinal regression},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {475-487},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Aho-Johnson/76,
AUTHOR = {Aho, A.V. and Johnson, S.C.},
TITLE = {Optimal code generation for expression trees},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {488-501},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bruno-Sethi/76,
AUTHOR = {Bruno, J. and Sethi, R.},
TITLE = {Code generation for a one-register machine},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {502-510},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mickunas-Lancaster-Schneider/76,
AUTHOR = {Mickunas, M.D. and Lancaster, R.L. and Schneider, V.B.},
TITLE = {Transforming LR(k) grammars to LR(1), SLR(1), and (1,1) bounded right-context grammars},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {511-533},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Muller-Preparata/76,
AUTHOR = {Muller, D.F. and Preparata, F.P.},
TITLE = {Restructuring of arithmetic expressions for parallel evaluation},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {534-543},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Papadimitriou/76,
AUTHOR = {Papadimitriou, Christos H.},
TITLE = {On the complexity of edge traversing},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {3},
PAGES = {544-554},
YEAR = {1976, July},
KEYWORDS = {mixed graphs, Eulerian graphs, unicursality test, Chinese postman problem, NP-complete problems},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sahni-Gonzalez/76,
AUTHOR = {Sahni, Sartaj and Gonzalez, Teofilo},
TITLE = {P-complete approximation problems},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {3},
PAGES = {555-565},
YEAR = {1976, July},
KEYWORDS = {P-complete, approximation algorithm, polynomial complexity, $k$-max cut, traveling salesperson},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yao-Yao/76a,
AUTHOR = {Yao, A.C.-C. and Yao, F.F.},
TITLE = {Lower bounds on merging networks},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {566-571},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Peterson/76,
AUTHOR = {Peterson, G.E.},
TITLE = {Theorem proving with lemmas},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {573-581},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ginsburg-Lynch/76,
AUTHOR = {Ginsburg, Seymour and Lynch, Nancy},
TITLE = {Size complexity in context-free grammar forms},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {4},
PAGES = {582-598},
YEAR = {1976, October},
KEYWORDS = {complexity, grammar forms, size of grammars},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yakimovsky/76,
AUTHOR = {Yakimovsky, Y.},
TITLE = {Boundary and object detection in real world images},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {599-618},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Eisner-Severance/76,
AUTHOR = {Eisner, M.J. and Severance, D.G.},
TITLE = {Mathematical techniques for efficient record segmentation in large shared databases},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {619-635},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Heller-Stevenson-Traub/76,
AUTHOR = {Heller, D.E. and Stevenson, D.K. and Traub, J.F.},
TITLE = {Accelerated iterative methods for the solution of tridiagonal systems on parallel computers},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {4},
PAGES = {636-654},
YEAR = {1976, October},
KEYWORDS = {parallel algorithms, tridiagonal systems, iterative methods},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bruno/76,
AUTHOR = {Bruno, J.L.},
TITLE = {Sequencing jobs with stochastic task structures on a single machine},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {655-664},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gonzalez-Sahni/76,
AUTHOR = {Gonzalez, Teofilo and Sahni, Sartaj},
TITLE = {Open shop scheduling to minimize finish time},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {4},
PAGES = {665-679},
YEAR = {1976, October},
KEYWORDS = {open shop, preemptive and nonpreemptive schedules, finish time, polynomial complexity, NP-complete},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Rosberg-Adiri/76,
AUTHOR = {Rosberg, Z. and Adiri, I.},
TITLE = {Multilevel queues with external priorities},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {680-690},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Wegbreit/76,
AUTHOR = {Wegbreit, B.},
TITLE = {Verifying program performance},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {691-699},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hayes/76,
AUTHOR = {Hayes, J.P.},
TITLE = {Enumeration of fanout-free Boolean functions},
JOURNAL = {J. ACM},
VOLUME = {23},
PAGES = {700-709},
YEAR = {1976},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Even-Tarjan/76,
AUTHOR = {Even, S. and Tarjan, R.E.},
TITLE = {A combinatorial problem which is complete in polynomial space},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {4},
PAGES = {710-719},
YEAR = {1976, October},
KEYWORDS = {completeness in polynomial space, computational complexity, Hex, Shannon switching game},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lipton-Eisenstat-DeMillo/76,
AUTHOR = {Lipton, R.J. and Eisenstat, S.C. and DeMillo, R.A.},
TITLE = {Space and time hierarchies for classes of control structures and data structures},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {4},
PAGES = {720-732},
YEAR = {1976, October},
KEYWORDS = {ancestor tree, bounded simulation, complexity, control structure, data structure},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{van_Emden-Kowalski/76,
AUTHOR = {van Emden, M.H. and Kowalski, R.A.},
TITLE = {The semantics of predicate logic as a programming language},
JOURNAL = {J. ACM},
VOLUME = {23},
NUMBER = {4},
PAGES = {733-742},
YEAR = {1976, October},
KEYWORDS = {predicate logic, semantics, resolution theorem proving, operational vs. denotational semantics},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}