Information and Computation -- 1995

Volume 116, Number 1, January 1995

• Michiel Smid. Dynamic rectangular point location with an application to the closest pair problem. Information and Computation, 116(1):1-9, January 1995. Abstract, References, and Citations. [BibTeX entry]

• Michael Huth. A maximal monoidal closed category of distributive algebraic domains. Information and Computation, 116(1):10-25, January 1995. Abstract, References, and Citations. [BibTeX entry]

• Juanito Camilleri and Glynn Winskel. CCS with priority choice. Information and Computation, 116(1):26-37, January 1995. Abstract, References, and Citations. [BibTeX entry]

• Bent Thomsen. A theory of higher order communicating systems. Information and Computation, 116(1):38-57, January 1995. Abstract, References, and Citations. [BibTeX entry]

• Anil Nerode, Raymond T. Ng, and V. S. Subrahmanian. Computing circumscriptive databases: I. Theory and algorithms. Information and Computation, 116(1):58-80, January 1995. Abstract, References, and Citations. [BibTeX entry]

• Naoki Abe. Characterizing PAC-learnability of semilinear sets. Information and Computation, 116(1):81-102, January 1995. Abstract, References, and Citations. [BibTeX entry]

• Neil Immerman and Susan Landau. The complexity of iterated multiplication. Information and Computation, 116(1):103-116, January 1995. Abstract, References, and Citations. [BibTeX entry]

• Wayne Eberly. Fast parallel band matrix arithmetic. Information and Computation, 116(1):117-127, January 1995. Abstract, References, and Citations. [BibTeX entry]

• Dafna Sheinwald, Abraham Lempel, and Jacob Ziv. On encoding and decoding with two-way head machines. Information and Computation, 116(1):128-133, January 1995. Abstract and Citations. [BibTeX entry]

• Volker Diekert, Paul Gastin, and Antoine Petit. Rational and recognizable complex trace languages. Information and Computation, 116(1):134-153, January 1995. Abstract, References, and Citations. [BibTeX entry]

Volume 116, Number 2, February 1, 1995

• Rudolf Fleischer, Hermann Jung, and Kurt Mehlhorn. A communication-randomness tradeoff for two-processor systems. Information and Computation, 116(2):155-161, 1 February 1995. Abstract and References. [BibTeX entry]

• Ulrich Tamm. Communication complexity of sum-type functions invariant under translation. Information and Computation, 116(2):162-173, 1 February 1995. Abstract and References. [BibTeX entry]

• John Case, Sanjay Jain, and Arun Sharma. Complexity issues for vacillatory function identification. Information and Computation, 116(2):174-192, 1 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Steve Schneider. An operational semantics for timed CSP. Information and Computation, 116(2):193-213, 1 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Tomoyuki Yamakami. Feasible computability and resource bounded topology. Information and Computation, 116(2):214-230, 1 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Zoltán Fülöp and Sándor Vágvölgyi. Attributed tree transducers cannot induce all deterministic bottom-up tree transformations. Information and Computation, 116(2):231-240, 1 February 1995. Abstract. [BibTeX entry]

• Gösta Grahne and Alberto O. Mendelzon. Updates and subjunctive queries. Information and Computation, 116(2):241-252, 1 February 1995. Abstract and Citations. [BibTeX entry]

• David Walker. Objects in the pi-calculus. Information and Computation, 116(2):253-271, 1 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Roberto M. Amadio. A quick construction of a retraction of all retractions for stable bifinites. Information and Computation, 116(2):272-274, 1 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Bruno Courcelle. Structural properties of context-free sets of graphs generated by vertex replacement. Information and Computation, 116(2):275-293, 1 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Jon G. Riecke. Statman's 1-section theorem. Information and Computation, 116(2):294-303, 1 February 1995. Abstract and References. [BibTeX entry]

• S. C. Fang and J. R. Rajasekera. Entropy optimization models with convex constraints. Information and Computation, 116(2):304-311, 1 February 1995. Abstract. [BibTeX entry]

Volume 117, Number 1, February 15, 1995

• R. P. Kurshan and K. L. McMillan. A structural induction theorem for processes. Information and Computation, 117(1):1-11, 15 February 1995. Abstract and References. [BibTeX entry]

• Hans Kleine Büning, Marek Karpinski, and Andreas Flögel. Resolution for quantified Boolean formulas. Information and Computation, 117(1):12-18, 15 February 1995. Abstract and References. [BibTeX entry]

• Amir M. Ben-Amram and Zvi Galil. On the power of the shift instruction. Information and Computation, 117(1):19-36, 15 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Georg Lausen and Eljas Soisalon-Soininen. Safety by uninterpreted locks. Information and Computation, 117(1):37-49, 15 February 1995. Abstract and References. [BibTeX entry]

• Rodney R. Howell and Muralidhar K. Venkatrao. On non-preemptive scheduling of recurring tasks using inserted idle times. Information and Computation, 117(1):50-62, 15 February 1995. Abstract and References. [BibTeX entry]

• Changwook Kim and Dong Hoon Lee. Node replacement graph languages squeezed with chains, trees, and forests. Information and Computation, 117(1):63-77, 15 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Ramana M. Idury and Alejandro A. Schäffer. Multiple matching of rectangular patterns. Information and Computation, 117(1):78-90, 15 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Oded Shmueli. A single recursive predicate is sufficient for pure Datalog. Information and Computation, 117(1):91-97, 15 February 1995. Abstract. [BibTeX entry]

• P. W. Hoogers, H. C. M. Kleijn, and P. S. Thiagarajan. A trace semantics for Petri nets. Information and Computation, 117(1):98-114, 15 February 1995. Abstract and References. [BibTeX entry]

• Giuseppe Castagna, Giorgio Ghelli, and Giuseppe Longo. A calculus for overloaded functions with subtyping. Information and Computation, 117(1):115-135, 15 February 1995. Abstract, References, and Citations. [BibTeX entry]

• Marco Bellia and M. Eugenia Occhiuto. Suprema of open and closed formulas and their application to resolution. Information and Computation, 117(1):136-150, 15 February 1995. Abstract and References. [BibTeX entry]

• Walter Ludwig. A subexponential randomized algorithm for the simple stochastic game problem. Information and Computation, 117(1):151-155, 15 February 1995. Abstract, References, and Citations. [BibTeX entry]

Volume 117, Number 2, March 1995

• Marianne Baudinet. On the expressiveness of temporal logic programming. Information and Computation, 117(2):157-180, March 1995. Abstract, References, and Citations. [BibTeX entry]

• David Aldous and Umesh Vazirani. A Markovian extension of Valiant's learning model. Information and Computation, 117(2):181-186, March 1995. Abstract and References. [BibTeX entry]

• Ramamohan Paturi, Sanguthevar Rajasekaran, and John Reif. The light bulb problem. Information and Computation, 117(2):187-192, March 1995. Abstract and References. [BibTeX entry]

• Dung T. Huynh and Lu Tian. On deciding readiness and failure equivalences for processes. Information and Computation, 117(2):193-205, March 1995. Abstract, References, and Citations. [BibTeX entry]

• Hirofumi Yokouchi. Embedding a second order type system into an intersection type system. Information and Computation, 117(2):206-220, March 1995. Abstract, References, and Citations. [BibTeX entry]

• Matthew Hennessy and Tim Regan. A process algebra for timed systems. Information and Computation, 117(2):221-239, March 1995. Abstract, References, and Citations. [BibTeX entry]

• Shai Ben-David, Alon Itai, and Eyal Kushilevitz. Learning by distances. Information and Computation, 117(2):240-250, March 1995. Abstract, References, and Citations. [BibTeX entry]

• Francis Bossut, Max Dauchet, and Bruno Warin. A Kleene theorem for a class of planar acyclic graphs Information and Computation, 117(2):251-265, March 1995. Abstract, References, and Citations. [BibTeX entry]

• Ashok Subramanian. The parallel complexity of propagation in Boolean circuits. Information and Computation, 117(2):266-275, March 1995. Abstract and References. [BibTeX entry]

• Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire. On the sample complexity of weakly learning. Information and Computation, 117(2):276-287, March 1995. Abstract and References. [BibTeX entry]

Volume 118, Number 1, April 1995

• Amihood Amir and Martin Farach. Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation, 118(1):1-11, April 1995. Abstract, References, Citations, etc. [BibTeX entry]

• Peter J. Stuckey. Negation and constraint logic programming. Information and Computation, 118(1):12-33, April 1995. Abstract and References. [BibTeX entry]

• Samir Khuller and Yossi Matias. A simple randomized sieve algorithm for the closest-pair problem. Information and Computation, 118(1):34-37, April 1995. Abstract, References, and Citations. [BibTeX entry]

• Walter Vogler. Generalized OM-bisimulation. Information and Computation, 118(1):38-47, April 1995. Abstract and References. [BibTeX entry]

• William J. Bultman and Wolfgang Maass. Fast identification of geometric objects with membership queries. Information and Computation, 118(1):48-64, April 1995. Abstract and References. [BibTeX entry]

• John Shawe-Taylor. Sample sizes for threshold networks with equivalences. Information and Computation, 118(1):65-72, April 1995. Abstract and References. [BibTeX entry]

• Richard Beigel, Martin Kummer, and Frank Stephan. Quantifying the amount of verboseness. Information and Computation, 118(1):73-90, April 1995. Abstract, References, and Citations. [BibTeX entry]

• Gregory Kucherov and Mohamed Tajine. Decidability of regularity and related properties of ground normal form languages. Information and Computation, 118(1):91-100, April 1995. Abstract and References. [BibTeX entry]

• Hervé J. Touati, Robert K. Brayton, and Robert Kurshan. Testing language containment for omega-automata using BDD's. Information and Computation, 118(1):101-109, April 1995. Abstract and References. [BibTeX entry]

• Igor Litovsky, Yves Métivier, and Wies{\l}aw Zielonka. On the recognition of families of graphs with local computations. Information and Computation, 118(1):110-119, April 1995. Abstract and References. [BibTeX entry]

• Masako Takahashi. Parallel reductions in lambda-calculus. Information and Computation, 118(1):120-127, April 1995. Abstract and Citations. [BibTeX entry]

• Jens Palsberg and Michael I. Schwartzbach. Safety analysis versus type inference. Information and Computation, 118(1):128-141, April 1995. Abstract, References, and Citations. [BibTeX entry]

• R. Alur, A. Itai, R. P. Kurshan, and M. Yannakakis. Timing verification by successive approximation. Information and Computation, 118(1):142-157, April 1995. Abstract and References. [BibTeX entry]

• Flaviu Cristian, Houtan Aghili, Ray Strong, and Danny Dolev. Atomic broadcast: From simple message diffusion to Byzantine agreement. Information and Computation, 118(1):158-179, April 1995. Abstract and References. [BibTeX entry]

Volume 118, Number 2, May 1, 1995

• Ji\v{r}í Adàmek. Recursive data types in algebraically omega-complete categories. Information and Computation, 118(2):181-190, 1 May 1995. Abstract, References, and Citations. [BibTeX entry]

• M. Nielsen, G. Rozenberg, and P. S. Thiagarajan. Transition systems, event structures and unfoldings. Information and Computation, 118(2):191-207, 1 May 1995. Abstract and Citations. [BibTeX entry]

• R\=usi\c{n}\v{s} Freivalds, Efim B. Kinber, and Rolf Wiehagen. How inductive inference strategies discover their errors. Information and Computation, 118(2):208-226, 1 May 1995. Abstract and References. [BibTeX entry]

• Rolf Niedermeier and Peter Rossmanith. Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. Information and Computation, 118(2):227-245, 1 May 1995. Abstract, References, and Citations. [BibTeX entry]

