default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDD. K. Subramanian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c5]Yolande Murat
, D. K. Subramanian, A. V. Lakshmanan, Martina Gerken:
Towards Solution-Processed Top-Emitting OLEDs Using a Phosphorescent Iridium Complex. ICTON 2019: 1-4
2000 – 2009
- 2006
- [j15]P. A. Vijaya, M. Narasimha Murty, D. K. Subramanian:
Efficient median based clustering and classification techniques for protein sequences. Pattern Anal. Appl. 9(2-3): 243-255 (2006) - [j14]P. A. Vijaya, M. Narasimha Murty, D. K. Subramanian:
Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification. Pattern Recognit. 39(12): 2344-2355 (2006) - 2005
- [c4]P. A. Vijaya, M. Narasimha Murty, D. K. Subramanian:
Analysis of Leader based Clustering Algorithms for Pattern Classification. IICAI 2005: 2072-2091 - [c3]P. A. Vijaya, M. Narasimha Murty, D. K. Subramanian:
An Efficient Hybrid Hierarchical Agglomerative Clustering (HHAC) Technique for Partitioning Large Data Sets. PReMI 2005: 583-588 - 2004
- [j13]P. A. Vijaya, M. Narasimha Murty, D. K. Subramanian:
An Efficient Hierarchical Clustering Algorithm for Protein Sequences. Int. J. Comput. Sci. Appl. 1(2): 61-75 (2004) - [j12]P. A. Vijaya, M. Narasimha Murty, D. K. Subramanian:
Leaders - Subleaders: An efficient hierarchical clustering algorithm for large data sets. Pattern Recognit. Lett. 25(4): 505-513 (2004) - [c2]P. A. Vijaya, M. Narasimha Murty, D. K. Subramanian:
An Efficient Technique for Protein Sequence Clustering and Classification. ICPR (2) 2004: 447-450 - 2003
- [j11]D. K. Subramanian, V. S. Ananthanarayana, M. Narasimha Murty:
Knowledge-based association rule mining using AND-OR taxonomies. Knowl. Based Syst. 16(1): 37-45 (2003) - [j10]V. S. Ananthanarayana, M. Narasimha Murty, D. K. Subramanian:
Tree structure for efficient data mining using rough sets. Pattern Recognit. Lett. 24(6): 851-862 (2003) - 2001
- [j9]V. S. Ananthanarayana, M. Narasimha Murty, D. K. Subramanian:
Multi-dimensional semantic clustering of large databases for association rule mining. Pattern Recognit. 34(4): 939-941 (2001) - [j8]V. S. Ananthanarayana, M. Narasimha Murty, D. K. Subramanian:
An incremental data mining algorithm for compact realization of prototypes. Pattern Recognit. 34(11): 2249-2251 (2001) - [j7]V. S. Ananthanarayana, M. Narasimha Murty, D. K. Subramanian:
Efficient clustering of large data sets. Pattern Recognit. 34(12): 2561-2563 (2001) - 2000
- [c1]V. S. Ananthanarayana, D. K. Subramanian, M. Narasimha Murty:
Scalable, Distributed and Dynamic Mining of Association Rules. HiPC 2000: 559-566
1990 – 1999
- 1998
- [j6]D. K. Subramanian, K. Subramanian:
Query Optimization in Multidatabase Systems. Distributed Parallel Databases 6(2): 183-210 (1998) - 1993
- [j5]Sibsankar Haldar, D. K. Subramanian:
An Affinity-Based Dynamic Load Balancing Protocol for Distributed Tansaction Processing Systems. Perform. Evaluation 17(1): 53-71 (1993) - 1992
- [j4]Sibsankar Haldar, D. K. Subramanian:
A Modified Round Robin Scheduler for Time-Sharing Systems. Comput. J. 35(Additional-Papers): A309-A315 (1992) - 1991
- [j3]Sibsankar Haldar, D. K. Subramanian:
Fairness in Processor Scheduling in Time Sharing Systems. ACM SIGOPS Oper. Syst. Rev. 25(1): 4-18 (1991)
1980 – 1989
- 1988
- [j2]Sibsankar Haldar, D. K. Subramanian:
Ring Based Termination Detection Algorithm for Distributed Computations. Inf. Process. Lett. 29(3): 149-153 (1988) - [j1]Sibsankar Haldar, D. K. Subramanian:
An Efficient Solution to the Mutual Exclusion Problem Using Unfair and Weak Semaphore. ACM SIGOPS Oper. Syst. Rev. 22(2): 60-66 (1988)
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:18 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:
