Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Balanced Trees)`

.
Showing records 1 – 5 of
5 total matches.

▼ Search Limiters

Princeton University

1. Sen, Siddhartha. New Systems and Algorithms for Scalable Fault Tolerance .

Degree: PhD, 2013, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp01mc87pq32q

► Users of Internet services are increasingly intolerant of delays and outages, while demanding a consistent online experience. A website that is down or misbehaving is…
(more)

Subjects/Keywords: balanced trees; Byzantine fault tolerance; database access methods; expander graphs; join-leave attacks; partial broadcast

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sen, S. (2013). New Systems and Algorithms for Scalable Fault Tolerance . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01mc87pq32q

Chicago Manual of Style (16^{th} Edition):

Sen, Siddhartha. “New Systems and Algorithms for Scalable Fault Tolerance .” 2013. Doctoral Dissertation, Princeton University. Accessed January 17, 2020. http://arks.princeton.edu/ark:/88435/dsp01mc87pq32q.

MLA Handbook (7^{th} Edition):

Sen, Siddhartha. “New Systems and Algorithms for Scalable Fault Tolerance .” 2013. Web. 17 Jan 2020.

Vancouver:

Sen S. New Systems and Algorithms for Scalable Fault Tolerance . [Internet] [Doctoral dissertation]. Princeton University; 2013. [cited 2020 Jan 17]. Available from: http://arks.princeton.edu/ark:/88435/dsp01mc87pq32q.

Council of Science Editors:

Sen S. New Systems and Algorithms for Scalable Fault Tolerance . [Doctoral Dissertation]. Princeton University; 2013. Available from: http://arks.princeton.edu/ark:/88435/dsp01mc87pq32q

University of the Western Cape

2.
Sayed, Hassan Adelyar.
The Complexity of Splay *Trees* and Skip Lists
.

Degree: 2008, University of the Western Cape

URL: http://hdl.handle.net/11394/2465

► Our main results are that splay *trees* are faster for sorted insertion, where AVL *trees* are faster for random insertion. For searching, skip lists are…
(more)

Subjects/Keywords: Binary Search Trees; Balanced Trees; AVL Trees; Self-adjusting Trees; Bottom-up Splay Trees

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sayed, H. A. (2008). The Complexity of Splay Trees and Skip Lists . (Thesis). University of the Western Cape. Retrieved from http://hdl.handle.net/11394/2465

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Sayed, Hassan Adelyar. “The Complexity of Splay Trees and Skip Lists .” 2008. Thesis, University of the Western Cape. Accessed January 17, 2020. http://hdl.handle.net/11394/2465.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sayed, Hassan Adelyar. “The Complexity of Splay Trees and Skip Lists .” 2008. Web. 17 Jan 2020.

Vancouver:

Sayed HA. The Complexity of Splay Trees and Skip Lists . [Internet] [Thesis]. University of the Western Cape; 2008. [cited 2020 Jan 17]. Available from: http://hdl.handle.net/11394/2465.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sayed HA. The Complexity of Splay Trees and Skip Lists . [Thesis]. University of the Western Cape; 2008. Available from: http://hdl.handle.net/11394/2465

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

3. Hassan, Ahmed Mohamed Elsayed. Designing, Modeling, and Optimizing Transactional Data Structures.

Degree: PhD, Electrical and Computer Engineering, 2015, Virginia Tech

URL: http://hdl.handle.net/10919/56656

► Transactional memory (TM) has emerged as a promising synchronization abstraction for multi-core architectures. Unlike traditional lock-based approaches, TM shifts the burden of implementing threads synchronization…
(more)

Subjects/Keywords: Transactional Memory; STM; HTM; Transactional Boosting; Concurrent Data Structures; Optimistic Semantic Synchronization; Lazy List; Balanced Trees; Hybrid Transactions; Semantic Validation; Remote Transaction Commit; Modeling; Linearizability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hassan, A. M. E. (2015). Designing, Modeling, and Optimizing Transactional Data Structures. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/56656

Chicago Manual of Style (16^{th} Edition):

Hassan, Ahmed Mohamed Elsayed. “Designing, Modeling, and Optimizing Transactional Data Structures.” 2015. Doctoral Dissertation, Virginia Tech. Accessed January 17, 2020. http://hdl.handle.net/10919/56656.

MLA Handbook (7^{th} Edition):

Hassan, Ahmed Mohamed Elsayed. “Designing, Modeling, and Optimizing Transactional Data Structures.” 2015. Web. 17 Jan 2020.

Vancouver:

Hassan AME. Designing, Modeling, and Optimizing Transactional Data Structures. [Internet] [Doctoral dissertation]. Virginia Tech; 2015. [cited 2020 Jan 17]. Available from: http://hdl.handle.net/10919/56656.

Council of Science Editors:

Hassan AME. Designing, Modeling, and Optimizing Transactional Data Structures. [Doctoral Dissertation]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/56656

University of Akron

4. Sands, William Alvah. Phylogenetic Inference Using a Discrete-Integer Linear Programming Model.

Degree: MS, Applied Mathematics, 2017, University of Akron

URL: http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802

► Combinatorial methods have proved to be useful in generating relaxations of polytopes in various areas of mathematical programming. In this work, we propose a discrete-integer…
(more)

Subjects/Keywords: Applied Mathematics; Biology; Phylogenetics; Trees; Distance Methods; Balanced Minimal Evolution; Polytopes; Relaxation; Linear Programming; Discrete Constraints; Branch and Bound; Heuristic; Large Neighborhood Search

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sands, W. A. (2017). Phylogenetic Inference Using a Discrete-Integer Linear Programming Model. (Masters Thesis). University of Akron. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802

Chicago Manual of Style (16^{th} Edition):

Sands, William Alvah. “Phylogenetic Inference Using a Discrete-Integer Linear Programming Model.” 2017. Masters Thesis, University of Akron. Accessed January 17, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802.

MLA Handbook (7^{th} Edition):

Sands, William Alvah. “Phylogenetic Inference Using a Discrete-Integer Linear Programming Model.” 2017. Web. 17 Jan 2020.

Vancouver:

Sands WA. Phylogenetic Inference Using a Discrete-Integer Linear Programming Model. [Internet] [Masters thesis]. University of Akron; 2017. [cited 2020 Jan 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802.

Council of Science Editors:

Sands WA. Phylogenetic Inference Using a Discrete-Integer Linear Programming Model. [Masters Thesis]. University of Akron; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802

University of Victoria

5. Williams, Aaron Michael. Shift gray codes.

Degree: Dept. of Computer Science, 2009, University of Victoria

URL: http://hdl.handle.net/1828/1966

► Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding…
(more)

Subjects/Keywords: shorthand universal cycles; combinatorial generation; minimal-change order; loopless algorithm; efficient algorithm; combinations; multiset permutations; balanced parentheses; Dyck words; Catalan paths; Schroder paths; Motzkin words; linear-extensions; posets; connected unit interval graphs; inversions; binary trees; k-ary trees; ordered trees with fixed branching sequence; Lyndon words; pre-necklaces; theoretical computer science; discrete mathematics; combinatorics; brute forcs; de Bruijn cycles; bubble languages; cool-lex order; lexicographic order; combinatorial enumeration; stacker-crane problem; traveling salesman problem; middle levels; fixed-density de Bruijn cycle; fixed-content; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science; UVic Subject Index::Sciences and Engineering::Mathematics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Williams, A. M. (2009). Shift gray codes. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1966

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Williams, Aaron Michael. “Shift gray codes.” 2009. Thesis, University of Victoria. Accessed January 17, 2020. http://hdl.handle.net/1828/1966.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Williams, Aaron Michael. “Shift gray codes.” 2009. Web. 17 Jan 2020.

Vancouver:

Williams AM. Shift gray codes. [Internet] [Thesis]. University of Victoria; 2009. [cited 2020 Jan 17]. Available from: http://hdl.handle.net/1828/1966.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Williams AM. Shift gray codes. [Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/1966

Not specified: Masters Thesis or Doctoral Dissertation