Monday, January 18

Session 26
Generating Discrete Structures

3:00 PM-4:00 PM
Room: Mencken
Chair: Michel Habib, Université Montpellier II, France

3:00-3:17 The Advantages of Forward Thinking in Generating Rooted and Free Trees

Gang Li and Frank Ruskey, University of Victoria, Canada

3:20-3:37 New Algorithms for Generating Conway Polynomials Over Finite Fields

Lenwood S. Heath and Nicholas A. Loehr, Virginia Polytechnic Institute and State University

3:40-3:57 An Efficient Algorithm for Generating Necklaces with Fixed Density

Joe Sawada and Frank Ruskey, University of Victoria, Canada

SODA'99 Home

Program

Program Updates

Author Index

Hotel

Transportation

Registration

tjf, 9/12/98, MMD, 10/13/98