On the computational complexity of bisimulation, redux

摘要

These proceedings accompany the Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop. This one-day meeting, held in the year of Paris Kanellakis's 50th birthday, commemorates Paris's legacy to computer science. It is a retrospective of his work and a celebration of his impact on computer science, through his research and through its influence on research directions taken by the computer science community. The workshop is affiliated with the ACM Federated Computing Research Conference held in San Diego, California, June 7--14, 2003.The workshop includes talks by invited speakers as well as by Paris's past students. The day will be capped by a banquet at which colleagues and friends will offer their personal recollections of Paris. Highlights of the workshop include invited talks by Dr. Christos Papadimitriou, University of California at Berkeley, Dr. Moshe Vardi, Rice University, and the winner of the ACM 2001 Paris Kanellakis Theory and Practice Award, Dr. Gene Myers of the University of California at Berkeley. This volume also includes four papers contributed by Paris's colleagues.