Tuesday, July 14

Diverse Topics

10:30 AM-12:30 PM
Chair: John L. Pfaltz, University of Virginia
Room: Sidney Smith 2111

10:30 Uniform Anti-Matroid Closure Spaces
John L. Pfaltz, University of Virginia
10:50 New Time-Space Tradeoffs for Selection from Read-Only-Memories
Sarnath Ramnath, St. Cloud State University and Venkatesh Raman, IMSc, Chennai, India
11:10 Making a Fair Trial with a Biased Coin
Kenneth J. Supowit, Ohio State University
11:30 Average Distance, Minimum Degree, and Forbidden Subgraphs
Peter Dankelmann, University of Natal, South Africa; Roger Entringer, University of New Mexico
11:50 The Edge Span of Distance Two Labelings of Graphs
Roger K. Yeh, Feng Chia University, Taiwan
12:10 Fast Algorithm for Finding Trigonometric Sums on Equidistant Points
Lei Li, Yamaguchi University, Japan; and Takashi Yahagi, Chiba University, Japan
12:30 Iterative Switching Networks
Victor N. Kasyanov, Institute of Informatics Systems, Novosibirsk, Russia
12:50 On the Problem of Approach the Target under Uncertainty
Greta Ts. Chikrii, Cybernetics Institute, Kiev, Ukraine
Program Program Overview Program-at-a-Glance Program Updates Speaker Index Registration Hotel Transportation

MMD, 7/8/98