Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2768341
Jump to:navigation, search

zbMath0987.68023MaRDI QIDQ2768341

John Iacono

Publication date: 30 January 2002


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

zbMATH Keywords

search treesplay trees


Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)


Related Items (10)

A unified access bound on comparison-based dynamic dictionaries ⋮ A Distribution-Sensitive Dictionary with Low Space Overhead ⋮ Skip-Splay: Toward Achieving the Unified Bound in the BST Model ⋮ Proximate point searching ⋮ The splay-list: a distribution-adaptive concurrent skip-list ⋮ The cost of offline binary search tree algorithms and the complexity of the request sequence ⋮ Confluently persistent tries for efficient version control ⋮ Belga B-trees ⋮ Multi-Finger Binary Search Trees ⋮ Parameterized analysis of paging and list update algorithms




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2768341&oldid=15647606"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 15:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki