@article{Jouannaud-Kounalis/89,
AUTHOR = {Jouannaud, Jean-Pierre and Kounalis, Emmanuel},
TITLE = {Automatic proofs by induction in theories without constructors},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {1},
PAGES = {1-33},
YEAR = {1989, July},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Cai-Hemachandra/89,
AUTHOR = {Cai, Jin-Yi and Hemachandra, Lane A.},
TITLE = {Enumerative counting is hard},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {1},
PAGES = {34-44},
YEAR = {1989, July},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Willard/89,
AUTHOR = {Willard, Dan E.},
TITLE = {Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {1},
PAGES = {45-64},
YEAR = {1989, July},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Droste/89,
AUTHOR = {Droste, Manfred},
TITLE = {Recursive domain equations for concrete data structures},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {1},
PAGES = {65-80},
YEAR = {1989, July},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lynch-Stark/89,
AUTHOR = {Lynch, Nancy A. and Stark, Eugene W.},
TITLE = {A proof of the Kahn principle for input/output automata},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {1},
PAGES = {81-92},
YEAR = {1989, July},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Sinclair-Jerrum/89,
AUTHOR = {Sinclair, Alistair and Jerrum, Mark},
TITLE = {Approximative counting, uniform generation and rapidly mixing Markov chains},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {1},
PAGES = {93-133},
YEAR = {1989, July},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bertoni-Mauri-Sabadini/89,
AUTHOR = {Bertoni, A. and Mauri, G. and Sabadini, N.},
TITLE = {Membership problems for regular and context-free trace languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {2},
PAGES = {135-150},
YEAR = {1989, August},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Montenyohl-Wand/89,
AUTHOR = {Montenyohl, Margaret and Wand, Mitchell},
TITLE = {Incorporating static analysis in a combinator-based compiler},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {2},
PAGES = {151-184},
YEAR = {1989, August},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Babai-Moran/89,
AUTHOR = {Babai, L{\'a}szl{\'o} and Moran, Shlomo},
TITLE = {Proving properties of interactive proofs by a generalized counting technique},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {2},
PAGES = {185-197},
YEAR = {1989, August},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Arnold-Dicky/89,
AUTHOR = {Arnold, Andr{\'e} and Dicky, Anne},
TITLE = {An algebraic characterization of transition system equivalences},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {2},
PAGES = {198-230},
YEAR = {1989, August},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ehrenfeucht-Haussler/89,
AUTHOR = {Ehrenfeucht, Andrzej and Haussler, David},
TITLE = {Learning decision trees from random examples},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {3},
PAGES = {231-246},
YEAR = {1989, September},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ehrenfeucht-Haussler-Kearns-Valiant/89,
AUTHOR = {Ehrenfeucht, Andrzej and Haussler, David and Kearns, Michael and Valiant, Leslie},
TITLE = {A general lower bound on the number of examples needed for learning},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {3},
PAGES = {247-261},
YEAR = {1989, September},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Anderson-Mayr-Warmuth/89,
AUTHOR = {Anderson, Richard J. and Mayr, Ernst W. and Warmuth, Manfred K.},
TITLE = {Parallel approximation algorithms for bin packing},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {3},
PAGES = {262-277},
YEAR = {1989, September},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Stomp-Roever-Gerth/89,
AUTHOR = {Stomp, F.A. and Roever, W.P. de and Gerth, R.T.},
TITLE = {The $\mu$-calculus as an assertion-language for fairness arguments},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {3},
PAGES = {278-322},
YEAR = {1989, September},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Freivalds-Smith-Velauthapillai/89,
AUTHOR = {Freivalds, R{\=u}si{\c{n}}{\u{s}} and Smith, Carl H. and Velauthapillai, Mahendran},
TITLE = {Trade-off among parameters affecting inductive inference},
JOURNAL = {Inf.~Comput.},
VOLUME = {82},
NUMBER = {3},
PAGES = {323-349},
YEAR = {1989, September},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}