scientific article
From MaRDI portal
Publication:2934638
zbMath1302.68102MaRDI QIDQ2934638
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Randomized algorithms (68W20)
Related Items (7)
Nearly Optimal Static Las Vegas Succinct Dictionary ⋮ The complexity of the co-occurrence problem ⋮ Confluently Persistent Tries for Efficient Version Control ⋮ Unnamed Item ⋮ Confluently persistent tries for efficient version control ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Unnamed Item
This page was built for publication:
