Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Mehlhorn, Kurt Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 5 of 7 reviews    
   Computing real roots of real polynomials
Sagraloff M., Mehlhorn K. Journal of Symbolic Computation 73(C): 46-86, 2016.  Type: Article

The computation of roots of a univariate polynomial is the most classical task in computational algebra. Since this problem arises in very many applications, plenty of techniques for its solution have been proposed. In this paper, Sagr...
...
Dec 1 2015  
  On a model of virtual address translation
Jurkiewicz T., Mehlhorn K. Journal of Experimental Algorithmics 191.1-1.28, 2014.  Type: Article

The standard random access model (RAM) of memory used in many analyses of algorithmic time complexity does not take into account the structure of modern hierarchical memories. Aggarwal and Vitter’s external memory (EM) model ...
...
Apr 16 2015  
  A separation bound for real algebraic expressions
Burnikel C., Funke S., Mehlhorn K., Schirra S., Schmitt S. Algorithmica 55(1): 14-28, 2009.  Type: Article

This paper is concerned with separation bounds--how small can a nonzero number defined by a certain kind of expression be? Put another way, how accurate do we need to be to answer with positive, negative, or zero? Such questio...
...
Apr 5 2010  
  Algorithms and data structures: the basic toolbox
Mehlhorn K., Sanders P., Springer Publishing Company, Incorporated, 2008. 300 pp.  Type: Book

This text is intended for undergraduate computer science (CS) majors, and focuses on algorithm analysis. An unstated assumption is that the reader has significant mathematical competence and a solid grounding in elementary data structu...
...
Oct 31 2008  
  Certifying and repairing solutions to large LPs how good are LP-solvers?
Dhiflaoui M., Funke S., Kwappik C., Mehlhorn K., Seel M., Schömer E., Schulte R., Weber D.  Discrete algorithms (Proceedings of the fourteenth annual ACM-SIAM symposium, Baltimore, Maryland, Jan 12-14, 2003) 255-256, 2003.  Type: Proceedings

Linear programming (LP) techniques are very useful in decision-making processes in organizations, including solving resource allocation problems for profit or nonprofit organizations. Linear programming solvers are available. These sta...
...
Jan 14 2004  

 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy