A Linear Time Approach to the Set Maxima Problem
From MaRDI portal
Publication:3989007
DOI10.1137/0405001zbMATH Open0739.68025OpenAlexW783504MaRDI QIDQ3989007FDOQ3989007
Authors: Amotz Bar-Noy, Joseph (Seffi) Naor, Rajeev Motwani
Publication date: 28 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0405001
Recommendations
Searching and sorting (68P10) General theory of linear incidence geometry and projective geometries (51A05)
Cited In (11)
- Augmenting approach for some maximum set problems
- Title not available (Why is that?)
- LATIN 2004: Theoretical Informatics
- A note on the 1-maximal elements problem
- On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs
- A provably fast linear-expected-time maxima-finding algorithm
- Finding extremal sets in less than quadratic time
- Maximal intersection queries in randomized input models
- Title not available (Why is that?)
- Efficient Computation of the Maximum of the Sum of Two Sequences and Applications
- Maximal Intersection Queries in Randomized Graph Models
This page was built for publication: A Linear Time Approach to the Set Maxima Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989007)