; reduction steps to get rid of the n calls to ++, which lies in O(n^2).
> Thats what we expected of course, since we know that each of the ++
> would need O(n) steps.
I really liked the excellent and very clear analysis! But the last
formula should be:
n + (n - 1) + (n - 2) + ... = n *
o fit in memory then it's clear that the code
*must* let go of the beginning to allow the garbage collector to do its
job. You wouldn't be able to work with a 7.5 GiB linked list otherwise.
--
Martin Geisler
VIFF (Virtual Ideal Functionality Framework) brings easy and efficient
SMPC
fline,
online), [...]
They do allow you to keep a copy of the .pdf file on your own website
for archiving purposes, but republishing the article with a single
column doesn't seem to be allowed.
[1]: The copyright form can be downloaded here:
http://www.springer.com/east/home/computer/lncs?S
