default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRakesh Mohanty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i27]Burle Sharma, Rakesh Mohanty, Sucheta Panda:
A Note On Lookahead In Real Life And Computing. CoRR abs/2403.17942 (2024)- 2023
- [j3]Debasis Dwibedy
, Rakesh Mohanty:
A note on Hardness of Multiprocessor Scheduling with Scheduling solution Space Tree. Comput. Sci. 24(1) (2023) - [i26]Debasis Dwibedy, Rakesh Mohanty:
Semi-online Scheduling with Lookahead. CoRR abs/2306.06003 (2023) - 2022
- [j2]Debasis Dwibedy, Rakesh Mohanty:
Semi-online scheduling: A survey. Comput. Oper. Res. 139: 105646 (2022) - [j1]Debasis Dwibedy, Rakesh Mohanty:
Online List Scheduling for Makespan Minimization: A Review of the State-of-the-art Results, Research Challenges and Open Problems. SIGACT News 53(2): 84-105 (2022) - [i25]Debasis Dwibedy, Rakesh Mohanty:
A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree. CoRR abs/2201.08788 (2022) - 2021
- [c5]Debasis Dwibedy, Rakesh Mohanty:
A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm Based on the Multi List Scheduling Model. ICMC 2021: 563-574 - [c4]Sheetal Swain, Rakesh Mohanty, Debasis Dwibedy:
New Results on Competitive Analysis of Online SRPT Scheduling. ICMC 2021: 967-977 - [i24]Debasis Dwibedy, Rakesh Mohanty:
New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines. CoRR abs/2106.04629 (2021) - 2020
- [i23]Rakesh Mohanty, Debasis Dwibedy, Shreeya Swagatika Sahoo:
New Competitive Analysis Results of Online List Scheduling Algorithm. CoRR abs/2001.00004 (2020) - [i22]Debasis Dwibedy, Rakesh Mohanty:
Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems. CoRR abs/2001.04698 (2020) - [i21]Debasis Dwibedy, Rakesh Mohanty:
A New Fairness Model based on User's Objective for Multi-user Multi-processor Online Scheduling. CoRR abs/2001.06159 (2020) - [i20]Debasis Dwibedy, Rakesh Mohanty:
A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model. CoRR abs/2001.07061 (2020) - [i19]Debasis Dwibedy, Rakesh Mohanty:
Semi-online Scheduling: A Survey. CoRR abs/2005.08614 (2020) - [i18]Baisakh, Rakesh Mohanty:
A Novel Move-To-Front-or-Logarithmic Position (MFLP) Online List Update Algorithm. CoRR abs/2010.13042 (2020) - [i17]Baisakh, Rakesh Mohanty:
Competitive Analysis of Move-to-Front-or-Middle (MFM) Online List Update Algorithm. CoRR abs/2010.14752 (2020) - [i16]Sheetal Swain, Rakesh Mohanty, Debasis Dwibedy:
Results on Competitiveness of Online Shortest Remaining Processing Time(SRPT) Scheduling with Special Classes of Inputs. CoRR abs/2012.10307 (2020)
2010 – 2019
- 2019
- [i15]Debasis Dwibedy, Rakesh Mohanty, Arun Khamari:
Online Rainbow Coloring In Graphs. CoRR abs/1912.12409 (2019) - 2017
- [c3]Rakesh Mohanty, Pankhuri Kiran:
New results on next fit and first fit on-line algorithms for square and rectangle packing. ICACCI 2017: 2201-2207 - 2016
- [c2]Mitali Sinha, Rakesh Mohanty, Prachi Tripathy, Suchismita Pattanaik:
Experimental study of a novel variant of Fiduccia Mattheyses(FM) partitioning algorithm. ICACCI 2016: 1820-1825 - 2014
- [c1]Rakesh Mohanty, Tirtharaj Dash, Biswadeep Khan, Shiba Prasad Dash:
An Experimental Study of a Novel Move-to-Front-or-Middle (MFM) List Update Algorithm. ICAA 2014: 187-197 - [i14]Mitali Sinha, Suchismita Pattanaik, Rakesh Mohanty, Prachi Tripathy:
Experimental Study of A Novel Variant of Fiduccia Mattheyses(FM) Partitioning Algorithm. CoRR abs/1403.0224 (2014) - 2013
- [i13]Rakesh Mohanty, Sangita Patel, Shiba Prasad Dash, Burle Sharma:
TRANS outperforms MTF for two special types of request sequences without locality of reference. CoRR abs/1309.2476 (2013) - 2012
- [i12]Rakesh Mohanty, Shiba Prasad Dash, Burle Sharma, Sangita Patel:
Performance Evaluation of A Proposed Variant of Frequency Count (VFC) List Accessing Algorithm. CoRR abs/1206.6185 (2012) - [i11]Rakesh Mohanty, Sangita Patel, Shiba Prasad Dash, Burle Sharma:
Some Novel Results From Analysis of Move To Front (MTF) List Accessing Algorithm. CoRR abs/1206.6187 (2012) - 2011
- [i10]Himansu Sekhar Behera, Rakesh Mohanty, Debashree Nayak:
A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis. CoRR abs/1103.3831 (2011) - [i9]Rakesh Mohanty, Sasmita Tripathy:
An Improved Move-To-Front(IMTF) Off-line Algorithm for the List Accessing Problem. CoRR abs/1105.0187 (2011) - [i8]Rakesh Mohanty, Himansu Sekhar Behera, Khusbu Patwari, Monisha Dash, M. Lakshmi Prasanna:
Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems. CoRR abs/1105.1736 (2011) - [i7]Rakesh Mohanty, Burle Sharma, Sasmita Tripathy:
Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm. CoRR abs/1109.2231 (2011) - [i6]Rakesh Mohanty, Seetaya Bhoi, Sasmita Tripathy:
A New Proposed Cost Model for List Accessing Problem using Buffering. CoRR abs/1109.2232 (2011) - [i5]Rakesh Mohanty, Manas Das, M. Lakshmi Prasanna, Sudhashree:
Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin(FJFDRR) Scheduling Algorithm. CoRR abs/1109.3075 (2011) - [i4]Himansu Sekhar Behera, Rakesh Mohanty, Sabyasachi Sahu, Sourav Kumar Bhoi:
Comparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time. CoRR abs/1109.3076 (2011) - 2010
- [i3]Rakesh Mohanty, Niharjyoti Sarangi, Sukant kumar Bishi:
A secured Cryptographic Hashing Algorithm. CoRR abs/1003.5787 (2010)
2000 – 2009
- 2009
- [i2]Rakesh Mohanty, N. S. Narayanaswamy:
Online Algorithms for Self-Organizing Sequential Search - A Survey. CoRR abs/0909.0095 (2009) - [i1]Rakesh Mohanty, N. S. Narayanaswamy:
Online Algorithms for Self-Organizing Sequential Search - A Survey. Electron. Colloquium Comput. Complex. TR09 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
