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
  Hopcroft, John Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 4 of 4 reviews    
   Introduction to automata theory, languages and computability
Hopcroft J. (ed), Motwani R., Ullman J., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2000. 521 pp.  Type: Book (9780201441246)

It can be reasonably argued that there are three major foundations of computer science: mathematical descriptions of computational devices, the limits of mechanical computation, and the specification of formal languages. It can further...
...
May 13 2003  
  The geometry of projective blending surfaces
Hoffmann C., Hopcroft J. (ed) Artificial Intelligence 37(1-3): 357-376, 1988.  Type: Article

The blending problem in solid modeling involves computing a transition surface that connects and is tangent to two of the existing surfaces of the model. Two major approaches to the solution of this problem exist. In the first approach...
...
Oct 1 1989  
  The impact of robotics on computer science
Hopcroft J. (ed) Communications of the ACM 29(6): 486-498, 1986.  Type: Article

The main thrust of this paper is to point out that various problems arising in robotics require not only the discrete mathematics which are part of current computer science curricula, but also other traditional branches of mathematics,...
...
Nov 1 1986  
  Movement problems for 2-dimensional linkages
Hopcroft J. (ed), Joseph D., Whitesides S. SIAM Journal on Computing 13(3): 610-629, 1984.  Type: Article

This is a beautiful paper with two highly original results. First, it is shown that a planar linkage can be forced to stay inside a region by the addition of a polynomial number of new links (polynomial in the number of original links...
...
Feb 1 1985  

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