© 2000

Algorithmic Problems in Groups and Semigroups

  • Jean-Camille Birget
  • Stuart Margolis
  • John Meakin
  • Mark Sapir
Conference proceedings

Part of the Trends in Mathematics book series (TM)

Table of contents

  1. Front Matter
    Pages i-x
  2. Jorge Almeida, Benjamin Steinberg
    Pages 1-23
  3. Karl Auinger
    Pages 25-33
  4. Gilbert Baumslag, Alexei Myasnikov, Vladimir Remeslennikov
    Pages 35-50
  5. Katalin Bencsath, Benjamin Fine, Anthony M. Gaglione, Alexei G. Myasnikov, Frank Roehl, Gerhard Rosenberger et al.
    Pages 51-90
  6. Karsten Henckell, Jean-Eric Pin
    Pages 121-137
  7. S. V. Ivanov, P. E. Schupp
    Pages 139-142
  8. Jean-François Raymond, Pascal Tesson, Denis Thérien
    Pages 217-233
  9. L. M. Shneerson
    Pages 251-265
  10. Howard Straubing
    Pages 267-288
  11. Back Matter
    Pages 309-309

About these proceedings


This volume contains papers which are based primarily on talks given at an inter­ national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998. The conference coincided with the Centennial Celebration of the Department of Mathematics and Statistics at the University of Nebraska-Lincoln on the occasion of the one hun­ dredth anniversary of the granting of the first Ph.D. by the department. Funding was provided by the US National Science Foundation, the Department of Math­ ematics and Statistics, and the College of Arts and Sciences at the University of Nebraska-Lincoln, through the College's focus program in Discrete, Experimental and Applied Mathematics. The purpose of the conference was to bring together researchers with interests in algorithmic problems in group theory, semigroup theory and computer science. A particularly useful feature of this conference was that it provided a framework for exchange of ideas between the research communities in semigroup theory and group theory, and several of the papers collected here reflect this interac­ tion of ideas. The papers collected in this volume represent a cross section of some of the results and ideas that were discussed in the conference. They reflect a synthesis of overlapping ideas and techniques stimulated by problems concerning finite monoids, finitely presented mono ids, finitely presented groups and free groups.


Group theory complexity geometry groups semigroups-algorithmic theory statistics theoretical computer science logic

Editors and affiliations

  • Jean-Camille Birget
    • 1
  • Stuart Margolis
    • 2
  • John Meakin
    • 3
  • Mark Sapir
    • 4
  1. 1.Faculty of Computer ScienceDalhousie UniversityHalifaxCanada
  2. 2.Dept. of Mathematics & Computer ScienceBar-Ilan UniversityRamat GanIsrael
  3. 3.Dept. of Mathematics & StatisticsUniversity of NebraskaLincolnUSA
  4. 4.Dept. of MathematicsVanderbilt UniversityNashvilleUSA

Bibliographic information