Matching fixed rectangles in 2-dimension

DOI10.1016/0167-7152(94)00255-XzbMath0848.60023OpenAlexW2061485484MaRDI QIDQ1914285

Ke-Ning Sheng, Joseph I. Naus

Publication date: 8 October 1996

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-7152(94)00255-x

zbMATH Keywords

latticematchingprobabilitylargest rectangle

Mathematics Subject Classification ID

Combinatorial probability (60C05) Distribution theory (60E99)

Related Items (2)

Approximations for a three dimensional scan statistic ⋮ Approximations for a conditional two-dimensional scan statistic.

Cites Work

• Matching rectangles in d-dimensions: Algorithms and laws of large numbers
• Pattern matching between two non-aligned random sequences
• Extreme order statistics for a sequence of dependent random variables
• On the longest run of coincidences
• Approximations for Distributions of Scan Statistics
• ON THE POWER FUNCTION OF THE LONGEST RUN AS A TEST FOR RANDOMNESS IN A SEQUENCE OF ALTERNATIVES

This page was built for publication: Matching fixed rectangles in 2-dimension