@article{Dielissen-Kaldewaij/91,
AUTHOR = {Dielissen, Victor J. and Kaldewaij, Anne},
TITLE = {Rectangular partition is polynomial in two dimensions but $NP$-complete in three},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {1-6},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Goralcik-Goralcikova-Koubek/91,
AUTHOR = {Goral{\v{c}}ik, P. and Goral{\v{c}}ikova, A. and Koubek, V.},
TITLE = {Alternation with a pebble},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {7-13},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Stojmenovic/91,
AUTHOR = {Stojmenovi{\'c}, Ivan},
TITLE = {Bisections and ham-sandwich cuts of convex polygons and polyhedra},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {15-21},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Elmagarmid-Du/91,
AUTHOR = {Elmagarmid, Ahmed K. and Du, Weimin},
TITLE = {Integrity aspects of quasi serializability},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {23-28},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Horng-Chen-Fang/91,
AUTHOR = {Horng, Shi-Jinn and Chen, Wen-Tsuen and Fang, Ming-Yi},
TITLE = {Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {29-37},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Shoup/91,
AUTHOR = {Shoup, Victor},
TITLE = {Smoothness and factoring polynomials over finite fields},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {39-42},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Cheng/91,
AUTHOR = {Cheng, Xu},
TITLE = {A graph transformation algorithm for concurrency control in a partitioned database},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {43-48},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chen-Das/91a,
AUTHOR = {Chen, Calvin C.-Y. and Das, Sajal K.},
TITLE = {A unified approach to parallel depth-first traversals of general trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {49-55},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Crochemore-Rytter/91,
AUTHOR = {Crochemore, Maxime and Rytter, Wojciech},
TITLE = {Efficient parallel algorithms to test square-freeness and factorize strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {57-60},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Alvarez-Gabarro/91,
AUTHOR = {{\'A}lvarez, C. and Gabarr{\'o}, J.},
TITLE = {The parallel complexity of two problems on concurrency},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {61-70},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yen/91,
AUTHOR = {Yen, Hsu-Chun},
TITLE = {A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {71-76},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Manzini/91,
AUTHOR = {Manzini, Giovanni},
TITLE = {Radix sort on the hypercube},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {77-81},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Meidanis/91,
AUTHOR = {Meid{\^a}nis, Jo{\~a}o},
TITLE = {Lower bounds for arithmetic problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {83-87},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Messeguer/91,
AUTHOR = {Messeguer, Xavier},
TITLE = {Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {89-100},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Misra/91a,
AUTHOR = {Misra, Jayadev},
TITLE = {Phase synchronization},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {101-105},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Corrigendum in Inf.~Process.~Lett.\ 41, 59},
}
@article{Minsker/91,
AUTHOR = {Minsker, Steven},
TITLE = {The towers of Antwerpen problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {107-111},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kao-Tate/91,
AUTHOR = {Kao, Ming-Yang and Tate, Stephen R.},
TITLE = {Online matching with blocked input},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {113-116},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Fernandez-Baca-Williams/91,
AUTHOR = {Fern{\'a}ndez-Baca, David and Williams, Mark A.},
TITLE = {On matroids and hierarchical graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {117-121},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rote/91,
AUTHOR = {Rote, G{\"u}nter},
TITLE = {Computing the minimum Hausdorff distance between two point sets on a line under translation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {123-127},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Langemyr/91a,
AUTHOR = {Langemyr, Lars},
TITLE = {Circuits for computing the GCD of two polynomials over an algebraic number field},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {129-134},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Martel/91,
AUTHOR = {Martel, Charles},
TITLE = {Self-adjusting multi-way search trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {135-141},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rajanarayanan-Iyengar/91,
AUTHOR = {Rajanarayanan, Subbiah and Iyengar, Sitharama S.},
TITLE = {A new optimal distributed algorithm for the set intersection problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {143-148},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rote-Woeginger-Zhu-Wang/91,
AUTHOR = {Rote, G{\"u}nter and Woeginger, Gerhard and Zhu, Binhai and Wang, Zhengyan},
TITLE = {Counting $k$-subsets and convex $k$-gons in the plane},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {149-151},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Mnuk/91,
AUTHOR = {M{\v{n}}uk, Michal},
TITLE = {A div($n$) depth Boolean circuit for smooth modular inverse},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {153-156},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Pramanik-Das-Bandyopadhyay-Fay/91,
AUTHOR = {Pramanik, P. and Das, P.K. and Bandyopadhyay, A.K. and Fay, D.Q.M.},
TITLE = {A deadlock-free communication kernel for loop architecture},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {157-161},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Acketa-Zunic/91,
AUTHOR = {Acketa, Dragan M. and {\v{Z}}uni{\'c}, Jovi{\v{s}}a D.},
TITLE = {On the number of linear partitions of the $(m,n)$-grid},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {163-168},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bradford-Jenkyns/91,
AUTHOR = {Bradford, James H. and Jenkyns, T.A.},
TITLE = {On the inadequacy of tournament algorithms for the $N$-SCS problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {169-171},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chrobak-Larmore/91,
AUTHOR = {Chrobak, Marek and Larmore, Lawrence L.},
TITLE = {A note on the server problem and a benevolent adversary},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {173-175},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Floren/91,
AUTHOR = {Floren, Rolf},
TITLE = {A note on ``A faster approximation algorithm for the Steiner problem in graphs''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {177-178},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Goldberg/91,
AUTHOR = {Goldberg, Andrew V.},
TITLE = {Processor-efficient implementation of a maximum flow algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {179-185},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Siklossy-Tulp/91,
AUTHOR = {Sikl{\'o}ssy, Laurent and Tulp, Eduard},
TITLE = {The space reduction method: A method to reduce the size of search spaces},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {187-192},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Gasarch/91a,
AUTHOR = {Gasarch, William I.},
TITLE = {On selecting the $k$ largest with restricted quadratic series},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {193-195},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Leiss-Reddy/91,
AUTHOR = {Leiss, Ernst L. and Reddy, Hari N.},
TITLE = {Embedding complete binary trees into hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {197-199},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Shonkwiler/91,
AUTHOR = {Shonkwiler, R.},
TITLE = {Computing the Hausdorff set distance in linear time for any $L_p$ point distance},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {201-207},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Basart/91,
AUTHOR = {Basart, J.M.},
TITLE = {Some upper bounds for minimal trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {209-213},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Cai-Hemachandra/91,
AUTHOR = {Cai, Jin-yi and Hemachandra, Lane A.},
TITLE = {A note on enumerative counting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {215-219},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sakkinen/91,
AUTHOR = {Sakkinen, Markku},
TITLE = {Selftype is a special case},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {221-224},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rytter-Saoudi/91,
AUTHOR = {Rytter, W. and Saoudi, A.},
TITLE = {On the complexity of the recognition of parallel 2D-image languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {225-229},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hershberger/91,
AUTHOR = {Hershberger, John},
TITLE = {A new data structure for shortest path queries in a simple polygon},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {231-235},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lingas/91,
AUTHOR = {Lingas, Andrzej},
TITLE = {Bit complexity of matrix products},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {237-242},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kim-Pramanik/91,
AUTHOR = {Kim, Myoung Ho and Pramanik, Sakti},
TITLE = {The FX distribution method for parallel processing of partial match queries},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {243-252},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Woeginger/91,
AUTHOR = {Woeginger, Gerhard},
TITLE = {On minimizing the sum of $k$ tardinesses},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {253-256},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hambrusch-Luby/91,
AUTHOR = {Hambrusch, Susanne and Luby, Michael},
TITLE = {Parallel asynchronous connected components in a mesh},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {257-263},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kalamboukis-Mantzaris/91,
AUTHOR = {Kalamboukis, T.Z. and Mantzaris, S.L.},
TITLE = {Towards optimal distributed election on chordal rings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {265-270},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Fotouhi-Pramanik/91,
AUTHOR = {Fotouhi, Farshad and Pramanik, Sakti},
TITLE = {Problem of optimizing the number of block accesses in performing relational join is $NP$-hard},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {271-275},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Matousek/91c,
AUTHOR = {Matou{\v{s}}ek, Ji{\v{r}}{\'i}},
TITLE = {Computing dominances in $E^n$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {277-278},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Danzig/91,
AUTHOR = {Danzig, Peter B.},
TITLE = {A cooperative game with applications to computer networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {283-289},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Preparata/91,
AUTHOR = {Preparata, Franco P.},
TITLE = {Inverting a Vandermonde matrix in minimum parallel time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {291-294},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kennedy/91,
AUTHOR = {Kennedy, Robert},
TITLE = {Parallel cardinality stacks and an application},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {295-299},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Irani/91,
AUTHOR = {Irani, Sandy},
TITLE = {Two results on the list update problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {301-306},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Luo-Klostermeyer-Chow-Newman-Wolfe/91,
AUTHOR = {Luo, Kenneth and Klostermeyer, William and Chow, Yuan-Chieh and Newman-Wolfe, Richard},
TITLE = {Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {307-313},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Latifi/91,
AUTHOR = {Latifi, Shahram},
TITLE = {Distributed subcube identification algorithms for reliable hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {315-321},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Nawrocki/91,
AUTHOR = {Nawrocki, Jerzy R.},
TITLE = {Conflict detection and resolution in a lexical analyzer generator},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {323-328},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Herley/91,
AUTHOR = {Herley, Kieran T.},
TITLE = {A note on the token distribution problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {329-334},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Zuckerman/91a,
AUTHOR = {Zuckerman, David},
TITLE = {On the time to traverse all edges of a graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {335-337},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Zivkovic/91,
AUTHOR = {Zivkovic, Dejan},
TITLE = {A fast algorithm for finding the compact sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {38},
PAGES = {339-342},
YEAR = {1991},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}