컨텐츠로 이동
Dynamic optimality and multi-splay trees 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

Dynamic optimality and multi-splay trees

저자: Daniel D Sleator; Chengwen Chris Wang
출판사: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2004]
시리즈: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
판/형식:   Print book : 영어
데이터베이스:WorldCat
요약:
Abstract: "The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tango, a BST  더 읽기…
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

온라인으로 문서 찾기

이 항목에 대한 링크

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

자료 유형: 인터넷 자료
문서 형식: 책, 인터넷 자원
모든 저자 / 참여자: Daniel D Sleator; Chengwen Chris Wang
OCLC 번호: 57217789
메모: "November 5, 2004."
설명: 12 pages : illustrations ; 28 cm.
일련 제목: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
책임: Daniel Dominic Sleator and Chengwen Chris Wang.

초록:

Abstract: "The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tango, a BST algorithm which is nearly dynamically optimal -- its competitive ratio is O(log log n) instead of a constant. Unfortunately, for many access patterns, tango is worse than other BST algorithms by a factor of log log n. In this paper we introduce multi-splay trees, which can be viewed as a variant of splay trees. We prove the multi-splay access lemma, which resembles the access lemma for splay trees. With different assignment of weights, this lemma allows us to prove various bounds on the performance of multi-splay trees. Specifically, we prove that multi-splay trees are O(log log n)-competitive, and amortized O(log n). This is the first BST data structure to simultaneously achieve these two bounds. In addition, the algorithm is simple enough that we include code for its key parts."

리뷰

사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


Primary Entity

<http://www.worldcat.org/oclc/57217789> # Dynamic optimality and multi-splay trees
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "57217789" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/17589306#Place/pittsburgh_pa> ; # Pittsburgh, Pa.
   schema:about <http://dewey.info/class/510.7808/> ;
   schema:about <http://id.worldcat.org/fast/868980> ; # Combinatorial optimization
   schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
   schema:about <http://id.worldcat.org/fast/1156136> ; # Trees (Graph theory)
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/17589306#Person/wang_chengwen_chris> ; # Chengwen Chris Wang
   schema:creator <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
   schema:datePublished "2004" ;
   schema:description "Abstract: "The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tango, a BST algorithm which is nearly dynamically optimal -- its competitive ratio is O(log log n) instead of a constant. Unfortunately, for many access patterns, tango is worse than other BST algorithms by a factor of log log n. In this paper we introduce multi-splay trees, which can be viewed as a variant of splay trees. We prove the multi-splay access lemma, which resembles the access lemma for splay trees. With different assignment of weights, this lemma allows us to prove various bounds on the performance of multi-splay trees. Specifically, we prove that multi-splay trees are O(log log n)-competitive, and amortized O(log n). This is the first BST data structure to simultaneously achieve these two bounds. In addition, the algorithm is simple enough that we include code for its key parts.""@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/17589306> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/17589306#Series/research_paper_carnegie_mellon_university_school_of_computer_science> ; # Research paper (Carnegie Mellon University. School of Computer Science) ;
   schema:name "Dynamic optimality and multi-splay trees"@en ;
   schema:productID "57217789" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/57217789#PublicationEvent/pittsburgh_pa_school_of_computer_science_carnegie_mellon_university_2004> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/17589306#Agent/school_of_computer_science_carnegie_mellon_university> ; # School of Computer Science, Carnegie Mellon University
   schema:url <http://doi.library.cmu.edu/10.1184/OCLC/57217789> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/57217789> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/17589306#Agent/school_of_computer_science_carnegie_mellon_university> # School of Computer Science, Carnegie Mellon University
    a bgn:Agent ;
   schema:name "School of Computer Science, Carnegie Mellon University" ;
    .

<http://experiment.worldcat.org/entity/work/data/17589306#Person/wang_chengwen_chris> # Chengwen Chris Wang
    a schema:Person ;
   schema:familyName "Wang" ;
   schema:givenName "Chengwen Chris" ;
   schema:name "Chengwen Chris Wang" ;
    .

<http://experiment.worldcat.org/entity/work/data/17589306#Place/pittsburgh_pa> # Pittsburgh, Pa.
    a schema:Place ;
   schema:name "Pittsburgh, Pa." ;
    .

<http://experiment.worldcat.org/entity/work/data/17589306#Series/research_paper_carnegie_mellon_university_school_of_computer_science> # Research paper (Carnegie Mellon University. School of Computer Science) ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/57217789> ; # Dynamic optimality and multi-splay trees
   schema:name "Research paper (Carnegie Mellon University. School of Computer Science) ;" ;
   schema:name "[Research paper] / Carnegie Mellon University. School of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/1156136> # Trees (Graph theory)
    a schema:Intangible ;
   schema:name "Trees (Graph theory)"@en ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
   schema:name "Algorithms"@en ;
    .

<http://id.worldcat.org/fast/868980> # Combinatorial optimization
    a schema:Intangible ;
   schema:name "Combinatorial optimization"@en ;
    .

<http://viaf.org/viaf/54241399> # Daniel Dominic Sleator
    a schema:Person ;
   schema:birthDate "1953" ;
   schema:familyName "Sleator" ;
   schema:givenName "Daniel Dominic" ;
   schema:givenName "Daniel D." ;
   schema:name "Daniel Dominic Sleator" ;
    .


Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.