
AMS Sectional Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:09:22
Program 
Deadlines 
Inquiries: meet@ams.org
1995 Fall Central Sectional meeting
Kent, OH, November 34, 1995
Meeting #904
Associate secretaries: Andy R Magid, AMS amagid@ou.edu
Special Session on Foundations and Mathematical Aspects of Computer Science

Friday November 3, 1995, 8:30 a.m.10:50 a.m.
Special Session on Foundations and Mathematical Aspects of Computer Science, I
Room 313, Kent Student Center Organizers: Johnnie W. Baker, Kent State University
Meera Sitharam, Kent State University

8:30 a.m.
Flows and queueing networks.
James A. Walsh*, Oberlin College
G. R. Hall, Oberlin College
B. Elenbogen, Oberlin College
(90468226)

9:00 a.m.
Poisson approximations for functionals of random trees.
Robert Paul Dobrow*, Northeast Missouri State University
Robert Smythe, Northeast Missouri State University
(90468220)

9:30 a.m.
Real solutions for multivariate polynomial inequalities.
Bruce B. Anderson*, Kent State University, Kent
Meera Sitharam, Kent State University, East Liverpool
(90426221)

10:00 a.m.
Efficient algorithms for computing the Jacobi symbol.
Jonathan Paul Sorenson*, Butler University
Shawna Meyer, Butler University
(90411229)

10:30 a.m.
Density of normal elements.
Daniel Panario*, University of Toronto
Shuhong Gao, University of Toronto
(90468227)

Friday November 3, 1995, 3:00 p.m.6:20 p.m.
Special Session on Foundations and Mathematical Aspects of Computer Science, II
Room 313, Kent Student Center Organizers: Johnnie W. Baker, Kent State University
Meera Sitharam, Kent State University

3:00 p.m.
Which real functions are computable? Generalizations of Church's Thesis.
Klaus Weihrauch*, Fern Universitaet, Germany
(90403225)

3:30 p.m.
Sparse hard sets for $P$: Resolution of a conjecture of Hartmanis.
D. Sivakumer*, State University of New York, Buffalo
JinYi Cai, State University of New York, Buffalo
(90468231)

4:00 p.m.
Spectral methods for matrix rigidity with applications to sizedepth tradeoffs and communication complexity.
Satyanarayana V. Lokam*, University of Chicago
(90468228)

4:30 p.m.
Lower bounds for monotone span programs.
Anna Gal*, Institute for Advanced Study
Amos Beimel, Institute for Advanced Study
Mike Paterson, Institute for Advanced Study
(90468219)

5:00 p.m.
On applications of Fourier analysis in machine learning.
Jeffrey Jackson*, Duquesne University
(90468233)

5:30 p.m.
Problems and techniques on Walsh functions.
Per Enflo*, Kent State University, Kent
(90468223)

6:00 p.m.
Complexity questions and approximation from function spaces over the cube.
Meera Sitharam*, Kent State University, Kent
(90468236)

Saturday November 4, 1995, 9:00 a.m.10:50 a.m.
Special Session on Foundations and Mathematical Aspects of Computer Science, III
Room 120, Mathematics and Computer Science Organizers: Johnnie W. Baker, Kent State University
Meera Sitharam, Kent State University

9:00 a.m.
On associative computing and molecular chemistry.
Johnnie W. Baker*, Kent State University, Kent
(90468243)

9:30 a.m.
New paradigms for parallel computation.
Selim G. Akl*, Queen's University
(90468145)

10:00 a.m.
Analysis of parallel quicksort algorithms.
Anne E. Condon*, University of Wisconsin, Madison
Richard E. Ladner, University of Wisconsin, Madison
(90468240)

10:30 a.m.
Honeycomb networks: topological properties and communication algorithms.
Ivan Stojmenovic*, University of Ottawa
(90468239)

Saturday November 4, 1995, 3:00 p.m.5:50 p.m.
Special Session on Foundations and Mathematical Aspects of Computer Science, IV
Room 120, Mathematics and Computer Science Organizers: Johnnie W. Baker, Kent State University
Meera Sitharam, Kent State University

3:00 p.m.
Hamiltonian triangulation of simple polygons.
Giri Narasimhan*, Memphis State University
(90468237)

3:30 p.m.
Efficient exploration of unknown environments.
Yury Smirnov*, Carnegie Mellon University
Sven Koenig, Carnegie Mellon University
Manuela Veloso, Carnegie Mellon University
(90468232)

4:00 p.m.
The online transportation problem.
Kirk Pruhs*, University of Pittsburgh, Pittsburgh
Bala Kalyanasundaram, University of Pittsburgh, Pittsburgh
(90468238)

4:30 p.m.
Simultaneous construction of school timetables and student schedules.
Gary Lewandowski*, Xavier University
(90468234)

5:00 p.m.
Linear time algorithms for dominating pairs in asteroidal triplefree graphs.
Steven Olariu*, Old Dominion University
Derek G. Corneil, Old Dominion University
L. Stewart, Old Dominion University
(90468224)

5:30 p.m.
Two processor scheduling and maximum matching for permutation graphs.
Sivaprakasam Sunder*, University of Delaware
R. Sarnath, Saint Cloud State University
(90468222)
Inquiries: meet@ams.org

