Finding Nearest Larger Neighbors

DOI10.1007/978-3-642-03456-5_17MaRDI QIDQ3644726zbMATH OpenOpenAlexFDO

Authors Sergey Bereg, Tetsuo Asano, David Kirkpatrick

Publication date 12 November 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)

Recommendations

• Time-space tradeoffs for all-nearest-larger-neighbors problems
• Space efficient data structures for nearest larger neighbor
• Space efficient data structures for nearest larger neighbor
• All nearest smallers made simple
• scientific article; zbMATH DE number 4074476

Cited in

(8)

• Encoding nearest larger values
• Analysis of an adaptive algorithm to find the two nearest neighbors
• Space efficient data structures for nearest larger neighbor
• Encoding Nearest Larger Values
• Space efficient data structures for nearest larger neighbor
• scientific article; zbMATH DE number 177533 (Why is no real title available?)
• A new algorithmic framework for basic problems on binary images
• In-place algorithm for erasing a connected component in a binary image

This page was built for publication: Finding Nearest Larger Neighbors

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