@article{Tarjan/86,
AUTHOR = {Tarjan, R.E.},
TITLE = {Sensitivity analysis of minimum spanning trees and shortest path trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {219},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Princeton Univ., NJ, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rytter/86a,
AUTHOR = {Rytter, W.},
TITLE = {The space complexity of the unique decipherability problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {1},
PAGES = {1-3},
YEAR = {1986, July},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Inf., Warsaw Univ., Poland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lin-Shih/86,
AUTHOR = {Lin, Ferng-Ching and Shih, Wei-Kuan},
TITLE = {Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {1},
PAGES = {5-9},
YEAR = {1986, July},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci. \& Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Tinhofer-Schreck/86,
AUTHOR = {Tinhofer, G. and Schreck, H.},
TITLE = {The bounded subset sum problem is almost everywhere randomly decidable in $O(n)$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {1},
PAGES = {11-17},
YEAR = {1986, July},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. f{\"u}r Math., Tech. Univ. M{\"u}nchen, Germany},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Schmeck/86,
AUTHOR = {Schmeck, H.},
TITLE = {On the maximum edge length in VLSI layouts of complete binary trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {1},
PAGES = {19-23},
YEAR = {1986, July},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. f{\"u}r Inf. und Praktische Math., Christian-Albrechts-Univ., Kiel, Germany},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Corrigendum in Inf.~Process.~Lett. 23, 165},
}
@article{Balcazar/86,
AUTHOR = {Balc{\'a}zar, J.L.},
TITLE = {On $\Delta_2^P$-immunity (complexity)},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {1},
PAGES = {25-28},
YEAR = {1986, July},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Fac. de Inf., Univ. Politecnica de Cataluna, Barcelona, Spain},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Culik-Karhumaki/86,
AUTHOR = {Culik II, Karel and Karhum{\"a}ki, Juhani},
TITLE = {A note on the equivalence problem of rational formal power series},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {1},
PAGES = {29-31},
YEAR = {1986, July},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Waterloo Univ., Ont., Canada},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kakuta-Nakamura-Iida/86,
AUTHOR = {Kakuta, K. and Nakamura, H. and Iida, S.},
TITLE = {A parallel reference counting algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {1},
PAGES = {33-37},
YEAR = {1986, July},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Inf. \& Comput. Sci., Toyohashi Univ. of Technol., Japan},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Falkowski-Schmitz/86,
AUTHOR = {Falkowski, B.-J. and Schmitz, L.},
TITLE = {A note on the queens' problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {1},
PAGES = {39-46},
YEAR = {1986, July},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Fakult{\"a}t f{\"u}r Inf., M{\"u}nchen Univ., Germany},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Vikas-Basandra/86,
AUTHOR = {Vikas, O.M. and Basandra, S.K.},
TITLE = {Data algebra and its application in database design},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {1},
PAGES = {47-54},
YEAR = {1986, July},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci. \& Eng., Indian Inst. of Technol., Kanpur, India},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lavallee-Roucairol/86,
AUTHOR = {Lavallee, I. and Roucairol, G.},
TITLE = {A fully distributed (minimal) spanning tree algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {55-62},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {LRI, Univ. Paris-Sud, Orsay, France},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Apostolico/86,
AUTHOR = {Apostolico, A.},
TITLE = {Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {63-69},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rohnert/86,
AUTHOR = {Rohnert, H.},
TITLE = {Shortest paths in the plane with convex polygonal obstacles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {71-76},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Saarbrucken Univ., Germany},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hoogerwoord/86,
AUTHOR = {Hoogerwoord, R.R.},
TITLE = {An implementation of mutual inclusion},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {77-80},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math., Eindhoven Univ. of Technol., Eindhoven, Netherlands},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rytter/86,
AUTHOR = {Rytter, W.},
TITLE = {An application of Mehlhorn's algorithm for bracket languages to $\log(n)$ space recognition of input-driven languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {81-84},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Inf., Warsaw Univ., Poland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Laski/86,
AUTHOR = {Laski, J.},
TITLE = {An algorithm for the derivation of codefinitions in computer programs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {85-90},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Sch. of Eng. \& Comput. Sci., Oakland Univ., Rochester, MI, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Annot-Janssens-Goor/86,
AUTHOR = {Annot, J.K. and Janssens, M.D. and Goor, A.J. van de},
TITLE = {Comments on Morris's starvation-free solution to the mutual exclusion problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {91-97},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ntafos/86,
AUTHOR = {Ntafos, S.},
TITLE = {On gallery watchmen in grids},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {99-102},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Texas Univ., Dallas, TX, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Franco/86,
AUTHOR = {Franco, J.},
TITLE = {On the probabilistic performance of algorithms for the satisfiability problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {103-106},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Codenotti-Lotti/86a,
AUTHOR = {Codenotti, B. and Lotti, G.},
TITLE = {Area-time tradeoffs for bilinear forms computations in VLSI},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {2},
PAGES = {107-109},
YEAR = {1986, August},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Istituto di Elaborazione dell'Inf., CNR, Pisa, Italy},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Codenotti-Lotti/86,
AUTHOR = {Codenotti, B. and Lotti, G.},
TITLE = {A VLSI fast solver for tridiagonal linear systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {111-114},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Istituto di Elaborazione dell'Informazione, CNR, Pisa, Italy},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Makarov/86,
AUTHOR = {Makarov, O.M.},
TITLE = {A noncommutative algorithm for multiplying 5*5 matrices using 102 multiplications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {115-117},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Biol. of South Seas, Sevastopol, USSR},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lai-Sprague/86,
AUTHOR = {Lai, T.-H. and Sprague, A.},
TITLE = {A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {119-122},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. \& Inf. Sci., Ohio State Univ., Columbus, OH, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Cooper-Akl/86,
AUTHOR = {Cooper, J. and Akl, S.G.},
TITLE = {Efficient selection on a binary tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {123-126},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. \& Inf. Sci., Queen's Univ., Kingston, Ont., Canada},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Poblete/86,
AUTHOR = {Poblete, P.V.},
TITLE = {Approximating functions by their Poisson transform},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {127-130},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Faculty of Phys. Sci. \& Math., Chile Univ., Santiago, Chile},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bertossi/86,
AUTHOR = {Bertossi, A.A.},
TITLE = {Total domination in interval graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {131-134},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dipartimento di Informatica, Pisa Univ., Italy},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Szpankowski/86,
AUTHOR = {Szpankowski, W.},
TITLE = {On an asymptotic analysis of a tree-type algorithm for broadcast communications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {135-142},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wagner/86,
AUTHOR = {Wagner, K.W.},
TITLE = {On the intersection of the class of linear context-free languages and the class of single-reset languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {143-146},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Fakult{\"a}t f{\"u}r Math. und Inf., Passau Univ., Germany},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Mints-Tyugu/86,
AUTHOR = {Mints, G. and Tyugu, E.},
TITLE = {Semantics of a declarative language},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {147-151},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Cybernet., Estonian Acad. of Sci., Tallinn, Estonian SSR},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Corrigendum in Inf.~Process.~Lett. 25, 139},
}
@article{Taghva/86,
AUTHOR = {Taghva, K.},
TITLE = {Some characterizations of finitely specifiable implicational dependency families},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {153-158},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., New Mexico Inst. of Min. \& Technol., Socorro, NM, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Udding/86,
AUTHOR = {Udding, J.T.},
TITLE = {Absence of individual starvation using weak semaphores},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {3},
PAGES = {159-162},
YEAR = {1986, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. for Biomed. Comput., Washington Univ., St. Louis, MO, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Dehornoy/86,
AUTHOR = {Dehornoy, P.},
TITLE = {Turing complexity of the ordinals},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {167-170},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math., Caen Univ., France},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Latteux-Timmerman/86,
AUTHOR = {Latteux, M. and Timmerman, E.},
TITLE = {Finitely generated $\omega$-languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {171-175},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Lab. de Recherche en Inf. Fondamentale, Lille I Univ., Villeneuve d'Ascq, France},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Alpern-Demers-Schneider/86,
AUTHOR = {Alpern, B. and Demers, A.J. and Schneider, F.B.},
TITLE = {Safety without stuttering},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {177-180},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{OHallaron-Reynolds/86,
AUTHOR = {O'Hallaron, D.R. and Reynolds, P.F., Jr.},
TITLE = {A generalized deadlock predicate},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {181-188},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Blum/86,
AUTHOR = {Blum, L.},
TITLE = {Towards an asymptotic analysis of Karmarkar's algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {189-194},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Mills Coll., Oakland, CA, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bertossi-Bonuccelli/86,
AUTHOR = {Bertossi, A.A. and Bonuccelli, M.A.},
TITLE = {Hamiltonian circuits in interval graph generalizations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {195-200},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dipartimento di Inf., Pisa Univ., Italy},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yamasaki-Doshita/86,
AUTHOR = {Yamasaki, S. and Doshita, S.},
TITLE = {Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {201-207},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Inf. Sci., Kyoto Univ., Japan},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Gordon/86,
AUTHOR = {Gordon, D.},
TITLE = {Eliminating the flag in threaded binary search trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {209-214},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Cincinnati Univ., OH, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Murphy-Selkow/86,
AUTHOR = {Murphy, O.J. and Selkow, S.M.},
TITLE = {The efficiency of using k-d trees for finding nearest neighbors in discrete space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {4},
PAGES = {215-218},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Sch. of Comput. \& Inf. Sci., Syracuse Univ., NY, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sommerhalder-Westrhenen/86,
AUTHOR = {Sommerhalder, R. and Westrhenen, S.C. van},
TITLE = {A parallel $O(\log n)$ algorithm for the drawing of algebraic curves in an $n\times n$ square},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {5},
PAGES = {221-226},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math. \& Inf., Tech. Univ., Delft, Netherlands},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ambos-Spies/86a,
AUTHOR = {Ambos-Spies, K.},
TITLE = {A note on complete problems for complexity classes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {5},
PAGES = {227-230},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Lehrstuhl f{\"u}r Inf. II, Dortmund Univ., Germany},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{van_de_Snepscheut-Udding/86,
AUTHOR = {van de Snepscheut, J.L.A. and Udding, J.T.},
TITLE = {An alternative implementation of communication primitives},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {5},
PAGES = {231-238},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math. \& Comput. Sci., Groningen Univ., Netherlands},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Evans-Yousif/86,
AUTHOR = {Evans, D.J. and Yousif, N.Y.},
TITLE = {Merging by the parallel jump searching algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {5},
PAGES = {239-246},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Studies, Loughborough Univ. of Technol., England},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chen-Williams/86,
AUTHOR = {Chen, G. and Williams, M.H.},
TITLE = {The value of an array facility in Prolog},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {5},
PAGES = {247-251},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Heriot-Watt Univ., Edinburgh, Scotland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Broy/86,
AUTHOR = {Broy, M.},
TITLE = {Denotational semantics of communicating sequential programs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {5},
PAGES = {253-259},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Fakultat f{\"u}r Math. und Inf., Passau Univ., Germany},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Stojanovski/86,
AUTHOR = {Stojanovski, J.},
TITLE = {A note on implementing PROLOG in LISP},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {5},
PAGES = {261-264},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Jozef Stefan Inst., Ljubljana, Yugoslavia},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Handley/86,
AUTHOR = {Handley, C.C.},
TITLE = {An in situ distributive sort},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {5},
PAGES = {265-270},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Natal Univ., Durban, S Africa},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Makinen/86,
AUTHOR = {M{\"a}kinen, E.},
TITLE = {A note on pure grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {5},
PAGES = {271-274},
YEAR = {1986, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math. Sci. \& Comput. Sci., Tampere Univ., Finland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Leiss/86,
AUTHOR = {Leiss, E.L.},
TITLE = {The inaccessible set: a classification by query type of security risks in statistical databases},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {275-279},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Houston Univ., University Park, TX, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Benois-Sakarovitch/86,
AUTHOR = {Benois, M. and Sakarovitch, J.},
TITLE = {On the complexity of some extended word problems defined by cancellation rules},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {281-287},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {IMAG Grenoble, St. Martin d'Heres, France},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Edelsbrunner-Welzl/86a,
AUTHOR = {Edelsbrunner, H. and Welzl, E.},
TITLE = {Halfplanar range search in linear space and $O(n^{0.695})$ query time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {289-293},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. for Inf. Processing., Tech. Univ. of Graz, Austria},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Martin/86,
AUTHOR = {Martin, A.J.},
TITLE = {A new generalization of Dekker's algorithm for mutual exclusion},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {295-297},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Holenderski/86,
AUTHOR = {Holenderski, L.},
TITLE = {The correctness of nondeterministic programs revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {299-303},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput., Imperial Coll., London, England},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Allison-Dix/86,
AUTHOR = {Allison, L. and Dix, T.I.},
TITLE = {A bit-string longest-common-subsequence algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {305-310},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Western Australia Univ., Nedlands, WA, Australia},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Choe-Chang/86,
AUTHOR = {Choe, Kwang-Moo and Chang, Chun-Hyon},
TITLE = {Efficient computation of the locally least-cost insertion string for the LR error repair},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {311-316},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci., Korea Adv. Inst. of Sci. \& Technol., Seoul, Korea},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Harary-Slater/86,
AUTHOR = {Harary, F. and Slater, P.J.},
TITLE = {A linear algorithm for the cutting center of a tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {317-319},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math., Michigan Univ., Ann Arbor, MI, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kieburtz/86,
AUTHOR = {Kieburtz, R.B.},
TITLE = {When chasing your tail saves time (graph theory)},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {321-324},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Comput. Sci. \& Eng., Oregon Graduate Center, Beaverton, OR, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Nakata-Sassa/86a,
AUTHOR = {Nakata, I. and Sassa, M.},
TITLE = {L-attributed LL(1)-grammars are LR-attributed},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {23},
NUMBER = {6},
PAGES = {325-328},
YEAR = {1986, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Inf. Sci. \& Electron., Tsukuba Univ., Ibaraki, Japan},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}