The online house numbering problem: min-max online list labeling
From MaRDI portal
Publication:5111720
DOI10.4230/LIPICS.ESA.2017.33zbMATH Open1442.68275OpenAlexW2758734434MaRDI QIDQ5111720FDOQ5111720
William E. Devanny, Tsvi Kopelowitz, Michael T. Goodrich, Jeremy T. Fineman
Publication date: 27 May 2020
Full work available at URL: https://dblp.uni-trier.de/db/conf/esa/esa2017.html#DevannyFGK17
Recommendations
Cites Work
- Near real-time suffix tree construction via the fringe marked ancestor problem
- Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
- Cross-document pattern matching
- Sparsification—a technique for speeding up dynamic graph algorithms
- Dynamic LCA Queries on Trees
- Title not available (Why is that?)
- Cache-Oblivious B-Trees
- Competitive Analysis of Flash-Memory Algorithms
- Improved dynamic dictionary matching
- On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
- A locality-preserving cache-oblivious dynamic dictionary
- Title not available (Why is that?)
- New bounds for the controller problem
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- Tight Lower Bounds for the Online Labeling Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
- File Maintenance: When in Doubt, Change the Layout!
This page was built for publication: The online house numbering problem: min-max online list labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111720)