@article{de_Bruin/84,
AUTHOR = {de Bruin, A.},
TITLE = {On the existence of Cook semantics},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {1-13},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Faculty of Economics, Erasmus Univ., Rotterdam, Netherlands},
ADDRESS = {Philadelphia, PA},
}
@article{Frederickson-Johnson/84,
AUTHOR = {Frederickson, G.N. and Johnson, D.B.},
TITLE = {Generalized selection and ranking: sorted matrices},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {14-30},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Computer Sci. Dept., Pennsylvania State Univ., University Park, PA, USA},
ADDRESS = {Philadelphia, PA},
NOTE = {see Erratum in SIAM J. Comput., Vol. 19, 205-206},
}
@article{Dyer/84,
AUTHOR = {Dyer, M.E.},
TITLE = {Linear time algorithms for two- and three-variable linear programs},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {31-45},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Maths. and Statistics, Teeside Polytech., Middlesbrough, England},
ADDRESS = {Philadelphia, PA},
}
@article{Reif/84b,
AUTHOR = {Reif, John H.},
TITLE = {On synchronous parallel computations with independent probabilistic choice},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {46-56},
YEAR = {1984, February},
KEYWORDS = {parallel computation, probabilistic computation, randomized algorithm, parallel speedup},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Aiken Computation Lab., Harvard Univ., Cambridge MA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Pullman/84,
AUTHOR = {Pullman, N.J.},
TITLE = {Clique covering of graphs IV. Algorithms},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {57-75},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Maths. and Statistics Dept., Queen's Univ., Kingston, Ontario, Canada},
ADDRESS = {Philadelphia, PA},
}
@article{Beeri-Vardi/84,
AUTHOR = {Beeri, C. and Vardi, M.Y.},
TITLE = {Formal systems for tuple and equality generating dependencies},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {76-98},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Hebrew Univ. of Jerusalem, Jerusalem, Israel},
ADDRESS = {Philadelphia, PA},
}
@article{Cosmadakis-Papadimitriou/84a,
AUTHOR = {Cosmadakis, S.S. and Papadimitriou, C.H.},
TITLE = {The traveling salesman problem with many visits to few cities},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {99-108},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Lab. for Computer Sci., MIT, Cambridge, MA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Manber-Tompa/84,
AUTHOR = {Manber, U. and Tompa, M.},
TITLE = {The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {109-115},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Univ. of Washington, Seattle, WA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Chiu-Bernstein-Ho/84,
AUTHOR = {Chiu, Dah-Ming and Bernstein, P.A. and Ho, Yu-Chi},
TITLE = {Optimizing chain queries in a distributed database system},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {116-134},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Div. of Appl. Sci., Harvard Univ., Cambridge, MA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Ladner-Lipton-Stockmeyer/84,
AUTHOR = {Ladner, R.E. and Lipton, R.J. and Stockmeyer, L.J.},
TITLE = {Alternating pushdown and stack automata},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {135-155},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Univ. of Washington, Seattle, WA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Klawe/84,
AUTHOR = {Klawe, M.},
TITLE = {Limitations on explicit constructions of expanding graphs},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {156-166},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Computer Sci. Dept., IBM Res., San Jose, CA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Ramanan/84,
AUTHOR = {Ramanan, Prakash V.},
TITLE = {Pushdown permuter characterization theorem},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {167-169},
YEAR = {1984, February},
KEYWORDS = {algorithm, permutation, stack, pushdown permuter},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Univ. of Illinois, Urbana, IL, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Friesen/84,
AUTHOR = {Friesen, D.K.},
TITLE = {Tighter bounds for the multifit processor scheduling algorithm},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {170-181},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Industrial Engng., Texas Aandm Univ., College Station, TX, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Megiddo-Supowit/84,
AUTHOR = {Megiddo, N. and Supowit, K.J.},
TITLE = {On the complexity of some common geometric location problems},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {1},
PAGES = {182-196},
YEAR = {1984, February},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Statistics, Tel Aviv Univ., Tel Aviv, Israel},
ADDRESS = {Philadelphia, PA},
}
@article{Ottmann-Parker-Rosenberg-Six-Wood/84,
AUTHOR = {Ottmann, T. and Parker, D.S. and Rosenberg, A.L. and Six, H.W. and Wood, D.},
TITLE = {Minimal-cost brother trees},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
PAGES = {197-218},
YEAR = {1984},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Inst. f{\"u}r Angewandte Informatik, Univ. Karlsruhe, Karlsruhe, Germany;},
ADDRESS = {Philadelphia, PA},
}
@article{Duris-Galil/84a,
AUTHOR = {D{\'u}ris, P. and Galil, Z.},
TITLE = {Two tapes are better than one for nondeterministic machines},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {219-227},
YEAR = {1984, May},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Computer Center, Slovak Acad. of Sci., Bratislava, Czechoslovakia},
ADDRESS = {Philadelphia, PA},
}
@article{Hu-Shing/84,
AUTHOR = {Hu, T.C. and Shing, M.T.},
TITLE = {Computation of matrix chain products. Part II},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {228-251},
YEAR = {1984, May},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Univ. of California, San Diego, La Jolla, CA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Robson/84,
AUTHOR = {Robson, J.M.},
TITLE = {$N$ by $N$ checkers is exptime complete},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {252-267},
YEAR = {1984, May},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Australian Nat. Univ., Canberra, Australia},
ADDRESS = {Philadelphia, PA},
}
@article{Bini/84,
AUTHOR = {Bini, D.},
TITLE = {Parallel solution of certain Toeplitz linear systems},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {268-276},
YEAR = {1984, May},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dipartimento di Matematica, Univ. di Pisa, Pisa, Italy},
ADDRESS = {Philadelphia, PA},
}
@article{Frederickson/84,
AUTHOR = {Frederickson, G.N.},
TITLE = {Self-organizing heuristics for implicit data structures},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {277-291},
YEAR = {1984, May},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Pennsylvania State Univ., University Park, PA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Sharir-Pnueli-Hart/84,
AUTHOR = {Sharir, M. and Pnueli, A. and Hart, S.},
TITLE = {Verification of probabilistic programs},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {292-314},
YEAR = {1984, May},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Tel Aviv Univ., Tel Aviv, Israel;},
ADDRESS = {Philadelphia, PA},
}
@article{Agarwal-Mittal-Sharma/84,
AUTHOR = {Agarwal, S. and Mittal, A.K. and Sharma, P.},
TITLE = {Constrained optimum communication trees and sensitivity analysis},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {315-328},
YEAR = {1984, May},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Moti Lal Nehru Regional Engng. Coll., Allahabad, India;},
ADDRESS = {Philadelphia, PA},
}
@article{Schoning-Book/84,
AUTHOR = {Sch{\"o}ning, Uwe and Book, Ronald V.},
TITLE = {Immunity, relativizations, and nondeterminism},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {329-337},
YEAR = {1984, May},
KEYWORDS = {complexity classes, relativizations, nondeterminism, bounded queries, immunity, P, NP},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Inst. f{\"u}r Informatik, Univ. Stuttgart, Stuttgart, Germany},
ADDRESS = {Philadelphia, PA},
}
@article{Harel-Tarjan/84,
AUTHOR = {Harel, Dov and Tarjan, Robert E.},
TITLE = {Fast algorithms for finding nearest common ancestors},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {338-355},
YEAR = {1984, May},
KEYWORDS = {graph algorithm, nearest common ancestor, tree, inverse Ackermann's function},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Univ. of New Hampshire, Durham, NH, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Grandjean/84,
AUTHOR = {Grandjean, E.},
TITLE = {The spectra of first-order sentences and computational complexity},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {356-373},
YEAR = {1984, May},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Univ. Claude Bernard-Lyon 1, Villeurbanne, France},
ADDRESS = {Philadelphia, PA},
}
@article{Cartwright/84,
AUTHOR = {Cartwright, R.},
TITLE = {Recursive programs as definitions in first order logic},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {374-408},
YEAR = {1984, May},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Math. Sci., Rice Univ., Houston, TX, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Stockmeyer-Vishkin/84,
AUTHOR = {Stockmeyer, Larry J. and Vishkin, Uzi},
TITLE = {Simulation of parallel random access machines by circuits},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {409-422},
YEAR = {1984, May},
KEYWORDS = {synchronous parallelism, parallel time complexity, circuit complexity, relating complexity measures},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Computer Sci. Dept., IBM Res. Lab., San Jose, CA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Chandra-Stockmeyer-Vishkin/84,
AUTHOR = {Chandra, Ashok and Stockmeyer, Larry and Vishkin, Uzi},
TITLE = {Constant depth reducibility},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {2},
PAGES = {423-439},
YEAR = {1984, May},
KEYWORDS = {circuit complexity, unbounded fan-in circuits, reducibility, compllte problems},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Mayr/84,
AUTHOR = {Mayr, E.W.},
TITLE = {An algorithm for the general Petri net reachability problem},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {441-460},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Stanford Univ., Stanford, CA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Book-Long-Selman/84,
AUTHOR = {Book, R.V. and Long, T.J. and Selman, A.L.},
TITLE = {Quantitative relativizations of complexity classes},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {461-487},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Maths., Univ. of California, Santa Barbara, CA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Chazelle/84b,
AUTHOR = {Chazelle, B.},
TITLE = {Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {488-507},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Brown Univ., Providence, RI, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Rosenkrantz-Stearns-Lewis/84,
AUTHOR = {Rosenkrantz, D.J. and Stearns, R.E. and Lewis II, P.M.},
TITLE = {Consistency and serializability in concurrent database systems},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {508-530},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., State Univ. of New York, Albany, NY, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Keane-Konheim-Meilijson/84,
AUTHOR = {Keane, M. and Konheim, A.G. and Meilijson, I.},
TITLE = {The organ pipe permutation},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {531-540},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Tech. Hogeschool Delft, Delft, Netherlands;},
ADDRESS = {Philadelphia, PA},
}
@article{Melhem-Rheinboldt/84,
AUTHOR = {Melhem, R.G. and Rheinboldt, W.C.},
TITLE = {A mathematical model for the verification of systolic networks},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {541-565},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Univ. of Pittsburgh, Pittsburgh, PA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Tarjan-Yannakakis/84,
AUTHOR = {Tarjan, Robert E. and Yannakakis, Mihalis},
TITLE = {Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {566-579},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Bell Labs., Murray Hill, NJ, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Tsin-Chin/84,
AUTHOR = {Tsin, Y.H. and Chin, F.Y.},
TITLE = {Efficient parallel algorithms for a class of graph theoretic problems},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {580-599},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computing Sci., Univ. of Alberta, Edmonton, Alberta, Canada},
ADDRESS = {Philadelphia, PA},
}
@article{Baker-Coffman/84,
AUTHOR = {Baker, B.S. and Coffman, E.G., Jr.},
TITLE = {Insertion and compaction algorithms in sequentially allocated storage},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {600-609},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Bell Labs., Murray Hill, NJ, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Hopcroft-Joseph-Whitesides/84,
AUTHOR = {Hopcroft, J. and Joseph, D. and Whitesides, S.},
TITLE = {Movement problems for 2-dimensional linkages},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {610-629},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Cornell Univ., Ithaca, NY, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Toueg-Babaoglu/84,
AUTHOR = {Toueg, S. and Babao{\~g}lu, {\"o}.},
TITLE = {On the optimum checkpoint selection problem},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {630-649},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Computer Sci., Cornell Univ., Ithaca, NY, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Leung-Vornberger-Witthoff/84,
AUTHOR = {Leung, J.Y.-T. and Vornberger, O. and Witthoff, J.D.},
TITLE = {On some variants of the bandwidth minimization problem},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {3},
PAGES = {650-668},
YEAR = {1984, August},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Electrical Engng. and Computer Sci., Northwestern Univ., Evanston, IL, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Heyman-Tsur/84,
AUTHOR = {Heyman, D.P. and Tsur, S.},
TITLE = {Disk performance in a transaction-oriented system},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {669-681},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Bell Commun. Res., Holmdel, NJ, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Blass-Gurevich/84,
AUTHOR = {Blass, A. and Gurevich, Y.},
TITLE = {Equivalence relations, invariants and normal forms},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {682-689},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Math., Michigan Univ., Ann Arbor, MI, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Lai-Sahni/84,
AUTHOR = {Lai, T.-H. and Sahni, S.},
TITLE = {Preemptive scheduling of a multiprocessor system with memories to minimize maximum lateness},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {690-704},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Comp. Sci., Minnesota Univ., Minneapolis, MN, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Dobson/84,
AUTHOR = {Dobson, G.},
TITLE = {Scheduling independent tasks on uniform processors},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {705-716},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Graduate Sch. of Manage., Rochester Univ., NY, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Heller/84,
AUTHOR = {Heller, H.},
TITLE = {On relativized polynomial and exponential computations},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {717-725},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Inst. f{\"u}r Inf., Tech. Univ., M{\"u}nchen, Germany},
ADDRESS = {Philadelphia, PA},
}
@article{Barz/84,
AUTHOR = {Barz, H.W.},
TITLE = {The power of synchronization mechanisms},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {726-749},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gallier/84a,
AUTHOR = {Gallier, J.H.},
TITLE = {$n$-rational algebras I. Basic properties and free algebras},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {750-775},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Comp. and Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Gallier/84,
AUTHOR = {Gallier, J.H.},
TITLE = {$n$-rational algebras II. Varieties and logic of inequalities},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {776-794},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Comput. and Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Linial/84,
AUTHOR = {Linial, N.},
TITLE = {The information-theoretic bound is good for merging},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {795-801},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Inst. of Math. and Comp. Sci., Hebrew Univ. of Jerusalem, Israel},
ADDRESS = {Philadelphia, PA},
}
@article{von_zur_Gathen/84,
AUTHOR = {von zur Gathen, J.},
TITLE = {Parallel algorithms for algebraic problems},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {802-824},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Comp. Sci., Toronto Univ., Ont., Canada},
ADDRESS = {Philadelphia, PA},
}
@article{Sherman-Pnueli-Harel/84,
AUTHOR = {Sherman, R. and Pnueli, A. and Harel, D.},
TITLE = {Is the interesting part of process logic uninteresting?: A translation from PL to PDL},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {825-839},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel},
ADDRESS = {Philadelphia, PA},
}
@article{JaJa-Kumar-Simon/84,
AUTHOR = {J{\'a}J{\'a}, J. and Kumar, V.K. Prasanna and Simon, J.},
TITLE = {Information transfer under different sets of protocols},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {840-849},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Comp. Sci., Pennsylvania State Univ., University Park, PA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Blum-Micali/84,
AUTHOR = {Blum, M. and Micali, S.},
TITLE = {How to generate cryptographically strong sequences of pseudo-random bits},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {850-864},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Dept. of Comp. Sci., California Univ., Berkeley, CA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Arnon-Collins-McCallum/84a,
AUTHOR = {Arnon, D.S. and Collins, G.E. and McCallum, S.},
TITLE = {Cylindrical algebraic decomposition I. The basic algorithm},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {865-877},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Xerox PARC, Palo Alto, CA, USA},
ADDRESS = {Philadelphia, PA},
}
@article{Arnon-Collins-McCallum/84,
AUTHOR = {Arnon, D.S. and Collins, G.E. and McCallum, S.},
TITLE = {Cylindrical algebraic decomposition II. An adjacency algorithm for the plane},
JOURNAL = {SIAM J. Comput.},
VOLUME = {13},
NUMBER = {4},
PAGES = {878-889},
YEAR = {1984, November},
PUBLISHER = {Society for Industrial and Applied Mathematics},
INSTITUTION = {Xerox PARC, Palo Alto, CA, USA},
ADDRESS = {Philadelphia, PA},
}