参考书目

[Abrahamson et al., 1994]	Abrahamson, K., Adler, A., Higham, L., and Kirkpatrick, D. (1994). Tight lower bounds for probabilistic solitude verification on anonymous rings. Journal of the ACM, 41(2):277-310.
[Afek et al., 1993]	Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., and Shavit, N. (1993). Atomic snapshots of shared memory. Journal of the ACM, 40(4):873-890.
[Afek et al., 1994]	Afek, Y., Attiya, H., Fekete, A., Fischer, M., Lynch, N., Mansour, Y., Wang, D.-W., and Zuck, L. (1994). Reliable communication over unreliable channels. Journal of the ACM, 41(6):1267-1297.
[Afek et al., 1996]	Afek, Y., Awerbuch, B., Plotkin, S., and Saks, M. (1996). Local management of a global resource in a communication network. Journal of the ACM, 43(1):1-19.
[Afek et al., 1995]	Afek, Y., Greenberg, D. S., Merritt, M., and Taubenfeld, G. (1995). Computing with faulty shared ojects. Journal of the ACM, 42(6):1231-1274.
[Afrati and Papadimitriou, 1993]	Afrati, F. and Papadimitriou, C. H. (1993). The parallel complexity of simple logic programs. Journal of the ACM, 40(4):891-916.
[Alon and Megiddo, 1994]	Alon, N. and Megiddo, N. (1994). Parallel linear programming in fixed dimension almost surely in constant time. Journal of the ACM, 41(2):422-434.
[Alon et al., 1995]	Alon, N., Yuster, R., and Zwick, U. (1995). Color-coding. Journal of the ACM, 42(4):844-856.
[Alur et al., 1996]	Alur, R., Feder, T., and Henzinger, T. A. (1996). The benefits of relaxing punctuality. Journal of the ACM, 43(1):116-146.
[Alur and Henzinger, 1994]	Alur, R. and Henzinger, T. A. (1994). A really temporal logic. Journal of the ACM, 41(1):181-204.
[Angluin et al., 1993]	Angluin, D., Hellerstein, L., and Karpinski, M. (1993). Learning read-once formulas with queries. Journal of the ACM, 40(1):185-210.
[Arnborg et al., 1993]	Arnborg, S., Courcelle, B., Proskurowski, A., and Seese, D. (1993). An algebraic theory of graph reduction. Journal of the ACM, 40(5):1134-1164.
[Aspnes et al., 1994]	Aspnes, J., Herlihy, M., and Shavit, N. (1994). Counting networks. Journal of the ACM, 41(5):1020-1048.
[Atallah et al., 1994]	Atallah, M. J., Goodrich, M. T., and Kosaraju, S. R. (1994). Parallel algorithms for evaluating sequences of set-manipulation operations. Journal of the ACM, 41(6):1049-1088.
[Attiya et al., 1995]	Attiya, H., Bar-Noy, A., and Dolev, D. (1995). Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124-142.
[Attiya et al., 1994]	Attiya, H., Dwork, C., Lynch, N., and Stockmeyer, L. (1994). Bounds on the time to reach agreement in the presence of timing uncertainty. Journal of the ACM, 41(1):122-152.
[Awerbuch and Peleg, 1995]	Awerbuch, B. and Peleg, D. (1995). Online tracking of mobile users. Journal of the ACM, 42(5):1021-1058.
[Baader, 1993]	Baader, F. (1993). Unification in commutative theories, Hilberts basis theorem and Gröbner bases. Journal of the ACM, 40(3):477-503.
[Baccelli et al., 1993]	Baccelli, F., Liu, Z., and Towsley, D. (1993). Extremal scheduling of parallel processing with and without real-time constraints. Journal of the ACM, 40(5):1209-1237.
[Bachmair and Dershowitz, 1994]	Bachmair, L. and Dershowitz, N. (1994). Equational inference, canonical proofs, and proof orderings. Journal of the ACM, 41(2):236-276.
[Baeten et al., 1993]	Baeten, J. C. M., Bergstra, J. A., and Klop, J. W. (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM, 40(3):653-682.
[Baker, 1994]	Baker, B. S. (1994). Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41(1):153-180.
[Bay and Bilardi, 1995]	Bay, P. and Bilardi, G. (1995). Deterministic on-line routing on area-universal networks. Journal of the ACM, 42(3):614-640.
[Bell and Witten, 1994]	Bell, T. C. and Witten, I. H. (1994). The relationship between greedy parsing and symbolwise text compression. Journal of the ACM, 41(4):708-724.
[Berger et al., 1995]	Berger, B., Brady, M., Brown, D., and Leighton, T. (1995). Nearly optimal algorithms and bounds for multilayer channel routing. Journal of the ACM, 42(2):500-542.
[Bergstra and Tucker, 1995]	Bergstra, J. A. and Tucker, J. V. (1995). Equational specifications, complete term rewriting systems, and computable and semicomputable algebras. Journal of the ACM, 42(6):1194-1230.
[Bhatt and Cai, 1993]	Bhatt, S. and Cai, J. (1993). Taking random walks to grow trees in hypercubes. Journal of the ACM, 40(3):741-764.
[Bhatt et al., 1996]	Bhatt, S. N., Chung, F. R. K., Hong, J.-W., Leighton, F. T., Obrenic', B., Rosenberg, A. L., and Schwabe, E. J. (1996). Optimal emulations by butterfly-like networks. Journal of the ACM, 43(2):293-330.
[Birman et al., 1995]	Birman, A., Gail, H. R., Hantler, S. L., Rosberg, Z., and Sidi, M. (1995). An optimal service policy for buffer systems. Journal of the ACM, 42(3):641-657.
[Bloom et al., 1995]	Bloom, B., Istrail, S., and Meyer, A. R. (1995). Bisimulation cant be traced. Journal of the ACM, 42(1):232-268.
[Blum, 1994]	Blum, A. (1994). New approximation algorithms for graph coloring. Journal of the ACM, 41(3):470-516.
[Blum et al., 1994]	Blum, A., Jiang, T., Li, M., Tromp, J., and Yannakakis, M. (1994). Linear approximation of shortest superstrings. Journal of the ACM, 41(4):630-647.
[Blum and Kannan, 1995]	Blum, M. and Kannan, S. (1995). Designing programs that check their work. Journal of the ACM, 42(1):269-291.
[Bol and Groote, 1996]	Bol, R. and Groote, J. F. (1996). The meaning of negative premises in transition system specifications. Journal of the ACM, 43(5):863-914.
[Boyar et al., 1995]	Boyar, J., Brassard, G., and Peralta, R. (1995). Subquadratic zero-knowledge. Journal of the ACM, 42(6):1169-1193.
[Boyer and Yu, 1996]	Boyer, R. S. and Yu, Y. (1996). Automated proofs of object code for a widely used microprocessor. Journal of the ACM, 43(1):166-192.
[Bshouty, 1993]	Bshouty, N. H. (1993). On the complexity of functions for random access machines. Journal of the ACM, 40(2):211-223.
[Bshouty and Tamon, 1996]	Bshouty, N. H. and Tamon, C. (1996). On the Fourier spectrum of monotone functions. Journal of the ACM, 43(4):747-770.
[Buntine and Bürckert, 1994]	Buntine, W. L. and Bürckert, H.-J. (1994). On solving equations and disequations. Journal of the ACM, 41(4):591-629.
[Busch and Mavronicolas, 1996]	Busch, C. and Mavronicolas, M. (1996). A combinatorial treatment of balancing networks. Journal of the ACM, 43(5):794-839.
[Callahan and Kosaraju, 1995]	Callahan, P. B. and Kosaraju, S. R. (1995). A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM, 42(1):67-90.
[Chandra et al., 1996]	Chandra, T. D., Hadzilacos, V., and Toueg, S. (1996). The weakest failure detector for solving Consensus. Journal of the ACM, 43(4):685-722.
[Chang and Nelson, 1995]	Chang, C. S. and Nelson, R. (1995). Bounds on the speedup and efficiency of partial synchronization in parallel processing systems. Journal of the ACM, 42(1):204-231.
[Chen and Warren, 1996]	Chen, W. and Warren, D. S. (1996). Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20-74.
[Cheng and Muntz, 1996]	Cheng, W. C. and Muntz, R. R. (1996). Bounding errors introduced by clustering of customers in closed product-form queueing networks. Journal of the ACM, 43(4):641-669.
[Chien and Kim, 1995]	Chien, A. A. and Kim, J. H. (1995). Planar-adaptive routing: Low-cost adaptive networks for multiprocessors. Journal of the ACM, 42(1):91-123.
[Choudhury et al., 1995]	Choudhury, G. L., Leung, K. K., and Whitt, W. (1995). Calculating normalization constants of closed queueing networks by numerically inverting their generating functions. Journal of the ACM, 42(5):935-970.
[Clarkson, 1995]	Clarkson, K. L. (1995). Las Vegas algorithms for linear and integer programming when the dimension is small. Journal of the ACM, 42(2):488-499.
[Coffman, Jr. and Garey, 1993]	Coffman, Jr., E. G. and Garey, M. R. (1993). Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling. Journal of the ACM, 40(5):991-1018.
[Cohen and Megiddo, 1993]	Cohen, E. and Megiddo, N. (1993). Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. Journal of the ACM, 40(4):791-830.
[Compton and Ravishankar, 1995]	Compton, K. J. and Ravishankar, C. (1995). Expected deadlock time in a multiprocessing system. Journal of the ACM, 42(3):562-583.
[Conforti and Cornuéjols, 1995]	Conforti, M. and Cornuéjols, G. (1995). A class of logic problems solvable by linear programming. Journal of the ACM, 42(5):1107-1113.
[Conway et al., 1994]	Conway, A. E., Pinsky, E., and Tridandapani, S. (1994). Efficient decomposition methods for the analysis of multi-facility blocking models. Journal of the ACM, 41(4):648-675.
[Cosnard and Daoudi, 1994]	Cosnard, M. and Daoudi, E. M. (1994). Optimal algorithms for parallel givens factorization on a coarse-grained PRAM. Journal of the ACM, 41(2):399-421.
[Courcoubetis and Yannakakis, 1995]	Courcoubetis, C. and Yannakakis, M. (1995). The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907.
[Curien et al., 1996]	Curien, P.-L., Hardin, T., and Lévy, J.-J. (1996). Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM, 43(2):362-397.
[Dallery et al., 1994]	Dallery, Y., Liu, Z., and Towsley, D. (1994). Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking. Journal of the ACM, 41(5):903-942.
[Dolev et al., 1993]	Dolev, D., Dwork, C., Waarts, O., and Yung, M. (1993). Perfectly secure message transmission. Journal of the ACM, 40(1):17-47.
[Dolev et al., 1995]	Dolev, D., Halpern, J. Y., Simons, B., and Strong, R. (1995). Dynamic fault-tolerant clock synchronization. Journal of the ACM, 42(1):143-185.
[Donald et al., 1993]	Donald, B., Xavier, P., Canny, J., and Reif, J. (1993). Kinodynamic motion planning. Journal of the ACM, 40(5):1048-1066.
[Driscoll et al., 1994]	Driscoll, J. R., Sleator, D. D. K., and Tarjan, R. E. (1994). Fully persistent lists with catenation. Journal of the ACM, 41(5):943-959.
[Drusinsky and Harel, 1994]	Drusinsky, D. and Harel, D. (1994). On the power of bounded concurrency I: Finite automata. Journal of the ACM, 41(3):517-539.
[Dubiner et al., 1994]	Dubiner, M., Galil, Z., and Magen, E. (1994). Faster tree pattern matching. Journal of the ACM, 41(2):205-213.
[Eiter and Gottlob, 1995]	Eiter, T. and Gottlob, G. (1995). The complexity of logic-based abduction. Journal of the ACM, 42(1):3-42.
[Fagin and Halpern, 1994]	Fagin, R. and Halpern, J. Y. (1994). Reasoning about knowledge and probability. Journal of the ACM, 41(2):340-367.
[Feige et al., 1996]	Feige, U., Goldwasser, S., Lovász, L., Safra, S., and Szegedy, M. (1996). Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268-292.
[Fekete et al., 1993]	Fekete, A., Lynch, N., Mansour, Y., and Spinelli, J. (1993). The impossibility of implementing reliable communication in the face of crashes. Journal of the ACM, 40(5):1087-1107.
[Fischer and Paterson, 1994]	Fischer, M. J. and Paterson, M. S. (1994). Fishspear: A priority queue algorithm. Journal of the ACM, 41(1):3-30.
[Fonlupt and Nachef, 1993]	Fonlupt, J. and Nachef, A. (1993). Dynamic programming and the graphical traveling salesman problem. Journal of the ACM, 40(5):1165-1187.
[Freivalds et al., 1995]	Freivalds, R., Kinber, E., and Smith, C. H. (1995). On the impact of forgetting on learning machines. Journal of the ACM, 42(6):1146-1168.
[Galil, 1995]	Galil, Z. (1995). A constant-time optimal parallel string-matching algorithm. Journal of the ACM, 42(4):908-918.
[Gallier et al., 1993]	Gallier, J., Narendran, P., Plaisted, D., Raatz, S., and Snyder, W. (1993). An algorithm for finding canonical sets of ground rewrite rules in polynomial time. Journal of the ACM, 40(1):1-16.
[Gao and Kaufmann, 1994]	Gao, S. and Kaufmann, M. (1994). Channel routing of multiterminal nets. Journal of the ACM, 41(4):791-818.
[Glass and Ni, 1994]	Glass, C. J. and Ni, L. M. (1994). The turn model for adaptive routing. Journal of the ACM, 41(5):874-902.
[Goemans and Williamson, 1995]	Goemans, M. X. and Williamson, D. P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145.
[Goldreich and Ostrovsky, 1996]	Goldreich, O. and Ostrovsky, R. (1996). Software protection and simulation on oblivious RAMs. Journal of the ACM, 43(3):431-473.
[Golumbic and Shamir, 1993]	Golumbic, M. C. and Shamir, R. (1993). Complexity and algorithms for reasoning about time: A graph-theoretic approach. Journal of the ACM, 40(5):1108-1133.
[Goodrich and Kosaraju, 1996]	Goodrich, M. T. and Kosaraju, S. R. (1996). Sorting on a parallel pointer machine with applications to set expression evaluation. Journal of the ACM, 43(2):331-361.
[Gottlob, 1995a]	Gottlob, G. (1995a). NP trees and Carnaps modal logic. Journal of the ACM, 42(2):421-457.
[Gottlob, 1995b]	Gottlob, G. (1995b). Translating default logic into standard autoepistemic logic. Journal of the ACM, 42(4):711-740.
[Haldar and Vidyasankar, 1995]	Haldar, S. and Vidyasankar, K. (1995). Constructing 1-writer multireader multivalued atomic variable from regular variables. Journal of the ACM, 42(1):186-203.
[Halpern and Tuttle, 1993]	Halpern, J. Y. and Tuttle, M. R. (1993). Knowledge, probability, and adversaries. Journal of the ACM, 40(4):917-962.
[Harper et al., 1993]	Harper, R., Honsell, F., and Plotkin, G. (1993). A framework for defining logics. Journal of the ACM, 40(1):143-184.
[Hellerstein et al., 1996]	Hellerstein, L., Pillaipakkamnatt, K., Raghavan, V., and Wilkins, D. (1996). How many queries are needed to learn? Journal of the ACM, 43(5):840-862.
[Hirst and Harel, 1994]	Hirst, T. and Harel, D. (1994). On the power of bounded concurrency II: Pushdown automata. Journal of the ACM, 41(3):540-554.
[Hobby, 1993]	Hobby, J. D. (1993). Generating automatically tuned bitmaps from outlines. Journal of the ACM, 40(1):48-94.
[Jean-Marie and Gün, 1993]	Jean-Marie, A. and Gün, L. (1993). Parallel queues with resequencing. Journal of the ACM, 40(5):1188-1208.
[Johnson, 1993]	Johnson, C. A. (1993). Factorization and circuit in the connection method. Journal of the ACM, 40(3):536-557.
[Joung and Smolka, 1996]	Joung, Y.-J. and Smolka, S. A. (1996). A comprehensive study of the complexity of multiparty interaction. Journal of the ACM, 43(1):75-115.
[Kahale, 1995]	Kahale, N. (1995). Eigenvalues and expansion of regular graphs. Journal of the ACM, 42(5):1091-1106.
[Karger et al., 1995]	Karger, D. R., Klein, P. N., and Tarjan, R. E. (1995). A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM, 42(2):321-328.
[Karger and Stein, 1996]	Karger, D. R. and Stein, C. (1996). A new approach to the minimum cut problem. Journal of the ACM, 43(4):601-640.
[Karloff and Raghavan, 1993]	Karloff, H. J. and Raghavan, P. (1993). Randomized algorithms and pseudorandom numbers. Journal of the ACM, 40(3):454-476.
[Karp, 1994]	Karp, R. M. (1994). Probabilistic recurrence relations. Journal of the ACM, 41(6):1136-1150.
[Karp and Zhang, 1993]	Karp, R. M. and Zhang, Y. (1993). Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the ACM, 40(3):765-789.
[Kearns and Valiant, 1994]	Kearns, M. and Valiant, L. (1994). Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the ACM, 41(1):67-95.
[Kfoury et al., 1994]	Kfoury, A. J., Tiuryn, J., and Urzyczyn, P. (1994). An analysis of ML typability. Journal of the ACM, 41(2):368-398.
[Khuller and Vishkin, 1994]	Khuller, S. and Vishkin, U. (1994). Biconnectivity approximations and graph carvings. Journal of the ACM, 41(2):214-235.
[Kifer et al., 1995]	Kifer, M., Lausen, G., and Wu, J. (1995). Logical foundations of object-oriented and frame-based languages. Journal of the ACM, 42(4):741-843.
[Knessl, 1993]	Knessl, C. (1993). On the sojourn time distribution in a finite capacity processor shared queue. Journal of the ACM, 40(5):1238-1301.
[Korilis and Lazar, 1995]	Korilis, Y. A. and Lazar, A. A. (1995). On the existence of equilibria in noncooperative optimal flow control. Journal of the ACM, 42(3):584-613.
[Kos'cielski and Pacholski, 1996]	Kos'cielski, A. and Pacholski, L. (1996). Complexity of Makanins algorithm. Journal of the ACM, 43(4):670-684.
[Koutsoupias and Papadimitriou, 1995]	Koutsoupias, E. and Papadimitriou, C. H. (1995). On the k-server conjecture. Journal of the ACM, 42(5):971-983.
[Kurtz et al., 1995]	Kurtz, S. A., Mahaney, S. R., and Royer, J. S. (1995). The isomorphism conjecture fails relative to a random oracle. Journal of the ACM, 42(2):401-420.
[Ladkin and Maddux, 1994]	Ladkin, P. B. and Maddux, R. D. (1994). On binary constraint problems. Journal of the ACM, 41(3):435-469.
[LaPaugh, 1993]	LaPaugh, A. S. (1993). Recontamination does not help to search a graph. Journal of the ACM, 40(2):224-245.
[Lengauer and Wanke, 1993]	Lengauer, T. and Wanke, E. (1993). Efficient decision procedures for graph properties on context-free graph languages. Journal of the ACM, 40(2):368-393.
[Leung, 1993]	Leung, K. K. (1993). An execution/sleep scheduling policy for serving an additional job in priority queueing systems. Journal of the ACM, 40(2):394-417.
[Li et al., 1996]	Li, M., Tromp, J., and Vitányi, P. M. B. (1996). How to share concurrent wait-free variables. Journal of the ACM, 43(4):723-746.
[Lin and Shoham, 1995]	Lin, F. and Shoham, Y. (1995). Provably correct theories of action. Journal of the ACM, 42(2):293-320.
[Linial et al., 1993]	Linial, N., Mansour, Y., and Nisan, N. (1993). Constant depth circuits, Fourier transform and learnability. Journal of the ACM, 40(3):607-620.
[Lui and Muntz, 1994]	Lui, J. C. S. and Muntz, R. R. (1994). Computing bounds on steady state availability of repairable computer systems. Journal of the ACM, 41(4):676-707.
[Lund and Yannakakis, 1994]	Lund, C. and Yannakakis, M. (1994). On the hardness of approximating minimization problems. Journal of the ACM, 41(5):960-981.
[Luo and Tsitsiklis, 1993]	Luo, Z. and Tsitsiklis, J. N. (1993). On the communication complexity of distributed algebraic computation. Journal of the ACM, 40(5):1019-1047.
[Marcus and Subrahmanian, 1996]	Marcus, S. and Subrahmanian, V. S. (1996). Foundations of multimedia database systems. Journal of the ACM, 43(3):474-523.
[McAllester and Givan, 1993]	McAllester, D. and Givan, R. (1993). Taxonomic syntax for first order inference. Journal of the ACM, 40(2):246-283.
[McAllester, 1993]	McAllester, D. A. (1993). Automatic recognition of tractability in inference relations. Journal of the ACM, 40(2):284-303.
[Mehlhorn and Tsakalidis, 1993]	Mehlhorn, K. and Tsakalidis, A. (1993). Dynamic interpolation search. Journal of the ACM, 40(3):621-634.
[Miltersen et al., 1996]	Miltersen, P. B., Paterson, M., and Tarui, J. (1996). The asymptotic complexity of merging networks. Journal of the ACM, 43(1):147-165.
[Motwani, 1994]	Motwani, R. (1994). Average-case analysis of algorithms for matchings and related problems. Journal of the ACM, 41(6):1329-1356.
[Murray and Rosenthal, 1993]	Murray, N. V. and Rosenthal, E. (1993). Dissolution: Making paths vanish. Journal of the ACM, 40(3):504-535.
[Naughton and Ramakrishnan, 1994]	Naughton, J. F. and Ramakrishnan, R. (1994). How to forget the past without repeating it. Journal of the ACM, 41(6):1151-1177.
[Nebel and Bürckert, 1995]	Nebel, B. and Bürckert, H.-J. (1995). Reasoning about temporal relations: A maximal tractable subclass of Allens interval algebra. Journal of the ACM, 42(1):43-66.
[Nederhof and Bertsch, 1996]	Nederhof, M.-J. and Bertsch, E. (1996). Linear-time suffix parsing for deterministic languages. Journal of the ACM, 43(3):524-554.
[Neiger and Toueg, 1993]	Neiger, G. and Toueg, S. (1993). Simulating synchronized clocks and common knowledge in distributed systems. Journal of the ACM, 40(2):334-367.
[Nelson and Towsley, 1993]	Nelson, R. and Towsley, D. (1993). A performance evaluation of several priority policies for parallel processing systems. Journal of the ACM, 40(3):714-740.
[Nicol, 1993]	Nicol, D. M. (1993). The cost of conservative synchronization in parallel discrete event simulations. Journal of the ACM, 40(2):304-333.
[Nicola and Vaandrager, 1995]	Nicola, R. D. and Vaandrager, F. (1995). Three logics for branching bisimulation. Journal of the ACM, 42(2):458-487.
[Nodine and Vitter, 1995]	Nodine, M. H. and Vitter, J. S. (1995). Greed sort: Optimal deterministic sorting on parallel disks. Journal of the ACM, 42(4):919-933.
[OHearn and Tennent, 1995]	OHearn, P. W. and Tennent, R. D. (1995). Parametricity and local variables. Journal of the ACM, 42(3):658-709.
[Orponen et al., 1994]	Orponen, P., Ko, K., Schöning, U., and Watanabe, O. (1994). Instance complexity. Journal of the ACM, 41(1):96-121.
[Pitt and Warmuth, 1993]	Pitt, L. and Warmuth, M. K. (1993). The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the ACM, 40(1):95-142.
[Rabin, 1994]	Rabin, T. (1994). Robust sharing of secrets when the dealer is honest or cheating. Journal of the ACM, 41(6):1089-1109.
[Rathmann et al., 1994]	Rathmann, P. K., Winslett, M., and Manasse, M. (1994). Circumscription with homomorphisms: Solving the equality and counterexample problems. Journal of the ACM, 41(5):819-873.
[Reif and Sharir, 1994]	Reif, J. and Sharir, M. (1994). Motion planning in the presence of moving obstacles. Journal of the ACM, 41(4):764-790.
[Reif and Storer, 1994]	Reif, J. H. and Storer, J. A. (1994). A single-exponential upper bounds for finding shortest paths in three dimensions. Journal of the ACM, 41(5):1013-1019.
[Rivest and Schapire, 1994]	Rivest, R. L. and Schapire, R. E. (1994). Diversity-based inference of finite automata. Journal of the ACM, 41(3):555-589.
[Rockmore, 1994]	Rockmore, D. N. (1994). Efficient computation of Fourier inversion for finite groups. Journal of the ACM, 41(1):31-66.
[Ross, 1994]	Ross, K. A. (1994). Modular stratification and magic sets for datalog programs with negation. Journal of the ACM, 41(6):1216-1266.
[Ross et al., 1994]	Ross, K. W., Tsang, D. H. K., and Wang, J. (1994). Monte Carlo summation and integration applied to multiclass queuing networks. Journal of the ACM, 41(6):1110-1135.
[Santos, 1996]	Santos, Jr., E. (1996). On linear potential functions for approximating Bayesian computations. Journal of the ACM, 43(3):399-430.
[Selman and Kautz, 1996]	Selman, B. and Kautz, H. (1996). Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224.
[Singh et al., 1994]	Singh, A. K., Anderson, J. H., and Gouda, M. G. (1994). The elusive atomic register. Journal of the ACM, 41(2):311-339.
[Storer and Reif, 1994]	Storer, J. A. and Reif, J. H. (1994). Shortest paths in the plane with polygonal obstacles. Journal of the ACM, 41(5):982-1012.
[Tay, 1993]	Tay, Y. C. (1993). On the optimality of strategies for multiple joins. Journal of the ACM, 40(5):1067-1086.
[Tempero and Ladner, 1995]	Tempero, E. D. and Ladner, R. E. (1995). Recoverable sequence transmission protocols. Journal of the ACM, 42(5):1059-1090.
[Toyama et al., 1995]	Toyama, Y., Klop, J. W., and Barendregt, H. P. (1995). Termination for direct sums of left-linear complete term rewriting systems. Journal of the ACM, 42(6):1275-1304.
[Tsitsiklis and Stamoulis, 1995]	Tsitsiklis, J. N. and Stamoulis, G. D. (1995). On the average communication complexity of asynchronous distributed algorithms. Journal of the ACM, 42(2):382-400.
[van Beek and Dechter, 1995]	van Beek, P. and Dechter, R. (1995). On the minimality and global consistency of row-convex constraint networks. Journal of the ACM, 42(3):543-561.
[van Glabbeek and Weijland, 1996]	van Glabbeek, R. J. and Weijland, W. P. (1996). Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555-600.
[van Kreveld and Overmars, 1993]	van Kreveld, M. J. and Overmars, M. H. (1993). Union-copy structures and dynamic segment trees. Journal of the ACM, 40(3):635-652.
[Verma, 1995]	Verma, R. M. (1995). A theory of using history for equational systems with applications. Journal of the ACM, 42(5):984-1020.
[Vitter and Krishnan, 1996]	Vitter, J. S. and Krishnan, P. (1996). Optimal prefetching via data compression. Journal of the ACM, 43(5):771-793.
[Wang et al., 1995]	Wang, K., Zhang, W., and Chau, S.-C. (1995). Decomposition of magic rewriting. Journal of the ACM, 42(2):329-381.
[Wang, 1993]	Wang, T. (1993). Z-module reasoning: An equality-oriented proving method with built-in ring axioms. Journal of the ACM, 40(3):558-606.
[Yu et al., 1993]	Yu, P. S., Dias, D. M., and Lavenberg, S. S. (1993). On the analytical modeling of database concurrency control. Journal of the ACM, 40(4):831-872.