Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Time Complexity Bounds for Sharedmemory Mutual Exclusion
 

Summary: Time Complexity Bounds for Shared­memory
Mutual Exclusion
by
Yong­Jik Kim
A dissertation submitted to the faculty of the University of North Carolina at Chapel
Hill in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
the Department of Computer Science.
Chapel Hill
2003
Approved by:
James H. Anderson, Advisor
Sanjoy K. Baruah, Reader
Jan F. Prins, Reader
Michael Merritt, Reader
Lars S. Nyland, Reader
Jack Snoeyink, Reader

ii
c
# 2003

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences