% Index to the Journal of Algorithms, vols 1--20

%\font\title=helv at 12pt
%\font\nrm=times at 9pt
%\font\nit=timesi at 9pt
%\font\csc=timescsc at 9pt
%\font\nbf=timesb at 9pt
%\font\smrm=times at 6.3pt
%\font\mc=times at 8pt
\font\title=phvr at 12pt
\font\nrm=ptmr at 9pt
\font\nit=ptmri at 9pt
\font\csc=ptmrc at 9pt
\font\nbf=ptmb at 9pt
\font\smrm=ptmr at 6.3pt
\font\mc=ptmr at 8pt

\font\accrm=cmr10 % for the Hungarian umlaut accent

% Here I'm typesetting RUDIMENTARY math with Times
\font\nineit=cmmi9
\font\ninesy=cmsy9
\textfont0=\nrm \scriptfont0=\smrm \def\rm{\fam0\nrm}
\textfont1=\nit \def\it{\fam\itfam\nit}
\textfont2=\ninesy
\textfont\bffam=\nbf \def\bf{\fam\bffam\nbf}
\def\greekmath$#1${{\textfont1=\nineit$#1$}}
\def\H#1{{\accrm\accent"7D \csc#1}} % warning, I didn't make this very robust
\def\AA{\leavevmode\setbox0\hbox{h}\dimen0\ht0\advance\dimen0-1ex%
  \rlap{\kern.15em\raise.87\dimen0\hbox{\char'27}}A}
\mathchardef\ldotp="602E % ldot as a punctuation mark
\mathcode`\,="602C
\mathcode`\.="002E
\mathcode`\/="002F
\mathcode`\<="303C
\mathcode`\>="303E

\newdimen\pagewidth  \pagewidth=27pc
\newdimen\pageheight \pageheight=43pc

\hsize=\pagewidth
\centerline{\title Journal of Algorithms}
\smallskip
\centerline{\title Cumulative Index for Volumes 1--\thinspace20}
\bigskip

\newif\ifpagesaved
\newbox\sbox % saved box preceding the index
\newbox\lbox % lefthand column in the index

\def\page{\box255}
\output{\global\setbox\sbox=\page \global\pagesavedtrue}
\pagesavedfalse \eject % eject the page-so-far
\setbox\sbox\vbox{\unvbox\sbox} % take it out of its box
\vsize=\pageheight \advance\vsize by -\ht\sbox % the remaining height

\hsize=.5\pagewidth \advance\hsize by -7.5pt
    % column width for the index (15pt between cols)
\def\lr{L} % this tells whether the left or right column is next
\output{\if L\lr\global\setbox\lbox=\page \gdef\lr{R}
  \else
   \shipout\vbox to\pageheight{\offinterlineskip
     \vbox to0pt{\vss\hbox to\pagewidth{\hfil\nrm\folio\hfil}\bigskip} % page no
     \box\sbox\vss
     \hbox to\pagewidth{\vbox to\vsize{\unvbox\lbox}\hfil
                      \vbox to\vsize{\page}}}
   \advancepageno
   \global\vsize=\pageheight
   \gdef\lr{L}
   \global\pagesavedfalse\fi}

\baselineskip=11pt
\parfillskip=0pt plus .6\hsize % try to avoid almost empty lines
\parskip=0pt plus 1pt
\rightskip=0pt plus 2.5em
\tolerance=9999
\hyphenpenalty=10000
\exhyphenpenalty 10000
\hbadness=1500
\emergencystretch=10pt
\clubpenalty=5000
\widowpenalty=5000
\interlinepenalty=5000

\spaceskip=3pt
\parindent=0pt
\def\hangit{\hangindent12pt}
\def\|{\hskip.7em\relax}
\def\:#1\\#2\\{\hangit\csc#1\|\nrm#2\|}
\def\>#1\\{\hangit\csc#1\nrm,\|}
\def\_{\vrule width 15pt height 1.4pt depth -1pt\thinspace}
\def\p#1:{#1:\thinspace}
\def\see{\nit see\/ \csc}
\def\also{\nit see also\/ \csc}

\font\msbmnine=msbm10 at 9pt % 2nd AMS symbol font (includes blackboard bold)
\def\bbb#1{\hbox{\msbmnine #1}}
\def\sic/{\relax} % this means I've verified an unusual item

\catcode`\@=\active
\let@=\thinspace

\obeylines
\:Abiteboul, Serge,\|Kuper,~Gabriel~M.,\|Mairson, Harry G.,\|Shvartsman, Alex Allister, and Vardi, Moshe Y.\\In memoriam: Paris~C. Kanellakis.\\\p20:203--204
\:Abrahamson, K.,\|Dadoun,~N.,\|Kirkpatrick, David G., and Przytycka, T.\\A simple parallel tree contraction algorithm.\\\p10:287--302
\:Adhar, Gur Saran, and Peng, Shietung.\\Parallel algorithms for cographs and parity graphs with applications.\\\p11:252--284
\:Afek, Yehuda, and Ricklin, Moty.\\Sparser: A paradigm for running distributed algorithms.\\\p14:316--328
\:Agarwal, Pankaj K.,\|Efrat, Alon,\|Sharir, Micha, and Toledo, Sivan.\\Computing a segment center for a planar point set.\\\p15:314--323
\:\_ and Sen, Sandeep.\\Selection in monotone matrices and computing $k$th nearest neighbors.\\\p20:581--601
\:\_ and Sharir, Micha.\\Circle shooting in a simple polygon.\\\p14:69--87
\:\_,\|\_, and Toledo, Sivan.\\Applications of parametric searching in geometric optimization.\\\p17:292--318
\:\_,\|van Kreveld, Marc, and Overmars, Mark H.\\Intersection queries in curved objects.\\\p15:229--266
\:Aggarwal, Alok,\|Bar-Noy, Amotz,\|Khuller, Samir,\|Kravets, Dina, and Schieber, Baruch.\\Efficient minimum cost matching and transportation using the quadrangle inequality.\\\p19:116--143
\:\_,\|Imai, Hiroshi,\|Katoh, Naoki, and Suri, Subhash.\\Finding $k$ points with minimum diameter and related problems.\\\p12:38--56
\:\_ and Melville, Robert C.\\Fast computation of the modality of polygons.\\\p7:369--381
\:\_ and Tokuyama, Takeshi.\\An improved algorithm for the traveler's problem.\\\p19:318--330
\>\_\\\also O'Rourke
\:Aigner, Martin.\\Parallel complexity of sorting problems.\\\p3:79--88
\:Akl, Selim G., and Meijer, Henk.\\On the average-case complexity of ``bucketing'' algorithms.\\\p3:9--13
\>Alagar, V. S.\\\see Thanh
\:Alekseyev, Valery B.\\On the complexity of some algorithms of matrix multiplication.\\\p6:71--85
\:Allison, Lloyd.\\Generating coset representatives for permutation groups.\\\p2:227--244
\:Alon, Noga,\|Babai, L\'aszl\'o, and Itai, Alon.\\A fast and simple randomized parallel algorithm for the maximal independent set problem.\\\p7:567--583
\:\_,\|Bar-Noy, Amotz,\|Linial, Nathan, and Peleg, David.\\Single round simulation on radio networks.\\\p13:188--210
\:\_,\|Duke, R. A.,\|Lefmann, H.,\|R\"odl, V., and Yuster, R.\\The algorithmic aspects of the regularity lemma.\\\p16:80--109
\:\_,\|Galil, Zvi, and Milman, V. D.\\Better expanders and superconcentrators.\\\p8:337--347
\:Alth\"ofer, Ingo.\\On the complexity of searching game trees and other recursion trees.\\\p9:538--567
\:\_.\\A parallel game tree search algorithm with a linear speedup.\\\p15:175--198
\:Amato, Nancy,\|Blum, Manuel,\|Irani, Sandra, and Rubinfeld, Ronitt.\\Reversing trains: A turn of the century sorting problem.\\\p10:413--428
\:Amir, Amihood,\|Landau, Gad M., and Vishkin, Uzi.\\Efficient pattern matching with scaling.\\\p13:2--32
\>Anshel, M.\\\see Domanski
\:Anstee, R. P.\\An algorithmic proof of Tutte's $f$-factor theorem.\\\p6:112--131
\:\_ and Farber, Martin.\\Characterizations of totally balanced matrices.\\\p5:215--230
\:Apostolico, Alberto, and Szpankowski, Wojciech.\\Self-alignments in words and their applications.\\\p13:446--467
\:Arkin, Esther M., and Papadimitriou, Christos H.\\On the complexity of circulations.\\\p7:134--145
\:Arnborg, Stefan,\|Lagergren, Jens, and Seese, Detlef.\\Easy problems for tree-decomposable graphs.\\\p12:308--340
\:Asano, Takao,\|Asano, Tetsuo, and Pinter, Ron Y.\\Polygon triangulation: Efficiency and minimality.\\\p7:221--231
\>\_\\\also Imai
\>Asano, Tetsuo\\\see Asano
\:Aspnes, James.\\Time- and space-efficient randomized consensus.\\\p14:414--431
\:\_ and Herlihy, Maurice.\\Fast randomized consensus using shared memory.\\\p11:441--461
\:Aspvall, Bengt.\\Recognizing disguised NR(1) instances of the satisfiability problem.\\\p1:97--103
\:\_ and Stone, Richard E.\\Khachiyan's linear programming algorithm.\\\p1:1--13
\:Assmann, S. F.,\|Johnson, David~S.,\|Kleitman, D. J., and Leung, Joseph Y-T.\\On a dual version of the one-dimensional bin packing problem.\\\p5:502--525
\:Atallah, Mikhail J.\\Computing the convex hull of line intersections.\\\p7:285--288
\:\_ and Hambrusch, Susanne E.\\On bipartite matchings of minimum density.\\\p8:480--502
\:\_ and Kosaraju, S. Rao.\\An efficient parallel algorithm for the row minima of a totally monotone matrix.\\\p13:394--413
\:Atkinson, M. D.\\An optimal algorithm for geometrical congruence.\\\p8:159--172
\:Attiya, Hagit, and Snir, Marc.\\Better computing on the anonymous ring.\\\p12:204--238
\:Aurenhammer, F.\\Improved algorithms for discs and balls using power diagrams.\\\p9:151--161
\:Ausiello, Giorgio,\|Italiano, Giuseppe F.,\|Spaccamela, Alberto Marchetti, and Nanni, Umberto.\\Incremental algorithms for minimal length paths.\\\p12:615--638
\:Averbuch, Amir,\|Bshouty, Nader~H., and Kaminski, Michael.\\A classification of algorithms for multiplying polynomials of small degree over finite fields.\\\p13:577--588
\:Avery, Peter.\\An algorithmic proof that semiorders are representable.\\\p13:144--147
\>Avis, D.\\\see El Gindy
\:Awerbuch, Baruch.\\On the effects of feedback in dynamic network protocols.\\\p11:342--373
\:\_,\|Bar-Noy, Amotz,\|Linial, Nathan, and Peleg, David.\\Improved routing strategies with succinct tables.\\\p11:307--341
\:Azar, Yossi,\|Naor, Joseph (Seffi), and Rom, Raphael.\\The competitiveness of on-line assignments.\\\p18:221--237
\medskip
\>Babai, L\'aszl\'o\\\see Alon
\:Bach, Eric,\|Driscoll, James, and Shallit, Jeffrey.\\Factor refinement.\\\p15:199--222
\:Bagchi, A., and Srimani, P. K.\\Weighted heuristic search in networks.\\\p6:550--576
\:Baker, Brenda S.\\A new proof for the first-fit decreasing bin-packing algorithm.\\\p6:49--70
\:\_,\|Brown, Donna J., and Katseff, Howard P.\\A 5/4 algorithm for two-dimensional packing.\\\p2:348--368
\:\_ and Coffman, E. G., Jr.\\A~two-dimensional bin-packing model of preemptive, {\mc FIFO} storage allocation.\\\p3:303--316
\:\_,\|Fortune, S. J., and Mahaney, S. R.\\Polygon containment under translation.\\\p7:532--548
\>Baldwin, Michael\\\see O'Rourke
\:Bampis, E.,\|El Haddad, M.,\|Manoussakis, Yannis, and Santha, M.\\A parallel reduction of Hamiltonian cycle to Hamiltonian path in tournaments.\\\p19:432--440
\:Bang-Jensen, J{\o}rgen,\|Manoussakis, Yannis, and Thomassen, Carsten.\\A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs.\\\p13:114--127
\:Bar-Eli, Eldad,\|Berman, Piotr,\|Fiat, Amos, and Yan, Peiyuan.\\Online navigation in a room.\\\p17:319--341
\:Bar-Ilan, Judit,\|Kortsarz, Guy, and Peleg, David.\\How to allocate network centers.\\\p15:385--415
\>Bar-Noy, Amotz\\\see Aggarwal; Alon; Awerbuch
\:Bar-Yehuda, Reuven, and Even,~S.\\A linear-time approximation algorithm for the weighted vertex cover problem.\\\p2:198--203
\:\_ and Kutten, Shay.\\Fault tolerant distributed majority commitment.\\\p9:568--582
\:Baumgarten, Hanna,\|Jung, Hermann, and Mehlhorn, Kurt.\\Dynamic point location in general subdivisions.\\\p17:342--380
\:Becker, Ronald I., and Perl, Yehoshua.\\Shifting algorithms for tree partitioning with general weighting functions.\\\p4:101--120
\:Ben-Asher, Yosi, and Schuster, Assaf.\\The complexity of data reduction on a reconfigurable linear array.\\\p18:322--357
\:Bender, Edward A., and Wilf, Herbert S.\\A theoretical analysis of backtracking in the graph coloring problem.\\\p6:275--282
\:Bentley, Jon Louis.\\A parallel algorithm for constructing minimum spanning trees.\\\p1:51--59
\:\_ and Saxe, James B.\\Decomposable searching problems~I. Static-to-dynamic transformation.\\\p1:301--358
\:Bergen, James R., and Shvaytser (Schweitzer), Haim.\\A probabilistic algorithm for computing Hough transforms.\\\p12:639--656
\:Berger, Bonnie, and Cowen, Lenore.\\Scheduling with concurrency-based constraints.\\\p18:98--123
\:Bergeron, F.,\|Berstel, J.,\|Brlek,~S., and Duboc, C.\\Addition~chains using continued fractions.\\\p10:403--412
\:Berkman, Omer,\|Schieber, Baruch, and Vishkin, Uzi.\\Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values.\\\p14:344--370
\:Berman, Fran,\|Johnson, David S.,\|Leighton, F. Tom,\|Shor, Peter W., and Snyder, Larry.\\Generalized planar matching.\\\p11:153--184
\:Berman, Piotr, and Ramaiyer, Viswanathan.\\Improved approximations for the Steiner tree problem.\\\p17:381--408
\>\_\\\also Bar-Eli
\:Bern, M. W.,\|Lawler, E. L., and Wong, A. L.\\Linear-time computation of optimal subgraphs of decomposable graphs.\\\p8:216--235
\:Bernstein, David,\|Rodeh,~Michael, and Gertner, Izidor.\\Approximation algorithms for scheduling arithmetic expressions on pipelined machines.\\\p10:120--139
\>Berstel, J.\\\see Bergeron
\:Beynon, W. M.\\A formal account of some elementary continued fraction algorithms.\\\p4:221--240
\:Bhattacharya, Binay K., and Toussaint, Godfried T.\\Efficient algorithms for computing the maximum distance between two finite planar sets.\\\p4:121--136
\:\_ and Zorbas, J.\\Solving the two-dimensional findpath problem using a line-triangle representation of the robot.\\\p9:449--469
\>\_\\\also Jadhav
\:Bienstock, D., and Seymour, Paul~D.\\Monotonicity in graph searching.\\\p12:239--245
\:Biran, Ofer,\|Moran, Shlomo, and Zaks, Shmuel.\\A combinatorial characterization of the distributed 1-solvable tasks.\\\p11:420--440
\:Birk, Yitzhak, and Lotspiech, Jeffrey B.\\On finding non-intersecting straightline connections of grid points to the boundary.\\\p13:636--656
\:Bitan, Sara, and Zaks, Shmuel.\\Optimal linear broadcast.\\\p14:288--315
\:Blaha, Kenneth D.\\Minimum bases for permutation groups: The greedy approximation.\\\p13:297--306
\>Blieberger, J.\\\see Schmid
\:Blum, Avrim, and Spencer, Joel.\\Coloring random and semi-random $k$-colorable graphs.\\\p19:204--234
\>Blum, Manuel\\\see Amato
\:Blumer, Janet A.\\How much is that {\mc DAWG} in the window? A moving window algorithm for the directed acyclic word graph.\\\p8:451--469
\:Bodlaender, Hans L.\\Polynomial algorithms for graph isomorphism and chromatic index on partial $k$-trees.\\\p11:631--643
\:\_.\\On linear time minor tests with depth-first search.\\\p14:1--23
\:\_,\|Gilbert, John R.,\|Hafsteinsson, Hj\'almt\'yr, and Kloks, Ton.\\Approximating treewidth, pathwidth, frontsize, and shortest elimination tree.\\\p18:238--255
\:\_ and Kloks, Ton.\\A simple linear time algorithm for triangulating three-colored graphs.\\\p15:160--172
\:Bollob\'as, B\'ela,\|Fenner, T. I., and Frieze, Alan M.\\On the best case of Heapsort.\\\p20:205--217
\:\_ and Simon, Istvan.\\Repeated random insertion into a priority queue.\\\p6:466--477
\:Booth, Heather, and Tarjan, Robert Endre.\\Finding the minimum-cost maximum flow in a series-parallel network.\\\p15:416--446
\:Borwein, Peter B.\\On the complexity of calculating factorials.\\\p6:376--380
\:Bose, Prosenjit, and Toussaint, Godfried T.\\Growing a tree from its branches.\\\p19:86--103
\:Boshernitzan, M., and Fraenkel, A. S.\\A linear algorithm for nonhomogeneous spectra of numbers.\\\p5:187--198
\:Boyar, Joan F., and Karloff, Howard~J.\\Coloring planar graphs in parallel.\\\p8:470--479
\:Brent, Richard P.,\|Gustavson, Fred~G., and Yun, David Y. Y.\\Fast solution of Toeplitz systems of equations and computation of Pad\'e approximants.\\\p1:259--295
\:Breslauer, Dany.\\Dictionary-matching on unbounded alphabets: Uniform length dictionaries.\\\p18:278--295
\:Bridgland, Michael F.\\Universal traversal sequences for paths and cycles.\\\p8:395--404
\:Brinck, Keith.\\On deletion in threaded binary trees.\\\p7:395--411
\>Brlek, S.\\\see Bergeron
\>Brown, Donna J.\\\see Baker; Ramanan
\:Bruck, Jehoshua, and Roychowdhury, Vwani P.\\How to play bowling in parallel on the grid.\\\p12:516--529
\>Bruckstein, Alfred\\\see Lindenbaum
\>Bshouty, Nader H.\\\see Averbuch; Kaminski
\:Buchsbaum, Adam L., and Tarjan, Robert Endre.\\Confluently persistent deques via data-structural bootstrapping.\\\p18:513--547
\>Bui, T. D.\\\see Thanh
\:Burge, William H.\\Stacks in a two-level store.\\\p2:178--185
\:Burley, William R.\\Traversing layered graphs using the work function algorithm.\\\p20:479--511
\:Buss, Jonathan F.,\|Kanellakis, Paris C.,\|Ragde, Prabhakar L., and Shvartsman, Alex Allister.\\Parallel algorithms with processor failures and delays.\\\p20:45--86
\:Butler, Gregory.\\Computing normalizers in permutation groups.\\\p4:163--175
\medskip
\:Camerini, P. M.,\|Galbiati, G., and Maffioli, F.\\Random pseudo-polynomial algorithms for exact matroid problems.\\\p13:258--273
\:Cantor, David G.\\Irreducible polynomials with integral coefficients have succinct certificates.\\\p2:385--392
\:Capoyleas, Vasilis,\|Rote, G\"unter, and Woeginger, Gerhard.\\Geometric clusterings.\\\p12:341--356
\>Carlsson, Svante\\\see de Berg
\:Caro, Yair,\|Seb\H{o}, Andr\'as, and Tarsi, Michael.\\Recognizing greedy structures.\\\p20:137--156
\:Caspi, Yuval, and Dekel, Eliezer.\\Edge coloring series parallel graphs.\\\p18:296--321
\:Chakrabarti, P. P., and Ghose, S.\\A~general best first search algorithm in {\mc AND}/{\mc OR} graphs.\\\p13:177--187
\>\_\\\also Dasgupta; Sarkar
\:Chandra, Barun, and Vishwanathan, Sundar.\\Constructing reliable communication networks of small weight online.\\\p18:159--175
\:Chandru, Vijay,\|Ghosh, Subir Kumar,\|Maheshwari, Anil,\|Rajan, V. T., and Saluja, Sanjeev.\\$\cal NC$-algorithms for minimum link path and related problems.\\\p19:173--203
\:Chang, Yukon,\|Hambrusch, Susanne E., and Simon, Janos.\\On the computational complexity of continuous routing.\\\p10:86--108
\:Chen, Danny Z.\\Optimally computing the shortest weakly visible subedge of a simple polygon.\\\p20:459--478
\>Chen, Gen-Huey\\\see Wang
\:Chen, Lin, and Yesha, Yaacov.\\Parallel recognition of the consecutive ones property with applications.\\\p12:375--392
\>Cheng, Kam Hoi\\\see Li
\:Cheng, Siu Wing, and Janardan, Ravi.\\Efficient maintenance of the union of intervals on a line, with applications.\\\p12:57--74
\:\_ and \_.\\Algorithms for ray-shooting and intersection searching.\\\p13:670--692
\:Cheng, Ying, and Hwang, Frank K.\\Diameters of weighted double loop networks.\\\p9:401--410
\:Cheriyan, J., and Maheshwari, S. N.\\Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs.\\\p9:507--537
\:Chiba, Norishige, and Nishizeki, Takao.\\The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs.\\\p10:187--211
\:\_,\|\_, and Saito, Nobuji.\\A~linear 5-coloring algorithm of planar graphs.\\\p2:317--327
\:Chong, Ka Wong, and Lam, Tak Wah.\\Finding connected components in $O(\log n\log\log n)$ time on the {\mc EREW} {\mc PRAM}.\\\p18:378--402
\:Chou, Ching-Tsun, and Gopal, Inder S.\\Linear broadcast routing.\\\p10:490--517
\:Chrobak, Marek, and Larmore, Lawrence L.\\On fast algorithms for two servers.\\\p12:607--614
\:\_ and \_.\\Generosity helps or an~11-competitive algorithm for three servers.\\\p16:234--263
\:\_ and Nishizeki, Takao.\\Improved edge-coloring algorithms for planar graphs.\\\p11:102--116
\:\_ and Yung, Moti.\\Fast algorithms for edge-coloring planar graphs.\\\p10:35--51
\:Chu, Jeff.\\Optimal algorithm for the nearest common dominator problem.\\\p13:693--697
\:Chung, Moon Jung.\\$O(n^{2.5})$ time algorithms for the subgraph homeomorphism problem on trees.\\\p8:106--112
\>Chwa, Kyung-Yong\\\see Doh
\>Coffman, E. G., Jr.\\\see Baker
\:Cohen, David, and Fredman, Michael~L.\\Weighted binary trees for concurrent searching.\\\p20:87--112
\>Cohoon, James\\\see Raghavan
\:Colbourn, Charles J.,\|Day, Robert P. J., and Nel, Louis D.\\Unranking and ranking spanning trees of a graph.\\\p10:271--286
\:\_,\|Myrvold, Wendy J., and Neufeld, Eugene.\\Two algorithms for unranking arborescences.\\\p20:268--281
\:Cole, Richard.\\Searching and storing similar lists.\\\p7:202--220
\:\_ and Yap, Chee K.\\Shape from probing.\\\p8:19--38
\:\_ and Zajicek, Ofer.\\An asynchronous parallel algorithm for undirected graph connectivity.\\\p18:50--97
\:Colussi, Livio.\\Fastest pattern matching in strings.\\\p16:163--189
\:Cook, Stephen A., and McKenzie, Pierre.\\Problems complete for deterministic logarithmic space.\\\p8:385--394
\:Corneil, Derek G., and Goldberg, Mark.\\A non-factorial algorithm for canonical numbering of a graph.\\\p5:345--362
\>\_\\\also Everett@; Przytycka
\>Cowen, Lenore\\\see Berger
\:Csirik, J.\\The parametric behavior of the first-fit decreasing bin packing algorithm.\\\p15:1--28
\:\_,\|Frenk, J. B. G.,\|Galambos,~G., and Rinnooy Kan, A. H. G.\\Probabilistic analysis of algorithms for dual bin packing problems.\\\p12:189--203
\:Culberson, Joseph C., and Reckhow, Robert A.\\Covering polygons is hard.\\\p17:2--44
\:Cypher, Robert, and Sanz, Jorge L.~C.\\Cubesort: A parallel algorithm for sorting $N$ data items with $S$-sorters.\\\p13:211--234
\:\_,\|\_, and Snyder, Larry.\\Hypercube and shuffle-exchange algorithms for image component labeling.\\\p10:140--150
\medskip
\>Dadoun, N.\\\see Abrahamson
\:Dahlhaus, Elias,\|Hajnal, P\'eter, and Karpinski, Marek.\\On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs.\\\p15:367--384
\:Dasgupta, Pallab,\|Chakrabarti, P. P., and DeSarkar, S. C.\\Multiobjective heuristic search in {\mc AND}/{\mc OR} graphs.\\\p20:282--311
\:Datta, Amitava,\|Lenhof, Hans-Peter,\|Schwarz, Christian, and Smid, Michiel.\\Static and dynamic algorithms for $k$-point clustering problems.\\\p19:474--503
\>Day, Robert P. J.\\\see Colbourn
\:de Berg, Mark T.,\|Carlsson, Svante, and Overmars, Mark~H.\\A general approach to dominance in the plane.\\\p13:274--296
\:\_,\|van Kreveld, Marc, and Snoeyink, Jack.\\Two- and three-dimensional point location in rectangular subdivisions.\\\p18:256--277
\:de la Torre, Pilar, and Kruskal, Clyde P.\\Fast parallel algorithms for all-sources lexicographic search and path-algebra problems.\\\p19:1--24
\>\_\\\also Knott
\>de Werra, D.\\\see Gavril
\>Dekel, Eliezer\\\see Caspi
\>Deogun, J. S.\\\see Ramanan
\>DeSarkar, S. C.\\\see Dasgupta; Sarkar
\:Devroye, Luc.\\The expected length of the longest probe sequence for bucket searching when the distribution is not uniform.\\\p6:1--9
\:\_ and Toussaint, Godfried T.\\Convex hulls for random lines.\\\p14:381--394
\:Diaconis, Persi.\\Average running time of the fast Fourier transform.\\\p1:187--208
\:Diks, Krzystof,\|Djidjev, Hristo~N.,\|Sykora, Ondrej, and Vrto, Imrich.\\Edge separators of planar and outerplanar graphs with applications.\\\p14:258--279
\:Dixon, John D., and Wilf, Herbert~S.\\The random selection of unlabeled graphs.\\\p4:205--213
\>Djidjev, Hristo N.\\\see Diks
\:Dobkin, David P., and Edelsbrunner, Herbert.\\Space searching for intersecting objects.\\\p8:348--361
\:\_ and Kirkpatrick, David G.\\A~linear algorithm for determining the separation of convex polyhedra.\\\p6:381--392
\:\_ and Munro, J. Ian.\\Efficient uses of the past.\\\p6:455--465
\:Doh, Jeong-In, and Chwa, Kyung-Yong.\\An algorithm for determining visibility of a simple polygon from an internal line segment.\\\p14:139--168
\:Doignon, Jean-Paul, and Falmagne, Jean-Claude.\\A polynomial time algorithm for unidimensional unfolding representations.\\\p16:218--233
\:Dolev, Danny.\\The Byzantine generals strike again.\\\p3:14--30
\:\_,\|Klawe, Maria M., and Rodeh, Michael.\\An $O(n\log n)$ unidirectional distributed algorithm for extrema finding in a circle.\\\p3:245--260
\:\_ and Warmuth, Manfred K.\\Scheduling precedence graphs of bounded height.\\\p5:48--59
\:Domanski, B., and Anshel, M.\\The complexity of Dehn's algorithm for word problems in groups.\\\p6:543--549
\>Driscoll, James\\\see Bach
\:Du, Jianzhong, and Leung, Joseph~Y-T.\\Minimizing mean flow time in two-machine open shops and flow shops.\\\p14:24--44
\:\_ and \_.\\Minimizing mean flow time with release time and deadline constraints.\\\p14:45--68
\>Duboc, C.\\\see Bergeron
\>Duke, R. A.\\\see Alon
\:Duval, Jean Pierre.\\Factorizing words over an ordered alphabet.\\\p4:363--381
\:Dyer, M. E., and Frieze, Alan~M.\\Planar 3DM is NP-complete.\\\p7:174--184
\:\_ and \_.\\The solution of some random NP-hard problems in polynomial expected time.\\\p10:451--489
\medskip
\:Eades, Peter, and Staples, John.\\On optimal trees.\\\p2:369--384
\:Eberly, Wayne.\\Logarithmic depth circuits for Hermite interpolation.\\\p16:335--360
\:Eddy, William F., and Schervish, Mark J.\\How many comparisons does Quicksort use?\\\p19:402--431
\:Edelsbrunner, Herbert.\\Computing the extreme distances between two convex polygons.\\\p6:213--224
\:\_ and Overmars, Mark H.\\Batched dynamic solutions to decomposable searching problems.\\\p6:515--542
\>\_\\\also Dobkin
\>Efrat, Alon\\\see Agarwal
\:Ehrenfeucht, Andrzej,\|Gabow, Harold N.,\|McConnell, Ross~M., and Sullivan, Stephen~J.\\An $O(n^2)$ divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs.\\\p16:283--294
\:Ehrlich, Gideon.\\Searching and sorting real numbers.\\\p2:1--12
\:El Gindy, H., and Avis, D.\\A linear algorithm for computing the visibility polygon from a point.\\\p2:186--197
\>El Haddad, M.\\\see Bampis
\:Engel, Konrad.\\An algorithm for the determination of the variance of a partially ordered set.\\\p19:441--448
\:Eppstein, David.\\Sequence comparison with mixed convex and concave costs.\\\p11:85--101
\:\_.\\Offline algorithms for dynamic minimum spanning tree problems.\\\p17:237--250
\:\_,\|Italiano, Giuseppe F.,\|Tamassia, Roberto,\|Tarjan, Robert Endre,\|Westbrook, Jeffery, and Yung, Moti.\\Maintenance of a minimum spanning forest in a dynamic plane graph.\\\p13:33--54; \p15:173
\:Er, M. C.\\The complexity of the generalised\sic/ cyclic Towers of Hanoi problem.\\\p6:351--358
\:Etzion, Tuvi.\\An algorithm for constructing $m$-ary de Bruijn sequences.\\\p7:331--340
\:Even, S., and Goldreich, O.\\The minimum-length generator sequence problem is NP-hard.\\\p2:311--313
\>\_\\\also Bar-Yehuda
\:Everett, H., and Corneil, Derek G.\\Recognizing visibility graphs of spiral polygons.\\\p11:1--26
\medskip
\>Falmagne, Jean-Claude\\\see Doignon
\:Farber, Martin, and Keil, J. Mark.\\Domination in permutation graphs.\\\p6:309--321
\>\_\\\also Anstee
\:Feig, Ephraim.\\On systems of bilinear forms whose minimal division-free algorithms are all bilinear.\\\p2:261--281
\:\_.\\Minimal algorithms for bilinear forms may have divisions.\\\p4:81--84
\:\_.\\Certain systems of bilinear forms whose minimal algorithms are all quadratic.\\\p4:137--149
\>Feil, Todd\\\see Hamidoune
\:Feinberg, Ellen B., and Papadimitriou, Christos H.\\Finding feasible paths for a two-point body.\\\p10:109--119
\>Fenner, T. I.\\\see Bollob\'as
\:Ferguson, Helaman R. P.\\A noninductive $GL(n,{\bbb Z})$ algorithm that constructs integral linear relations for $n$ $\bbb Z$-linearly dependent real numbers.\\\p8:131--145
\:Fern\'andez-Baca, David, and Slutzki, Giora.\\Solving parametric problems on trees.\\\p10:381--402
\:\_ and \_.\\Parametric problems on graphs of bounded tree-width.\\\p16:408--430
\:Fiat, Amos,\|Karp, Richard M.,\|Luby, Michael,\|McGeoch, Lyle~A.,\|Sleator, Daniel D., and Young, Neal E.\\Competitive paging algorithms.\\\p12:685--699
\>\_\\\also Bar-Eli
\:Filaseta, Michael,\|Robinson, M.~L., and Wheeler, Ferrell~S.\\The minimal Euclidean norm of an algebraic number is effectively computable.\\\p16:309--333
\:Fillebrown, Sandra.\\Faster computation of Bernoulli numbers.\\\p13:431--445
\:Fischer, Anat,\|Gilboa, Itzhak, and Shpitalni, Moshe.\\A polynomial algorithm for minimal interval representation.\\\p13:546--563
\:Flajolet, Philippe,\|Fran\c{c}on, J., and Vuillemin, J.\\Sequence of operations analysis for dynamic data structures.\\\p1:111--141
\:\_ and Saheb, Nasser.\\The complexity of generating an exponentially distributed variate.\\\p7:463--488
\:Formann, Michael,\|Wagner, Dorothea, and Wagner, Frank.\\Routing through a dense channel with minimum total wire length.\\\p15:267--283
\>Fortune, S. J.\\\see Baker
\>Fraenkel, A. S.\\\see Boshernitzan
\>Fran\c{c}on, J.\\\see Flajolet
\:Frank, Andr\'as.\\A weighted matroid intersection algorithm.\\\p2:328--336
\:Franzblau, D. S., and Zeilberger, Doron.\\A bijective proof of the hook-length formula.\\\p3:317--343
\:Frederickson, Greg N.\\Using cellular graph embeddings in solving all pairs shortest paths problems.\\\p19:45--85
\:\_ and Guan, D. J.\\Nonpreemptive ensemble motion planning on a tree.\\\p15:29--60
\:\_ and Johnson, Donald B.\\Finding $k$th paths and $p$-centers by generating and searching good data structures.\\\p4:61--80
\:Fredman, Michael L.\\The spanning bound as a measure of range query complexity.\\\p2:77--87
\:\_ and Goldsmith, Deborah L.\\Three stacks.\\\p17:45--70
\:\_,\|Johnson, David S.,\|McGeoch, Lyle A., and Ostheimer, G.\\Data structures for traveling salesmen.\\\p18:432--479
\:\_ and Volper, Dennis J.\\The complexity of partial match retrieval in a dynamic setting.\\\p3:68--78
\>\_\\\also Cohen
\>Frenk, J. B. G.\\\see Csirik
\:Friesen, D. K., and Langston, Michael A.\\Evaluation of a {\mc MULTIFIT}-based scheduling algorithm.\\\p7:35--59
\:Frieze, Alan M.\\An algorithm for finding Hamilton cycles in random directed graphs.\\\p9:181--204
\:\_ and Suen, Stephen.\\Analysis of two simple heuristics on a random instance of $k$-{\mc SAT}.\\\p20:312--355
\>\_\\\also Bollob\'as; Dyer
\>Fujisawa, Toshio\\\see Kashiwabara
\:F\"urer, Martin, and Raghavachari, Balaji.\\Approximating the minimum-degree Steiner tree to within one of optimal.\\\p17:409--423
\:\_ and \_.\\An efficient parallel algorithm for finding Hamiltonian cycles in dense directed graphs.\\\p18:203--220
\medskip
\:Gabow, Harold N.\\Centroids, representations, and submodular flows.\\\p18:586--628
\:\_ and Tarjan, Robert Endre.\\Efficient algorithms for a family of matroid intersection problems.\\\p5:80--131
\:\_ and \_.\\Algorithms for two bottleneck optimization problems.\\\p9:411--417
\>\_\\\also Ehrenfeucht
\>Galambos, G.\\\see Csirik
\>Galbiati, G.\\\see Camerini
\>Galil, Zvi\\\see Alon; Leven
\:Gavril, F\u{a}nic\u{a}.\\Generating the maximum spanning trees of a weighted graph.\\\p8:592--597
\:\_ and Sch\"onheim, Johanan.\\Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs.\\\p6:239--252
\:\_,\|Toledano Laredo, V., and de~Werra, D.\\Chordless paths, odd holes, and kernels in graphs without $m$-obstructions.\\\p17:207--221
\:Georgakopoulos, George, and Papadimitriou, Christos H.\\The 1-Steiner tree problem.\\\p8:122--130
\>Gertner, Izidor\\\see Bernstein
\>Ghose, S.\\\see Chakrabarti; Sarkar
\:Ghosh, Subir Kumar.\\Computing the visibility polygon from a convex set and related problems.\\\p12:75--95
\>\_\\\also Chandru
\:Gibbons, Phillip,\|Karp, Richard M.,\|Ramachandran, Vijaya,\|Soroker, Danny, and Tarjan, Robert Endre.\\Transitive compaction in parallel via branchings.\\\p12:110--125
\:Gilbert, John R.,\|Hutchinson, Joan~P., and Tarjan, Robert Endre.\\A separator theorem for graphs of bounded genus.\\\p5:391--407
\>\_\\\also Bodlaender
\>Gilboa, Itzhak\\\see Fischer
\>Goddard, Wayne\\\see Zhu
\:Goldberg, Andrew V.,\|Plotkin, Serge A., and Vaidya, Pravin M.\\Sublinear-time parallel algorithms for matching and related problems.\\\p14:180--213
\:Goldberg, Leslie Ann.\\Efficient algorithms for listing unlabeled graphs.\\\p13:128--143
\>Goldberg, Mark\\\see Corneil
\:Goldberg, Robert N.\\Minimal string difference encodings.\\\p3:147--156
\:Goldberg, Tal, and Zwick, Uri.\\Faster parallel string matching via larger deterministic samples.\\\p16:295--308
\>Goldreich, O.\\\see Even
\>Goldsmith, Deborah L.\\\see Fredman
\:Golumbic, Martin Charles, and Hammer, Peter L.\\Stability in circular arc graphs.\\\p9:314--320
\:\_,\|Kaplan, Haim, and Shamir, Ron.\\Graph sandwich problems.\\\p19:449--473
\:Gonnet, Gaston H., and Munro, J. Ian.\\The analysis of linear probing sort by the use of a new mathematical transform.\\\p5:451--470
\:Goodrich, Michael T.\\Triangulating a polygon in parallel.\\\p10:327--351
\>Gopal, Inder S.\\\see Chou
\:Graham, Ronald L., and Yao, F.~Frances.\\Finding the convex hull of a simple polygon.\\\p4:324--331
\:Greenberg, Harold.\\Solution to a linear diophantine equation for nonnegative integers.\\\p9:343--353
\>Guan, D. J.\\\see Frederickson
\:Gu\'enoche, A.\\Random spanning tree.\\\p4:214--220
\:Guibas, Leonidas J.\\Problems.\\\p1:107--110; \p1:209--212; \p1:394--395; \p2:103--104; \p2:208--210; \p2:314--315; \p3:177--181; \p3:362--380; \p4:85--86; \p4:176--188; \p4:382--396; \p5:145--146; \p5:579--594; \p6:283--290
\>\_\\\also Hershberger
\:Gupta, Arvind, and Nishimura, Naomi.\\The parallel complexity of tree embedding problems.\\\p18:176--200
\:Gupta, Prosenjit,\|Janardan, Ravi, and Smid, Michiel.\\Further results on generalized intersection searching problems: Counting, reporting, and dynamization.\\\p19:282--317
\:Gupta, U. I.,\|Lee, D. T., and Wong, C. K.\\Ranking and unranking of $B$-trees.\\\p4:51--60
\:Gurari, Eitan M., and Sudborough, Ivan Hal.\\Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem.\\\p5:531--546
\:Gusfield, Dan.\\Bounds for naive multiple machine scheduling with release times and deadlines.\\\p5:1--6
\>Gustavson, Fred G.\\\see Brent
\:G\"uting, Ralf-Hartmut.\\An optimal contour algorithm for iso-oriented rectangles.\\\p5:303--326
\:\_,\|Nurmi, Otto, and Ottmann, Thomas.\\Fast algorithms for direct enclosures and direct dominances.\\\p10:170--186
\medskip
\:Hafner, James Lee, and McCurley, Kevin S.\\On the distribution of running times of certain integer factoring algorithms.\\\p10:531--556
\>Hafsteinsson, Hj\'almt\'yr\\\see Bodlaender
\:Hagerup, Torben.\\Fast deterministic processor allocation.\\\p18:629--649
\>Hajnal, P\'eter\\\see Dahlhaus
\:Hakimi, S. Louis, and Schmeichel, Edward F.\\An adaptive algorithm for system level diagnosis.\\\p5:526--530
\>\_\\\also Nakajima; Schmeichel
\>Hambrusch, Susanne E.\\\see Atallah; Chang
\:Hamidoune, Yahya Ould,\|Roeder, David,\|Janke, Steven,\|Feil, Todd, and Koo, Richard.\\The probability of splitters in a list.\\\p10:151--154
\>Hammer, Peter L.\\\see Golumbic
\:Hao, Jianxiu, and Orlin, James B.\\A faster algorithm for finding the minimum cut in a directed graph.\\\p17:424--446
\:Hartvigsen, David.\\Minimum path bases.\\\p15:125--142
\:Hassin, Refael, and Megiddo, Nimrod.\\An optimal algorithm for finding all the jumps of a monotone step-function.\\\p6:265--274
\:H{\aa}stad, Johan.\\Tensor rank is NP-complete.\\\p11:644--654
\:Hayward, Ryan, and McDiarmid, Colin J. H.\\Average case analysis of heap building by repeated insertion.\\\p12:126--153
\:He, Xin.\\An improved algorithm for the planar 3-cut problem.\\\p12:23--37
\:\_.\\Efficient parallel algorithms for series parallel graphs.\\\p12:409--430
\:\_.\\Parallel algorithm for cograph recognition with applications.\\\p15:284--313
\:\_ and Yesha, Yaacov.\\Binary tree algebraic computation and parallel algorithms for simple graphs.\\\p9:92--113
\:Hell, Pavol, and Kirkpatrick, David~G.\\Algorithms for degree constrained graph factors of minimum deficiency.\\\p14:115--138
\:\_ and Rosenfeld, Moshe.\\The complexity of finding generalized paths in tournaments.\\\p4:303--309
\:Hentzel, Irvin Roy, and Hogben, Leslie.\\Exhaustive checking of sparse algebras.\\\p2:44--49
\>Herlihy, Maurice\\\see Aspnes
\:Hershberger, John, and Guibas, Leonidas J.\\An $O(n^2)$ shortest path algorithm for a non-rotating convex body.\\\p9:18--46
\:\_ and Suri, Subhash.\\Finding tailored partitions.\\\p12:431--463
\:\_ and \_.\\A pedestrian approach to ray shooting: Shoot a ray, take a walk.\\\p18:403--431
\:Hester, J. H.,\|Hirschberg, D. S.,\|Huang, Shou-Hsuan Stephen, and Wong, C. K.\\Faster construction of optimal binary split trees.\\\p7:412--424
\:\_,\|\_, and Larmore, Lawrence~L.\\Construction of optimal binary split trees in the presence of bounded access probabilities.\\\p9:245--253
\:Heun, Volker, and Mayr, Ernst~W.\\A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube.\\\p20:375--399
\:Heusinger, H., and Noltemeier,~H.\\On separable clusterings.\\\p10:212--227
\:Hirschberg, D. S., and Larmore, Lawrence L.\\The traveler's problem.\\\p13:148--160
\>\_\\\also Hester
\:Ho, Kevin I-J.,\|Leung, Joseph Y-T., and Wei, W-D.\\Minimizing maximum weighted error for imprecise computation tasks.\\\p16:431--452
\:Hochbaum, Dorit S., and Maass, Wolfgang.\\Fast approximation algorithms for a nonconvex covering problem.\\\p8:305--323
\:\_,\|Nishizeki, Takao, and Shmoys, David B.\\A better than ``best possible'' algorithm to edge color multigraphs.\\\p7:79--104
\:Hofri, Micha.\\A probabilistic analysis of the next-fit bin packing algorithm.\\\p5:547--556
\:\_ and Kamhi, Sami.\\A stochastic analysis of the {\mc NFD} bin-packing algorithm.\\\p7:489--509
\:\_ and Shachnai, Hadas.\\Self-organizing lists and independent references: A statistical synergy.\\\p12:533--555
\>Hogben, Leslie\\\see Hentzel
\>Hong, Jiarong\\\see Plaisted
\:Hsu, Wen-Lian, and Spinrad, Jeremy~P.\\Independent sets in circular-arc graphs.\\\p19:145--160
\:Hu, T. C., and Shing, M. T.\\An $O(n)$ algorithm to find a near-optimum partition of a convex polygon.\\\p2:122--138
\:\_ and \_.\\Multiterminal flows in outerplanar networks.\\\p4:241--261
\:Huang, Ming-Deh A.\\Generalized Riemann hypothesis and factoring polynomials over finite fields.\\\p12:464--481
\:\_.\\Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields.\\\p12:482--489
\:\_ and Teng, Shang-Hua.\\Security, verifiability, and universality in distributed computing.\\\p11:492--521
\:Huang, Shou-Hsuan Stephen.\\Optimal multiway split trees.\\\p8:146--156
\:\_ and Wong, C. K.\\Optimal binary split trees.\\\p5:69--79
\>\_\\\also Hester
\:Huang, Yuejiang.\\A new algorithm for the generation of binary de Bruijn sequences.\\\p11:44--51
\:Hui, Lucas Chi Kwong, and Martel, Charles.\\Unsuccessful search in self-adjusting data structures.\\\p15:447--481
\>Hui, Roger\\\see Ibarra
\>Hutchinson, Joan P.\\\see Gilbert
\:Hwang, Frank K., and Weng, J. F.\\The shortest network under a given topology.\\\p13:468--488
\>\_\\\also Cheng
\>Hyafil, Laurent\\\see Ramanan
\medskip
\:Ibarra, Oscar H.,\|Moran, Shlomo, and Hui, Roger.\\A generalization of the fast {\mc LUP} matrix decomposition algorithm and applications.\\\p3:45--56
\:\_,\|Wang, Hui, and Jiang, Tao.\\On efficient parallel algorithms for solving set recurrence equations.\\\p14:244--257
\:\_ and Zheng, Qi.\\Some efficient algorithms for permutation graphs.\\\p16:453--469
\:Iliopoulos, Costas S.\\Analysis of an algorithm for composition of binary quadratic forms.\\\p3:157--159
\:Imai, Hiroshi, and Asano, Takao.\\Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane.\\\p4:310--323
\:\_ and \_.\\Dynamic orthogonal segment intersection search.\\\p8:1--18
\>\_\\\also Aggarwal
\>Irani, Sandra\\\see Amato
\:Irving, Robert W.\\An efficient algorithm for the ``stable roommates'' problem.\\\p6:577--595
\>Ishiguro, Akira\\\see Suzuki
\:Itai, Alon, and Rodeh, Michael.\\Scheduling transmissions in a network.\\\p6:409--429
\:\_ and Shachnai, Hadas.\\Adaptive source routing in high-speed networks.\\\p20:218--243
\>\_\\\also Alon
\>Italiano, Giuseppe F.\\\see Ausiello; Eppstein
\:Iwama, Kazuo, and Iwamoto, Chuzo.\\\greekmath$\alpha$-connectivity: A gradually nonparallel graph problem.\\\p20:526--544
\:\_ and Kambayashi, Yahiko.\\A simpler parallel algorithm for graph connectivity.\\\p16:190--217
\:\_,\|Miyano, Eiji, and Kambayashi, Yahiko.\\Routing problems on the mesh of buses.\\\p20:613--631
\>Iwamoto, Chuzo\\\see Iwama
\medskip
\:Jadhav, Shreesh,\|Mukhopadhyay, Asish, and Bhattacharya, Binay~K.\\An optimal algorithm for the intersection radius of a set of convex polygons.\\\p20:244--267
\>Janardan, Ravi\\\see Cheng; Gupta
\>Janke, Steven\\\see Hamidoune
\:Jerrum, Mark.\\A compact representation for permutation groups.\\\p7:60--78
\>Jiang, Tao\\\see Ibarra
\:Johnson, David B., and Zwaenepoel, Willy.\\Recovery in distributed systems using optimistic message logging and checkpointing.\\\p11:462--491
\:Johnson, David S.\\The NP-completeness column: An ongoing guide.\\\p2:393--405; \p3:89--99; \p3:182--195; \p3:288--300; \p3:381--395; \p4:87--100; \p4:189--203; \p4:286--300; \p4:397--411; \p5:147--160; \p5:284--299; \p5:433--447; \p5:595--609; \p6:145--159; \p6:291--305; \p6:434--451; \p7:289--305; \p7:584--601; \p8:285--303; \p8:438--448; \p9:426--444; \p11:144--151; \p13:502--524
\>\_\\\also Assmann; Berman; Fredman
\:Johnson, Donald B., and Metaxas, Panagiotis.\\A parallel algorithm for computing minimum spanning trees.\\\p19:383--401
\>\_\\\also Frederickson
\:Johnson, Ellis L.\\Subadditive lifting methods for partitioning and knapsack problems.\\\p1:75--96
\:Joichi, Jim, and Stanton, Dennis.\\An algorithmic involution for $p(n)$.\\\p15:223--228
\>Jung, Hermann\\\see Baumgarten
\medskip
\:Kalvin, Alan D., and Varol, Yaakov L.\\On the generation of all topological sortings.\\\p4:150--162
\:Kalyanasundaram, Bala, and Pruhs, Kirk.\\Online weighted matching.\\\p14:478--488
\>Kambayashi, Yahiko\\\see Iwama
\>Kamhi, Sami\\\see Hofri
\:Kaminski, Michael.\\An algorithm for polynomial multiplication that does not depend on the ring constants.\\\p9:137--147
\:\_,\|Kirkpatrick, David G., and Bshouty, Nader H.\\Addition requirements for matrix and transposed matrix products.\\\p9:354--364
\>\_\\\also Averbuch
\>Kanellakis, Paris C.\\\see Buss
\:Kantor, William M.\\Polynomial-time algorithms for finding elements of prime order and Sylow subgroups.\\\p6:478--514
\:\_.\\Finding Sylow normalizers in polynomial time.\\\p11:523--563
\:\_ and Taylor, D. E.\\Polynomial-time versions of Sylow's theorem.\\\p9:1--17
\>Kaplan, Haim\\\see Golumbic
\:Karchmer, Mauricio, and Naor, Joseph (Seffi).\\A fast parallel algorithm to color a graph with \greekmath$\Delta$ colors.\\\p9:83--91
\:Karger, David R.,\|Phillips, Steven~J., and Torng, Eric.\\A better algorithm for an ancient scheduling problem.\\\p20:400--430
\:Karloff, Howard J., and Shmoys, David B.\\Efficient parallel algorithms for edge coloring problems.\\\p8:39--52
\>\_\\\also Boyar
\:Karp, Richard M.,\|Luby, Michael, and Madras, Neal.\\Monte-Carlo approximation algorithms for enumeration problems.\\\p10:429--448
\:\_ and Tarjan, Robert Endre.\\Linear expected-time algorithms for connectivity problems.\\\p1:374--393
\>\_\\\also Fiat@; Gibbons
\:Karpinski, Marek, and Luby, Michael.\\Approximating the number of zeroes of a {\nit GF\/}\sic/[2] polynomial.\\\p14:280--287
\>\_\\\also Dahlhaus
\:Kashiwabara, Toshinobu,\|Masuda, Sumio,\|Nakajima, Kazuo, and Fujisawa, Toshio.\\Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph.\\\p13:161--174
\>Katoh, Naoki\\\see Aggarwal
\>Katseff, Howard P.\\\see Baker
\:Kaufmann, Michael, and Mehlhorn, Kurt.\\Routing through a generalized switchbox.\\\p7:510--531
\>Keil, J. Mark\\\see Farber
\:Kelsen, Pierre, and Ramachandran, Vijaya.\\On finding minimal two-connected subgraphs.\\\p18:1--49
\:Khuller, Samir, and Thurimella, Ramakrishna.\\Approximation algorithms for graph augmentation.\\\p14:214--225
\:\_,\|Vishkin, Uzi, and Young, Neal E.\\A primal-dual parallel approximation technique applied to weighted set and vertex covers.\\\p17:280--289
\>\_\\\also Aggarwal
\:Kim, Young Man, and Lai, Ten-Hwang.\\The complexity of congestion-1 embedding in a hypercube.\\\p12:246--280
\:Kindervater, Gerard A. P.,\|Lenstra, Jan Karel, and Shmoys, David~B.\\The parallel complexity of {\mc TSP} heuristics.\\\p10:249--270
\:King, V.,\|Rao, Satish B., and Tarjan, Robert Endre.\\A faster deterministic maximum flow algorithm.\\\p17:447--474
\:Kingston, Jeffrey H.\\A new proof of the Garsia-Wachs algorithm.\\\p9:129--136
\>Kirkpatrick, David G.\\\see Abrahamson; Dobkin; Hell; Kaminski
\:Klarner, David A.\\An algorithm to determine when certain sets have 0-density.\\\p2:31--43
\:Klawe, Maria M.\\Superlinear bounds for matrix searching problems.\\\p13:55--78
\>\_\\\also Dolev
\:Klee, Victor, and Laskowski, Michael C.\\Finding the smallest triangles containing a given convex polygon.\\\p6:359--375
\:Klein, Philip N.\\Parallelism, preprocessing, and reachability: A hybrid algorithm for directed graphs.\\\p14:331--343
\:\_ and Ravi, R.\\A nearly best-possible approximation algorithm for node-weighted Steiner trees.\\\p19:104--115
\>Kleitman, D. J.\\\see Assmann
\:Klingsberg, Paul.\\A combinatorial family of labeled trees.\\\p1:104--106
\:\_.\\A Gray code for compositions.\\\p3:41--44
\:Kloks, Ton, and Kratsch, D.\\Treewidth of chordal bipartite graphs.\\\p19:266--281
\>\_\\\also Bodlaender
\:Knott, Gary D.\\Fixed-bucket binary storage trees.\\\p3:276--287
\:\_.\\Direct-chaining with coalescing lists.\\\p5:7--21
\:\_ and de la Torre, Pilar.\\Hash table collision resolution with direct chaining.\\\p10:20--34
\:Knuth, Donald E.\\Dynamic Huffman coding.\\\p6:163--180
\:\_.\\An analysis of optimum caching.\\\p6:181--199
\:\_.\\An exact analysis of stable allocation.\\\p20:431--442
\:Ko, Ker-I, and Teng, Shia-Chung.\\On the number of queries necessary to identify a permutation.\\\p7:449--462
\:Koda, Yasunori, and Ruskey, Frank.\\A Gray code for the ideals of a forest poset.\\\p15:324--340
\:Kofler, E. T., and Leondes, C. T.\\Algorithmic modifications to the theory of evidential reasoning.\\\p17:269--279
\>Kong, T. Y.\\\see Werman
\>Koo, Richard\\\see Hamidoune
\:Kortsarz, Guy, and Peleg, David.\\Generating sparse 2-spanners.\\\p17:222--236
\>\_\\\also Bar-Ilan
\>Kosaraju, S. Rao\\\see Atallah
\>Kratsch, D.\\\see Kloks
\>Kravets, Dina\\\see Aggarwal
\:Krawczyk, Hugo.\\How to predict congruential generators.\\\p13:527--545
\:Krizanc, Danny.\\Time-randomness trade-offs in parallel computation.\\\p20:1--19
\>Kruskal, Clyde P.\\\see de la Torre
\:Ku\v{c}era, Lud\v{e}k.\\The greedy coloring is a bad probabilistic algorithm.\\\p12:674--684
\:Kulkarni, V. G.\\Generating random combinatorial objects.\\\p11:185--207
\:Kunde, Manfred,\|Langston, Michael A., and Liu, Jin-Ming.\\On a special case of uniform processor scheduling.\\\p9:287--296
\>Kuper, Gabriel M.\\\see Abiteboul
\>Kutten, Shay\\\see Bar-Yehuda
\medskip
\:Lagarias, J. C.\\Worst-case complexity bounds for algorithms in the theory of integral quadratic forms.\\\p1:142--186
\:\_ and Odlyzko, A. M.\\Computing \greekmath$\pi$$(x)$: An analytic method.\\\p8:173--191
\:Lagergren, Jens.\\Efficient parallel algorithms for graphs of bounded tree-width.\\\p20:20--44
\>\_\\\also Arnborg
\:Lai, Ten-Hwang, and Sahni, Sartaj.\\Nearly on-line scheduling of multiprocessor systems with memories.\\\p4:353--362
\:\_ and Sprague, Alan.\\On the routability of a convex grid.\\\p8:372--384
\:\_ and Wei, Shu-Shang.\\Algorithms for page retrieval and Hamiltonian paths on forward-convex line graphs.\\\p18:358--375
\>\_\\\also Kim
\>Lam, Tak Wah\\\see Chong
\:Landau, Gad M., and Vishkin, Uzi.\\Fast parallel and serial approximate string matching.\\\p10:157--169
\>\_\\\also Amir
\>Langston, Michael A.\\\see Friesen; Kunde
\:Larmore, Lawrence L.\\A~subquadratic algorithm for constructing approximately optimal binary search trees.\\\p8:579--591
\:\_ and Schieber, Baruch.\\On-line~dynamic programming with applications to the prediction of {\mc RNA} secondary structure.\\\p12:490--515
\>\_\\\also Chrobak; Hester; Hirschberg
\:Larson, Per-{\AA}ke.\\Analysis of hashing with chaining in the prime area.\\\p5:36--47
\>Laskowski, Michael C.\\\see Klee
\>Lawler, E. L.\\\see Bern
\>Lee, C. C.\\\see Ramanan
\:Lee, D. T., and Preparata, Franco~P.\\An improved algorithm for the rectangle enclosure problem.\\\p3:218--224
\:\_ and Wong, C. K.\\Finding intersection of rectangles by range search.\\\p2:337--347
\>\_\\\also Gupta; Ramanan
\>Lefmann, H.\\\see Alon
\:Leighton, F. Tom,\|Maggs, Bruce M.,\|Ranade, Abhiram G., and Rao, Satish B.\\Randomized routing and sorting on fixed-connection networks.\\\p17:157--205
\>\_\\\also Berman
\:Leiserson, Charles E., and Saxe, James B.\\A mixed-integer linear programming problem which is efficiently solvable.\\\p9:114--128
\>Lempel, A.\\\see Seroussi
\:Lengauer, T.\\On the solution of inequality systems relevant to IC-layout.\\\p5:408--421
\:\_.\\Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs.\\\p8:260--284
\>Lenhof, Hans-Peter\\\see Datta
\:Lenstra, Jan Karel,\|Veldhorst, Marinus, and Veltman, Bart.\\The complexity of scheduling trees with communication delays.\\\p20:157--173
\>\_\\\also Kindervater
\>Leondes, C. T.\\\see Kofler
\:Leung, Joseph Y-T.\\Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs.\\\p5:22--35
\>\_\\\also Assmann; Du; Ho
\:Levcopoulos, Christos, and Petersson, Ola.\\Adaptive Heapsort.\\\p14:395--413
\:Leven, Daniel, and Galil, Zvi.\\NP\sic/~completeness of finding the chromatic index of regular graphs.\\\p4:35--44
\:\_ and Sharir, Micha.\\An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers.\\\p8:192--215
\:Levy, Hanoch, and Low, David W.\\A contraction algorithm for finding small cycle cutsets.\\\p9:470--493
\:Lewandowski, J. L.,\|Liu, C. L., and Liu, J. W. S.\\An algorithmic proof of a generalization of the Birkhoff-von Neumann theorem.\\\p7:323--330
\:Li, Keqin, and Cheng, Kam Hoi.\\Heuristic algorithms for on-line packing in three dimensions.\\\p13:589--605
\:Li, Liwu, and Marsland, T. A.\\Probability-based game tree pruning.\\\p11:27--43
\:Lieberherr, Karl J.\\Algorithmic extremal problems in combinatorial optimization.\\\p3:225--244
\:Lindenbaum, Michael, and Bruckstein, Alfred.\\Parallel strategies for geometric probing.\\\p13:320--349
\:Linial, Nathan, and Saks, M.\\Searching ordered structures.\\\p6:86--103
\>\_\\\also Alon; Awerbuch
\:Lipski, Witold, Jr., and Papadimitriou, Christos H.\\A~fast algorithm for testing for safety~and detecting deadlocks in locked transaction systems.\\\p2:211--226
\:\_ and Preparata, Franco P.\\Finding the contour of a union of iso-oriented rectangles.\\\p1:235--246; \p2:105; \p3:301--302
\:\_ and \_.\\Segments, rectangles, contours.\\\p2:63--76
\>Liu, C. L.\\\see Lewandowski; Ramanan
\>Liu, J. W. S.\\\see Lewandowski
\>Liu, Jin-Ming\\\see Kunde
\:Lloyd, Errol L.\\An $O(n\log m)$ algorithm for the Josephus problem.\\\p4:262--270
\>Lo, Win-tsung\\\see Peng
\>Lorentz, Richard J.\\\see Main
\>Lotspiech, Jeffrey B.\\\see Birk
\:Lotti, Grazia.\\Fast solution of linear systems with polynomial coefficients over the ring of integers.\\\p13:564--576
\:Loveland, Donald W.\\Finding critical sets.\\\p8:362--371
\>Low, David W.\\\see Levy
\:Lozinskii, Eliezer L.\\An algorithm for parallel evaluation of functions.\\\p4:271--281
\>Luby, Michael\\\see Fiat@; Karp; Karpinski
\:Lucas, Joan M.\\The rotation graph of binary trees is Hamiltonian.\\\p8:503--535
\:\_,\|Roelants van Baronaigien, D., and Ruskey, Frank.\\On rotations and the generation of binary trees.\\\p15:343--366
\medskip
\:Ma, Tze-Heng, and Spinrad, Jeremy~P.\\An $O(n^2)$ algorithm for undirected split decomposition.\\\p16:145--160
\:\_ and \_.\\On the 2-chain subgraph cover and related problems.\\\p17:251--268
\>Maass, Wolfgang\\\see Hochbaum
\>Maddila, Sanjeev\\\see O'Rourke
\>Madras, Neal\\\see Karp
\>Maffioli, F.\\\see Camerini
\>Maggs, Bruce M.\\\see Leighton
\>Mahaney, S. R.\\\see Baker
\>Maheshwari, Anil\\\see Chandru
\>Maheshwari, S. N.\\\see Cheriyan
\:Mahmoud, Hosam M., and Pittel, Boris.\\Analysis of the space of search trees under the random insertion algorithm.\\\p10:52--75
\:Maimon, Oded.\\An algorithm for the Lorenz measure in locational decisions on trees.\\\p9:583--596
\:Main, Michael G., and Lorentz, Richard J.\\An $O(n\log n)$ algorithm for finding all repetitions in a string.\\\p5:422--432
\>Mairson, Harry G.\\\see Abiteboul
\:Malitz, Seth M.\\Graphs with $E$ edges have pagenumber $O(\sqrt{E}\,)$.\\\p17:71--84
\:\_.\\Genus $g$ graphs have pagenumber $O(\sqrt{g}\,)$.\\\p17:85--109
\:Manasse, Mark S.,\|McGeoch, Lyle A., and Sleator, Daniel~D.\\Competitive algorithms for server problems.\\\p11:208--230
\>Manber, Udi\\\see Wu
\:Manne, Fredrik, and S{\o}revik, Tor.\\Optimal partitioning of sequences.\\\p19:235--249
\>Manoussakis, Yannis\\\see Bampis; Bang-Jensen
\:Mansour, Yishay, and Patt-Shamir, Boaz.\\Greedy packet scheduling on shortest paths.\\\p14:449--465
\:\_ and Schieber, Baruch.\\Finding the edge connectivity of directed graphs.\\\p10:76--85
\:\_ and Schulman, Leonard.\\Sorting on a ring of processors.\\\p11:622--630
\>Marsland, T. A.\\\see Li
\:Martel, Charles, and Subramonian, Ramesh.\\On the complexity of certified write-all algorithms.\\\p16:361--387
\>\_\\\also Hui
\>Masuda, Sumio\\\see Kashiwabara
\:Matias, Yossi, and Vishkin, Uzi.\\On parallel hashing and integer sorting.\\\p12:573--606
\:Matou\v{s}ek, Ji\v{r}\'{\i}.\\Linear optimization queries.\\\p14:432--448
\:\_.\\Derandomization in computational geometry.\\\p20:545--580
\:\_ and Thomas, Robin.\\Algorithms finding\sic/ tree-decompositions of graphs.\\\p12:1--22
\:\_ and Welzl, Emo.\\Good splitters for counting points in triangles.\\\p13:307--319
\>Mayr, Ernst W.\\\see Heun
\>McConnell, Ross M.\\\see Ehrenfeucht
\>McCurley, Kevin S.\\\see Hafner
\:McDiarmid, Colin J. H., and Reed, B.~A.\\Building heaps fast.\\\p10:352--365
\>\_\\\also Hayward
\>McGeoch, Lyle A.\\\see Fiat@; Fredman; Manasse
\:McKay, Brendan D., and Wormald, Nicholas C.\\Uniform generation of random regular graphs of moderate degree.\\\p11:52--67
\>McKenzie, Pierre\\\see Cook
\:Megiddo, Nimrod.\\Partitioning with two lines in the plane.\\\p6:430--433
\:\_ and Zemel, Eitan.\\An $O(n\log n)$ randomizing algorithm for the weighted Euclidean 1-center problem.\\\p7:358--368
\>\_\\\also Hassin
\>Mehlhorn, Kurt\\\see Baumgarten; Kaufmann
\>Meijer, Henk\\\see Akl
\>Melter, Robert\\\see Werman
\:Melville, Robert C.\\A time/space tradeoff for in-place array permutation.\\\p2:139--143
\>\_\\\also Aggarwal
\>Metaxas, Panagiotis\\\see Johnson
\:Mignotte, Maurice.\\Identification of algebraic numbers.\\\p3:197--204
\:Miller, Z., and Orlin, James B.\\NP-completeness for minimizing maximum edge length in grid embeddings.\\\p6:10--16
\>Milman, V. D.\\\see Alon
\:Minieka, Edward, and Patel, Niranjani H.\\On finding the core of a tree with a specified length.\\\p4:345--352
\:Minsker, Steven.\\The Towers of Hanoi rainbow problem: Coloring the rings.\\\p10:1--19
\>Miyano, Eiji\\\see Iwama
\:Mohammed, John L., and Subi, Carlos S.\\An improved block-interchange algorithm.\\\p8:113--121
\:Mohar, Bojan.\\Projective planarity in linear time.\\\p15:482--502
\:Monier, Louis.\\Combinatorial solutions of multidimensional divide-and-conquer recurrences.\\\p1:60--74
\:Moran, Shlomo, and Perl, Yehoshua.\\The complexity of identifying redundant and essential elements.\\\p2:22--30
\>\_\\\also Biran; Ibarra
\:Morgan, Christine A., and Slater, Peter J.\\A linear algorithm for a core of a tree.\\\p1:247--258
\:Morton, H. R., and Short, H. B.\\Calculating the 2-variable polynomial for knots presented as closed braids.\\\p11:117--131
\:Moses, Yoram, and Waarts, Orli.\\Coordinated traversal: $(t+1)$-round Byzantine agreement in polynomial time.\\\p17:110--156
\:Mount, David M., and Silverman, Ruth.\\Packing and covering the plane with translates of a convex polygon.\\\p11:564--580
\>Mukhopadhyay, Asish\\\see Jadhav
\:Munro, J. Ian, and Raman, Venkatesh.\\Sorting with minimum data movement.\\\p13:374--393
\>\_\\\also Dobkin; Gonnet@; Poblete
\>Myers, Eugene\\\see Wu
\>Myrvold, Wendy J.\\\see Colbourn
\medskip
\:Nakajima, Kazuo, and Hakimi, S. Louis.\\Complexity results for scheduling tasks with discrete starting times.\\\p3:344--361
\>\_\\\also Kashiwabara
\:Nakayama, Hiroyuki,\|Nishizeki, Takao, and Saito, Nobuji.\\Lower bounds for combinatorial problems on graphs.\\\p6:393--399
\>Nanni, Umberto\\\see Ausiello
\:Naor, Joseph (Seffi), and Novick, Mark B.\\An efficient reconstruction of a graph from its line graph in parallel.\\\p11:132--143
\>\_\\\also Azar; Karchmer
\:Neiger, Gil, and Toueg, Sam.\\Automatically increasing the fault-tolerance of distributed algorithms.\\\p11:374--419
\>Nel, Louis D.\\\see Colbourn
\>Neufeld, Eugene\\\see Colbourn
\>Nishimura, Naomi\\\see Gupta
\>Nishizeki, Takao\\\see Chiba; Chrobak; Hochbaum; Nakayama; Suzuki; Zhou
\>Noltemeier, H.\\\see Heusinger
\:Norton, Carolyn Haibt,\|Plotkin, Serge A., and Tardos, \'Eva.\\Using separation algorithms in fixed dimension.\\\p13:79--98
\:Noshita, Kohei.\\A theorem on the expected complexity of Dijkstra's shortest path algorithm.\\\p6:400--408
\>Novick, Mark B.\\\see Naor
\>Nurmi, Otto\\\see G\"uting
\medskip
\:\'O'D\'unlaing, Colm, and Yap, Chee K.\\A ``retraction'' method for planning the motion of a disc.\\\p6:104--111
\:O'Rourke, Joseph,\|Aggarwal, Alok,\|Maddila, Sanjeev, and Baldwin, Michael.\\An optimal algorithm for finding minimal enclosing triangles.\\\p7:258--269
\>Odlyzko, A. M.\\\see Lagarias
\:Olariu, S.,\|Toida, S., and Zubair,~M.\\On a conjecture by Plaisted and Hong.\\\p9:597--598
\:Olivos, Jorge.\\On vectorial addition chains.\\\p2:13--21
\>Oommen, B. J.\\\see Valiveti
\>Orlin, James B.\\\see Hao; Miller
\>Ostheimer, G.\\\see Fredman
\>Otsuka, M.\\\see Schmeichel
\>Ottmann, Thomas\\\see G\"uting
\:Overmars, Mark H.\\Dynamization of order decomposable set problems.\\\p2:245--260; \p4:301
\:\_.\\Efficient data structures for range searching on a grid.\\\p9:254--275
\:\_ and Wood, Derick.\\On rectangular visibility.\\\p9:372--390
\>\_\\\also Agarwal; de Berg; Edelsbrunner
\medskip
\:Pachl, Jan K.\\A lower bound for probabilistic distributed algorithms.\\\p8:53--65
\:Pan, V. Ya.\\Convolution of vectors over the real field of constants by evaluation--\sic/interpolation algorithms.\\\p1:297--300
\:\_.\\The bit-complexity of arithmetic algorithms.\\\p2:144--163
\:\_.\\A unified approach to the analysis of bilinear algorithms.\\\p2:301--310
\:\_.\\The additive and logical complexities of linear and bilinear arithmetic algorithms.\\\p4:1--34
\:Panconesi, Alessandro, and Srinivasan, Aravind.\\On the complexity of distributed network decomposition.\\\p20:356--374
\:Papadimitriou, Christos H., and Vazirani, Umesh V.\\On two geometric problems related to the travelling salesman problem.\\\p5:231--246
\>\_\\\also Arkin; Feinberg; Georgakopoulos; Lipski
\>Park, Kunsoo\\\see Wang
\>Patel, Niranjani H.\\\see Minieka
\:Paterson, Michael S., and Razborov, A. A.\\The set of minimal braids is co-NP-complete.\\\p12:393--408
\:\_ and Yao, F. Frances.\\Point retrieval for polygons.\\\p7:441--447
\:\_ and \_.\\Optimal binary space partitions for orthogonal objects.\\\p13:99--113
\>Patt-Shamir, Boaz\\\see Mansour
\:Pearl, Judea.\\A space-efficient on-line method of computing quantile estimates.\\\p2:164--177
\:Pearson, David, and Vazirani, Vijay~V.\\Efficient sequential and parallel algorithms for maximal bipartite sets.\\\p14:171--179
\>Peleg, David\\\see Alon; Awerbuch; Bar-Ilan; Kortsarz
\>Peleg, Shmuel\\\see Werman
\:Peng, Shietung, and Lo, Win-tsung.\\Efficient algorithms for finding a core of a tree with a specified length.\\\p20:445--458
\:\_,\|Stephens, A. B., and Yesha, Yelena.\\Algorithms for a core and $k$-tree core of a tree.\\\p15:143--159
\>\_\\\also Adhar
\:Perl, Yehoshua.\\Optimum split trees.\\\p5:367--374
\>\_\\\also Becker; Moran
\>Petersson, Ola\\\see Levcopoulos
\>Phillips, Steven J.\\\see Karger
\>Pinter, Ron Y.\\\see Asano
\>Pisanski, Toma\v{z}\\\see \v{Z}erovnik
\:Pittel, Boris.\\Linear probing: The probable largest search time grows logarithmically with the number of records.\\\p8:236--249
\>\_\\\also Mahmoud
\:Plaisted, David A.\\Heuristic matching for graphs satisfying the triangle inequality.\\\p5:163--179
\:\_ and Hong, Jiarong.\\A heuristic triangulation algorithm.\\\p8:405--437
\>Plotkin, Serge A.\\\see Goldberg; Norton
\:Poblete, Patricio V., and Munro, J. Ian.\\The analysis of a fringe heuristic for binary search trees.\\\p6:336--350
\:\_ and \_.\\Last-come-first-served hashing.\\\p10:228--248
\:Pomerance, Carl, and Sorenson, Jonathan.\\Counting the integers factorable via cyclotomic methods.\\\p19:250--265
\:Poonen, Bjorn.\\The worst case in Shellsort and related algorithms.\\\p15:101--124
\>Preparata, Franco P.\\\see Lee; Lipski
\:Pritchard, Paul.\\Fast compact prime number sieves (among others).\\\p4:332--344
\hangit\nrm Problems and solutions,\|\see Guibas; van Emde Boas
\:Proskurowski, Andrzej, and Ruskey, Frank.\\Binary tree Gray codes.\\\p6:225--238
\>\_\\\also Ruskey
\>Pruhs, Kirk\\\see Kalyanasundaram
\:Przytycka, T., and Corneil, Derek~G.\\Parallel algorithms for parity graphs.\\\p12:96--109
\>\_\\\also Abrahamson
\medskip
\:Rabin, Michael O., and Vazirani, Vijay V.\\Maximum matchings in general graphs through randomization.\\\p10:557--567
\:Ragde, Prabhakar L.\\The parallel simplicity of compaction and chaining.\\\p14:371--380
\>\_\\\also Buss
\>Raghavachari, Balaji\\\see F\"urer
\:Raghavan, Raghunath,\|Cohoon, James, and Sahni, Sartaj.\\Single bend wiring.\\\p7:232--257
\>Rajan, V. T.\\\see Chandru
\:Rajasekaran, Sanguthevar.\\$k$--$k$ routing, $k$--$k$ sorting, and cut-through routing on the mesh.\\\p19:361--382
\:Ralston, A.\\A new memoryless algorithm for de Bruijn sequences.\\\p2:50--62
\:Ramachandran, Vijaya.\\Finding a minimum feedback arc set in reducible flow graphs.\\\p9:299--313
\>\_\\\also Gibbons; Kelsen
\>Ramaiyer, Viswanathan\\\see Berman
\>Raman, Venkatesh\\\see Munro
\:Ramanan, Prakash V.,\|Brown, Donna J.,\|Lee, C. C., and Lee, D. T.\\On-line bin packing in linear time.\\\p10:305--326
\:\_,\|Deogun, J. S., and Liu, C. L.\\A personnel assignment problem.\\\p5:132--144
\:\_ and Hyafil, Laurent.\\New algorithms for selection.\\\p5:557--578
\:Ramarao, K. V. S., and Venkatesan, Shankar M.\\On finding and updating shortest paths distributively.\\\p13:235--257
\:Ramesh, H.\\On traversing layered graphs on-line.\\\p18:480--512
\>Ranade, Abhiram G.\\\see Leighton
\:Rangan, C. Pandu.\\On the minimum number of additions required to compute a quadratic form.\\\p4:282--285
\>Rao, Satish B.\\\see King; Leighton
\>Ravi, R.\\\see Klein
\>Razborov, A. A.\\\see Paterson
\>Reckhow, Robert A.\\\see Culberson
\>Reed, B. A.\\\see McDiarmid
\:Remmel, J. B., and Whitney, R.\\Multiplying Schur functions.\\\p5:471--487
\:Richards, Dana.\\Finding short cycles in planar graphs using separators.\\\p7:382--394
\>Ricklin, Moty\\\see Afek
\>Rinnooy Kan, A. H. G.\\\see Csirik
\:Robertson, Neil, and Seymour, Paul~D.\\Graph minors. II. Algorithmic aspects of tree-width.\\\p7:309--322
\>Robinson, M. L.\\\see Filaseta
\:Robson, J. M.\\Algorithms for maximum independent sets.\\\p7:425--440
\>Rodeh, Michael\\\see Bernstein; Dolev; Itai
\:R\"odl, V., and Tovey, C.\\Multiple optima in local search.\\\p8:250--259
\>\_\\\also Alon
\>Roeder, David\\\see Hamidoune
\>Roelants van Baronaigien, D.\\\see Lucas
\>Rom, Raphael\\\see Azar
\:Ronn, Eytan.\\NP-complete stable matching problems.\\\p11:285--304
\:R\'onyai, Lajos.\\Factoring polynomials over finite fields.\\\p9:391--400
\:\_.\\Zero divisors in quaternion algebras.\\\p9:494--506
\:\_.\\A deterministic method for computing splitting elements in simple algebras over $\bf Q$.\\\p16:24--32
\:Rosen, Barry K.\\Robust linear algorithms for cutsets.\\\p3:205--217
\>Rosenfeld, Moshe\\\see Hell
\:Rosenstiehl, Pierre, and Tarjan, Robert Endre.\\Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations.\\\p5:375--390
\>Rote, G\"unter\\\see Capoyleas
\>Roychowdhury, Vwani P.\\\see Bruck
\>Rubinfeld, Ronitt\\\see Amato
\:Ruppert, Jim.\\A Delaunay refinement algorithm for quality 2-dimensional mesh generation.\\\p18:548--585
\:Ruskey, Frank.\\Adjacent interchange generation of combinations.\\\p9:162--180
\:\_ and Proskurowski, Andrzej.\\Generating binary trees by transpositions.\\\p11:68--84
\:\_,\|Savage, Carla D., and Wang, Terry Min Yih.\\Generating necklaces.\\\p13:414--430
\>\_\\\also Koda; Lucas; Proskurowski
\medskip
\:Sagan, Bruce.\\On selecting a random shifted Young tableau.\\\p1:213--234
\>Saheb, Nasser\\\see Flajolet
\>Sahni, Sartaj\\\see Lai; Raghavan
\>Saito, Nobuji\\\see Chiba; Nakayama
\>Saks, M.\\\see Linial
\:Salowe, Jeffrey, and Steiger, William.\\Simplified stable merging tasks.\\\p8:557--571
\>Saluja, Sanjeev\\\see Chandru
\>Santha, M.\\\see Bampis
\>Sanz, Jorge L. C.\\\see Cypher
\:Sarkar, U. K.,\|Chakrabarti, P. P.,\|Ghose, S., and DeSarkar, S. C.\\Improving greedy algorithms by lookahead-search.\\\p16:1--23
\:Savage, Carla D.\\Gray code sequences of partitions.\\\p10:577--595
\>\_\\\also Ruskey
\>Saxe, James B.\\\see Bentley; Leiserson
\:Sch\"affer, Alejandro A.\\A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm.\\\p9:321--342
\:\_ and Van Wyk, Christopher J.\\Convex hulls of piecewise-smooth Jordan curves.\\\p8:66--94
\:Schaffer, Russel, and Sedgewick, Robert.\\The analysis of Heapsort.\\\p15:76--100
\>Schervish, Mark J.\\\see Eddy
\>Schieber, Baruch\\\see Aggarwal; Berkman; Larmore; Mansour
\:Schmeichel, Edward F.,\|Hakimi, S. Louis,\|Otsuka, M., and Sullivan,~G.\\A parallel fault identification algorithm.\\\p11:231--241
\>\_\\\also Hakimi
\:Schmid, U., and Blieberger, J.\\On nonpreemptive {\mc LCFS} scheduling with deadlines.\\\p18:124--158
\:Schnorr, C. P.\\Refined analysis and improvements on some factoring algorithms.\\\p3:101--127
\:\_.\\A more efficient algorithm for lattice basis reduction.\\\p9:47--62
\:Sch\"onhage, A.\\Probabilistic computation of integer polynomial {\mc GCD}s.\\\p9:365--371
\>Sch\"onheim, Johanan\\\see Gavril
\>Schulman, Leonard\\\see Mansour
\>Schuster, Assaf\\\see Ben-Asher
\>Schwarz, Christian\\\see Datta
\>Seb\H{o}, Andr\'as\\\see Caro
\:Sedgewick, Robert.\\A new upper bound for Shellsort.\\\p7:159--173
\>\_\\\also Schaffer; Weiss
\>Seese, Detlef\\\see Arnborg
\:Sellers, Peter H.\\The theory and computation of evolutionary distances: Pattern recognition.\\\p1:359--373
\:Semba, Ichiro.\\An efficient algorithm for generating all $k$-subsets  $(1\leq k\leq m\leq n)$ of the set $\{1,2,\ldots,n\}$ in lexicographical order.\\\p5:281--283
\:Sen, Sandeep.\\Fractional cascading revisited.\\\p19:161--172
\>\_\\\also Agarwal
\:Seroussi, G., and Lempel, A.\\On symmetric algorithms for bilinear forms over finite fields.\\\p5:327--344
\>Seymour, Paul D.\\\see Bienstock; Robertson
\>Shachnai, Hadas\\\see Hofri; Itai
\>Shallit, Jeffrey\\\see Bach
\:Shamir, Eli, and Upfal, Eli.\\Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces.\\\p5:488--501
\>Shamir, Ron\\\see Golumbic
\>Sharir, Micha\\\see Agarwal; Leven
\:Shasha, Dennis, and Zhang, Kaizhong.\\Fast algorithms for the unit cost editing distance between trees.\\\p11:581--621
\>\_\\\also Zhang
\:Sherk, Murray.\\Self-adjusting $k$-ary search trees.\\\p19:25--44
\:Shiloach, Yossi.\\Fast canonization of circular strings.\\\p2:107--121
\:\_ and Vishkin, Uzi.\\Finding the maximum, merging, and sorting in a parallel computation model.\\\p2:88--102
\:\_ and \_.\\An $O(\log n)$ parallel connectivity algorithm.\\\p3:57--67
\:\_ and \_.\\An $O(n^2\log n)$ parallel {\mc MAX-FLOW} algorithm.\\\p3:128--146
\>Shing, M. T.\\\see Hu
\>Shmoys, David B.\\\see Hochbaum; Karloff; Kindervater
\>Shor, Peter W.\\\see Berman
\>Short, H. B.\\\see Morton
\>Shpitalni, Moshe\\\see Fischer
\>Shvartsman, Alex Allister\\\see Abiteboul; Buss
\>Shvaytser (Schweitzer), Haim\\\see Bergen
\>Silverman, Ruth\\\see Mount
\>Simon, Istvan\\\see Bollob\'as
\>Simon, Janos\\\see Chang
\:Skiena, Steven S.\\Probing convex polygons with half-planes.\\\p12:359--374
\:Skowro\'nska, Miros{\l}awa,\|Sys{\l}o, Maciej M., and Zamfirescu, Cristina.\\An algorithmic characterization of total digraphs.\\\p7:120--133
\>Slater, Peter J.\\\see Morgan
\>Sleator, Daniel D.\\\see Fiat@; Manasse
\>Slutzki, Giora\\\see Fern\'andez-Baca
\>Smid, Michiel\\\see Datta; Gupta
\:Snir, Marc.\\Depth-size trade-offs for parallel prefix computation.\\\p7:185--201
\>\_\\\also Attiya
\>Snoeyink, Jack\\\see de Berg
\>Snyder, Larry\\\see Berman; Cypher
\:Soisalon-Soininen, Eljas, and Wood, Derick.\\Optimal algorithms to compute the closure of a set of iso-rectangles.\\\p5:199--214
\:Sorenson, Jonathan.\\Two fast {\mc GCD} algorithms.\\\p16:110--144
\>\_\\\also Pomerance
\>S{\o}revik, Tor\\\see Manne
\:Soroker, Danny.\\Fast parallel strong orientation of mixed graphs and related augmentation problems.\\\p9:205--223
\:\_.\\Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament.\\\p9:276--286
\>\_\\\also Gibbons
\>Spaccamela, Alberto Marchetti\\\see Ausiello
\>Spencer, Joel\\\see Blum
\:Spinrad, Jeremy P.\\Recognition of circle graphs.\\\p16:264--282
\>\_\\\also Hsu; Ma
\>Sprague, Alan\\\see Lai
\:Sprugnoli, Renzo.\\The analysis of a simple in-place merging algorithm.\\\p10:366--380
\>Srimani, P. K.\\\see Bagchi
\>Srinivasan, Aravind\\\see Panconesi
\>Stanton, Dennis\\\see Joichi
\>Staples, John\\\see Eades
\:Steele, J. Michael, and Yao, Andrew Chi-Chih.\\Lower bounds for algebraic decision trees.\\\p3:1--8
\>Steiger, William\\\see Salowe
\:Steiner, George.\\Searching in 2-dimensional partial orders.\\\p8:95--105
\>Stephens, A. B.\\\see Peng
\>Stone, Richard E.\\\see Aspvall
\:Stout, Quentin F.\\Pyramid computer solutions of the closest pair problem.\\\p6:200--212
\>Subi, Carlos S.\\\see Mohammed
\:Subramanian, Ashok.\\An explanation of splaying.\\\p20:512--525
\>Subramonian, Ramesh\\\see Martel
\>Sudborough, Ivan Hal\\\see Gurari
\>Suen, Stephen\\\see Frieze
\>Sullivan, G.\\\see Schmeichel
\>Sullivan, Stephen J.\\\see Ehrenfeucht
\>Suri, Subhash\\\see Aggarwal; Hershberger
\:Suzuki, Hitoshi,\|Ishiguro, Akira, and Nishizeki, Takao.\\Variable-priority queue and doughnut routing.\\\p13:606--635
\>\_\\\also Zhou
\:Swart, Garret.\\Finding the convex hull facet by facet.\\\p6:17--48
\>Sykora, Ondrej\\\see Diks
\>Sys{\l}o, Maciej M.\\\see Skowro\'nska
\:Szpankowski, Wojciech.\\Some results on $V$-ary asymmetric tries.\\\p9:224--244
\>\_\\\also Apostolico
\:Szymanski, Thomas G.\\Hash table reorganization.\\\p6:322--335
\medskip
\>Tamassia, Roberto\\\see Eppstein
\:Tamminen, Markku.\\Two levels are as good as any.\\\p6:138--144
\:Tan, Jimmy J. M.\\A necessary and sufficient condition for the existence of a complete stable matching.\\\p12:154--178
\>Tardos, \'Eva\\\see Norton
\>Tarjan, Robert Endre\\\see Booth; Buchsbaum; Eppstein; Gabow; Gibbons; Gilbert@; Karp; King; Rosenstiehl
\>Tarsi, Michael\\\see Caro
\>Taylor, D. E.\\\see Kantor
\>Teng, Shang-Hua\\\see Huang
\>Teng, Shia-Chung\\\see Ko
\:Thanh, Mai,\|Alagar, V. S., and Bui, T. D.\\Optimal expected-time algorithms for merging.\\\p7:341--357
\>Thomas, Robin\\\see Matou\v{s}ek
\:Thomassen, Carsten.\\The graph genus problem is NP-complete.\\\p10:568--576
\:\_.\\The even cycle problem for planar digraphs.\\\p15:61--75
\>\_\\\also Bang-Jensen
\:Thorup, Mikkel.\\Efficient preprocessing of simple binary pattern forests.\\\p20:602--612
\>Thurimella, Ramakrishna\\\see Khuller
\:Tiwari, Prasoon.\\An efficient parallel algorithm for shifting the root of a depth first spanning tree.\\\p7:105--119
\>Toida, S.\\\see Olariu
\>Tokuyama, Takeshi\\\see Aggarwal
\>Toledano Laredo, V.\\\see Gavril
\>Toledo, Sivan\\\see Agarwal
\:Tolimieri, R.\\A nonquadratic minimal algorithm for a system of quadratic forms.\\\p3:31--40
\>Torng, Eric\\\see Karger
\>Toueg, Sam\\\see Neiger
\>Toussaint, Godfried T.\\\see Bhattacharya; Bose; Devroye
\>Tovey, C.\\\see R\"odl
\:Tucker, Alan, and Wilson, Donna.\\An $O(N^2)$ algorithm for coloring perfect planar graphs.\\\p5:60--68
\:Tung, S. P.\\Computational complexities of diophantine equations with parameters.\\\p8:324--336
\:Turner, Jonathan S.\\Almost all $k$-colorable graphs are easy to color.\\\p9:63--82
\medskip
\:Ukkonen, Esko.\\Finding approximate patterns in strings.\\\p6:132--137
\>Upfal, Eli\\\see Shamir
\medskip
\>Vaidya, Pravin M.\\\see Goldberg
\:Vaishnavi, V. K., and Wood, Derick.\\Rectilinear line segment intersection, layered segment trees, and dynamization.\\\p3:160--176
\:Valiant, L. G.\\Short monotone formulae for the majority function.\\\p5:363--366
\:Valiveti, R. S., and Oommen, B. J.\\Self-organizing doubly-linked lists.\\\p14:88--114
\:Vall\'ee, Brigitte.\\Gauss' algorithm revisited.\\\p12:556--572
\:van Emde Boas, Peter.\\Problems.\\\p12:183--185; \p12:700--703
\>van Kreveld, Marc\\\see Agarwal; de Berg
\:van Leeuwen, Jan, and Wood, Derick.\\The measure problem for rectangular ranges in $d$-space.\\\p2:282--300
\:van Vliet, Andr\'e.\\On the asymptotic worst case behavior of harmonic fit.\\\p20:113--136
\>Van Wyk, Christopher J.\\\see Sch\"affer
\>Vardi, Moshe Y.\\\see Abiteboul
\>Varol, Yaakov L.\\\see Kalvin
\>Vazirani, Umesh V.\\\see Papadimitriou
\>Vazirani, Vijay V.\\\see Pearson; Rabin
\:Veldhorst, Marinus.\\The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees.\\\p7:1--34
\>\_\\\also Lenstra
\>Veltman, Bart\\\see Lenstra
\:Venkatesan, Shankar M.\\Improved constants for some separator theorems.\\\p8:572--578
\>\_\\\also Ramarao
\:Verma, Rakesh M.\\A general method and a master theorem for divide-and-conquer recurrences with applications.\\\p16:67--79
\:Vishkin, Uzi.\\Implementation of simultaneous memory address access in models that forbid it.\\\p4:45--50
\:\_.\\A parallel blocking flow algorithm for acyclic networks.\\\p13:489--501
\>\_\\\also Amir; Berkman; Khuller; Landau; Matias; Shiloach
\:Vishwanathan, Sundar.\\Randomized online graph coloring.\\\p13:657--669
\>\_\\\also Chandra
\:Vitter, Jeffrey Scott.\\Deletion algorithms for hashing that preserve randomness.\\\p3:261--275
\>Volper, Dennis J.\\\see Fredman
\>Vrto, Imrich\\\see Diks
\>Vuillemin, J.\\\see Flajolet
\medskip
\>Waarts, Orli\\\see Moses
\:Wachs, Michelle L.\\On an efficient dynamic programming technique of F. F. Yao.\\\p10:518--530
\>Wagner, Dorothea\\\see Formann
\>Wagner, Frank\\\see Formann
\:Wang, Biing-Feng,\|Chen, Gen-Huey, and Park, Kunsoo.\\On the set~{\mc LCS} and set-set {\mc LCS} problems.\\\p14:466--477
\>Wang, Hui\\\see Ibarra
\>Wang, Jason T. L.\\\see Zhang
\>Wang, Terry Min Yih\\\see Ruskey
\:Wanke, Egon.\\Bounded tree-width and {\mc LOGCFL}.\\\p16:470--491
\>Warmuth, Manfred K.\\\see Dolev
\:Warnow, Tandy J.\\Tree compatibility and inferring evolutionary history.\\\p16:388--407
\:Warshauer, Max L.\\Conway's parallel sorting algorithm.\\\p7:270--276
\>Wei, Shu-Shang\\\see Lai
\>Wei, W-D.\\\see Ho
\:Weinberger, P. J.\\Finding the number of factors of a polynomial.\\\p5:180--186
\:Weiss, Mark Allen, and Sedgewick, Robert.\\Tight lower bounds for Shellsort.\\\p11:242--251
\>Welzl, Emo\\\see Matou\v{s}ek
\>Weng, J. F.\\\see Hwang
\:Werman, Michael,\|Peleg, Shmuel,\|Melter, Robert, and Kong, T. Y.\\Bipartite graph matching for points on a line or a circle.\\\p7:277--284
\>Westbrook, Jeffery\\\see Eppstein
\>Wheeler, Ferrell S.\\\see Filaseta
\>Whitney, R.\\\see Remmel
\:Wilber, Robert.\\The concave least-weight subsequence problem revisited.\\\p9:418--425
\:Wilf, Herbert S.\\The uniform selection of free trees.\\\p2:204--207
\:\_.\\Two algorithms for the sieve method.\\\p12:179--182
\>\_\\\also Bender; Dixon
\>Wilson, Donna\\\see Tucker
\:Winter, Pawel.\\Generalized Steiner problem in series-parallel networks.\\\p7:549--566
\>Woeginger, Gerhard\\\see Capoyleas
\:Wolfson, Ouri.\\An algorithm for early unlocking of entities in database transactions.\\\p7:146--156
\:\_.\\The virtues of locking by symbolic names.\\\p8:536--556
\>Wong, A. L.\\\see Bern
\>Wong, C. K.\\\see Gupta; Hester; Huang; Lee
\>Wood, Derick\\\see Overmars; Soisalon-Soininen; Vaishnavi; van~Leeuwen
\:Wormald, Nicholas C.\\Generating random regular graphs.\\\p5:247--280
\>\_\\\also McKay
\:Wu, Sun,\|Manber, Udi, and Myers, Eugene.\\A subquadratic algorithm for approximate regular expression matching.\\\p19:346--360
\:Wu, Xiaolin.\\Optimal quantization by matrix searching.\\\p12:663--673
\medskip
\>Yan, Peiyuan\\\see Bar-Eli
\:Yannakakis, Mihalis.\\On the approximation of maximum satisfiability.\\\p17:475--502
\:Yao, Andrew Chi-Chih.\\An analysis of $(h,k,1)$-Shellsort.\\\p1:14--50
\:\_.\\On optimal arrangements of keys with double hashing.\\\p6:253--264
\>\_\\\also Steele
\>Yao, F. Frances\\\see Graham; Paterson
\>Yap, Chee K.\\\see Cole; \'O'D\'unlaing
\:Yellin, Daniel M.\\Representing sets with constant time equality testing.\\\p13:353--373
\>Yesha, Yaacov\\\see Chen; He
\>Yesha, Yelena\\\see Peng
\>Young, Neal E.\\\see Fiat@; Khuller
\>Yun, David Y. Y.\\\see Brent
\>Yung, Moti\\\see Chrobak; Eppstein
\>Yuster, R.\\\see Alon
\medskip
\>Zajicek, Ofer\\\see Cole
\>Zaks, Shmuel\\\see Biran; Bitan
\>Zamfirescu, Cristina\\\see Skowro\'nska
\:Zantema, H.\\Minimizing sums of addition chains.\\\p12:281--307
\>Zeilberger, Doron\\\see Franzblau
\>Zemel, Eitan\\\see Megiddo
\:\v{Z}erovnik, Janez, and Pisanski, Toma\v{z}.\\Computing the diameter in multiple-loop networks.\\\p14:226--243
\:Zhang, Kaizhong,\|Shasha, Dennis, and Wang, Jason T. L.\\Approximate tree matching in the presence of variable length don't cares.\\\p16:33--66
\>\_\\\also Shasha
\>Zheng, Qi\\\see Ibarra
\:Zhou, Xiao,\|Suzuki, Hitoshi, and Nishizeki, Takao.\\A linear algorithm for edge-coloring series-parallel multigraphs.\\\p20:174--201
\:Zhu, Binghuan, and Goddard, Wayne.\\An algorithm for outerplanar graphs with parameter.\\\p12:657--662
\:Zhu, Xuding.\\A polynomial algorithm for homomorphisms to oriented cycles.\\\p19:333--345
\>Zorbas, J.\\\see Bhattacharya
\>Zubair, M.\\\see Olariu
\>Zwaenepoel, Willy\\\see Johnson
\>Zwick, Uri\\\see Goldberg

\bye
