Maximal antichain lattice algorithms for distributed computations

DOI10.1007/978-3-642-35668-1_17MaRDI QIDQ5507402zbMATH OpenOpenAlexFDO

Authors Vijay K. Garg

Publication date 19 December 2016

Published in Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35668-1_17

Mathematics Subject Classification ID

Partial orders, general (06A06) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Online algorithms; streaming algorithms (68W27)

Recommendations

• Computing on-line the lattice of maximal antichains of posets
• A fast incremental algorithm for building lattices
• On-line computations of the ideal lattice of posets
• Distributed algorithm to detect strong conjunctive predicates
• Some optimal algorithms for decomposed partially ordered sets

Cited in

(1)

• Computing on-line the lattice of maximal antichains of posets

This page was built for publication: Maximal antichain lattice algorithms for distributed computations

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