The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 1 / 2005  
         
  Article:   MATHEMATICS AND COMPUTER SCIENCE III { ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES, MICHAEL DRMOTA, PHILIPPE FLAJOLET, DANIµELE GARDY AND BERNHARD GITTENBERGER (EDITORS), TRENDS IN MATHEMATICS, BIRKHÄAUSER VERLAG, BASEL-BOSTON-BERLIN 2004, XV + 555.

Authors:  RADU LUPŞA.
 
       
         
  Abstract:  The book contains invited papers, contributed papers (lectures) and short com- munications (posters), which were presented at the International Colloquium of Mathematics and Computers Science held at the Vienna University of Technology, in September 13-17, 2004. This colloquium is the third one in a now regularly es- tablished series, following the first two venues in September 2000 and September 2002 in Versailles. Their Proceedings were published too with BirkhÄauser Verlag in 2000 and 2002, respectively. These colloquia were acknowledged as a success by the two communities, mathematicians and computer scientists, as well as other people working in various areas of applied mathematics and engineering. They o®er the opportunity to establish the state of the art and, at a same time, to present new results, new trends and new ideas in common areas. The present volume addresses problems situated at the interface between mathe- matics and Computer Science, with special emphasis on discrete probabilistic mod- els and their relation to algorithms. Combinatorial and probabilistic properties of random graphs, random trees, combinatorial stochastic processes (random walks, for instance) are also included. The major field of applications is the analysis of algorithms and data structures, but applications to statistical theory, information theory and mathematical logic are also considered.  
         
     
         
         
      Back to previous page