Talk:Succinct data structure

Who's this Jacobson fellow? Sketch-The-Fox 01:29, 27 October 2007 (UTC)

I edited it and removed the "underlying combinatorial object" jargon, which I think was confusing. When can we remove the note about the Jargon? Smhanov (talk) 02:29, 13 March 2011 (UTC)

Is a C String Really Implicit?
A C string uses a byte to encode a sequence of characters from a set of 255 alternatives, since the string can't contain 0 as a valid character. Therefore, a n+1 byte (8n+8 bit) C string will be encoding a data structure with entropy log(255)*n. Doesn't this mean that it's in fact a compact data structure? — Preceding unsigned comment added by 212.252.105.234 (talk) 06:26, 21 November 2016 (UTC)

Is the heap the most known implicit data structure?
Wouldn't the simple array qualify for this position, even though it is a simpler data structure than the heap? — Preceding unsigned comment added by Honeypot95 (talk • contribs) 14:03, 3 February 2020 (UTC)

I'm pretty sure Union-Find is compact: for every element Z, Union-Find just needs to maintain a parent pointer (and depending on optimizations, also a rank or size counter), making the overall size O(Z). — Preceding unsigned comment added by 2605:A601:A621:3500:C543:DED7:72A2:64F3 (talk) 08:55, 15 July 2023 (UTC)