12:00 p.m. Applications of array searching to economic lot-sized models. Alok Aggarwal*, IBM Research Division, Yorktown Heights, New York
(863-68-809)
12:30 p.m. Compact storage of nonadaptive routing tables. Baruch Schieber*, IBM T. J. Watson Research Center, Yorktown Heights, New York
(863-68-808)
1:00 p.m. Two algorithms for selecting the k-th smallest entry in each row of a Monge array. James Park*, Massachusetts Institute of Technology
(863-68-807)
1:30 p.m. Series-parallel graphs, Monge arrays and greedy linear. Alan Hoffman*, IBM T. J. Watson Research Center, Yorktown Heights, New York
(863-68-806)
2:00 p.m. Staircase transportation problems with superadditive rewards and cumulative capacities. Arthur F. Veinott, Jr.*, IBM Almaden Research Center, San Jose, California and Stanford University
(863-68-805)
7:00 a.m. Ackermann's inverse and computer circuits. Nicholas Pippenger*, University of British Columbia
(863-68-804)
7:30 a.m. Lower envelopes of line segments. Peter Shor*, AT&T Bell Laboratories, Murray Hill, New Jersey
(863-68-801)
8:00 a.m. Lower bound for the union-find problem. Michael L. Fredman*, Rutgers University, New Brunswick
(863-68-803)
8:30 a.m. An optimal algorithm with unknown time complexity for convex matrix searching. Lawrence L. Larmore*, University of California, Riverside
(863-68-802)
9:00 a.m. Superlinear lower bounds for matrix searching algorithms. Maria Klawe*, University of British Columbia,
(863-68-800)