Chester Holtz

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this work, we critique two papers, " A Polynomial-Time Solution to the Clique Problem " by Tamta, Pande, and Dhami [3], and " A Polynomial-Time Algorithm For Solving Clique Problems " by LaPlante [1]. We summarize and analyze both papers, noting that the algorithms presented in both papers are flawed. We conclude that neither author has successfully(More)
In this paper, we demonstrate the effectiveness of Cheney's Copy Algorithm for a Lisp-like system and experimentally show the infeasability of developing an optimal garbage collector for general use. We summarize and compare several garbage-collection algorithms including Cheney's Algorithm, the canonical Mark and Sweep Algorithm, and Knuth's Classical Lisp(More)
  • 1