1991 Joint Mathematics Meetings, Program by Special Session
AMS Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:08:48
1991 Joint Mathematics Meetings
San Francisco, CA, January 16-19, 1991
Andy R Magid, AMS firstname.lastname@example.org
Kenneth A Ross, MAA email@example.com
AMS Special Session on Matrix Searching, Monge Arrays and Ackemann's Inverse: Algorithms and Lower Bounds
Friday January 18, 1991, 12:00 p.m.-2:20 p.m.
AMS Special Session on Matrix Searching, Monge Arrays and Ackemann's Inverse: Algorithms and Lower Bounds, I
Applications of array searching to economic lot-sized models.
Alok Aggarwal*, IBM Research Division, Yorktown Heights, New York
Compact storage of nonadaptive routing tables.
Baruch Schieber*, IBM T. J. Watson Research Center, Yorktown Heights, New York
Two algorithms for selecting the k-th smallest entry in each row of a Monge array.
James Park*, Massachusetts Institute of Technology
Series-parallel graphs, Monge arrays and greedy linear.
Alan Hoffman*, IBM T. J. Watson Research Center, Yorktown Heights, New York
Staircase transportation problems with superadditive rewards and cumulative capacities.
Arthur F. Veinott, Jr.*, IBM Almaden Research Center, San Jose, California and Stanford University
Saturday January 19, 1991, 7:00 a.m.-9:20 a.m.
AMS Special Session on Matrix Searching, Monge Arrays and Ackemann's Inverse: Algorithms and Lower Bounds, II
Ackermann's inverse and computer circuits.
Nicholas Pippenger*, University of British Columbia
Lower envelopes of line segments.
Peter Shor*, AT&T Bell Laboratories, Murray Hill, New Jersey
Lower bound for the union-find problem.
Michael L. Fredman*, Rutgers University, New Brunswick
An optimal algorithm with unknown time complexity for convex matrix searching.
Lawrence L. Larmore*, University of California, Riverside
Superlinear lower bounds for matrix searching algorithms.
Maria Klawe*, University of British Columbia,