scientific article; zbMATH DE number 7053303

zbMath1422.68045MaRDI QIDQ5743424

Kostas Tsichlas, Gerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095167

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (2)

Fully persistent B-trees ⋮ A distributed indexing method for timeline similarity query

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining order in a generalized linked list
• Making data structures persistent
• A new data structure for representing sorted lists
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Algorithms and Data Structures for External Memory
• AVL-trees for localized search
• A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
• I/O-efficient point location using persistent B-trees

This page was built for publication: