default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. S. Ramakrishna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j10]Adnan Mohamed, R. S. Ramakrishna:
Linear election in pancake graphs. Inf. Process. Lett. 106(3): 127-131 (2008)- 2007
- [j9]Jun-Ho Her, R. S. Ramakrishna:
An external-memory depth-first search algorithm for general grid graphs. Theor. Comput. Sci. 374(1-3): 170-180 (2007) - [c13]Jun-Ho Her, R. S. Ramakrishna:
An O(log n) Parallel Time Depth-First Search Algorithm for Solid Grid Graphs. HPCNCS 2007: 206-211 - [c12]Kyeong Tae Kim, R. S. Ramakrishna:
A Level-based Key Management for both In-Network Processing and Mobility in WSNs. MASS 2007: 1-8 - 2006
- [j8]Minho Kim, R. S. Ramakrishna:
Projected clustering for categorical datasets. Pattern Recognit. Lett. 27(12): 1405-1417 (2006) - 2005
- [j7]Hyun Chin, R. S. Ramakrishna:
A New Algorithm for Silhouette Detection in Volume Objects and Its Parallelization. IEICE Trans. Inf. Syst. 88-D(8): 1977-1984 (2005) - [j6]Jun-Ho Her, R. S. Ramakrishna:
External-memory depth-first search algorithm for solid grid graphs. Inf. Process. Lett. 93(4): 177-183 (2005) - [j5]Minho Kim, R. S. Ramakrishna:
New indices for cluster validity assessment. Pattern Recognit. Lett. 26(15): 2353-2363 (2005) - 2004
- [j4]Jun-Ho Her, R. S. Ramakrishna:
I/O-Efficient Multilevel Graph Partitioning Algorithm for Massive Graph Data. IEICE Trans. Inf. Syst. 87-D(7): 1789-1794 (2004) - [c11]Minho Kim, Hyunjin Yoo, R. S. Ramakrishna:
Cluster Validation for High-Dimensional Datasets. AIMSA 2004: 178-187 - [c10]Minho Kim, R. S. Ramakrishna:
A New Clustering Algorithm Based On Cluster Validity Indices. Discovery Science 2004: 322-329 - [c9]Mi-Ok Kim, Jun-Ho Her, R. S. Ramakrishna:
Replication Decision Making for Dynamic Data Replica Management in Data Grid. PDPTA 2004: 794-800 - 2003
- [c8]Minho Kim, Gye Hyung Kim, R. S. Ramakrishna:
A Virtual Join Algorithm for Fast Association Rule Mining. IDEAL 2003: 796-800 - [c7]Gye Hyung Kim, Minho Kim, Jun-Ho Her, R. S. Ramakrishna:
Efficient Fault Tolerant Apriori Algorithm for Discovering Association Rules among Local Protein Structures. METMBS 2003: 82-87 - 2002
- [c6]Jun-Ho Her, R. S. Ramakrishna:
Design and Implementation of Reliable Network RamDisk. PDPTA 2002: 1652-1658 - 2001
- [c5]Sei-Ie Jang, Joong-Han Kim, R. S. Ramakrishna:
Framework for Building Mobile Contex-Aware Applications. Human.Society@Internet 2001: 139-150 - [c4]Joong-Han Kim, Seong-Soo Yae, R. S. Ramakrishna, Yoo-Sung Kim:
Load Distribution in Jini Using JINT. PPAM 2001: 354-363 - [c3]Chin Hyun Chung, R. S. Ramakrishna:
A New Parallel Volume Rendering Algorithm. WSCG (Short Papers) 2001: 32-37
1990 – 1999
- 1999
- [c2]Jusung Baek, R. S. Ramakrishna, Donk-Ik Lee:
A Design of a Protocol for Detecting an Agent Clone in Mobile Agent Systems and its Correctness Proof. PODC 1999: 269 - 1998
- [c1]R. S. Ramakrishna, B. Vaidyanathan:
Error Analysis in Stereo Vision. ACCV (1) 1998: 296-304 - 1990
- [j3]R. K. Singh, R. S. Ramakrishna:
Shadows and texture in computer vision. Pattern Recognit. Lett. 11(2): 133-141 (1990) - [j2]Manoj K. Kamani, R. S. Ramakrishna:
Predicate-formation for synthesizing LISP code. IEEE Trans. Syst. Man Cybern. 20(2): 530-533 (1990)
1980 – 1989
- 1985
- [j1]R. S. Ramakrishna, S. K. Mullick, R. K. S. Rathore:
A new iterative algorithm for image restoration. Comput. Vis. Graph. Image Process. 30(1): 47-55 (1985)
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 23:22 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:
