Experts has a new look! Let us know what you think of the updates.

Provide feedback
Home
Scholarly Works
Sub-Logarithmic Algorithms for the Largest Empty...
Conference

Sub-Logarithmic Algorithms for the Largest Empty Rectangle Problem.

Authors

Olariu S; Shen W; Wilson L

Editors

Koczkodaj WW; Lauer PE; Toptsis AA

Pagination

pp. 106-109

Publisher

IEEE Computer Society

Publication Date

1992

ISBN-10

0-8186-2812-X

Conference proceedings

ICCI