• Joseph Y. Halpern and Edward L. Wimmers. Full abstraction and expressive completeness for FP. Information and Computation, 118(2):246-271, 1 May 1995. Abstract and References. [BibTeX entry]

• Roberto Gorrieri and Cosimo Laneve. Split and ST bisimulation semantics. Information and Computation, 118(2):272-288, 1 May 1995. Abstract, References, and Citations. [BibTeX entry]

• Howard Straubing, Denis Thérien, and Wolfgang Thomas. Regular languages defined with generalized quanifiers. Information and Computation, 118(2):289-301, 1 May 1995. Abstract, References, and Citations. [BibTeX entry]

• Juraj Hromkovi\v{c}, Vladimír Müller, Ondrej Sýkora, and Imrich Vr\v{t}o. On embeddings in cycles. Information and Computation, 118(2):302-305, 1 May 1995. Abstract. [BibTeX entry]

• Didier Caucal, Dung T. Huynh, and Lu Tian. Deciding branching bimiliarity of normed context-free processes is in \Sigma^p_2. Information and Computation, 118(2):306-315, 1 May 1995. Abstract and References. [BibTeX entry]

• Oded Maler and Amir Pnueli. On the learnability of infinitary regular sets. Information and Computation, 118(2):316-326, 1 May 1995. Abstract and References. [BibTeX entry]

• Andreas Weber and Reinhard Klemm. Economy of description for single-valued transducers. Information and Computation, 118(2):327-340, 1 May 1995. Abstract, References, and Citations. [BibTeX entry]

Volume 119, Number 1, May 15, 1995

• Jennifer Seberry, Xian-Mo Zhang, and Yuliang Zheng. Nonlinearity and propagation characteristics of balanced Boolean functions. Information and Computation, 119(1):1-13, 15 May 1995. Abstract and Citations. [BibTeX entry]

• Wil Dekkers. Inhabitation of types in the simply typed lambda calculus. Information and Computation, 119(1):14-17, 15 May 1995. Abstract. [BibTeX entry]

• Richard Kennaway, Jan Willem Klop, Ronan Sleep, and Fer-Jan de Vries. Transfinite reductions in orthogonal term rewriting systems. Information and Computation, 119(1):18-38, 15 May 1995. Abstract, References, and Citations. [BibTeX entry]

• Kenji Yamanishi. A loss bound model for on-line stochastic prediction algorithms. Information and Computation, 119(1):39-54, 15 May 1995. Abstract, References, and Citations. [BibTeX entry]

• Furio Honsell, Ian A. Mason, Scott Smith, and Carolyn Talcott. A variable typed logic of effects. Information and Computation, 119(1):55-90, 15 May 1995. Abstract, References, and Citations. [BibTeX entry]

• Kamal Lodaya, Rohit Parikh, R. Ramanujan, and P. S. Thiagarajan. A logical study of distributed transition systems. Information and Computation, 119(1):91-118, 15 May 1995. Abstract, References, and Citations. [BibTeX entry]

• J. A. Bergstra and Jan Heering. Homomorphism preserving algebraic specifications require hidden sorts. Information and Computation, 119(1):119-123, 15 May 1995. Abstract and References. [BibTeX entry]

• Torben Hagerup. A lower bound for the emulation of PRAM memories on processor networks. Information and Computation, 119(1):124-128, 15 May 1995. Abstract and References. [BibTeX entry]

• Erich Grädel and Gregory L. McColm. On the Power of Deterministic Transitive Closures Information and Computation, 119(1):129-135, 15 May 1995. Abstract, References, and Citations. [BibTeX entry]

Volume 119, Number 2, June 1995

• F. Ferrucci, G. Pacini, and Maria I. Sessa. Redundancy elimination and loop checks for logic programs. Information and Computation, 119(2):137-153, June 1995. Abstract and References. [BibTeX entry]

• Katsutoshi Nakayama and Akira Maruoka. Loop circuits and their relation to Razborov's approximation model. Information and Computation, 119(2):154-159, June 1995. Abstract, References, and Citations. [BibTeX entry]

• Anuj Dawar, Steven Lindell, and Scott Weinstein. Infinitary logic and inductive definability over finite structures. Information and Computation, 119(2):160-175, June 1995. Abstract, References, and Citations. [BibTeX entry]

• Roberto Di Cosmo. Second order isomorphic types: A proof theoretic study on second order lambda-calculus with surjective paring and terminal object. Information and Computation, 119(2):176-201, June 1995. Abstract, References, and Citations. [BibTeX entry]

• Franco Barbanera, Mariangiola Dezani-Ciancaglini, and Ugo de'Liguoro. Intersection and union types: Syntax and semantics. Information and Computation, 119(2):202-230, June 1995. Abstract, References, and Citations. [BibTeX entry]

• Zhi-Zhong Chen and Seinosuke Toda. The complexity of selecting maximal solutions. Information and Computation, 119(2):231-239, June 1995. Abstract, References, and Citations. [BibTeX entry]

• Yves Métivier and Gwénaël Richomme. New results on the star problem in trace monoids. Information and Computation, 119(2):240-251, June 1995. Abstract, References, and Citations. [BibTeX entry]

• Xavier Gouy and Ying Jiang. Universal retractions on DI-domains. Information and Computation, 119(2):252-257, June 1995. Abstract and References. [BibTeX entry]

• Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, and Alejandro Schäffer. Improved dynamic dictionary matching. Information and Computation, 119(2):258-282, June 1995. Abstract, References, and Citations. [BibTeX entry]

• Gil Neiger. Simplifying the design of knowledge-based algorithms using knowledge consistency. Information and Computation, 119(2):283-293, June 1995. Abstract and References. [BibTeX entry]

Volume 120, Number 1, July 1995

• Koichi Yamazaki. A normal form problem for unlabeled boundary NLC graph languages. Information and Computation, 120(1):1-10, July 1995. Abstract and References. [BibTeX entry]

• Shai Ben-David, Gyora M. Benedek, and Yishay Mansour. A parametrization scheme for classifying models of PAC learnability. Information and Computation, 120(1):11-21, July 1995. Abstract and References. [BibTeX entry]

• Vwani Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, and Thomas Kailath. Vector analysis of threshold functions. Information and Computation, 120(1):22-31, July 1995. Abstract and References. [BibTeX entry]

• Abbas Edalat. Dynamical systems, measures and fractals via domain theory. Information and Computation, 120(1):32-48, July 1995. Abstract, References, and Citations. [BibTeX entry]

• Ronald V. Book, Jack H. Lutz, and David M. Martin Jr.. The global power of additional queries to random oracles. Information and Computation, 120(1):49-54, July 1995. Abstract and References. [BibTeX entry]

• Mitsunori Ogihara. Equivalence of NC^k and AC^{k-1} closures of NP and other classes. Information and Computation, 120(1):55-58, July 1995. Abstract, References, and Citations. [BibTeX entry]

• Martin Kummer and Frank Stephan. Recursion theoretic properties of frequency computation and bounded queries. Information and Computation, 120(1):59-77, July 1995. Abstract, References, and Citations. [BibTeX entry]

• Ronald Fagin, Larry J. Stockmeyer, and Moshe Y. Vardi. On monadic NP vs. monadic co-NP. Information and Computation, 120(1):78-92, July 1995. Abstract, References, and Citations. [BibTeX entry]

• Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, and Tiko Kameda. Optimal amortized distributed consensus. Information and Computation, 120(1):93-100, July 1995. Abstract and References. [BibTeX entry]

• Guozhu Dong and Jianwen Su. Incremental and decremental evaluation of transitive closure by first-order queries. Information and Computation, 120(1):101-106, July 1995. Abstract, References, and Citations. [BibTeX entry]

• Peter W. O'Hearn and Jon G. Riecke. Kripke logical relations and PCF. Information and Computation, 120(1):107-116, July 1995. Abstract, References, and Citations. [BibTeX entry]

• Danièle Beauquier and Damian Niwi\'nski. Automata on infinite trees with counting constraints. Information and Computation, 120(1):117-125, July 1995. Abstract and References. [BibTeX entry]

• Jean Neraud. Algorithms for detecting morphic images of a word. Information and Computation, 120(1):126-148, July 1995. Abstract and References. [BibTeX entry]

• Shih Ping Tung. The bounds of Skolem functions and their applications. Information and Computation, 120(1):149-154, July 1995. Abstract and Citations. [BibTeX entry]

Volume 120, Number 2, August 1 1995

• Thomas Zeugmann, Steffen Lange, and Shyam Kapur. Characterizations of monotonic and dual monotonic language learning. Information and Computation, 120(2):155-173, 1 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Joachim Parrow and Davide Sangiorgi. Algebraic theories for name-passing calculi. Information and Computation, 120(2):174-197, 1 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Heribert Vollmer and Klaus W. Wagner. Complexity classes of optimization functions. Information and Computation, 120(2):198-219, 1 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Jan Van den Bussche and Jan Paredaens. The expressive power of complex values in object-based data models. Information and Computation, 120(2):220-236, 1 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Victor Y. Pan, Isdor Sobze, and Antoine Atinkpahoun. On parallel computations with banded matrices. Information and Computation, 120(2):237-250, 1 August 1995. Abstract and References. [BibTeX entry]

• A. J. Power. Why tricategories? Information and Computation, 120(2):251-262, 1 August 1995. Abstract and References. [BibTeX entry]

• Alessandra Di Pierro, Maurizio Martelli, and Catuscia Palamidessi. Negation as instantiation. Information and Computation, 120(2):263-278, 1 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Michele Boreale and Rocco De Nicola. Testing equivalence for mobile processes. Information and Computation, 120(2):279-303, 1 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Richard Beigel, Martin Kummer, and Frank Stephan. Approximable sets. Information and Computation, 120(2):304-314, 1 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Shih Ping Tung. Computational complexity of arithmetical sentences. Information and Computation, 120(2):315-325, 1 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Jonathan Buss and Martin Tompa. Lower bounds on universal traversal sequences based on chains of length five. Information and Computation, 120(2):326-329, 1 August 1995. Abstract, References, and Citations. [BibTeX entry]

Volume 121, Number 1, August 15 1995

• Lane A. Hemaspaandra and Sudhir K. Jha. Defying upward and downward separation. Information and Computation, 121(1):1-13, 15 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Luc Longpré and Osamu Watanabe. On symmetry of information and polynomial time invertibility. Information and Computation, 121(1):14-22, 15 August 1995. Abstract and References. [BibTeX entry]

• Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano. Zero-knowledge arguments and public-key cryptography. Information and Computation, 121(1):23-40, 15 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Y. Ben-Asher, K.-J. Lange, D. Peleg, and A. Schuster. The complexity of reconfiguring network models. Information and Computation, 121(1):41-58, 15 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Rob J. van Glabbeek, Scott A. Smolka, and Bernhard Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 121(1):59-80, 15 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Georg Gottlob. The complexity of default reasoning under the stationary fixed point semantics. Information and Computation, 121(1):81-92, 15 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Leonard M. Adleman, Ming-Deh Huang, and Kireeti Kompella. Efficient checkers for number-theoretic computations. Information and Computation, 121(1):93-102, 15 August 1995. Abstract, References, and Citations. [BibTeX entry]

• Peter Clote. Cutting plane and Frege proofs. Information and Computation, 121(1):103-122, 15 August 1995. Abstract and References. [BibTeX entry]

• Iain A. Stewart. Completeness of path-problems via logical reductions. Information and Computation, 121(1):123-134, 15 August 1995. Abstract and Citations. [BibTeX entry]

Volume 121, Number 2, September 1995

