Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(data structures). Showing records 1 – 30 of 511 total matches.

[1] [2] [3] [4] [5] … [18]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Carpen-Amarie, Maria. Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers.

Degree: 2017, Université de Neuchâtel

 De nos jours les systèmes multi-cœurs sont omniprésents. La conception des applications demande de plus en plus un moyen de synchronisation plus léger, ainsi qu'une… (more)

Subjects/Keywords: data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carpen-Amarie, M. (2017). Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers. (Thesis). Université de Neuchâtel. Retrieved from http://doc.rero.ch/record/309503

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Carpen-Amarie, Maria. “Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers.” 2017. Thesis, Université de Neuchâtel. Accessed January 26, 2021. http://doc.rero.ch/record/309503.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Carpen-Amarie, Maria. “Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers.” 2017. Web. 26 Jan 2021.

Vancouver:

Carpen-Amarie M. Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers. [Internet] [Thesis]. Université de Neuchâtel; 2017. [cited 2021 Jan 26]. Available from: http://doc.rero.ch/record/309503.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Carpen-Amarie M. Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers. [Thesis]. Université de Neuchâtel; 2017. Available from: http://doc.rero.ch/record/309503

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

2. Sharma, Manoj Kumar. A Design Space for Distributed Producer-Consumer Data Structures Using RDMA.

Degree: 2020, University of Waterloo

 Remote Direct Memory Access (RDMA) has become a standard networking technology and is prominently used in high-performance applications. While RDMA can provide both excellent performance… (more)

Subjects/Keywords: Distributed Data Structures; Flow Structures; RDMA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sharma, M. K. (2020). A Design Space for Distributed Producer-Consumer Data Structures Using RDMA. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16163

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sharma, Manoj Kumar. “A Design Space for Distributed Producer-Consumer Data Structures Using RDMA.” 2020. Thesis, University of Waterloo. Accessed January 26, 2021. http://hdl.handle.net/10012/16163.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sharma, Manoj Kumar. “A Design Space for Distributed Producer-Consumer Data Structures Using RDMA.” 2020. Web. 26 Jan 2021.

Vancouver:

Sharma MK. A Design Space for Distributed Producer-Consumer Data Structures Using RDMA. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10012/16163.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sharma MK. A Design Space for Distributed Producer-Consumer Data Structures Using RDMA. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16163

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

3. Zhou, Gelin. In-Memory Storage for Labeled Tree-Structured Data.

Degree: 2017, University of Waterloo

 In this thesis, we design in-memory data structures for labeled and weights trees, so that various types of path queries or operations can be supported… (more)

Subjects/Keywords: Data Structures; Path Queries; Labeled Trees; Succinct Data Structures; Space-efficient Data Structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, G. (2017). In-Memory Storage for Labeled Tree-Structured Data. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11500

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zhou, Gelin. “In-Memory Storage for Labeled Tree-Structured Data.” 2017. Thesis, University of Waterloo. Accessed January 26, 2021. http://hdl.handle.net/10012/11500.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zhou, Gelin. “In-Memory Storage for Labeled Tree-Structured Data.” 2017. Web. 26 Jan 2021.

Vancouver:

Zhou G. In-Memory Storage for Labeled Tree-Structured Data. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10012/11500.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhou G. In-Memory Storage for Labeled Tree-Structured Data. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11500

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rutgers University

4. Zhang, Yayan, 1986-. Data normalization and clustering for big and small data and an application to clinical trials.

Degree: PhD, Statistics and Biostatistics, 2015, Rutgers University

The purpose of this thesis is to propose new methodology for data normalization and cluster prediction in order to help us unravel the structure of… (more)

Subjects/Keywords: Data structures (Computer science); Statistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Yayan, 1. (2015). Data normalization and clustering for big and small data and an application to clinical trials. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/47619/

Chicago Manual of Style (16th Edition):

Zhang, Yayan, 1986-. “Data normalization and clustering for big and small data and an application to clinical trials.” 2015. Doctoral Dissertation, Rutgers University. Accessed January 26, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/47619/.

MLA Handbook (7th Edition):

Zhang, Yayan, 1986-. “Data normalization and clustering for big and small data and an application to clinical trials.” 2015. Web. 26 Jan 2021.

Vancouver:

Zhang, Yayan 1. Data normalization and clustering for big and small data and an application to clinical trials. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2021 Jan 26]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47619/.

Council of Science Editors:

Zhang, Yayan 1. Data normalization and clustering for big and small data and an application to clinical trials. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47619/


Virginia Tech

5. Bock, Matthew. A Framework for Hadoop Based Digital Libraries of Tweets.

Degree: MS, Computer Science and Applications, 2017, Virginia Tech

 The Digital Library Research Laboratory (DLRL) has collected over 1.5 billion tweets for the Integrated Digital Event Archiving and Library (IDEAL) and Global Event Trend… (more)

Subjects/Keywords: big data; digital libraries; data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bock, M. (2017). A Framework for Hadoop Based Digital Libraries of Tweets. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78351

Chicago Manual of Style (16th Edition):

Bock, Matthew. “A Framework for Hadoop Based Digital Libraries of Tweets.” 2017. Masters Thesis, Virginia Tech. Accessed January 26, 2021. http://hdl.handle.net/10919/78351.

MLA Handbook (7th Edition):

Bock, Matthew. “A Framework for Hadoop Based Digital Libraries of Tweets.” 2017. Web. 26 Jan 2021.

Vancouver:

Bock M. A Framework for Hadoop Based Digital Libraries of Tweets. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10919/78351.

Council of Science Editors:

Bock M. A Framework for Hadoop Based Digital Libraries of Tweets. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/78351


University of Waterloo

6. Cepeda, Diego. EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory.

Degree: 2020, University of Waterloo

 Volatile memory has dominated the realm of main memory on servers and computers for a long time. In 2019, Intel released to the public the… (more)

Subjects/Keywords: persistent memory; hash table; recoverable data structures; concurrent data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cepeda, D. (2020). EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16193

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Cepeda, Diego. “EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory.” 2020. Thesis, University of Waterloo. Accessed January 26, 2021. http://hdl.handle.net/10012/16193.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cepeda, Diego. “EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory.” 2020. Web. 26 Jan 2021.

Vancouver:

Cepeda D. EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10012/16193.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cepeda D. EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16193

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

7. Pratt, Simon. Three Approaches to Building Time-Windowed Geometric Data Structures.

Degree: 2016, University of Waterloo

 Given a set of geometric objects (points or line segments) each associated with a time value, we wish to determine whether a given property is… (more)

Subjects/Keywords: computational geometry; geometric data structures; data structures; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pratt, S. (2016). Three Approaches to Building Time-Windowed Geometric Data Structures. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10654

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pratt, Simon. “Three Approaches to Building Time-Windowed Geometric Data Structures.” 2016. Thesis, University of Waterloo. Accessed January 26, 2021. http://hdl.handle.net/10012/10654.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pratt, Simon. “Three Approaches to Building Time-Windowed Geometric Data Structures.” 2016. Web. 26 Jan 2021.

Vancouver:

Pratt S. Three Approaches to Building Time-Windowed Geometric Data Structures. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10012/10654.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pratt S. Three Approaches to Building Time-Windowed Geometric Data Structures. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10654

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Rochester

8. Rovner, Paul D. Automatic Representation Selection for Associative Data Structures.

Degree: PhD, 2011, University of Rochester

 The selection of efficient storage representations for high-level data structures is a design problem that is ready for systematic analysis. This thesis is about automating… (more)

Subjects/Keywords: efficient storage; associative data structures; automating; SAIL

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rovner, P. D. (2011). Automatic Representation Selection for Associative Data Structures. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/13790

Chicago Manual of Style (16th Edition):

Rovner, Paul D. “Automatic Representation Selection for Associative Data Structures.” 2011. Doctoral Dissertation, University of Rochester. Accessed January 26, 2021. http://hdl.handle.net/1802/13790.

MLA Handbook (7th Edition):

Rovner, Paul D. “Automatic Representation Selection for Associative Data Structures.” 2011. Web. 26 Jan 2021.

Vancouver:

Rovner PD. Automatic Representation Selection for Associative Data Structures. [Internet] [Doctoral dissertation]. University of Rochester; 2011. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/1802/13790.

Council of Science Editors:

Rovner PD. Automatic Representation Selection for Associative Data Structures. [Doctoral Dissertation]. University of Rochester; 2011. Available from: http://hdl.handle.net/1802/13790


Mississippi State University

9. Mohanty, Somya Darsan. Ordered Merkle Tree - a versatile data-structure for security kernels.

Degree: PhD, Computer Science and Engineering, 2013, Mississippi State University

  Hidden undesired functionality is an unavoidable reality in any complex hardware or software component. Undesired functionality deliberately introduced Trojan horses or accidentally introduced bugsin… (more)

Subjects/Keywords: Authenticated Data-Structures; Trustworthy Computing; Security Kernels

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mohanty, S. D. (2013). Ordered Merkle Tree - a versatile data-structure for security kernels. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-06242013-124105/ ;

Chicago Manual of Style (16th Edition):

Mohanty, Somya Darsan. “Ordered Merkle Tree - a versatile data-structure for security kernels.” 2013. Doctoral Dissertation, Mississippi State University. Accessed January 26, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-06242013-124105/ ;.

MLA Handbook (7th Edition):

Mohanty, Somya Darsan. “Ordered Merkle Tree - a versatile data-structure for security kernels.” 2013. Web. 26 Jan 2021.

Vancouver:

Mohanty SD. Ordered Merkle Tree - a versatile data-structure for security kernels. [Internet] [Doctoral dissertation]. Mississippi State University; 2013. [cited 2021 Jan 26]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06242013-124105/ ;.

Council of Science Editors:

Mohanty SD. Ordered Merkle Tree - a versatile data-structure for security kernels. [Doctoral Dissertation]. Mississippi State University; 2013. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06242013-124105/ ;


Texas A&M University

10. Milan, Maxwell. Lightning Interaction with Lighter-Than-Air Platforms.

Degree: MS, Civil Engineering, 2018, Texas A&M University

 Understanding the behavior of lightning and modeling its physical effects is of great importance with regard to structures subjected to lightning strikes. In this study,… (more)

Subjects/Keywords: lightning; physics; satellite data; grounded airborne structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Milan, M. (2018). Lightning Interaction with Lighter-Than-Air Platforms. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/173802

Chicago Manual of Style (16th Edition):

Milan, Maxwell. “Lightning Interaction with Lighter-Than-Air Platforms.” 2018. Masters Thesis, Texas A&M University. Accessed January 26, 2021. http://hdl.handle.net/1969.1/173802.

MLA Handbook (7th Edition):

Milan, Maxwell. “Lightning Interaction with Lighter-Than-Air Platforms.” 2018. Web. 26 Jan 2021.

Vancouver:

Milan M. Lightning Interaction with Lighter-Than-Air Platforms. [Internet] [Masters thesis]. Texas A&M University; 2018. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/1969.1/173802.

Council of Science Editors:

Milan M. Lightning Interaction with Lighter-Than-Air Platforms. [Masters Thesis]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/173802


Texas A&M University

11. Milan, Maxwell. Lightning Interaction with Lighter-Than-Air Platforms.

Degree: MS, Civil Engineering, 2018, Texas A&M University

 Understanding the behavior of lightning and modeling its physical effects is of great importance with regard to structures subjected to lightning strikes. In this study,… (more)

Subjects/Keywords: lightning; physics; satellite data; grounded airborne structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Milan, M. (2018). Lightning Interaction with Lighter-Than-Air Platforms. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/173707

Chicago Manual of Style (16th Edition):

Milan, Maxwell. “Lightning Interaction with Lighter-Than-Air Platforms.” 2018. Masters Thesis, Texas A&M University. Accessed January 26, 2021. http://hdl.handle.net/1969.1/173707.

MLA Handbook (7th Edition):

Milan, Maxwell. “Lightning Interaction with Lighter-Than-Air Platforms.” 2018. Web. 26 Jan 2021.

Vancouver:

Milan M. Lightning Interaction with Lighter-Than-Air Platforms. [Internet] [Masters thesis]. Texas A&M University; 2018. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/1969.1/173707.

Council of Science Editors:

Milan M. Lightning Interaction with Lighter-Than-Air Platforms. [Masters Thesis]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/173707


Northeastern University

12. Catalano, Dominic J. The Nearly Optimal N-ary Search Tree.

Degree: MS, Department of Electrical and Computer Engineering, 2016, Northeastern University

 As the scale and importance of data increases, so does the task of information retrieval. Currently, the best methodology for index based structures offers a… (more)

Subjects/Keywords: data structures; optimized search; search trees

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Catalano, D. J. (2016). The Nearly Optimal N-ary Search Tree. (Masters Thesis). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20253673

Chicago Manual of Style (16th Edition):

Catalano, Dominic J. “The Nearly Optimal N-ary Search Tree.” 2016. Masters Thesis, Northeastern University. Accessed January 26, 2021. http://hdl.handle.net/2047/D20253673.

MLA Handbook (7th Edition):

Catalano, Dominic J. “The Nearly Optimal N-ary Search Tree.” 2016. Web. 26 Jan 2021.

Vancouver:

Catalano DJ. The Nearly Optimal N-ary Search Tree. [Internet] [Masters thesis]. Northeastern University; 2016. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/2047/D20253673.

Council of Science Editors:

Catalano DJ. The Nearly Optimal N-ary Search Tree. [Masters Thesis]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20253673


University of Exeter

13. Fieldsend, Jonathan E. Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training.

Degree: PhD, 2003, University of Exeter

Subjects/Keywords: 006; Data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fieldsend, J. E. (2003). Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training. (Doctoral Dissertation). University of Exeter. Retrieved from http://hdl.handle.net/10871/11706

Chicago Manual of Style (16th Edition):

Fieldsend, Jonathan E. “Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training.” 2003. Doctoral Dissertation, University of Exeter. Accessed January 26, 2021. http://hdl.handle.net/10871/11706.

MLA Handbook (7th Edition):

Fieldsend, Jonathan E. “Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training.” 2003. Web. 26 Jan 2021.

Vancouver:

Fieldsend JE. Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training. [Internet] [Doctoral dissertation]. University of Exeter; 2003. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10871/11706.

Council of Science Editors:

Fieldsend JE. Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training. [Doctoral Dissertation]. University of Exeter; 2003. Available from: http://hdl.handle.net/10871/11706


Reykjavík University

14. Steinunn Gróa Sigurðardóttir 1987-. Wilf-classification of mesh patterns of short length .

Degree: 2011, Reykjavík University

 This B.Sc. project deals with mesh pattern avoidance in permutations. A mesh pattern is a pair P=(p,R), where p is a permutation of length k… (more)

