Sep. 15th, 2004

fflo: (Default)
From 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"?
fflo: (Default)
From 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"?
fflo: (Default)
fflo

Hello.

CURRENTLY FEATURING
the
Postcard of the Day

(a feature involving a postcard on a day)

- - - - - - - - - - - - - - - - - - - - -

For another postcard thing, see
my old postcard poems tumblr or
its handy archive.

- - - - - - - - - - - - - - - - - - - - -

I'm currently double-posting here & at livejournal. Add me and let me know who you are, and we can read each other's protected posts.

======================

"What was once thought cannot be unthought."

-- Möbius, The Physicists

=======================

January 2026

S M T W T F S
    12 3
45678910
11121314151617
18192021222324
25262728293031
Page generated Jan. 5th, 2026 03:38 am