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 +publisher:"Texas A&M University" +contributor:("Welch, Jennifer"). Showing records 1 – 30 of 79 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

▼ Search Limiters


Texas A&M University

1. Wang, Jiaqi. Time Bounds for Shared Objects in Partially Synchronous Systems.

Degree: MS, Computer Science, 2012, Texas A&M University

 Shared objects are a key component in today's large distributed systems. Linearizability is a popular consistency condition for such shared objects which gives the illusion… (more)

Subjects/Keywords: Shared objects; linearizability; partially synchronous system; bounds on time complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, J. (2012). Time Bounds for Shared Objects in Partially Synchronous Systems. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10214

Chicago Manual of Style (16th Edition):

Wang, Jiaqi. “Time Bounds for Shared Objects in Partially Synchronous Systems.” 2012. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10214.

MLA Handbook (7th Edition):

Wang, Jiaqi. “Time Bounds for Shared Objects in Partially Synchronous Systems.” 2012. Web. 01 Dec 2020.

Vancouver:

Wang J. Time Bounds for Shared Objects in Partially Synchronous Systems. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10214.

Council of Science Editors:

Wang J. Time Bounds for Shared Objects in Partially Synchronous Systems. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10214


Texas A&M University

2. Rajagopalan, Arun Krishnakumar. Fast and Precise On-The-Fly Data Race Detection.

Degree: MS, Computer Science, 2016, Texas A&M University

 While concurrent programming is quickly gaining popularity lately, developing bug-free programs is still challenging. Although developers have a wide choice of race detection tools available,… (more)

Subjects/Keywords: bug detection; concurrency; debugging; dynamic analysis; parallelism; performance analysis; runtime monitoring; software engineering; redundancy; data race; missing events; precise detection; happens-before; maximal thread causality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rajagopalan, A. K. (2016). Fast and Precise On-The-Fly Data Race Detection. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157131

Chicago Manual of Style (16th Edition):

Rajagopalan, Arun Krishnakumar. “Fast and Precise On-The-Fly Data Race Detection.” 2016. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/157131.

MLA Handbook (7th Edition):

Rajagopalan, Arun Krishnakumar. “Fast and Precise On-The-Fly Data Race Detection.” 2016. Web. 01 Dec 2020.

Vancouver:

Rajagopalan AK. Fast and Precise On-The-Fly Data Race Detection. [Internet] [Masters thesis]. Texas A&M University; 2016. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/157131.

Council of Science Editors:

Rajagopalan AK. Fast and Precise On-The-Fly Data Race Detection. [Masters Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157131


Texas A&M University

3. Chandanala, Roja Ramani. On Combining Duty-cycling with Network Coding in Flood-based Sensor Networks.

Degree: MS, Computer Science, 2012, Texas A&M University

 Network coding and duty-cycling are two popular techniques for saving energy in wireless sensor networks. To the best of our knowledge, the idea to combine… (more)

Subjects/Keywords: wireless sensor networks; energy efficiency; duty cycling; network coding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chandanala, R. R. (2012). On Combining Duty-cycling with Network Coding in Flood-based Sensor Networks. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8627

Chicago Manual of Style (16th Edition):

Chandanala, Roja Ramani. “On Combining Duty-cycling with Network Coding in Flood-based Sensor Networks.” 2012. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8627.

MLA Handbook (7th Edition):

Chandanala, Roja Ramani. “On Combining Duty-cycling with Network Coding in Flood-based Sensor Networks.” 2012. Web. 01 Dec 2020.

Vancouver:

Chandanala RR. On Combining Duty-cycling with Network Coding in Flood-based Sensor Networks. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8627.

Council of Science Editors:

Chandanala RR. On Combining Duty-cycling with Network Coding in Flood-based Sensor Networks. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8627


Texas A&M University

4. Agumbe Suresh Mahima. A Cyber-Physical Systems Approach to Water Distribution System Monitoring.

Degree: PhD, Computer Science, 2015, Texas A&M University

 Water Distribution Systems (WDS) are critical infrastructures of national importance that supply water of desired quality and quantity to consumers. They are prone to damages… (more)

Subjects/Keywords: cyber-physical systems; water distribution systems; mobile sensors; wireless sensor networks; monitoring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mahima, A. S. (2015). A Cyber-Physical Systems Approach to Water Distribution System Monitoring. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156536

Chicago Manual of Style (16th Edition):

Mahima, Agumbe Suresh. “A Cyber-Physical Systems Approach to Water Distribution System Monitoring.” 2015. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/156536.

MLA Handbook (7th Edition):

Mahima, Agumbe Suresh. “A Cyber-Physical Systems Approach to Water Distribution System Monitoring.” 2015. Web. 01 Dec 2020.

Vancouver:

Mahima AS. A Cyber-Physical Systems Approach to Water Distribution System Monitoring. [Internet] [Doctoral dissertation]. Texas A&M University; 2015. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/156536.

Council of Science Editors:

Mahima AS. A Cyber-Physical Systems Approach to Water Distribution System Monitoring. [Doctoral Dissertation]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/156536


Texas A&M University

5. Ortiz-Lopez, Keishla Desiree. Bounded Protocols for Efficient Reliable Message Transmission.

Degree: MS, Computer Science, 2017, Texas A&M University

 In the reliable message transmission problem (RMTP) processors communicate by exchanging messages, but the channel that connects two processors is subject to message loss, duplication,… (more)

Subjects/Keywords: communication networks; message transmission protocols; distributed computing; computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ortiz-Lopez, K. D. (2017). Bounded Protocols for Efficient Reliable Message Transmission. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/165959

Chicago Manual of Style (16th Edition):

Ortiz-Lopez, Keishla Desiree. “Bounded Protocols for Efficient Reliable Message Transmission.” 2017. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/165959.

MLA Handbook (7th Edition):

Ortiz-Lopez, Keishla Desiree. “Bounded Protocols for Efficient Reliable Message Transmission.” 2017. Web. 01 Dec 2020.

Vancouver:

Ortiz-Lopez KD. Bounded Protocols for Efficient Reliable Message Transmission. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/165959.

Council of Science Editors:

Ortiz-Lopez KD. Bounded Protocols for Efficient Reliable Message Transmission. [Masters Thesis]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/165959


Texas A&M University

6. Chung, Hyun-Chul. Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation.

Degree: PhD, Computer Science, 2013, Texas A&M University

 A distributed system is a collection of computing entities that communicate with each other to solve some problem. Distributed systems impact almost every aspect of… (more)

Subjects/Keywords: Distributed Computing; Mobile Ad Hoc Networks; Leader Election; Neighbor Detection; Resource Allocation; Dining Philosophers Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chung, H. (2013). Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151735

Chicago Manual of Style (16th Edition):

Chung, Hyun-Chul. “Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation.” 2013. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/151735.

MLA Handbook (7th Edition):

Chung, Hyun-Chul. “Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation.” 2013. Web. 01 Dec 2020.

Vancouver:

Chung H. Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/151735.

Council of Science Editors:

Chung H. Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151735


Texas A&M University

7. Brammer, Grant. Algorithms for Searching and Analyzing Sets of Evolutionary Trees.

Degree: PhD, Computer Science and Engineering, 2014, Texas A&M University

 The evolutionary relationships between organisms are represented as phylogenetic trees. These trees have important implications for understanding biodiversity, tracking disease, and designing medicine. Since the… (more)

Subjects/Keywords: computer science; phylogenetics; query; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brammer, G. (2014). Algorithms for Searching and Analyzing Sets of Evolutionary Trees. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152770

Chicago Manual of Style (16th Edition):

Brammer, Grant. “Algorithms for Searching and Analyzing Sets of Evolutionary Trees.” 2014. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/152770.

MLA Handbook (7th Edition):

Brammer, Grant. “Algorithms for Searching and Analyzing Sets of Evolutionary Trees.” 2014. Web. 01 Dec 2020.

Vancouver:

Brammer G. Algorithms for Searching and Analyzing Sets of Evolutionary Trees. [Internet] [Doctoral dissertation]. Texas A&M University; 2014. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/152770.

Council of Science Editors:

Brammer G. Algorithms for Searching and Analyzing Sets of Evolutionary Trees. [Doctoral Dissertation]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152770


Texas A&M University

8. Viqar, Saira. Communication Algorithms for Wireless Ad Hoc Networks.

Degree: PhD, Computer Science, 2012, Texas A&M University

 In this dissertation we present deterministic algorithms for reliable and efficient communication in ad hoc networks. In the first part of this dissertation we give… (more)

Subjects/Keywords: Mobile Ad Hoc Networks; Sensor Networks; Neighbor Discovery

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Viqar, S. (2012). Communication Algorithms for Wireless Ad Hoc Networks. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766

Chicago Manual of Style (16th Edition):

Viqar, Saira. “Communication Algorithms for Wireless Ad Hoc Networks.” 2012. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766.

MLA Handbook (7th Edition):

Viqar, Saira. “Communication Algorithms for Wireless Ad Hoc Networks.” 2012. Web. 01 Dec 2020.

Vancouver:

Viqar S. Communication Algorithms for Wireless Ad Hoc Networks. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766.

Council of Science Editors:

Viqar S. Communication Algorithms for Wireless Ad Hoc Networks. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766


Texas A&M University

9. Tiwari, Praveen 1985-. On Covering Points with Conics and Strips in the Plane.

Degree: MS, Computer Science, 2012, Texas A&M University

 Geometric covering problems have always been of focus in computer scientific research. The generic geometric covering problem asks to cover a set S of n… (more)

Subjects/Keywords: Approximation; Fixed-parameter tractability; NP-Hardness; Geometric Cover

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tiwari, P. 1. (2012). On Covering Points with Conics and Strips in the Plane. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/148314

Chicago Manual of Style (16th Edition):

Tiwari, Praveen 1985-. “On Covering Points with Conics and Strips in the Plane.” 2012. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/148314.

MLA Handbook (7th Edition):

Tiwari, Praveen 1985-. “On Covering Points with Conics and Strips in the Plane.” 2012. Web. 01 Dec 2020.

Vancouver:

Tiwari P1. On Covering Points with Conics and Strips in the Plane. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/148314.

Council of Science Editors:

Tiwari P1. On Covering Points with Conics and Strips in the Plane. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/148314


Texas A&M University

10. Su, Yang. Across-Peer Rate Allocation Algorithm in Peer-to-peer Networks.

Degree: MS, Computer Engineering, 2013, Texas A&M University

 We introduce a new across-peer rate allocation algorithm with successive refinement to improve the video transmission performance in P2P networks, based on the combination of… (more)

Subjects/Keywords: Network Codes; Rate Allocation; Multiple Description Codes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Su, Y. (2013). Across-Peer Rate Allocation Algorithm in Peer-to-peer Networks. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151019

Chicago Manual of Style (16th Edition):

Su, Yang. “Across-Peer Rate Allocation Algorithm in Peer-to-peer Networks.” 2013. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/151019.

MLA Handbook (7th Edition):

Su, Yang. “Across-Peer Rate Allocation Algorithm in Peer-to-peer Networks.” 2013. Web. 01 Dec 2020.

Vancouver:

Su Y. Across-Peer Rate Allocation Algorithm in Peer-to-peer Networks. [Internet] [Masters thesis]. Texas A&M University; 2013. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/151019.

Council of Science Editors:

Su Y. Across-Peer Rate Allocation Algorithm in Peer-to-peer Networks. [Masters Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151019


Texas A&M University

11. Pandey, Sanat Kumar. Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network.

Degree: MS, Computer Engineering, 2015, Texas A&M University

 In this thesis we consider the problem of neighbor discovery in synchronous single hop wireless ad-hoc networks. The central problem is to establish a broadcasting… (more)

Subjects/Keywords: Neighbor discovery; ad-hoc radio network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pandey, S. K. (2015). Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155754

Chicago Manual of Style (16th Edition):

Pandey, Sanat Kumar. “Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network.” 2015. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/155754.

MLA Handbook (7th Edition):

Pandey, Sanat Kumar. “Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network.” 2015. Web. 01 Dec 2020.

Vancouver:

Pandey SK. Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network. [Internet] [Masters thesis]. Texas A&M University; 2015. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/155754.

Council of Science Editors:

Pandey SK. Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network. [Masters Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155754


Texas A&M University

12. Won, Myounggyu. Challenges and Solutions for Location-based Routing in Wireless Sensor Networks with Complex Network Topology.

Degree: PhD, Computer Science, 2013, Texas A&M University

 Complex Network Topologies (CNTs)–network holes and cuts–often occur in practical WSN deployments. Many researchers have acknowledged that CNTs adversely affect the performance of location-based routing… (more)

Subjects/Keywords: Wireless Sensor Networks; Network Holes; Network Cuts; Location-based Routing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Won, M. (2013). Challenges and Solutions for Location-based Routing in Wireless Sensor Networks with Complex Network Topology. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151200

Chicago Manual of Style (16th Edition):

Won, Myounggyu. “Challenges and Solutions for Location-based Routing in Wireless Sensor Networks with Complex Network Topology.” 2013. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/151200.

MLA Handbook (7th Edition):

Won, Myounggyu. “Challenges and Solutions for Location-based Routing in Wireless Sensor Networks with Complex Network Topology.” 2013. Web. 01 Dec 2020.

Vancouver:

Won M. Challenges and Solutions for Location-based Routing in Wireless Sensor Networks with Complex Network Topology. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/151200.

Council of Science Editors:

Won M. Challenges and Solutions for Location-based Routing in Wireless Sensor Networks with Complex Network Topology. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151200


Texas A&M University

13. Su, Hang. Design and Analysis of Opportunistic MAC Protocols for Cognitive Radio Wireless Networks.

Degree: PhD, Computer Engineering, 2012, Texas A&M University

 As more and more wireless applications/services emerge in the market, the already heavily crowded radio spectrum becomes much scarcer. Meanwhile, however,as it is reported in… (more)

Subjects/Keywords: Cognitive radio; multi-channel MAC; dynamic spectrum access; cross-layer design; M/G^Y/1 queuing theory; QoS provisionings; cooperative spectrum sensing; channel hopping; decision process; rate adaption; opportunistic scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Su, H. (2012). Design and Analysis of Opportunistic MAC Protocols for Cognitive Radio Wireless Networks. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8943

Chicago Manual of Style (16th Edition):

Su, Hang. “Design and Analysis of Opportunistic MAC Protocols for Cognitive Radio Wireless Networks.” 2012. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8943.

MLA Handbook (7th Edition):

Su, Hang. “Design and Analysis of Opportunistic MAC Protocols for Cognitive Radio Wireless Networks.” 2012. Web. 01 Dec 2020.

Vancouver:

Su H. Design and Analysis of Opportunistic MAC Protocols for Cognitive Radio Wireless Networks. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8943.

Council of Science Editors:

Su H. Design and Analysis of Opportunistic MAC Protocols for Cognitive Radio Wireless Networks. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8943


Texas A&M University

14. Farnsworth, Cameron Lee. The Polynomial Waring Problem and the Determinant.

Degree: PhD, Mathematics, 2016, Texas A&M University

 The symmetric rank of a polynomial P is the minimum number of d-th powers of linear forms necessary to sum to P. Questions pertaining to… (more)

Subjects/Keywords: symmetric border rank; lower bounds; determinant; permanent

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farnsworth, C. L. (2016). The Polynomial Waring Problem and the Determinant. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157889

Chicago Manual of Style (16th Edition):

Farnsworth, Cameron Lee. “The Polynomial Waring Problem and the Determinant.” 2016. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/157889.

MLA Handbook (7th Edition):

Farnsworth, Cameron Lee. “The Polynomial Waring Problem and the Determinant.” 2016. Web. 01 Dec 2020.

Vancouver:

Farnsworth CL. The Polynomial Waring Problem and the Determinant. [Internet] [Doctoral dissertation]. Texas A&M University; 2016. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/157889.

Council of Science Editors:

Farnsworth CL. The Polynomial Waring Problem and the Determinant. [Doctoral Dissertation]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157889


Texas A&M University

15. Gesmundo, Fulvio. Geometry and Representation Theory in the Study of Matrix Rigidity.

Degree: PhD, Mathematics, 2017, Texas A&M University

 The notion of matrix rigidity was introduced by L. Valiant in 1977. He proved a theorem that relates the rigidity of a matrix to the… (more)

Subjects/Keywords: Matrix rigidity; discrete fourier transform; Vandermonde matrix; Cauchy matrix

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gesmundo, F. (2017). Geometry and Representation Theory in the Study of Matrix Rigidity. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/161491

Chicago Manual of Style (16th Edition):

Gesmundo, Fulvio. “Geometry and Representation Theory in the Study of Matrix Rigidity.” 2017. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/161491.

MLA Handbook (7th Edition):

Gesmundo, Fulvio. “Geometry and Representation Theory in the Study of Matrix Rigidity.” 2017. Web. 01 Dec 2020.

Vancouver:

Gesmundo F. Geometry and Representation Theory in the Study of Matrix Rigidity. [Internet] [Doctoral dissertation]. Texas A&M University; 2017. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/161491.

Council of Science Editors:

Gesmundo F. Geometry and Representation Theory in the Study of Matrix Rigidity. [Doctoral Dissertation]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/161491


Texas A&M University

16. Papadopoulos, Ioannis. STAPL-RTS: A Runtime System for Massive Parallelism.

Degree: PhD, Computer Science, 2016, Texas A&M University

 Modern High Performance Computing (HPC) systems are complex, with deep memory hierarchies and increasing use of computational heterogeneity via accelerators. When developing applications for these… (more)

Subjects/Keywords: parallel; runtime system; high performance; nested parallelism; asynchronous; shared memory; distributed memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Papadopoulos, I. (2016). STAPL-RTS: A Runtime System for Massive Parallelism. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156985

Chicago Manual of Style (16th Edition):

Papadopoulos, Ioannis. “STAPL-RTS: A Runtime System for Massive Parallelism.” 2016. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/156985.

MLA Handbook (7th Edition):

Papadopoulos, Ioannis. “STAPL-RTS: A Runtime System for Massive Parallelism.” 2016. Web. 01 Dec 2020.

Vancouver:

Papadopoulos I. STAPL-RTS: A Runtime System for Massive Parallelism. [Internet] [Doctoral dissertation]. Texas A&M University; 2016. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/156985.

Council of Science Editors:

Papadopoulos I. STAPL-RTS: A Runtime System for Massive Parallelism. [Doctoral Dissertation]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/156985


Texas A&M University

17. Hafer, William Thomas. Sensitivity Methods Applied to Orbital Pursuit-Evasion.

Degree: PhD, Aerospace Engineering, 2014, Texas A&M University

 In this work, sensitivity methods are examined as a means to solve and analyze the problem of orbital pursuit-evasion (PE). Orbital PE is a two-sided… (more)

Subjects/Keywords: Orbital pursuit-evasion; sensitivity methods; barrier surfaces; two-sided optimal control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hafer, W. T. (2014). Sensitivity Methods Applied to Orbital Pursuit-Evasion. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/153412

Chicago Manual of Style (16th Edition):

Hafer, William Thomas. “Sensitivity Methods Applied to Orbital Pursuit-Evasion.” 2014. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/153412.

MLA Handbook (7th Edition):

Hafer, William Thomas. “Sensitivity Methods Applied to Orbital Pursuit-Evasion.” 2014. Web. 01 Dec 2020.

Vancouver:

Hafer WT. Sensitivity Methods Applied to Orbital Pursuit-Evasion. [Internet] [Doctoral dissertation]. Texas A&M University; 2014. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/153412.

Council of Science Editors:

Hafer WT. Sensitivity Methods Applied to Orbital Pursuit-Evasion. [Doctoral Dissertation]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/153412


Texas A&M University

18. Pandey, Nikhil. Critical Cliques and Their Application to Influence Maximization in Online Social Networks.

Degree: MS, Computer Science, 2012, Texas A&M University

 Graph decompositions have useful applications in optimization problems that are categorized as NP-Hard. Modular Decomposition of a graph is a technique to decompose the graph… (more)

Subjects/Keywords: critical cliques; influence maximization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pandey, N. (2012). Critical Cliques and Their Application to Influence Maximization in Online Social Networks. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11102

Chicago Manual of Style (16th Edition):

Pandey, Nikhil. “Critical Cliques and Their Application to Influence Maximization in Online Social Networks.” 2012. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11102.

MLA Handbook (7th Edition):

Pandey, Nikhil. “Critical Cliques and Their Application to Influence Maximization in Online Social Networks.” 2012. Web. 01 Dec 2020.

Vancouver:

Pandey N. Critical Cliques and Their Application to Influence Maximization in Online Social Networks. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11102.

Council of Science Editors:

Pandey N. Critical Cliques and Their Application to Influence Maximization in Online Social Networks. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11102


Texas A&M University

19. Matthews, Suzanne. Efficient Algorithms for Comparing, Storing, and Sharing Large Collections of Phylogenetic Trees.

Degree: PhD, Computer Science, 2012, Texas A&M University

 Evolutionary relationships between a group of organisms are commonly summarized in a phylogenetic (or evolutionary) tree. The goal of phylogenetic inference is to infer the… (more)

Subjects/Keywords: computer science; computational biology, bioinformatics; systematic biology; biology; evolutionary tree; phylogenetic tree; tree collections; phylogeny; compression; version control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Matthews, S. (2012). Efficient Algorithms for Comparing, Storing, and Sharing Large Collections of Phylogenetic Trees. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11124

Chicago Manual of Style (16th Edition):

Matthews, Suzanne. “Efficient Algorithms for Comparing, Storing, and Sharing Large Collections of Phylogenetic Trees.” 2012. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11124.

MLA Handbook (7th Edition):

Matthews, Suzanne. “Efficient Algorithms for Comparing, Storing, and Sharing Large Collections of Phylogenetic Trees.” 2012. Web. 01 Dec 2020.

Vancouver:

Matthews S. Efficient Algorithms for Comparing, Storing, and Sharing Large Collections of Phylogenetic Trees. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11124.

Council of Science Editors:

Matthews S. Efficient Algorithms for Comparing, Storing, and Sharing Large Collections of Phylogenetic Trees. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11124

20. Manshouri, Reza. Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life.

Degree: MS, Computer Science, 2017, Texas A&M University

 Constructing the Supertree of Life can provide crucially valuable knowledge to address many critical contemporary challenges such as fighting diseases, improving global agriculture, and protecting… (more)

Subjects/Keywords: phylogenetic; hill-climbing; simulated annealing; NP-hard

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manshouri, R. (2017). Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/169652

Chicago Manual of Style (16th Edition):

Manshouri, Reza. “Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life.” 2017. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/169652.

MLA Handbook (7th Edition):

Manshouri, Reza. “Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life.” 2017. Web. 01 Dec 2020.

Vancouver:

Manshouri R. Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/169652.

Council of Science Editors:

Manshouri R. Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life. [Masters Thesis]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/169652

21. Oh, Eunseuk. On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks.

Degree: PhD, Computer Science, 2004, Texas A&M University

 As the size of networks increases continuously, dealing with networks with faulty nodes becomes unavoidable. In this dissertation, we introduce a new measure for network… (more)

Subjects/Keywords: strong fault tolerance; star networks; hypercube networks

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oh, E. (2004). On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/1284

Chicago Manual of Style (16th Edition):

Oh, Eunseuk. “On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks.” 2004. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/1284.

MLA Handbook (7th Edition):

Oh, Eunseuk. “On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks.” 2004. Web. 01 Dec 2020.

Vancouver:

Oh E. On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks. [Internet] [Doctoral dissertation]. Texas A&M University; 2004. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/1284.

Council of Science Editors:

Oh E. On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks. [Doctoral Dissertation]. Texas A&M University; 2004. Available from: http://hdl.handle.net/1969.1/1284

22. Kanjani, Khushboo. Supporting fault-tolerant communication in networks.

Degree: MS, Computer Engineering, 2009, Texas A&M University

 We address two problems dealing with fault-tolerant communication in networks. The first one is designing a distributed storage protocol tolerant to Byzantine failure of servers.… (more)

Subjects/Keywords: Distributed Storage; fault-tolerance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kanjani, K. (2009). Supporting fault-tolerant communication in networks. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-3118

Chicago Manual of Style (16th Edition):

Kanjani, Khushboo. “Supporting fault-tolerant communication in networks.” 2009. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-3118.

MLA Handbook (7th Edition):

Kanjani, Khushboo. “Supporting fault-tolerant communication in networks.” 2009. Web. 01 Dec 2020.

Vancouver:

Kanjani K. Supporting fault-tolerant communication in networks. [Internet] [Masters thesis]. Texas A&M University; 2009. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-3118.

Council of Science Editors:

Kanjani K. Supporting fault-tolerant communication in networks. [Masters Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-3118

23. Roy, Gautam. A Distributed Pool Architecture for Genetic Algorithms.

Degree: MS, Computer Engineering, 2011, Texas A&M University

 The genetic algorithm paradigm is a well-known heuristic for solving many problems in science and engineering in which candidate solutions, or “individuals”, are manipulated in… (more)

Subjects/Keywords: genetic algorithms; distributed algorithms; distributed storage; product lifecycle design

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roy, G. (2011). A Distributed Pool Architecture for Genetic Algorithms. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7322

Chicago Manual of Style (16th Edition):

Roy, Gautam. “A Distributed Pool Architecture for Genetic Algorithms.” 2011. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7322.

MLA Handbook (7th Edition):

Roy, Gautam. “A Distributed Pool Architecture for Genetic Algorithms.” 2011. Web. 01 Dec 2020.

Vancouver:

Roy G. A Distributed Pool Architecture for Genetic Algorithms. [Internet] [Masters thesis]. Texas A&M University; 2011. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7322.

Council of Science Editors:

Roy G. A Distributed Pool Architecture for Genetic Algorithms. [Masters Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7322

24. Tanase, Ilie Gabriel. The STAPL Parallel Container Framework.

Degree: PhD, Computer Science, 2012, Texas A&M University

 The Standard Template Adaptive Parallel Library (STAPL) is a parallel programming infrastructure that extends C with support for parallelism. STAPL provides a run-time system, a… (more)

Subjects/Keywords: Computer Science

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tanase, I. G. (2012). The STAPL Parallel Container Framework. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8753

Chicago Manual of Style (16th Edition):

Tanase, Ilie Gabriel. “The STAPL Parallel Container Framework.” 2012. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8753.

MLA Handbook (7th Edition):

Tanase, Ilie Gabriel. “The STAPL Parallel Container Framework.” 2012. Web. 01 Dec 2020.

Vancouver:

Tanase IG. The STAPL Parallel Container Framework. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8753.

Council of Science Editors:

Tanase IG. The STAPL Parallel Container Framework. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8753

25. Leonard, Derek Anthony. Algorithms for Large-Scale Internet Measurements.

Degree: PhD, Computer Science, 2012, Texas A&M University

 As the Internet has grown in size and importance to society, it has become increasingly difficult to generate global metrics of interest that can be… (more)

Subjects/Keywords: Distance Estimation; Horizontal Scanning; Service Discovery; Intrusion Detection Systems; Internet Measurements

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leonard, D. A. (2012). Algorithms for Large-Scale Internet Measurements. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8651

Chicago Manual of Style (16th Edition):

Leonard, Derek Anthony. “Algorithms for Large-Scale Internet Measurements.” 2012. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8651.

MLA Handbook (7th Edition):

Leonard, Derek Anthony. “Algorithms for Large-Scale Internet Measurements.” 2012. Web. 01 Dec 2020.

Vancouver:

Leonard DA. Algorithms for Large-Scale Internet Measurements. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8651.

Council of Science Editors:

Leonard DA. Algorithms for Large-Scale Internet Measurements. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8651

26. Boyd, Bryan 1985-. Local Randomization in Neighbor Selection Improves PRM Roadmap Quality.

Degree: MS, Computer Science, 2012, Texas A&M University

 Probabilistic Roadmap Methods (PRMs) are one of the most used classes of motion planning methods. These sampling-based methods generate robot configurations (nodes) and then connect… (more)

Subjects/Keywords: Motion Planning; Robotics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boyd, B. 1. (2012). Local Randomization in Neighbor Selection Improves PRM Roadmap Quality. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/148341

Chicago Manual of Style (16th Edition):

Boyd, Bryan 1985-. “Local Randomization in Neighbor Selection Improves PRM Roadmap Quality.” 2012. Masters Thesis, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/148341.

MLA Handbook (7th Edition):

Boyd, Bryan 1985-. “Local Randomization in Neighbor Selection Improves PRM Roadmap Quality.” 2012. Web. 01 Dec 2020.

Vancouver:

Boyd B1. Local Randomization in Neighbor Selection Improves PRM Roadmap Quality. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/148341.

Council of Science Editors:

Boyd B1. Local Randomization in Neighbor Selection Improves PRM Roadmap Quality. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/148341

27. Wang, Yue. Data Representation for Efficient and Reliable Storage in Flash Memories.

Degree: PhD, Computer Science, 2013, Texas A&M University

 Recent years have witnessed a proliferation of flash memories as an emerging storage technology with wide applications in many important areas. Like magnetic recording and… (more)

Subjects/Keywords: flash memories; rank modulation; low voltage device; file recovery; content assisted

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Y. (2013). Data Representation for Efficient and Reliable Storage in Flash Memories. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/149536

Chicago Manual of Style (16th Edition):

Wang, Yue. “Data Representation for Efficient and Reliable Storage in Flash Memories.” 2013. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/149536.

MLA Handbook (7th Edition):

Wang, Yue. “Data Representation for Efficient and Reliable Storage in Flash Memories.” 2013. Web. 01 Dec 2020.

Vancouver:

Wang Y. Data Representation for Efficient and Reliable Storage in Flash Memories. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/149536.

Council of Science Editors:

Wang Y. Data Representation for Efficient and Reliable Storage in Flash Memories. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/149536

28. Kumar, Saptaparni. Fault-Tolerant Distributed Services in Message-Passing Systems.

Degree: PhD, Computer Science, 2019, Texas A&M University

 Distributed systems ranging from small local area networks to large wide area networks like the Internet composed of static and/or mobile users have become increasingly… (more)

Subjects/Keywords: Distributed Computing; Fault tolerance; Lower Bounds; Algorithms

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, S. (2019). Fault-Tolerant Distributed Services in Message-Passing Systems. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/186154

Chicago Manual of Style (16th Edition):

Kumar, Saptaparni. “Fault-Tolerant Distributed Services in Message-Passing Systems.” 2019. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/186154.

MLA Handbook (7th Edition):

Kumar, Saptaparni. “Fault-Tolerant Distributed Services in Message-Passing Systems.” 2019. Web. 01 Dec 2020.

Vancouver:

Kumar S. Fault-Tolerant Distributed Services in Message-Passing Systems. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/186154.

Council of Science Editors:

Kumar S. Fault-Tolerant Distributed Services in Message-Passing Systems. [Doctoral Dissertation]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/186154

29. Sastry, Srikanth. A Prescription for Partial Synchrony.

Degree: PhD, Computer Engineering, 2012, Texas A&M University

 Algorithms in message-passing distributed systems often require partial synchrony to tolerate crash failures. Informally, partial synchrony refers to systems where timing bounds on communication and… (more)

Subjects/Keywords: Partial Synchrony; Failure Detectors; Empirical Systems; Fault Tolerance; Crash Faults; Real Time; Fairness

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sastry, S. (2012). A Prescription for Partial Synchrony. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9146

Chicago Manual of Style (16th Edition):

Sastry, Srikanth. “A Prescription for Partial Synchrony.” 2012. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9146.

MLA Handbook (7th Edition):

Sastry, Srikanth. “A Prescription for Partial Synchrony.” 2012. Web. 01 Dec 2020.

Vancouver:

Sastry S. A Prescription for Partial Synchrony. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9146.

Council of Science Editors:

Sastry S. A Prescription for Partial Synchrony. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9146

30. Li, Qing. Towards Endurable, Reliable and Secure Flash Memories-a Coding Theory Application.

Degree: PhD, Computer Science, 2015, Texas A&M University

 Storage systems are experiencing a historical paradigm shift from hard disk to nonvolatile memories due to its advantages such as higher density, smaller size and… (more)

Subjects/Keywords: Flash memories; coding theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Q. (2015). Towards Endurable, Reliable and Secure Flash Memories-a Coding Theory Application. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156149

Chicago Manual of Style (16th Edition):

Li, Qing. “Towards Endurable, Reliable and Secure Flash Memories-a Coding Theory Application.” 2015. Doctoral Dissertation, Texas A&M University. Accessed December 01, 2020. http://hdl.handle.net/1969.1/156149.

MLA Handbook (7th Edition):

Li, Qing. “Towards Endurable, Reliable and Secure Flash Memories-a Coding Theory Application.” 2015. Web. 01 Dec 2020.

Vancouver:

Li Q. Towards Endurable, Reliable and Secure Flash Memories-a Coding Theory Application. [Internet] [Doctoral dissertation]. Texas A&M University; 2015. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1969.1/156149.

Council of Science Editors:

Li Q. Towards Endurable, Reliable and Secure Flash Memories-a Coding Theory Application. [Doctoral Dissertation]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/156149

[1] [2] [3]

.