Publications of Dr. Michael Brinkmeier

• M. Brinkmeier:
  Minimizing Symmetric Set Functions Faster
  Technical Report, TU Ilmenau, 2006
  [PDF]
  
  
• M. Brinkmeier:
  PageRank revisited.
  To be published in ACM Transactions on Internet Technologies, volume 6, number 3 (August 2006)
  [PDF]
  
  
• M.Brinkmeier:
  A Simple and Fast Min-Cut Algorithm.
  Fundamentals of Computation Theory 2005, Lübeck, Germany, August 2005, Springer LNCS 3623, 317-328, 2005
  [PDF]
  
  
• M. Brinkmeier:
  Distributed Calculation of PageRank using Strongly Connected Components.
  To be published in Proceedings of the I2CS'2005, Paris
  [PDF]
  
• M. Brinkmeier:
  Structural Alignments of Pseudo-knotted RNA-molecules in Polynomial Time.
  Technical Report, TU Ilmenau, 2003
  [PDF] (Submitted)
  
  
• M. Brinkmeier und T. Schank:
  Network Statistics.
  in U. Brandes und T. Erlebach (Editoren): Network Analysis, Springer LNCS 3418, 293-317, 2005
  Online-Access
  
• M. Brinkmeier:
  Pseudoknotted Secondary RNA Structure.
  Technical Report, TU Ilmenau, 2003
  [PDF]
  
  
• M. Brinkmeier:
  Operads and Terms.
  Technical Report, TU Ilmenau, 2003
  [PDF]
  
• M. Brinkmeier:
  Communities in Graphs.
  Proceedings of the I2CS'2003, Springer LNCS 2877
  [PDF] [PS] (Technical Report)
  
• M. Brinkmeier:
  Strongly Homotopy-Commutative Monoids Revisited.
  Doc. Math. J. DMV 5, 613-624 (2000)
  [Preprint]
  
  
• M. Brinkmeier:
  On Operads.
  Dissertation, Universität Osnabrück, 2000
  [PDF]
  
• M. Brinkmeier:
  The Tensorproduct Of Little Cubes.
  Preprint 00-098, Universität Bielefeld, 2000
  [PDF]
  
• M. Brinkmeier:
  The Milgram Non-Operad.
  Ann. Inst. Fourier, No.5, 1427-1438 (1999),
  [Preprint]