Computational Discrete Mathematics

Advanced Lectures

  • Helmut Alt
Book

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2122)

Table of contents

  1. Front Matter
    Pages I-VII
  2. Martin Aigner
    Pages 1-12
  3. Helmut Alt
    Pages 13-24
  4. Bernd Gärtner, Emo Welzl
    Pages 25-46
  5. Tor Helleseth
    Pages 47-55
  6. Christoph Meinel, Christian Stangier
    Pages 61-78
  7. Hans Jürgen Prömel, Anusch Taraz
    Pages 98-118
  8. Ralph-Hardo Schulz
    Pages 136-147
  9. Gernot Stroth
    Pages 148-158
  10. Back Matter
    Pages 172-172

About this book

Introduction

This book is based on a graduate education program on computational discrete mathematics run for several years in Berlin, Germany as a joint effort of theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics.
The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics in a coherent and consolidated way. Among the areas covered are combinatorics, graph theory, coding theory, discrete and computational geometry, optimization, and algorithmic aspects of algebra.

Keywords

Computer Discrete mathematics Mapping algorithms coding coding theory combinatorics computational algebra computational algorithms computational geometry computational mathematics data structures geometry graph computations randomization

Editors and affiliations

  • Helmut Alt
    • 1
  1. 1.Institut für InformatikFreie Universität BerlinBerlinGermany

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45506-X
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42775-9
  • Online ISBN 978-3-540-45506-6
  • Series Print ISSN 0302-9743
  • About this book