Time and space efficient representations of distributive lattices

MaRDI QIDQ4607917zbMATH OpenFDO

Authors J. Ian Munro, Corwin W. Sinnamon

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175306

Mathematics Subject Classification ID

Data structures (68P05) Structure and representation theory of distributive lattices (06D05)

Recommendations

• Tree structure for distributive lattices and its applications
• scientific article; zbMATH DE number 1554928
• An Efficient Data Structure for Lattice Operations
• Efficient polynomial algorithms for distributive lattices
• scientific article; zbMATH DE number 1554940

Cited in

(4)

• Distance queries over dynamic interval graphs
• scientific article; zbMATH DE number 7765383 (Why is no real title available?)
• Distance queries over dynamic interval graphs
• Efficient algorithms on distributive lattices

This page was built for publication: Time and space efficient representations of distributive lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607917)