@article{Gallier-Narendran-Plaisted-Raatz-Snyder/93,
AUTHOR = {Gallier, J. and Narendran, P. and Plaisted, D. and Raatz, S. and Snyder, W.},
TITLE = {An algorithm for finding canonical sets of ground rewrite rules in polynomial time},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {1},
PAGES = {1-16},
YEAR = {1993, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Dolev-Dwork-Waarts-Yung/93,
AUTHOR = {Dolev, D. and Dwork, C. and Waarts, O. and Yung, M.},
TITLE = {Perfectly secure message transmission},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {1},
PAGES = {17-47},
YEAR = {1993, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hobby/93,
AUTHOR = {Hobby, J.D.},
TITLE = {Generating automatically tuned bitmaps from outlines},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {1},
PAGES = {48-94},
YEAR = {1993, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Pitt-Warmuth/93,
AUTHOR = {Pitt, L. and Warmuth, M.K.},
TITLE = {The minimum consistent DFA problem cannot be approximated within any polynomial},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {1},
PAGES = {95-142},
YEAR = {1993, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Harper-Honsell-Plotkin/93,
AUTHOR = {Harper, R. and Honsell, F. and Plotkin, G.},
TITLE = {A framework for defining logics},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {1},
PAGES = {143-184},
YEAR = {1993, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Angluin-Hellerstein-Karpinski/93,
AUTHOR = {Angluin, D. and Hellerstein, L. and Karpinski, M.},
TITLE = {Learning read-once formulas with queries},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {1},
PAGES = {185-210},
YEAR = {1993, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bshouty/93,
AUTHOR = {Bshouty, Nader H.},
TITLE = {On the complexity of functions for random access machines},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {2},
PAGES = {211-223},
YEAR = {1993, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{LaPaugh/93,
AUTHOR = {LaPaugh, Andrea S.},
TITLE = {Recontamination does not help to search a graph},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {2},
PAGES = {224-245},
YEAR = {1993, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{McAllester-Givan/93,
AUTHOR = {McAllester, David and Givan, Robert},
TITLE = {Taxonomic syntax for first order inference},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {2},
PAGES = {246-283},
YEAR = {1993, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{McAllester/93,
AUTHOR = {McAllester, David A.},
TITLE = {Automatic recognition of tractability in inference relations},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {2},
PAGES = {284-303},
YEAR = {1993, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Nicol/93,
AUTHOR = {Nicol, David M.},
TITLE = {The cost of conservative synchronization in parallel discrete event simulations},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {2},
PAGES = {304-333},
YEAR = {1993, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Neiger-Toueg/93,
AUTHOR = {Neiger, Gil and Toueg, Sam},
TITLE = {Simulating synchronized clocks and common knowledge in distributed systems},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {2},
PAGES = {334-367},
YEAR = {1993, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lengauer-Wanke/93,
AUTHOR = {Lengauer, Thomas and Wanke, Egon},
TITLE = {Efficient decision procedures for graph properties on context-free graph languages},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {2},
PAGES = {368-393},
YEAR = {1993, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Leung/93,
AUTHOR = {Leung, Kin K.},
TITLE = {An execution/sleep scheduling policy for serving an additional job in priority queuing systems},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {2},
PAGES = {394-417},
YEAR = {1993, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Coppersmith-Doyle-Raghavan-Snir/93,
AUTHOR = {Coppersmith, Don and Doyle, Peter and Raghavan, Prabhakar and Snir, Marc},
TITLE = {Random walks on weighted graphs and applications to on-line algorithms},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {421-453},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Karloff-Raghavan/93,
AUTHOR = {Karloff, Howard J. and Raghavan, Prabhakar},
TITLE = {Randomized algorithms and pseudorandom numbers},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {454-476},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Baader/93,
AUTHOR = {Baader, Franz},
TITLE = {Unification in commutative theories, Hilbert's basis theorem, and Gr{\"o}bner bases},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {477-503},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Murray-Rosenthal/93,
AUTHOR = {Murray, Neil V. and Rosenthal, Erik},
TITLE = {Dissolution: Making paths vanish},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {504-535},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Johnson/93a,
AUTHOR = {Johnson, C.A.},
TITLE = {Factorization and circuit in the connection method},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {536-557},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Wang/93d,
AUTHOR = {Wang, Tie-Cheng},
TITLE = {Z-module reasoning: An equality-oriented proving method with built-in ring axioms},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {558-606},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Linial-Mansour-Nisan/93,
AUTHOR = {Linial, Nathan and Mansour, Yishay and Nisan, Noam},
TITLE = {Constant depth circuits, Fourier transform, and learnability},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {607-620},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mehlhorn-Tsakalidis/93,
AUTHOR = {Mehlhorn, Kurt and Tsakalidis, Athanasios},
TITLE = {Dynamic interpolation search},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {621-634},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{van_Kreveld-Overmars/93,
AUTHOR = {van Kreveld, Marc J. and Overmars, Mark H.},
TITLE = {Union-copy structures and dynamic segment trees},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {635-652},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Baeten-Bergstra-Klop/93,
AUTHOR = {Baeten, J.C.M. and Bergstra, J.A. and Klop, J.W.},
TITLE = {Decidability of bisimulation equivalence for processes generating context-free languages},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {653-682},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gaifman-Mairson-Sagiv-Vardi/93,
AUTHOR = {Gaifman, Haim and Mairson, Harry and Sagiv, Yehoshua and Vardi, Moshe Y.},
TITLE = {Undecidable optimization problems for database logic programs},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {683-713},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Nelson-Towsley/93,
AUTHOR = {Nelson, Randolph and Towsley, Donald},
TITLE = {A performance evaluation of several priority policies for parallel processing systems},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {714-740},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bhatt-Cai/93,
AUTHOR = {Bhatt, Sandeep and Cai, Jin-Yi},
TITLE = {Taking random walks to grow trees in hypercubes},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {741-764},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Karp-Zhang/93,
AUTHOR = {Karp, Richard M. and Zhang, Yanjun},
TITLE = {Randomized parallel algorithms for backtrack search and branch-and-bound computation},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {3},
PAGES = {765-789},
YEAR = {1993, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Cohen-Megiddo/93,
AUTHOR = {Cohen, Edith and Megiddo, Nimrod},
TITLE = {Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {4},
PAGES = {791-830},
YEAR = {1993, September},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yu-Dias-Lavenberg/93,
AUTHOR = {Yu, Philip S. and Dias, Daniel M. and Lavenberg, Stephen S.},
TITLE = {On the analytical modeling of database concurrency control},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {4},
PAGES = {831-872},
YEAR = {1993, September},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Afek-Attiya-Dolev-Gafni-Merritt-Shavit/93,
AUTHOR = {Afek, Yehuda and Attiya, Hagit and Dolev, Danny and Gafni, Eli and Merritt, Michael and Shavit, Nir},
TITLE = {Atomic snapshots of shared memory},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {4},
PAGES = {873-890},
YEAR = {1993, September},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Afrati-Papadimitriou/93,
AUTHOR = {Afrati, Foto and Papadimitriou, Christos H.},
TITLE = {The parallel complexity of simple logic programs},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {4},
PAGES = {891-916},
YEAR = {1993, September},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Halpern-Tuttle/93,
AUTHOR = {Halpern, Joseph Y. and Tuttle, Mark R.},
TITLE = {Knowledge, probability, and adversaries},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {4},
PAGES = {917-962},
YEAR = {1993, September},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Marek-Schwarz-Truszczynski/93,
AUTHOR = {Marek, V. Wiktor and Schwarz, Grigori F. and Truszczy{\'n}ski, Miros{\l}aw},
TITLE = {Modal nonmonotonic logics: Ranges, characterization, computation},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {4},
PAGES = {963-990},
YEAR = {1993, September},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Coffman-Garey/93,
AUTHOR = {Coffman, E.G., Jr. and Garey, M.R.},
TITLE = {Proof of the 4/3 conjecture for preemptive vs.\ nonpreemptive two-processor scheduling},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {991-1018},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Luo-Tsitsiklis/93,
AUTHOR = {Luo, Zhi-Quan and Tsitsiklis, John N.},
TITLE = {On the communication complexity of distributed algebraic computation},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1019-1047},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Donald-Xavier-Canny-Reif/93,
AUTHOR = {Donald, Bruce and Xavier, Patrick and Canny, John and Reif, John},
TITLE = {Kinodynamic motion planning},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1048-1066},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Tay/93a,
AUTHOR = {Tay, Y.C.},
TITLE = {On the optimality of strategies for multiple joins},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1067-1086},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fekete-Lynch-Mansour-Spinelli/93,
AUTHOR = {Fekete, Alan and Lynch, Nancy and Mansour, Yishay and Spinelli, John},
TITLE = {The impossibility of implementing reliable communication in the face of crashes},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1087-1107},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Golumbic-Shamir/93,
AUTHOR = {Golumbic, Martin Charles and Shamir, Ron},
TITLE = {Complexity and algorithms for reasoning about time: A graph-theoretic approach},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1108-1133},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Arnborg-Courcelle-Proskurowski-Seese/93,
AUTHOR = {Arnborg, Stefan and Courcelle, Bruno and Proskurowski, Andrzej and Seese, Detlef},
TITLE = {An algebraic theory of graph reduction},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1134-1164},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fonlupt-Nachef/93,
AUTHOR = {Fonlupt, Jean and Nachef, Armand},
TITLE = {Dynamic programming and the graphical traveling salesman problem},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1165-1187},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Jean-Marie-Gun/93,
AUTHOR = {Jean-Marie, Alain and G{\"u}n, Levent},
TITLE = {Parallel queues with resequencing},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1188-1208},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Baccelli-Liu-Towsley/93,
AUTHOR = {Baccelli, Fran{\c{c}}ois and Liu, Zhen and Towsley, Don},
TITLE = {Extremal scheduling of parallel processing with and without real-time constraints},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1209-1237},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Knessl/93,
AUTHOR = {Knessl, Charles},
TITLE = {On the sojourn time distribution in a finite capacity processor shared queue},
JOURNAL = {J. ACM},
VOLUME = {40},
NUMBER = {5},
PAGES = {1238-1301},
YEAR = {1993, November},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}