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:"University of North Texas" +contributor:("Das, Sajal K."). Showing records 1 – 12 of 12 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of North Texas

1. Bagchi, Tanuj. An Efficient Hybrid Heuristic and Probabilistic Model for the Gate Matrix Layout Problem in VLSI Design.

Degree: 1993, University of North Texas

 In this thesis, the gate matrix layout problem in VLSI design is considered where the goal is to minimize the number of tracks required to… (more)

Subjects/Keywords: integrated circuits; efficient hybrid heuristics; Integrated circuits  – Very large scale integration  – Design and construction.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bagchi, T. (1993). An Efficient Hybrid Heuristic and Probabilistic Model for the Gate Matrix Layout Problem in VLSI Design. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc500878/

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):

Bagchi, Tanuj. “An Efficient Hybrid Heuristic and Probabilistic Model for the Gate Matrix Layout Problem in VLSI Design.” 1993. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc500878/.

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

MLA Handbook (7th Edition):

Bagchi, Tanuj. “An Efficient Hybrid Heuristic and Probabilistic Model for the Gate Matrix Layout Problem in VLSI Design.” 1993. Web. 15 Dec 2019.

Vancouver:

Bagchi T. An Efficient Hybrid Heuristic and Probabilistic Model for the Gate Matrix Layout Problem in VLSI Design. [Internet] [Thesis]. University of North Texas; 1993. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc500878/.

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

Council of Science Editors:

Bagchi T. An Efficient Hybrid Heuristic and Probabilistic Model for the Gate Matrix Layout Problem in VLSI Design. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc500878/

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


University of North Texas

2. John, Ajita. Linearly Ordered Concurrent Data Structures on Hypercubes.

Degree: 1992, University of North Texas

 This thesis presents a simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of… (more)

Subjects/Keywords: linearly ordered data structures; hypercubes; concurrent manipulation; Hypercube.; Data structures (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

John, A. (1992). Linearly Ordered Concurrent Data Structures on Hypercubes. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc501197/

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):

John, Ajita. “Linearly Ordered Concurrent Data Structures on Hypercubes.” 1992. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc501197/.

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

MLA Handbook (7th Edition):

John, Ajita. “Linearly Ordered Concurrent Data Structures on Hypercubes.” 1992. Web. 15 Dec 2019.

Vancouver:

John A. Linearly Ordered Concurrent Data Structures on Hypercubes. [Internet] [Thesis]. University of North Texas; 1992. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc501197/.

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

Council of Science Editors:

John A. Linearly Ordered Concurrent Data Structures on Hypercubes. [Thesis]. University of North Texas; 1992. Available from: https://digital.library.unt.edu/ark:/67531/metadc501197/

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


University of North Texas

3. Sen, Sanjoy Kumar. Analysis of Memory Interference in Buffered Multi-processor Systems in Presence of Hot Spots and Favorite Memories.

Degree: 1995, University of North Texas

In this thesis, a discrete Markov chain model for analyzing memory interference in multiprocessors, is presented. Advisors/Committee Members: Das, Sajal K., Shahrokhi, Farhad M., Shi, Weiping.

Subjects/Keywords: memory interference; multiprocessors; Markov chain models; Approximation algorithms.; Set theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sen, S. K. (1995). Analysis of Memory Interference in Buffered Multi-processor Systems in Presence of Hot Spots and Favorite Memories. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278426/

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):

Sen, Sanjoy Kumar. “Analysis of Memory Interference in Buffered Multi-processor Systems in Presence of Hot Spots and Favorite Memories.” 1995. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc278426/.

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

MLA Handbook (7th Edition):

Sen, Sanjoy Kumar. “Analysis of Memory Interference in Buffered Multi-processor Systems in Presence of Hot Spots and Favorite Memories.” 1995. Web. 15 Dec 2019.

Vancouver:

Sen SK. Analysis of Memory Interference in Buffered Multi-processor Systems in Presence of Hot Spots and Favorite Memories. [Internet] [Thesis]. University of North Texas; 1995. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278426/.

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

Council of Science Editors:

Sen SK. Analysis of Memory Interference in Buffered Multi-processor Systems in Presence of Hot Spots and Favorite Memories. [Thesis]. University of North Texas; 1995. Available from: https://digital.library.unt.edu/ark:/67531/metadc278426/

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


University of North Texas

4. Jayaram, Rajeev, 1971-. Quality-of-Service Provisioning and Resource Reservation Mechanisms for Mobile Wireless Networks.

Degree: 1998, University of North Texas

 In this thesis, a framework for Quality of Service provisioning in next generation wireless access networks is proposed. The framework aims at providing a differentiated… (more)

