Browsing by thesis submitted date"1999"
Now showing items 1-20 of 97
-
Algorithms and lower bounds for graph connectivity and covering
Graph Connectivity is a well-studied problem, and its time complexity is well understood. However, its space complexity remains a mystery. Closely related to the space complexity of connectivity is the problem of derandomizing ... -
Analysis Of Microwave Thawing
(2012-04-30) -
Beneficiation Studies On Molybdenite Ore From Harur Area, Tamil Nadu
(2014-09-15)Molybdenum is a versatile alloying and refractory metal of strategic importance. In India almost all molybdenite is obtained currently as st byproduct from copper and uranium deposits. The present Indian production is only ... -
A Caching And Streaming Framework For Multimedia
(2012-03-26) -
Comparative Studies On Slope Stability Analysis
(2012-02-16) -
Competitive queueing models of serial order memory in speech and language
A recent focus in cognitive and brain sciences is to construct models for memory starting with assumptions that are neurophysiologically plausible. The behavior of the model should fit the empirical data. In this thesis, ... -
Counting number of points on elliptic curves over F2m fields : An implementation study
Hasse’s theorem states that:ifE {W g) Then |i| < 2y/q. This gives the bound on the number of points. In 1985, Schoof presented a polynomial time algorithm for computing The algorithm has running time of 0(log® q) bit ...