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
 
Roos, Robert
Allegheny College
Meadville, Pennsylvania
 
   Reader Recommended
   Reviewer Selected
   Highlighted
Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 64 reviews

   
  The Java tutorial: a short course on the basics (6th ed.)
Gallardo R., Hommel S., Kannan S., Gordon J., Zakhour S., Addison-Wesley Professional, Upper Saddle River, NJ, 2014. 864 pp.  Type: Book (978-0-134034-08-9)

Beginning with the first edition of The Java tutorial in 1996, the book has been a hard-copy version of the online Java tutorials [1], where the content is available in Hypertext Markup Language (HTML) form. Ebook versions may b...

May 28 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  
  An extension of context-free grammars with one-sided context specifications
Barash M., Okhotin A. Information and Computation 237268-293, 2014.  Type: Article

The gap between context-sensitive languages and context-free languages (types 1 and 2 in the Chomsky hierarchy) has been a rich area of research in formal language theory for the past five decades, giving rise to such mildly context-se...

Dec 16 2014  
  A note on the emptiness problem for alternating finite-memory automata
Genkin D., Kaminski M., Peterfreund L. Theoretical Computer Science 52697-107, 2014.  Type: Article

The emptiness problems for one-register alternating finite-memory automata and one-register alternating finite-memory tree automata are known to be decidable. The authors present decidability proofs that are significantly simpler than ...

Sep 3 2014  
  The algorithmics of solitaire-like games
Backhouse R., Chen W., Ferreira J. Science of Computer Programming 78(11): 2029-2046, 2013.  Type: Article

Using three types of solitaire puzzles, peg-jumping games, chessboard tiling problems, and a type that the authors call replacement-set games, the authors provide examples of the use of invariants in the design and solution of such puz...

Jul 7 2014  
  Introduction to compiler construction in a Java world
Campbell B., Iyer S., Akbal-Delibas B., Chapman & Hall/CRC, Boca Raton, FL, 2013. 381 pp.  Type: Book (978-1-439860-88-5)

In a random, unscientific sampling of syllabi for recent compiler courses at a dozen universities in the US, I determined that many still use the iconic “dragon book” [1], or older textbooks from as far back as 1995...

Sep 10 2013  
  Integrating theoretical and empirical computer science in a data structures course
Coffey J.  SIGCSE 2013 (Proceeding of the 44th ACM Technical Symposium on Computer Science Education, Denver, CO, Mar 6-9, 2013) 23-28, 2013.  Type: Proceedings

There is nothing surprising or original about proposing to make discrete mathematics “relevant” to students of computer science. Nor is it controversial to have weekly two-hour labs, or to assign programming project...

May 13 2013  
  Regression test suite prioritization using system models
Tahat L., Korel B., Harman M., Ural H. Software Testing, Verification & Reliability 22(7): 481-506, 2012.  Type: Article

The use of system models for guiding the prioritization of regression test suites is examined in depth. In particular, this paper extends recent work on the use of extended finite-state machine (EFSM) models as a tool for predicting wh...

Mar 5 2013  
  Fast brief practical DFA minimization
Valmari A. Information Processing Letters 112(6): 213-217, 2012.  Type: Article

It is very unusual to see a paper on computational complexity that focuses on actual code, rather than using a higher-level pseudocode description of algorithms. Valmari’s paper presents a complete C++ program for finding a m...

Jul 2 2012  
  Rainbow of computer science: dedicated to Hermann Maurer on the occasion of his 70th birthday (LNCS 6570)
Calude C., Rozenberg G., Salomaa A. Springer-Verlag, Berlin, Germany, 2011.  Type: Divisible Book

In the tradition of all Festschriften, this volume in tribute to Hermann Maurer collects short contributions on a variety of topics of particular relevance to the honoree. Given the diversity of Maurer’s published work, these...

Dec 5 2011  
 
 
 
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