An optimal parallel minimax tree algorithm

An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented. The algorithm achieves these optimal bounds by a combination of existing parallel techniques (applied in novel ways) and a new technique, called accelerated valley filling. Parallel algorithms f...

Full description

Saved in:
Bibliographic Details
Published in:Parallel and Distributed Processing, 2nd IEEE Symposium On pp. 293 - 300
Main Authors: Kirkpatrick, D.G., Przytycka, T.
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1990
Subjects:
Acceleration
Algorithm design and analysis
Binary search trees
Binary trees
Computer science
Cost function
Filling
Minimax techniques
Parallel algorithms
Phase change random access memory
ISBN:0818620870, 9780818620874
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented. The algorithm achieves these optimal bounds by a combination of existing parallel techniques (applied in novel ways) and a new technique, called accelerated valley filling. Parallel algorithms for several other versions of the minimax tree problem are also discussed.< >
AbstractList An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented. The algorithm achieves these optimal bounds by a combination of existing parallel techniques (applied in novel ways) and a new technique, called accelerated valley filling. Parallel algorithms for several other versions of the minimax tree problem are also discussed.< >
Author Kirkpatrick, D.G.
Przytycka, T.
Author_xml – sequence: 1
  givenname: D.G.
  surname: Kirkpatrick
  fullname: Kirkpatrick, D.G.
  organization: British Columbia Univ., Vancouver, BC, Canada
– sequence: 2
  givenname: T.
  surname: Przytycka
  fullname: Przytycka, T.
  organization: British Columbia Univ., Vancouver, BC, Canada
BookMark eNotT01LAzEUDKigrb2Lp5yFrclu3iY5lvoJBQv2Xl7ii0ayH2T3oP_eQJ3LMAMz782CnfdDT4zdSLGWUtj79_3Dfi2tLVI1APKMLYSRpq2F0eKSrabpWxQAFEtdsbtNz4dxjh0mPmLGlCjxLvbF-OFzJuKYPocc56_uml0ETBOt_nnJDk-Ph-1LtXt7ft1udlU0dq4AhG10KCecD402CGQhkALrtXMgPrT0hF5ZdFarVqnWuVoGHerat1giS3Z7qo1EdBxz-ST_Hk9jmj_2UkEL
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SPDP.1990.143551
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore Digital Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 300
ExternalDocumentID 143551
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i89t-550937f000bcf378a5e95fe459c7bb50d71ceac49ab9746446bb21f7f22c6acf3
IEDL.DBID RIE
ISBN 0818620870
9780818620874
IngestDate Tue Aug 26 17:03:07 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i89t-550937f000bcf378a5e95fe459c7bb50d71ceac49ab9746446bb21f7f22c6acf3
PageCount 8
ParticipantIDs ieee_primary_143551
PublicationCentury 1900
PublicationDate 19900000
PublicationDateYYYYMMDD 1990-01-01
PublicationDate_xml – year: 1990
  text: 19900000
PublicationDecade 1990
PublicationTitle Parallel and Distributed Processing, 2nd IEEE Symposium On
PublicationTitleAbbrev SPDP
PublicationYear 1990
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000558624
Score 1.2145636
Snippet An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented. The algorithm achieves these optimal bounds by a...
SourceID ieee
SourceType Publisher
StartPage 293
SubjectTerms Acceleration
Algorithm design and analysis
Binary search trees
Binary trees
Computer science
Cost function
Filling
Minimax techniques
Parallel algorithms
Phase change random access memory
Title An optimal parallel minimax tree algorithm
URI https://ieeexplore.ieee.org/document/143551
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA86PHiazonf5OBJqGu75uso6vAgo-AOu40ke9FB18rsxD_fl7SbCF68JYGUvjTJ--rv9wi5HlrprGQZnjSnowzmSWTSjEUKPNCRWwkuAIWfxXgsp1OVtzzbAQsDAOHnM7j1zZDLn1d27UNlA6_bPVx6VwjeQLW24ZSYMQ91CAyPCbZi3Ictv86mn22ylLEavOQPuQfqYTc881dtlaBaRt1_vdQB6f9A9Gi-VT6HZAfKHuluajTQ9sgekZu7klZ4LSx1QT3Nd1FAQT2fyFJ_UZ-Rprp4rVaL-m3ZJ5PR4-T-KWrrI0QLqeoIfQu0LRzKbqwbCqkZKOYgY8oKY1g8F4nFazVT2qDTgHYPNyZNnHBparnGKcekU1YlnBDK0QszgMOcQSaNNsZajrad53bHhXOnpOcFn703DBizRuazP0fPyb5f2CZMcUE69WoNl2TPftaLj9VV-GrfbRCUSQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA8yBT1N58T5mYMnoa7tkrY5ijomzlFwh91Gkr3ooGtlduKf70vaTQQv3pJASl-a5H3193uEXPV0YnTCGZ40Iz0Gs8BTIeOeAAt0jHQCxgGFh_FolEwmIq15th0WBgDcz2dwY5sulz8r9MqGyrpWt1u49DZnLPQrsNYmoOJzbsEOjuMxwJaPO7Fm2Fn32TpP6YvuS3qfWqgedt1Tf1VXccql3_zXa-2T9g9Ij6Yb9XNAtiBvkea6SgOtD-0hub7NaYEXw0Jm1BJ9Zxlk1DKKLOQXtTlpKrPXYjkv3xZtMu4_jO8GXl0hwZsnovTQu0DrwqDsSptenEgOghtgXOhYKe7P4kDjxcqEVOg2oOUTKRUGJjZhqCOJU45IIy9yOCY0Qj9MAQ5HHFiipFJaR2jdWXZ3XDjTIS0r-PS94sCYVjKf_Dl6SXYH4-fhdPg4ejole3aRq6DFGWmUyxWckx39Wc4_lhfuC34DWgKXkA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Parallel+and+Distributed+Processing%2C+2nd+IEEE+Symposium+On&rft.atitle=An+optimal+parallel+minimax+tree+algorithm&rft.au=Kirkpatrick%2C+D.G.&rft.au=Przytycka%2C+T.&rft.date=1990-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818620874&rft.spage=293&rft.epage=300&rft_id=info:doi/10.1109%2FSPDP.1990.143551&rft.externalDocID=143551
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/sc.gif&client=summon&freeimage=true