• Alexandru Mateescu, Arto Salomaa, Kai Salomaa, and Sheng Yu. P, NP and the Post correspondence problem. Information and Computation, 121(2):135-142, September 1995. Abstract, References, and Citations. [BibTeX entry]

• Søren Christensen, Hans Hüttel, and Colin Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121(2):143-148, September 1995. Abstract, References, and Citations. [BibTeX entry]

• Walter Vogler. Timed testing of concurrent systems. Information and Computation, 121(2):149-171, September 1995. Abstract, References, and Citations. [BibTeX entry]

• Leo Bachmair, Harald Ganzinger, Christopher Lynch, and Wayne Snyder. Basic paramodulation. Information and Computation, 121(2):172-192, September 1995. Abstract, References, and Citations. [BibTeX entry]

• D. McAllester, J. Ku\v{c}an, and D. F. Otth. A proof of strong normalization of F_2, F_\omega and beyond. Information and Computation, 121(2):193-200, September 1995. Abstract, References, and Citations. [BibTeX entry]

• Sanjay Jain, Arun Sharma, and Mahendran Velauthapillai. Finite identification of functions by teams with success ratio 1/2 and above. Information and Computation, 121(2):201-213, September 1995. Abstract and References. [BibTeX entry]

• Nancy Lynch and Frits Vaandrager. Forward and backward simulations: I. Untimed systems. Information and Computation, 121(2):214-233, September 1995. Abstract, References, and Citations. [BibTeX entry]

• J. C. M. Baeten, J. A. Bergstra, and S. A. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation, 121(2):234-255, September 1995. Abstract, References, and Citations. [BibTeX entry]

• Yoav Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256-285, September 1995. Abstract, References, and Citations. [BibTeX entry]

Volume 122, Number 1, October 1995

• Maurizio Gabbrielli, Giorgio Levi, and Maria Chiara Meo. Observable behaviors and equivalences of logic programs. Information and Computation, 122(1):1-29, October 1995. Abstract, References, and Citations. [BibTeX entry]

• Alexander Aiken, Dexter Kozen, and Ed Wimmers. Decidability of systems of set constraints with negative constraints. Information and Computation, 122(1):30-44, October 1995. Abstract, References, and Citations. [BibTeX entry]

• Hong Chen and Jieh Hsiang. Recurrence domains: Their unification and application to logic programming. Information and Computation, 122(1):45-69, October 1995. Abstract, References, and Citations. [BibTeX entry]

• Mario Coppo and Paola Giannini. Principal types and unification for a simple intersection type systems. Information and Computation, 122(1):70-96, October 1995. Abstract, References, and Citations. [BibTeX entry]

• Pierpaolo Degano and Roberto Gorrieri. A causal operational semantics of action refinement. Information and Computation, 122(1):97-119, October 1995. Abstract, References, and Citations. [BibTeX entry]

• Dieter Spreen. On some decision problems in programming. Information and Computation, 122(1):120-139, October 1995. Abstract, References, and Citations. [BibTeX entry]

• S. Muthukrishnan and H. Ramesh. String matching under a general matching relation. Information and Computation, 122(1):140-148, October 1995. Abstract, References, and Citations. [BibTeX entry]

Volume 122, Number 2, November 1, 1995

• Ugo de'Liguoro and Adolfo Piperno. Non deterministic extensions of untyped lambda-calculus. Information and Computation, 122(2):149-177, 1 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Roberto Barbuti, Michael Codish, Roberto Giacobazzi, and Michael J. Maher. Oracle semantics for Prolog. Information and Computation, 122(2):178-200, 1 November 1995. Abstract, References, and Citations. [BibTeX entry]

• G. L. McColm. Pebble games and subroutines in least fixed point logic. Information and Computation, 122(2):201-220, 1 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Christian Herrmann. On the undecidability of implications between embedded multivalued database dependencies. Information and Computation, 122(2):221-235, 1 November 1995. Abstract and References. [BibTeX entry]

• Krishnan Pillaipakkamnatt and Vijay Raghavan. Read-twice DNF formulas are properly learnable. Information and Computation, 122(2):236-267, 1 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Carolyn Brown and Doug Gurr. A categorical linear framework for Petri nets. Information and Computation, 122(2):268-285, 1 November 1995. Abstract and References. [BibTeX entry]

• Wan Fokkink and Steven Klusener. An effective axiomatization for real time ACP. Information and Computation, 122(2):286-299, 1 November 1995. Abstract, References, and Citations. [BibTeX entry]

Volume 123, Number 1, November 15, 1995

• Ryszard Janicki and Maciej Koutny. Semantics of inhibitor nets. Information and Computation, 123(1):1-16, 15 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Juraj Hromkovi\v{c}, Ralf Klasing, Elena A. Stöhr, and Hubert Wagener. Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs. Information and Computation, 123(1):17-28, 15 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Martin Farach and Mikkel Thorup. Fast comparison of evolutionary trees. Information and Computation, 123(1):29-37, 15 November 1995. Abstract and References. [BibTeX entry]

• Liming Cai, Jianer Chen, Rodney Downey, and Michael Fellows. On the structure of parameterized problems in NP. Information and Computation, 123(1):38-49, 15 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Jan C. Bioch and Toshihide Ibaraki. Complexity of identification and dualization of positive Boolean functions. Information and Computation, 123(1):50-63, 15 November 1995. Abstract, References, and Citations. [BibTeX entry]

• R\=usi\c{n}\v{s} Freivalds, Efim B. Kinber, and Carl H. Smith. On the intrinsic complexity of learning. Information and Computation, 123(1):64-71, 15 November 1995. Abstract and References. [BibTeX entry]

• Hannah Bast and Torben Hagerup. Fast parallel space allocation, estimation and integer sorting. Information and Computation, 123(1):72-110, 15 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Fabrizio Luccio and Linda Pagli. Approximate matching for two families of trees. Information and Computation, 123(1):111-120, 15 November 1995. Abstract and References. [BibTeX entry]

• Lance Fortnow and Sophie Laplante. Circuit lower bounds à la Kolmogorov Information and Computation, 123(1):121-126, 15 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Omer Berkman, Costas S. Iliopoulos, and Kunsoo Park. The subtree max gap problem with application to parallel string covering. Information and Computation, 123(1):127-137, 15 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Yuji Takada. A hierarchy of language families learnable by regular language learning. Information and Computation, 123(1):138-145, 15 November 1995. Abstract, References, and Citations. [BibTeX entry]

• Nader H. Bshouty. Exact learning Boolean functsion via the monotone theory. Information and Computation, 123(1):146-153, 15 November 1995. Abstract, References, and Citations. [BibTeX entry]

Volume 123, Number 1, November 15, 1995

• Hagit Attiya, Shlomi Dolev, and Jennifer L. Welch. Connection management without retaining information. Information and Computation, 123(2):155-171, December 1995. Abstract and References. [BibTeX entry]

• Anuj Dawar and Lauri Hella. The expressive power of finitely many generalized quantifiers. Information and Computation, 123(2):172-184, December 1995. Abstract, References, and Citations. [BibTeX entry]

• Bernd Becker, Rolf Dreschler, and Ralph Werchner. On the relation between BDDs and FDDs. Information and Computation, 123(2):185-197, December 1995. Abstract and References. [BibTeX entry]

• Jens Palsberg. Efficient inference of object types. Information and Computation, 123(2):198-209, December 1995. Abstract, References, and Citations. [BibTeX entry]

• David Peleg and Avishai Wool. The availability of quorum systems. Information and Computation, 123(2):210-223, December 1995. Abstract, References, and Citations. [BibTeX entry]

• Efim Kinber and Frank Stephan. Language learning from texts: Mindchanges, limited memory, and monotonicity. Information and Computation, 123(2):224-241, December 1995. Abstract, References, and Citations. [BibTeX entry]

Shortcuts: