
AMS Sectional Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:09:20
1995 Spring Eastern Sectional Meeting
Hartford, CT, March 3-5, 1995
Meeting #898
Associate secretaries: Lesley M Sibner, AMS lsibner@duke.poly.edu
Special Session on Cayley Graphs and Computation
-
Saturday March 4, 1995, 8:25 a.m.-10:45 a.m.
Special Session on Cayley Graphs and Computation, I
Room 217, Undergraduate Building
-
8:25 a.m.
Cayley graphs: From surface actions to bell-ringing.
Andrew J. Woldar*, Villanova University
(898-05-122) -
9:15 a.m.
Spectral bounds on the geometry of Cayley graphs.
John D. Lafferty*, Carnegie Mellon University
(898-05-100) -
10:05 a.m.
Optimal cycle codes constructed from Ramanujan graphs.
J. P. Tillich*, University of British Columbia
G. Z\'emor, Ecole Nationale Superieure, France
(898-94-111)
-
8:25 a.m.
-
Saturday March 4, 1995, 2:30 p.m.-4:50 p.m.
Special Session on Cayley Graphs and Computation, II
Room 217, Undergraduate Building
-
2:30 p.m.
Levels of uniformity in algebraically specified networks.
Arnold L. Rosenberg*, University of Massachusetts, Amherst
(898-68-37) -
3:20 p.m.
The degree-diameter problem for several varieties of Cayley graphs.
Randall Dougherty*, Ohio State University, Columbus
Vance Faber, Los Alamos National Laboratory
(898-05-143) -
4:10 p.m.
The diameter of directed Cayley graphs of Abelian groups.
Charles M. Fiduccia, Supercomputing Research Center, Maryland
Rodney W. Forcade, Supercomputing Research Center, Maryland
Jennifer Zito*, Supercomputing Research Center, Maryland
(898-05-130)
-
2:30 p.m.
-
Sunday March 5, 1995, 8:25 a.m.-10:45 a.m.
Special Session on Cayley Graphs and Computation, III
Room 217, Undergraduate Building
-
8:25 a.m.
Time and space efficient routing algorithms for Cayley graphs.
K. Wendy Tang*, State University of New York, Stony Brook
(898-68-01) -
9:15 a.m.
Normal algorithms and Cayley graphs.
Richard N. Draper*, Supercomputing Research Center, Maryland
(898-05-13) -
10:05 a.m.
The Dopey-traveler problem on Cayley and coset graphs.
Fred S. Annexstein*, University of Cincinnati
(898-05-09)
-
8:25 a.m.
-
Sunday March 5, 1995, 2:30 p.m.-4:50 p.m.
Special Session on Cayley Graphs and Computation, IV
Room 217, Undergraduate Building
-
2:30 p.m.
Computing Boolean functions on anonymous Cayley networks.
E. Kranakis, Carleton University
D. Krizanc*, Carleton University
(898-68-40) -
3:20 p.m.
A model for wavefront computation based on Cayley graphs.
Michael D. Rice, Wesleyan University
Stephen B. Seidman*, Auburn University, Auburn
(898-68-14) -
4:10 p.m.
Signature algorithms for interconnection networks.
Michael D. Rice*, Wesleyan University
Lewis C. Robertson, Wesleyan University
(898-68-11)
-
2:30 p.m.