Murali K. Srinivasan

Learn More
PURPOSE High survival rates have frequently been reported for immediately loaded implants. The aim of this systematic review was to compare immediately loaded with early and conventional loaded implants for overdenture treatment with regard to their 1-year survival rates. MATERIALS AND METHODS Systematic database (Medline, Embase, CENTRAL) and hand(More)
OBJECTIVE This in vitro study evaluated the influence of implant angulations on the retentive behavior of two overdenture attachments during cyclic dislodging. METHODS Models simulating a two-implant overdenture situation were fabricated. They were divided into five groups based on their simulated implant angulations (Groups: 1 = 0°; 2 = 20°; 3 = 30°; 4 =(More)
OBJECTIVE The aim of this in vitro pilot study was to evaluate the influence of an artificial saliva (AS) lubricant on the retentive force of a stud-type attachment (LOCATOR(®) ) for implant overdentures (IODs). METHODS Twenty custom-made models simulating a two-IOD with parallel implant situation were fabricated using LOCATOR(®) attachments. The in vitro(More)
BACKGROUND Mandibular two-implant-retained overdentures were suggested as first choice of treatment for edentulous mandibles. However, wear of the attachments may reduce their retention and compromise long-term clinical success. AIM The aim of this in vitro study was to compare the change in the retentive force and removal torque of three attachment(More)
OBJECTIVE This systematic review was performed to compare the survival of 1- vs. 2-implant overdentures (IODs) in the edentulous mandible. MATERIALS AND METHODS Manual and electronic database (PubMed, EMBASE and CENTRAL) searches were performed to identify scientific articles, published in English, reporting on mandibular IODs utilizing unsplinted(More)
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. Let DP(n) (respectively, DS(n)) denote the convex hull of all degree partitions (respectively, degree sequences) of simple graphs on the vertex set [n] = {1, 2,. .. , n}. We think of DS(n) as the symmetrization of DP(n) and DP(n) as the asymmetric part of(More)