• Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/sadh/017/01/0221-0236

    • Keywords

       

      Efficient parallel algorithms; maximum empty rectangle problem; mesh-of-trees architecture

    • Abstract

       

      We present efficient parallel algorithms for the maximum empty rectangle problem in this paper. On crew pram, we solve the area version of this problem inO(log2n) time usingO(nlogn) processors. The perimeter version of this problem is solved inO(logn) time usingO(nlog2n) processors. On erew pram, we solve both the problems inO(logn) time usingO(n2/logn) processors. We also present anO(logn) time algorithm on a mesh-of-trees architecture.

    • Author Affiliations

       

      Amitava Datta1 R Srikant1 G D S Ramkumar1 Kamala Krithivasan1

      1. Department of Computer Science and Engineering, Indian Institute of Technology, Madras - 600 036, India
    • Dates

       
  • Sadhana | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.