these are words that go together well
Sep. 15th, 2004 03:53 pm![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
ffloFrom the proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001):
"A data structure is fully persistent if it varies in time and supports access and modifications of all its versions. A fully persistent data structure that supports update operations on more than one version at a time is called confluently persistent."
I'd like to change my blog's subtitle to "Confluently persistent," but the definition doesn't fit (at least technically).
Maybe "Confluent persistence"?
"A data structure is fully persistent if it varies in time and supports access and modifications of all its versions. A fully persistent data structure that supports update operations on more than one version at a time is called confluently persistent."
I'd like to change my blog's subtitle to "Confluently persistent," but the definition doesn't fit (at least technically).
Maybe "Confluent persistence"?
![[identity profile]](https://www.dreamwidth.org/img/silk/identity/openid.png){kind=small}
Re: symposium
Date: Sep. 16th, 2004 07:04 am (UTC)Yeah, you only wanted to go for the T-shirt & all the hot practitioners of algorithms.