5 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Indian Institute of Technology MadrasIN2 papers
- Sambalpur UniversityIN2 papers
- Veer Surendra Sai University of TechnologyIN2 papers
- Babeș-Bolyai UniversityRO1 paper
- Istituto Nazionale di Fisica NucleareIT1 paper
- Kavli Institute for Particle Astrophysics and CosmologyUS1 paper
- Pacif Institute of Cosmology and SelfologyIN1 paper
- Scuola Superiore MeridionaleIT1 paper
- University of Naples Federico IIIT1 paper
- Zhejiang Normal UniversityCN1 paper
5 papers
Evidence of dynamical dark energy found via the DESI DR2 Lyman forest
Salvatore Capozziello, Himanshu Chaudhary, G. Mustafa +1
We present a comprehensive analysis of the cosmological implications of the Dark Energy Spectroscopic Instrument (DESI) Data Release 2 (DR2) Lyman- forest baryon acoustic oscill…
TRANS outperforms MTF for two special types of request sequences without locality of reference
Rakesh Mohanty, Sangita Patel, Shiba Prasad Dash +1
Various list accessing algorithms have been proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front (MTF) and Transpose…
A Review of Energy Efficient Dynamic Source Routing Protocol for Mobile Ad Hoc Networks
Baisakh
This paper presents a comprehensive summery of different energy efficient protocols that are based on the basic Mechanism of DSR and enlightens the effort and commitment that has b…
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense Mobile Ad Hoc Networks
Baisakh, Chinmayee Mishra, Abhilipsa Pradhan
We have proposed a novel Grid Based Dynamic Energy Efficient Routing (GBDEER) approach which is aimed to construct an energy efficient path from source to destination based on grid…
Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm
Rakesh Mohanty, Burle Sharma, Sasmita Tripathy
List Accessing Problem is a well studied research problem in the context of linear search. Input to the list accessing problem is an unsorted linear list of distinct elements along…