Subjects/Keywords: Gagnaskipan; Tölvunarfræði; Data structures (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

1987-, S. G. S. (2011). Wilf-classification of mesh patterns of short length . (Thesis). Reykjavík University. Retrieved from http://hdl.handle.net/1946/9181

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

1987-, Steinunn Gróa Sigurðardóttir. “Wilf-classification of mesh patterns of short length .” 2011. Thesis, Reykjavík University. Accessed January 26, 2021. http://hdl.handle.net/1946/9181.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

1987-, Steinunn Gróa Sigurðardóttir. “Wilf-classification of mesh patterns of short length .” 2011. Web. 26 Jan 2021.

Vancouver:

1987- SGS. Wilf-classification of mesh patterns of short length . [Internet] [Thesis]. Reykjavík University; 2011. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/1946/9181.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

1987- SGS. Wilf-classification of mesh patterns of short length . [Thesis]. Reykjavík University; 2011. Available from: http://hdl.handle.net/1946/9181

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

15. Valliyil Thankachan, Sharma. Space-efficient data structures for string searching and retrieval.

Degree: PhD, Computer Sciences, 2013, Louisiana State University

 Let D = {d_1, d_2, ...} be a collection of string documents of n characters in total, which are drawn from an alphabet set Sigma… (more)

Subjects/Keywords: Data Structures; String Searching; Retrieval; Top-k

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Valliyil Thankachan, S. (2013). Space-efficient data structures for string searching and retrieval. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-01162014-201105 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2848

Chicago Manual of Style (16th Edition):

Valliyil Thankachan, Sharma. “Space-efficient data structures for string searching and retrieval.” 2013. Doctoral Dissertation, Louisiana State University. Accessed January 26, 2021. etd-01162014-201105 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2848.

MLA Handbook (7th Edition):

Valliyil Thankachan, Sharma. “Space-efficient data structures for string searching and retrieval.” 2013. Web. 26 Jan 2021.

Vancouver:

Valliyil Thankachan S. Space-efficient data structures for string searching and retrieval. [Internet] [Doctoral dissertation]. Louisiana State University; 2013. [cited 2021 Jan 26]. Available from: etd-01162014-201105 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2848.

Council of Science Editors:

Valliyil Thankachan S. Space-efficient data structures for string searching and retrieval. [Doctoral Dissertation]. Louisiana State University; 2013. Available from: etd-01162014-201105 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2848


University of Cincinnati

16. Sun, Shuyan. A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data.

Degree: PhD, Education, Criminal Justice, and Human Services: Educational Studies, 2012, University of Cincinnati

  Multilevel nonnested data structures are common in many research areas. The traditional hierarchical linear modeling requires purely nested data structures and thus cannot be… (more)

Subjects/Keywords: Psychological Tests; Multilevel nonnested data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, S. (2012). A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337718150

Chicago Manual of Style (16th Edition):

Sun, Shuyan. “A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data.” 2012. Doctoral Dissertation, University of Cincinnati. Accessed January 26, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337718150.

MLA Handbook (7th Edition):

Sun, Shuyan. “A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data.” 2012. Web. 26 Jan 2021.

Vancouver:

Sun S. A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data. [Internet] [Doctoral dissertation]. University of Cincinnati; 2012. [cited 2021 Jan 26]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337718150.

Council of Science Editors:

Sun S. A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data. [Doctoral Dissertation]. University of Cincinnati; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337718150

17. Salikhov, Kamil. Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data.

Degree: Docteur es, Informatique, 2017, Université Paris-Est

Les volumes des données générées par les technologies de séquençage haut débit augmentent exponentiellement ce dernier temps. Le stockage, le traitement et le transfertdeviennent des… (more)

Subjects/Keywords: Structures de données; Algorithmes; L’indexation de séquences d’ADN; Data structures; Algorithms; DNA sequence data

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Salikhov, K. (2017). Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2017PESC1232

Chicago Manual of Style (16th Edition):

Salikhov, Kamil. “Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data.” 2017. Doctoral Dissertation, Université Paris-Est. Accessed January 26, 2021. http://www.theses.fr/2017PESC1232.

MLA Handbook (7th Edition):

Salikhov, Kamil. “Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data.” 2017. Web. 26 Jan 2021.

Vancouver:

Salikhov K. Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data. [Internet] [Doctoral dissertation]. Université Paris-Est; 2017. [cited 2021 Jan 26]. Available from: http://www.theses.fr/2017PESC1232.

Council of Science Editors:

Salikhov K. Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data. [Doctoral Dissertation]. Université Paris-Est; 2017. Available from: http://www.theses.fr/2017PESC1232


Portland State University

18. Archer, David William. Conceptual Modeling of Data with Provenance.

Degree: PhD, Computer Science, 2011, Portland State University

  Traditional database systems manage data, but often do not address its provenance. In the past, users were often implicitly familiar with data they used,… (more)

Subjects/Keywords: Database management; Electronic data processing; Data structures (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Archer, D. W. (2011). Conceptual Modeling of Data with Provenance. (Doctoral Dissertation). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/133

Chicago Manual of Style (16th Edition):

Archer, David William. “Conceptual Modeling of Data with Provenance.” 2011. Doctoral Dissertation, Portland State University. Accessed January 26, 2021. https://pdxscholar.library.pdx.edu/open_access_etds/133.

MLA Handbook (7th Edition):

Archer, David William. “Conceptual Modeling of Data with Provenance.” 2011. Web. 26 Jan 2021.

Vancouver:

Archer DW. Conceptual Modeling of Data with Provenance. [Internet] [Doctoral dissertation]. Portland State University; 2011. [cited 2021 Jan 26]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/133.

Council of Science Editors:

Archer DW. Conceptual Modeling of Data with Provenance. [Doctoral Dissertation]. Portland State University; 2011. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/133


Lincoln University

19. Cattermole, Richard. Web routers: an explorative performance review.

Degree: 2017, Lincoln University

 In society, today almost everybody has used the internet and by extension the World Wide Web. Over the past 30 years a lot of work… (more)

Subjects/Keywords: web; router; http; server; client; data structures; regex; performance; World Wide Web; optimization; 100504 Data Communications; 080403 Data Structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cattermole, R. (2017). Web routers: an explorative performance review. (Thesis). Lincoln University. Retrieved from http://hdl.handle.net/10182/8702

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Cattermole, Richard. “Web routers: an explorative performance review.” 2017. Thesis, Lincoln University. Accessed January 26, 2021. http://hdl.handle.net/10182/8702.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cattermole, Richard. “Web routers: an explorative performance review.” 2017. Web. 26 Jan 2021.

Vancouver:

Cattermole R. Web routers: an explorative performance review. [Internet] [Thesis]. Lincoln University; 2017. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10182/8702.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cattermole R. Web routers: an explorative performance review. [Thesis]. Lincoln University; 2017. Available from: http://hdl.handle.net/10182/8702

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Nelson Mandela Metropolitan University

20. Koekemoer, Silma Marguerite. A strategy towards implementing standardised data structures in municipal information systems.

Degree: 2020, Nelson Mandela Metropolitan University

 The regulation pertaining to a Standard Chart of Accounts (SCOA) for Municipalities was published in 2014 and is applicable to all 257 municipalities and municipal… (more)

Subjects/Keywords: Data structures (Computer science); Municipal government  – Data processing; Public administration  – Data processing; Management information systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koekemoer, S. M. (2020). A strategy towards implementing standardised data structures in municipal information systems. (Thesis). Nelson Mandela Metropolitan University. Retrieved from http://hdl.handle.net/10948/46064

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Koekemoer, Silma Marguerite. “A strategy towards implementing standardised data structures in municipal information systems.” 2020. Thesis, Nelson Mandela Metropolitan University. Accessed January 26, 2021. http://hdl.handle.net/10948/46064.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Koekemoer, Silma Marguerite. “A strategy towards implementing standardised data structures in municipal information systems.” 2020. Web. 26 Jan 2021.

Vancouver:

Koekemoer SM. A strategy towards implementing standardised data structures in municipal information systems. [Internet] [Thesis]. Nelson Mandela Metropolitan University; 2020. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10948/46064.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koekemoer SM. A strategy towards implementing standardised data structures in municipal information systems. [Thesis]. Nelson Mandela Metropolitan University; 2020. Available from: http://hdl.handle.net/10948/46064

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Columbia University

21. Lu, Feihan. Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine.

Degree: 2018, Columbia University

 Bayesian statistical procedures use probabilistic models and probability distributions to summarize data, estimate unknown quantities of interest, and predict future observations. The procedures borrow strength… (more)

Subjects/Keywords: Statistics; Bayesian statistical decision theory; Data structures (Computer science); Neurosciences – Data processing; Medicine – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, F. (2018). Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8VD8FXF

Chicago Manual of Style (16th Edition):

Lu, Feihan. “Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine.” 2018. Doctoral Dissertation, Columbia University. Accessed January 26, 2021. https://doi.org/10.7916/D8VD8FXF.

MLA Handbook (7th Edition):

Lu, Feihan. “Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine.” 2018. Web. 26 Jan 2021.

Vancouver:

Lu F. Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2021 Jan 26]. Available from: https://doi.org/10.7916/D8VD8FXF.

Council of Science Editors:

Lu F. Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D8VD8FXF


Durban University of Technology

22. Agbehadji, Israel Edem. Meta-heuristic search methods for big data analytics and visualization of frequently changed patterns.

Degree: 2019, Durban University of Technology

Submitted in fulfilment of the requirements of the degree of Doctor of Philosophy in Information Technology (IT), e Faculty of Accounting and Informatics, Durban University… (more)

Subjects/Keywords: Big data – South Africa; Data sets – South Africa; Data structures (Computer science); Computer-aided design

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Agbehadji, I. E. (2019). Meta-heuristic search methods for big data analytics and visualization of frequently changed patterns. (Thesis). Durban University of Technology. Retrieved from http://hdl.handle.net/10321/3372

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Agbehadji, Israel Edem. “Meta-heuristic search methods for big data analytics and visualization of frequently changed patterns.” 2019. Thesis, Durban University of Technology. Accessed January 26, 2021. http://hdl.handle.net/10321/3372.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Agbehadji, Israel Edem. “Meta-heuristic search methods for big data analytics and visualization of frequently changed patterns.” 2019. Web. 26 Jan 2021.

Vancouver:

Agbehadji IE. Meta-heuristic search methods for big data analytics and visualization of frequently changed patterns. [Internet] [Thesis]. Durban University of Technology; 2019. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10321/3372.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Agbehadji IE. Meta-heuristic search methods for big data analytics and visualization of frequently changed patterns. [Thesis]. Durban University of Technology; 2019. Available from: http://hdl.handle.net/10321/3372

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Maria, Clément. Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology.

Degree: Docteur es, Informatique, 2014, Nice

La théorie de l'homologie généralise en dimensions supérieures la notion de connectivité dans les graphes. Étant donné un domaine, décrit par un complexe simplicial, elle… (more)

Subjects/Keywords: Algorithmes; Structures de données; Complexes simpliciaux; Homologie persistante; Algorithms; Data structures; Simplicial complexes; Persistent homology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maria, C. (2014). Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology. (Doctoral Dissertation). Nice. Retrieved from http://www.theses.fr/2014NICE4081

Chicago Manual of Style (16th Edition):

Maria, Clément. “Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology.” 2014. Doctoral Dissertation, Nice. Accessed January 26, 2021. http://www.theses.fr/2014NICE4081.

MLA Handbook (7th Edition):

Maria, Clément. “Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology.” 2014. Web. 26 Jan 2021.

Vancouver:

Maria C. Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology. [Internet] [Doctoral dissertation]. Nice; 2014. [cited 2021 Jan 26]. Available from: http://www.theses.fr/2014NICE4081.

Council of Science Editors:

Maria C. Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology. [Doctoral Dissertation]. Nice; 2014. Available from: http://www.theses.fr/2014NICE4081


Brno University of Technology

24. Janeček, Jan. Řídicí a datové struktury v programovacích jazycích: Control and data structures in programming languages.

Degree: 2019, Brno University of Technology

 The essence of this work is to give basic information about the algorithm development and general pieces of knowledge of the structures in programming languages.… (more)

Subjects/Keywords: Řídicí struktury; datové struktury; programování; programovací jazyk; Control structures; data structures; programming; programming language

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Janeček, J. (2019). Řídicí a datové struktury v programovacích jazycích: Control and data structures in programming languages. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/18887

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Janeček, Jan. “Řídicí a datové struktury v programovacích jazycích: Control and data structures in programming languages.” 2019. Thesis, Brno University of Technology. Accessed January 26, 2021. http://hdl.handle.net/11012/18887.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Janeček, Jan. “Řídicí a datové struktury v programovacích jazycích: Control and data structures in programming languages.” 2019. Web. 26 Jan 2021.

Vancouver:

Janeček J. Řídicí a datové struktury v programovacích jazycích: Control and data structures in programming languages. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/11012/18887.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Janeček J. Řídicí a datové struktury v programovacích jazycích: Control and data structures in programming languages. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/18887

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Kanellou, Eleni. Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur.

Degree: Docteur es, Informatique, 2015, Rennes 1

Actuellement, la majorité des architectures de processeurs sont fondées sur une mémoire partagée avec cohérence de caches. Des prototypes intégrant de grandes quantités de cœurs,… (more)

Subjects/Keywords: Mémoire transactionnelle logicielle; Programmation concurrente; Structures de données; Structures de données (informatique); Stm; Concurrent programming; Data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kanellou, E. (2015). Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur. (Doctoral Dissertation). Rennes 1. Retrieved from http://www.theses.fr/2015REN1S171

Chicago Manual of Style (16th Edition):

Kanellou, Eleni. “Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur.” 2015. Doctoral Dissertation, Rennes 1. Accessed January 26, 2021. http://www.theses.fr/2015REN1S171.

MLA Handbook (7th Edition):

Kanellou, Eleni. “Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur.” 2015. Web. 26 Jan 2021.

Vancouver:

Kanellou E. Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur. [Internet] [Doctoral dissertation]. Rennes 1; 2015. [cited 2021 Jan 26]. Available from: http://www.theses.fr/2015REN1S171.

Council of Science Editors:

Kanellou E. Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur. [Doctoral Dissertation]. Rennes 1; 2015. Available from: http://www.theses.fr/2015REN1S171


University of Waterloo

26. Sigouin, William. Concurrent Data Structures Using Multiword Compare and Swap.

Degree: 2020, University of Waterloo

 To maximize the performance of concurrent data structures, researchers have turned to highly complex fine-grained techniques. Resulting algorithms are often extremely difficult to understand and… (more)

Subjects/Keywords: concurrency; data structures; search trees; lock-freedom; non-blocking; dynamic connectivity; Data structures (Computer science); Computer multitasking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sigouin, W. (2020). Concurrent Data Structures Using Multiword Compare and Swap. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15813

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sigouin, William. “Concurrent Data Structures Using Multiword Compare and Swap.” 2020. Thesis, University of Waterloo. Accessed January 26, 2021. http://hdl.handle.net/10012/15813.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sigouin, William. “Concurrent Data Structures Using Multiword Compare and Swap.” 2020. Web. 26 Jan 2021.

Vancouver:

Sigouin W. Concurrent Data Structures Using Multiword Compare and Swap. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10012/15813.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sigouin W. Concurrent Data Structures Using Multiword Compare and Swap. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15813

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

27. Zahradníček, Tomáš. Knihovna pro vizualizaci dynamických datových struktur: Library for Dynamic Data Structure Visualization.

Degree: 2019, Brno University of Technology

 This thesis deals with design and implementation of library for visualizing dynamic data structures as directed graphs. It also focuses on errors, that can occur… (more)

Subjects/Keywords: Vizualizace datových struktur; ladicí nástroj; dynamické datové struktury; Visualization of data structures; debugger; dynamic data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zahradníček, T. (2019). Knihovna pro vizualizaci dynamických datových struktur: Library for Dynamic Data Structure Visualization. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/69742

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zahradníček, Tomáš. “Knihovna pro vizualizaci dynamických datových struktur: Library for Dynamic Data Structure Visualization.” 2019. Thesis, Brno University of Technology. Accessed January 26, 2021. http://hdl.handle.net/11012/69742.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zahradníček, Tomáš. “Knihovna pro vizualizaci dynamických datových struktur: Library for Dynamic Data Structure Visualization.” 2019. Web. 26 Jan 2021.

Vancouver:

Zahradníček T. Knihovna pro vizualizaci dynamických datových struktur: Library for Dynamic Data Structure Visualization. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/11012/69742.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zahradníček T. Knihovna pro vizualizaci dynamických datových struktur: Library for Dynamic Data Structure Visualization. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/69742

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


RMIT University

28. Razavi Hesabi, Z. Mining complex data in highly streaming environments.

Degree: 2019, RMIT University

Data is growing at a rapid rate because of advanced hardware and software technologies and platforms such as e-health systems, sensor networks, and social media.… (more)

Subjects/Keywords: Fields of Research; data summarization; big data; machine learning; distributed computing; data management; dimensionality reduction; compression; clustering; histograms; index data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Razavi Hesabi, Z. (2019). Mining complex data in highly streaming environments. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162912

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Razavi Hesabi, Z. “Mining complex data in highly streaming environments.” 2019. Thesis, RMIT University. Accessed January 26, 2021. http://researchbank.rmit.edu.au/view/rmit:162912.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Razavi Hesabi, Z. “Mining complex data in highly streaming environments.” 2019. Web. 26 Jan 2021.

Vancouver:

Razavi Hesabi Z. Mining complex data in highly streaming environments. [Internet] [Thesis]. RMIT University; 2019. [cited 2021 Jan 26]. Available from: http://researchbank.rmit.edu.au/view/rmit:162912.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Razavi Hesabi Z. Mining complex data in highly streaming environments. [Thesis]. RMIT University; 2019. Available from: http://researchbank.rmit.edu.au/view/rmit:162912

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

29. Antoniou, Dimitrios. Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου.

Degree: 2011, University of Patras; Πανεπιστήμιο Πατρών

 In this dissertation we take an in-depth look at the use of effective and efficient data structures and algorithms in the fields of data mining… (more)

Subjects/Keywords: Αλγόριθμοι; Δομές δεδομένων; Ανάκτηση πληροφορίας; Τεχνολογίες διαδικτύου; Algorithms; Data structures; Data mining; Web technologies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Antoniou, D. (2011). Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. (Thesis). University of Patras; Πανεπιστήμιο Πατρών. Retrieved from http://hdl.handle.net/10442/hedi/33573

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Antoniou, Dimitrios. “Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου.” 2011. Thesis, University of Patras; Πανεπιστήμιο Πατρών. Accessed January 26, 2021. http://hdl.handle.net/10442/hedi/33573.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Antoniou, Dimitrios. “Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου.” 2011. Web. 26 Jan 2021.

Vancouver:

Antoniou D. Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. [Internet] [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2011. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10442/hedi/33573.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Antoniou D. Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2011. Available from: http://hdl.handle.net/10442/hedi/33573

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

30. Fragkoulis, Marios. Technologies for main memory data analysis.

Degree: 2017, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών

 The digital data has become a key resource for solving scienƟfic and business problems and achieving compeƟƟve advantage. With this purpose the scienƟfic and business… (more)

Subjects/Keywords: Ανάλυση δεδομένων; Δομές δεδομένων; Κύρια μνήμη; SQL; Data analysis; Data structures; Main memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fragkoulis, M. (2017). Technologies for main memory data analysis. (Thesis). Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Retrieved from http://hdl.handle.net/10442/hedi/44021

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fragkoulis, Marios. “Technologies for main memory data analysis.” 2017. Thesis, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Accessed January 26, 2021. http://hdl.handle.net/10442/hedi/44021.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fragkoulis, Marios. “Technologies for main memory data analysis.” 2017. Web. 26 Jan 2021.

Vancouver:

Fragkoulis M. Technologies for main memory data analysis. [Internet] [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2017. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10442/hedi/44021.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fragkoulis M. Technologies for main memory data analysis. [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2017. Available from: http://hdl.handle.net/10442/hedi/44021

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [18]

.