pippenger

At a glance this sounds like a re-discovery of addition chains and using them to construct Pippenger algorithm.

Some time ago Pippenger [1] showed that some programs cannot be transliterated into pure strict functional languages without suffering a slowdown.

Later, Bird et al [2] show that the example given by Pippenger to show the slowdown really depends on strictness, and can be transliterated into a pure lazy functional language without asymptotic slowdown.

If you are talking about Pippenger-Fischer theorem, then that's about Turing machines, not machines with RAM.

There is a tweak to hashing in Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H.

For hashing in general, a good step forward is in Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H.

There was use of Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H.

And for hashing, the clean solution is Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H.

I mentioned Pippenger's article to bring to the debate the idea that the question whether such transliteration is always possible is an open research problem.

Sure, there is Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H.

So, to keep track of the names in the object hierarchy, there was use of Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H.

There's a good history supporting my point in books by Knuth, Ullman, Sedgewick, the paper Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H.

If you are talking about Pippenger-Fischer theorem, then that's about Turing machines, not machines with RAM.

There is a tweak to hashing in Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H.

For hashing in general, a good step forward is in Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H.