Subjects/Keywords: Mobile computing; Wireless networks; Wi-fi; Wireless communication systems.; Mobile computing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jayaram, Rajeev, 1. (1998). Quality-of-Service Provisioning and Resource Reservation Mechanisms for Mobile Wireless Networks. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278542/

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):

Jayaram, Rajeev, 1971-. “Quality-of-Service Provisioning and Resource Reservation Mechanisms for Mobile Wireless Networks.” 1998. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc278542/.

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

MLA Handbook (7th Edition):

Jayaram, Rajeev, 1971-. “Quality-of-Service Provisioning and Resource Reservation Mechanisms for Mobile Wireless Networks.” 1998. Web. 15 Dec 2019.

Vancouver:

Jayaram, Rajeev 1. Quality-of-Service Provisioning and Resource Reservation Mechanisms for Mobile Wireless Networks. [Internet] [Thesis]. University of North Texas; 1998. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278542/.

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

Council of Science Editors:

Jayaram, Rajeev 1. Quality-of-Service Provisioning and Resource Reservation Mechanisms for Mobile Wireless Networks. [Thesis]. University of North Texas; 1998. Available from: https://digital.library.unt.edu/ark:/67531/metadc278542/

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


University of North Texas

5. Pothuru, Surendra. Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System.

Degree: 1994, University of North Texas

 The primary purpose of this work is to study, implement and analyze the performance of parallel algorithms related to subsequence problems. The problems include string… (more)

Subjects/Keywords: subsequence problems; algorithms; computer science; multiprocessors; Parallel programming (Computer science); Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pothuru, S. (1994). Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278833/

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):

Pothuru, Surendra. “Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System.” 1994. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc278833/.

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

MLA Handbook (7th Edition):

Pothuru, Surendra. “Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System.” 1994. Web. 15 Dec 2019.

Vancouver:

Pothuru S. Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System. [Internet] [Thesis]. University of North Texas; 1994. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278833/.

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

Council of Science Editors:

Pothuru S. Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System. [Thesis]. University of North Texas; 1994. Available from: https://digital.library.unt.edu/ark:/67531/metadc278833/

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


University of North Texas

6. Simmons, Dayton C. (Dayton Cooper). Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory.

Degree: 1993, University of North Texas

 In this dissertation the results of Jerrum and Sinclair on the conductance of Markov chains are used to prove that almost all generalized Steinhaus graphs… (more)

Subjects/Keywords: Markov chains; mathematics; Steinhaus graphs; Markov processes.; Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Simmons, D. C. (. C. (1993). Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc277740/

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):

Simmons, Dayton C (Dayton Cooper). “Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory.” 1993. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc277740/.

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

MLA Handbook (7th Edition):

Simmons, Dayton C (Dayton Cooper). “Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory.” 1993. Web. 15 Dec 2019.

Vancouver:

Simmons DC(C. Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. [Internet] [Thesis]. University of North Texas; 1993. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc277740/.

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

Council of Science Editors:

Simmons DC(C. Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc277740/

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


University of North Texas

7. Mao, Ai-sheng. A Theoretical Network Model and the Incremental Hypercube-Based Networks.

Degree: 1995, University of North Texas

 The study of multicomputer interconnection networks is an important area of research in parallel processing. We introduce vertex-symmetric Hamming-group graphs as a model to design… (more)

Subjects/Keywords: Hypercube networks (Computer networks); parallel processing; Hamming cubes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mao, A. (1995). A Theoretical Network Model and the Incremental Hypercube-Based Networks. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc277860/

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):

Mao, Ai-sheng. “A Theoretical Network Model and the Incremental Hypercube-Based Networks.” 1995. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc277860/.

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

MLA Handbook (7th Edition):

Mao, Ai-sheng. “A Theoretical Network Model and the Incremental Hypercube-Based Networks.” 1995. Web. 15 Dec 2019.

Vancouver:

Mao A. A Theoretical Network Model and the Incremental Hypercube-Based Networks. [Internet] [Thesis]. University of North Texas; 1995. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc277860/.

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

Council of Science Editors:

Mao A. A Theoretical Network Model and the Incremental Hypercube-Based Networks. [Thesis]. University of North Texas; 1995. Available from: https://digital.library.unt.edu/ark:/67531/metadc277860/

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


University of North Texas

8. Horng, Wen-Bing. Using Extended Logic Programs to Formalize Commonsense Reasoning.

Degree: 1992, University of North Texas

 In this dissertation, we investigate how commonsense reasoning can be formalized by using extended logic programs. In this investigation, we first use extended logic programs… (more)

Subjects/Keywords: reasoning; logic; computer science; Logic programming.; Logic, Symbolic and mathematical.; Reasoning.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Horng, W. (1992). Using Extended Logic Programs to Formalize Commonsense Reasoning. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278054/

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):

Horng, Wen-Bing. “Using Extended Logic Programs to Formalize Commonsense Reasoning.” 1992. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc278054/.

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

MLA Handbook (7th Edition):

Horng, Wen-Bing. “Using Extended Logic Programs to Formalize Commonsense Reasoning.” 1992. Web. 15 Dec 2019.

Vancouver:

Horng W. Using Extended Logic Programs to Formalize Commonsense Reasoning. [Internet] [Thesis]. University of North Texas; 1992. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278054/.

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

Council of Science Editors:

Horng W. Using Extended Logic Programs to Formalize Commonsense Reasoning. [Thesis]. University of North Texas; 1992. Available from: https://digital.library.unt.edu/ark:/67531/metadc278054/

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


University of North Texas

9. Halverson, Ranette Hudson. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design.

Degree: 1993, University of North Texas

 The goal of a parallel algorithm is to solve a single problem using multiple processors working together and to do so in an efficient manner.… (more)

Subjects/Keywords: Algorithms.; Parallel processing (Electronic computers); parallel algorithm; parentheses matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Halverson, R. H. (1993). Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278153/

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):

Halverson, Ranette Hudson. “Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design.” 1993. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc278153/.

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

MLA Handbook (7th Edition):

Halverson, Ranette Hudson. “Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design.” 1993. Web. 15 Dec 2019.

Vancouver:

Halverson RH. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. [Internet] [Thesis]. University of North Texas; 1993. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278153/.

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

Council of Science Editors:

Halverson RH. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc278153/

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


University of North Texas

10. Lim, Daekeun. Cycles and Cliques in Steinhaus Graphs.

Degree: 1994, University of North Texas

 In this dissertation several results in Steinhaus graphs are investigated. First under some further conditions imposed on the induced cycles in steinhaus graphs, the order… (more)

Subjects/Keywords: Steinhaus graphs; mathematics; Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lim, D. (1994). Cycles and Cliques in Steinhaus Graphs. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278469/

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):

Lim, Daekeun. “Cycles and Cliques in Steinhaus Graphs.” 1994. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc278469/.

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

MLA Handbook (7th Edition):

Lim, Daekeun. “Cycles and Cliques in Steinhaus Graphs.” 1994. Web. 15 Dec 2019.

Vancouver:

Lim D. Cycles and Cliques in Steinhaus Graphs. [Internet] [Thesis]. University of North Texas; 1994. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278469/.

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

Council of Science Editors:

Lim D. Cycles and Cliques in Steinhaus Graphs. [Thesis]. University of North Texas; 1994. Available from: https://digital.library.unt.edu/ark:/67531/metadc278469/

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


University of North Texas

11. Sarkar, Falguni. Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation.

Degree: 1996, University of North Texas

 Discrete event simulation is an important tool for modeling and analysis. Some of the simulation applications such as telecommunication network performance, VLSI logic circuits design,… (more)

Subjects/Keywords: Computer simulation.; Discrete-time systems.; discrete event simulation; logical processes; parallel discrete event simulation; global virtual time

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sarkar, F. (1996). Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc279308/

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):

Sarkar, Falguni. “Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation.” 1996. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc279308/.

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

MLA Handbook (7th Edition):

Sarkar, Falguni. “Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation.” 1996. Web. 15 Dec 2019.

Vancouver:

Sarkar F. Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation. [Internet] [Thesis]. University of North Texas; 1996. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc279308/.

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

Council of Science Editors:

Sarkar F. Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation. [Thesis]. University of North Texas; 1996. Available from: https://digital.library.unt.edu/ark:/67531/metadc279308/

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


University of North Texas

12. Sen, Sanjoy Kumar. Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing.

Degree: 1997, University of North Texas

 The fusion of computers and communications has promised to herald the age of information super-highway over high speed communication networks where the ultimate goal is… (more)

Subjects/Keywords: mobile computing; wireless computing; bandwidth; Mobile computing.; Wireless communication systems.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sen, S. K. (1997). Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278885/

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):

Sen, Sanjoy Kumar. “Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing.” 1997. Thesis, University of North Texas. Accessed December 15, 2019. https://digital.library.unt.edu/ark:/67531/metadc278885/.

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

MLA Handbook (7th Edition):

Sen, Sanjoy Kumar. “Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing.” 1997. Web. 15 Dec 2019.

Vancouver:

Sen SK. Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing. [Internet] [Thesis]. University of North Texas; 1997. [cited 2019 Dec 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278885/.

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

Council of Science Editors:

Sen SK. Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing. [Thesis]. University of North Texas; 1997. Available from: https://digital.library.unt.edu/ark:/67531/metadc278885/

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

.