@article{Chang-Gouda/91,
AUTHOR = {Chang, Chung-Kuo and Gouda, M.G.},
TITLE = {On the minimum requirements for independent recovery in distributed systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {1-7},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Zhang/91b,
AUTHOR = {Zhang, Xubo},
TITLE = {Overlap closures do not suffice for termination of general term rewriting systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {9-11},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chaudhuri-Ladner/91,
AUTHOR = {Chaudhuri, Soma and Ladner, Richard E.},
TITLE = {Safety and liveness of $\omega$-context-free languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {13-20},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Olariu/91c,
AUTHOR = {Olariu, Stephan},
TITLE = {An optimal greedy heuristic to color interval graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {21-25},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kann/91,
AUTHOR = {Kann, Viggo},
TITLE = {Maximum bounded 3-dimensional matching is MAX SNP-complete},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {27-35},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Manolopoulos-Vakali/91,
AUTHOR = {Manolopoulos, Yannis and Vakali, Athina},
TITLE = {Seek distances in disks with two independent heads per surface},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {37-42},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sarkar-Chakrabarti-Ghose-Sarkar/91,
AUTHOR = {Sarkar, U.K. and Chakrabarti, P.P. and Ghose, S. and Sarkar, S.C. de},
TITLE = {Multiple stack branch and bound},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {43-48},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Campbell-Higgins/91,
AUTHOR = {Campbell, Douglas and Higgins, John},
TITLE = {Minimal visibility graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {49-53},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yu-Lin-Wu/91,
AUTHOR = {Yu, Bin and Lin, Xinggang and Wu, Youshou},
TITLE = {The tree representation of the graph used in binary image processing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {55-59},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Litovsky/91,
AUTHOR = {Litovsky, Igor},
TITLE = {Prefix-free languages as $\omega$-generators},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {61-65},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Luccio-Pietracaprina-Pucci/91,
AUTHOR = {Luccio, Fabrizio and Pietracaprina, Andrea and Pucci, Geppino},
TITLE = {Analysis of parallel uniform hashing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {67-69},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Snyder/91,
AUTHOR = {Snyder, Timothy Law},
TITLE = {Lower bounds for rectilinear Steiner trees in bounded space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {71-74},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Corrigendum in Inf.~Process.~Lett.\ 38, 279},
}
@article{Handley/91,
AUTHOR = {Handley, C.C.},
TITLE = {A space efficient distributive sort},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {75-78},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Tamassia/91,
AUTHOR = {Tamassia, Roberto},
TITLE = {An incremental reconstruction method for dynamic planar point location},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {79-83},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Tanaka/91,
AUTHOR = {Tanaka, Yoshihiro},
TITLE = {A dual algorithm for the satisfiability problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {85-89},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Beigel-Hemachandra-Wechsung/91,
AUTHOR = {Beigel, Richard and Hemachandra, Lane A. and Wechsung, Gerd},
TITLE = {Probabilistic polynomial time is closed under parity reductions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {91-94},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{von_Wright/91,
AUTHOR = {von Wright, J.},
TITLE = {Program inversion in the refinement calculus},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {95-100},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Gibbons-Ziani/91,
AUTHOR = {Gibbons, Alan and Ziani, Ridha},
TITLE = {The balanced binary tree technique on mesh-connected computers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {101-109},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{He/91a,
AUTHOR = {He, Xin},
TITLE = {An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {111-116},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Carlsson/91,
AUTHOR = {Carlsson, Svante},
TITLE = {An optimal algorithm for deleting the root of a heap},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {117-120},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Skyum/91,
AUTHOR = {Skyum, Sven},
TITLE = {A simple algorithm for computing the smallest enclosing circle},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {121-125},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Czyzowicz-Lakshmanan-Pelc/91,
AUTHOR = {Czyzowicz, Jurek and Lakshmanan, K.B. and Pelc, Andrzej},
TITLE = {Searching with a forbidden lie pattern in responses},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {127-132},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Manber-Baeza-Yates/91,
AUTHOR = {Manber, Udi and Baeza-Yates, Ricardo},
TITLE = {An algorithm for string matching with a sequence of don't cares},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {133-136},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Duris-Vrto/91,
AUTHOR = {D{\'u}ri{\v{s}}, Pavol and Vr{\v{t}}o, Imrich},
TITLE = {Semelectivity is not sufficient},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {137-141},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Green/91,
AUTHOR = {Green, Frederic},
TITLE = {An oracle separating $\bigoplus P$ from $PP^{PH}$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {149-153},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Janssen/91,
AUTHOR = {Janssen, A.J.E.M.},
TITLE = {An optimization problem related to neural networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {155-157},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sasaki/91,
AUTHOR = {Sasaki, Galen},
TITLE = {The effect of the density of states on the Metropolis algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {159-163},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Huynh/91b,
AUTHOR = {Huynh, Dung T.},
TITLE = {The effective entropies of some extensions of context-free languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {165-169},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Turski/91,
AUTHOR = {Turski, Wladyslasw M.},
TITLE = {On starvation and some related issues},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {171-174},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hofri-Shachnai/91,
AUTHOR = {Hofri, Micha and Shachnai, Hadas},
TITLE = {On the optimality of the counter scheme for dynamic linear lists},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {175-179},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wen/91,
AUTHOR = {Wen, Zhaofang},
TITLE = {Parallel multiple search},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {181-186},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Jacobs/91,
AUTHOR = {Jacobs, D.P.},
TITLE = {Probabilistic checking of associativity in algebras},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {187-191},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Deng-Mahajan/91a,
AUTHOR = {Deng, Xiaotie and Mahajan, Sanjeev},
TITLE = {Server problems and resistive spaces},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {193-196},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Irving/91,
AUTHOR = {Irving, Robert W.},
TITLE = {On approximating the minimum independent dominating set},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {197-200},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Tan-Hirata-Inagaki/91,
AUTHOR = {Tan, Xue-Hou and Hirata, Tomio and Inagaki, Yasuyoshi},
TITLE = {The intersection searching problem for $c$-oriented polygons},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {201-204},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Huizing-Roever/91,
AUTHOR = {Huizing, C. and Roever, W.P. de},
TITLE = {Introduction to design choices in the semantics of statecharts},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {205-213},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Zwick/91,
AUTHOR = {Zwick, Uri},
TITLE = {An extension of Khrapchenko's theorem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {215-217},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Liang-Rhee-Dhall-Lakshmivarahan/91,
AUTHOR = {Liang, Y. and Rhee, C. and Dhall, S.K. and Lakshmivarahan, S.},
TITLE = {A new approach for the domination problem on permutation graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {219-224},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Corbett-Scherson/91,
AUTHOR = {Corbett, Peter F. and Scherson, Isaac D.},
TITLE = {A unified algorithm for sorting on multidimensional mesh-connected processors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {225-231},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Serna/91,
AUTHOR = {Serna, Maria},
TITLE = {Approximating linear programming is log-space complete for $\P$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {233-236},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Alt-Blum-Mehlhorn-Paul/91,
AUTHOR = {Alt, H. and Blum, N. and Mehlhorn, K. and Paul, M.},
TITLE = {Computing a maximum cardinality matching in a bipartite graph in time $O(n\sqrt{1.5}{m/\log n})$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {237-240},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yuan/91,
AUTHOR = {Yuan, Shyan-Ming},
TITLE = {Topological properties of supercube},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {241-245},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Mullin/91,
AUTHOR = {Mullin, James K.},
TITLE = {A caution on universal classes of hash functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {247-256},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Beauquier/91,
AUTHOR = {Beauquier, Dani{\`e}le},
TITLE = {An undecidable problem about rational sets and contour words of polyominoes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {257-263},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kaldewaj-Schoenmakers/91,
AUTHOR = {Kaldewaj, Anne and Schoenmakers, Berry},
TITLE = {The derivation of a tighter bound for top-down skew heaps},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {265-271},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Itoh/91,
AUTHOR = {Itoh, Toshiya},
TITLE = {Characterization for a family of infinitely many irreducible equally spaced polynomials},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {273-277},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sakakibara/91,
AUTHOR = {Sakakibara, Yasubumi},
TITLE = {On learning from queries and counterexamples in the presence of noise},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {279-284},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Taubenfeld/91,
AUTHOR = {Taubenfeld, Gadi},
TITLE = {On the nonexistence of resilient consensus protocols},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {285-289},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wang-Cheng/91,
AUTHOR = {Wang, Qingzhou and Cheng, Kam Hoi},
TITLE = {List scheduling of parallel tasks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {291-297},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Taubner/91,
AUTHOR = {Taubner, Dirk},
TITLE = {A note on the notation of recursion in process algebras},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {299-303},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Teo-Tuan/91,
AUTHOR = {Teo, Kim-Heng and Tuan, Tai-Ching},
TITLE = {An improved upper bound on the number of intersections between two rectangular paths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {305-309},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Mahmoud/91,
AUTHOR = {Mahmoud, Sabri A.},
TITLE = {Motion estimation based on modified Fourier spectrum},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {311-313},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Danvy/91,
AUTHOR = {Danvy, Olivier},
TITLE = {Semantics-directed compilation of nonlinear patterns},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {315-322},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Vidyasankar/91,
AUTHOR = {Vidyasankar, K.},
TITLE = {A very simple construction of 1-writer multireader multivalued atomic variable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {323-326},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wang-Chen-Chen/91,
AUTHOR = {Wang, Biing-Feng and Chen, Chuen-Liang and Chen, Gen-Huey},
TITLE = {A simple approach to implementing multiplication with small tables},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {327-329},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Galil-Italiano/91c,
AUTHOR = {Galil, Zvi and Italiano, Giuseppe F.},
TITLE = {A note on set union with arbitrary deunions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {331-335},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lee-Choe/91,
AUTHOR = {Lee, Myung-Joon and Choe, Kwang-Moo},
TITLE = {$SLR(k)$ covering for $LR(k)$ grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {337-347},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Corrigendum in Inf.~Process.~Lett.\ 38, 281},
}
@article{Srikant-Krithivasan/91,
AUTHOR = {Srikant, R. and Krithivasan, Kamala},
TITLE = {Fastest path across constrained moving rectilinear obstacles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {349-353},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rao-Zhang/91,
AUTHOR = {Rao, Nageswara S.V. and Zhang, Weixiong},
TITLE = {Building heaps in parallel},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {37},
PAGES = {355-358},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}