English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Parallel algorithm for maximum empty L-shaped polygon

Preetham, A. J., Krithivasan, K., Rangan, C. P., & Sibeyn, J. F. (1996). Parallel algorithm for maximum empty L-shaped polygon. In 3rd Conference on High-Performance Computing. Los Alamitos, USA: IEEE.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Preetham, A. J.1, Author
Krithivasan, Kamala, Author
Rangan, C. Pandu2, Author           
Sibeyn, Jop F.1, Author
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021996
 Publication Status: Issued
 Pages: -
 Publishing info: Los Alamitos, USA : IEEE
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517733
Other: Local-ID: C1256428004B93B8-3D8CBF553C099488C12564C2002FB887-Sibeyn-et-al96
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: -
Start-/End Date: 1996

Legal Case

show

Project information

show

Source 1

show
hide
Title: 3rd Conference on High-Performance Computing
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Los Alamitos, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -