Computing a poset from its realizer

DOI10.1016/S0020-0190(97)00166-XzbMath1336.68274OpenAlexW2103768465MaRDI QIDQ287260

Vincenzo Mastrobuoni, Enrico Nardelli, Alesiano Santomo

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00166-x

zbMATH Keywords

data structurespartially ordered sets

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorics of partially ordered sets (06A07) Data structures (68P05)

Related Items (1)

Computing a poset from its realizer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing a poset from its realizer
• Log-logarithmic worst-case range queries are possible in space theta(N)
• Adding range restriction capability to dynamic data structures
• Efficient data structures for range searching on a grid
• An improved algorithm for the rectangle enclosure problem

This page was built for publication: Computing a poset from its realizer