Rakesh Mohanty

Orcid: 0000-0002-7002-4142

According to our database1, Rakesh Mohanty authored at least 31 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Note On Lookahead In Real Life And Computing.
CoRR, 2024

2023
Semi-online Scheduling with Lookahead.
CoRR, 2023

A note on Hardness of Multiprocessor Scheduling with Scheduling solution Space Tree.
Comput. Sci., 2023

2022
Online List Scheduling for Makespan Minimization: A Review of the State-of-the-art Results, Research Challenges and Open Problems.
SIGACT News, 2022

Semi-online scheduling: A survey.
Comput. Oper. Res., 2022

2021
New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines.
CoRR, 2021

New Results on Competitive Analysis of Online SRPT Scheduling.
Proceedings of the Seventh International Conference on Mathematics and Computing, 2021

A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm Based on the Multi List Scheduling Model.
Proceedings of the Seventh International Conference on Mathematics and Computing, 2021

2020
Results on Competitiveness of Online Shortest Remaining Processing Time(SRPT) Scheduling with Special Classes of Inputs.
CoRR, 2020

Competitive Analysis of Move-to-Front-or-Middle (MFM) Online List Update Algorithm.
CoRR, 2020

A Novel Move-To-Front-or-Logarithmic Position (MFLP) Online List Update Algorithm.
CoRR, 2020

A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model.
CoRR, 2020

A New Fairness Model based on User's Objective for Multi-user Multi-processor Online Scheduling.
CoRR, 2020

Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems.
CoRR, 2020

New Competitive Analysis Results of Online List Scheduling Algorithm.
CoRR, 2020

2019
Online Rainbow Coloring In Graphs.
CoRR, 2019

2017
New results on next fit and first fit on-line algorithms for square and rectangle packing.
Proceedings of the 2017 International Conference on Advances in Computing, 2017

2016
Experimental study of a novel variant of Fiduccia Mattheyses(FM) partitioning algorithm.
Proceedings of the 2016 International Conference on Advances in Computing, 2016

2014
An Experimental Study of a Novel Move-to-Front-or-Middle (MFM) List Update Algorithm.
Proceedings of the Applied Algorithms - First International Conference, 2014

2013
TRANS outperforms MTF for two special types of request sequences without locality of reference.
CoRR, 2013

2012
Some Novel Results From Analysis of Move To Front (MTF) List Accessing Algorithm
CoRR, 2012

Performance Evaluation of A Proposed Variant of Frequency Count (VFC) List Accessing Algorithm
CoRR, 2012

2011
Comparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time
CoRR, 2011

Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin(FJFDRR) Scheduling Algorithm
CoRR, 2011

A New Proposed Cost Model for List Accessing Problem using Buffering
CoRR, 2011

Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm
CoRR, 2011

Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems
CoRR, 2011

An Improved Move-To-Front(IMTF) Off-line Algorithm for the List Accessing Problem
CoRR, 2011

A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis
CoRR, 2011

2010
A secured Cryptographic Hashing Algorithm
CoRR, 2010

2009
Online Algorithms for Self-Organizing Sequential Search - A Survey.
Electron. Colloquium Comput. Complex., 2009


  Loading...