Skip to content
Browse files

update comment

  • Loading branch information...
1 parent 3e2cd7c commit 7e08f959eae9a5b0c57e33ad9cf86e3086468afc @dhruvbird dhruvbird committed May 3, 2012
Showing with 3 additions and 2 deletions.
  1. +3 −2 doc/pdpma.tex
5 doc/pdpma.tex
@@ -105,8 +105,9 @@ \section{How to partially deamortize the PMA?}
copying elements $\sqrt{n}$ at a time.
We know that we can choose any window in the PMA as long as the window
-sizes grow exponentially (include reference). i.e. We select windows
-of size
+sizes grow exponentially (include reference - asked as an assignment
+question, but Dr. Bender mentioned that there is a paper on
+this). i.e. We select windows of size
$\sqrt{n},\ 2\sqrt{n},\ 4\sqrt{n},\ 8\sqrt{n},\ and\ so\ on\ldots{}$.
Once we have determined that a certain number of segments (say $c$) of

0 comments on commit 7e08f95

Please sign in to comment.
Something went wrong with that request. Please try again.