The Online House Numbering Problem: Min-Max Online List Labeling

DOI10.4230/LIPIcs.ESA.2017.33zbMath1442.68275OpenAlexW2758734434MaRDI QIDQ5111720

William E. Devanny, Tsvi Kopelowitz, Jeremy T. Fineman, Michael T. Goodrich

Publication date: 27 May 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/esa/esa2017.html#DevannyFGK17

zbMATH Keywords

list labelingfile maintenancehouse numbering

Mathematics Subject Classification ID

Data structures (68P05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cross-document pattern matching
• New bounds for the controller problem
• Improved dynamic dictionary matching
• 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
• A locality-preserving cache-oblivious dynamic dictionary
• Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
• Tight Lower Bounds for the Online Labeling Problem
• SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
• On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
• Sparsification—a technique for speeding up dynamic graph algorithms
• File Maintenance: When in Doubt, Change the Layout!
• Dynamic LCA Queries on Trees
• Competitive Analysis of Flash-Memory Algorithms
• Cache-Oblivious B-Trees

This page was built for publication: The Online House Numbering Problem: Min-Max Online List Labeling