default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. Viswanathan Iyer
Person information
- affiliation (PhD 2007): National Institute of Technology Trichy (NITT), Department of Computer Science and Engineering, Tiruchirappalli, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]K. Viswanathan Iyer, Sulphikar A:
Some computational aspects of terminal Wiener index. Int. J. Comput. Sci. Math. 19(2): 123-132 (2024)
2010 – 2019
- 2019
- [j9]Karthick Seshadri
, K. Viswanathan Iyer, Mercy Shalinie Selvaraj:
Design and evaluation of a parallel document clustering algorithm based on hierarchical latent semantic analysis. Concurr. Comput. Pract. Exp. 31(13) (2019) - 2018
- [i10]K. Viswanathan Iyer:
Big data analytics: The stakes for students, scientists & managers - a management perspective. CoRR abs/1803.05991 (2018) - 2017
- [j8]K. Viswanathan Iyer:
A dynamic intranet-based online-portal support for Computer Science teaching. Educ. Inf. Technol. 22(3): 827-840 (2017) - [i9]K. Viswanathan Iyer:
A dynamic intranet-based online-portal support for Computer Science teaching. CoRR abs/1701.02093 (2017) - 2014
- [i8]K. Viswanathan Iyer:
A case for Intranet-based 0nline portal for undergraduate Computer Science education. CoRR abs/1408.1032 (2014) - 2011
- [i7]K. Viswanathan Iyer:
Functional dependency in relational databases (adapted after M.Y.Vardi's survey). CoRR abs/1103.4979 (2011) - [i6]P. Venkata Subba Reddy, K. Viswanathan Iyer:
Conditional and Unique Coloring of Graphs. CoRR abs/1106.3456 (2011) - 2010
- [j7]R. Balakrishnan. N. Sridharan, K. Viswanathan Iyer:
A Sharp Lower Bound for the Wiener Index of a Graph. Ars Comb. 97 (2010) - [j6]Karthick Seshadri, K. Viswanathan Iyer:
Parallelization of a dynamic SVD clustering algorithm and its application in information retrieval. Softw. Pract. Exp. 40(10): 883-896 (2010) - [i5]R. Balakrishnan, N. Sridharan, K. Viswanathan Iyer:
A sharp lower bound for the Wiener index of a graph. CoRR abs/1008.4039 (2010) - [i4]P. Venkata Subba Reddy, K. Viswanathan Iyer:
Algorithms for enumerating and counting D2CS of some graphs. CoRR abs/1011.4550 (2010) - [i3]P. Venkata Subba Reddy, K. Viswanathan Iyer:
On conditional coloring of some graphs. CoRR abs/1011.5289 (2010) - [i2]P. Venkata Subba Reddy, K. Viswanathan Iyer:
Conditional coloring of some parameterized graphs. CoRR abs/1012.2251 (2010)
2000 – 2009
- 2009
- [j5]K. Viswanathan Iyer, S. Prasanna:
A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree. Inf. Process. Lett. 109(11): 560-562 (2009) - [i1]K. Viswanathan Iyer, K. R. Uday Kumar Reddy:
Wiener index of binomial trees and Fibonacci trees. CoRR abs/0910.4432 (2009) - 2008
- [j4]R. Balakrishnan, N. Sridharan, K. Viswanathan Iyer:
Wiener index of graphs with more than one cut-vertex. Appl. Math. Lett. 21(9): 922-927 (2008) - 2001
- [j3]K. Viswanathan Iyer, M. Harinath:
Java based replicated server objects and their remote method invocations in a distributed environment. Softw. Pract. Exp. 31(4): 357-370 (2001)
1980 – 1989
- 1986
- [j2]K. Viswanathan Iyer, Lalit M. Patnaik:
Performance Study of a Centralized Concurrency Control Algorithm for Distributed Database Systems Using SIMULA. Comput. J. 29(2): 118-126 (1986) - [j1]Lalit M. Patnaik, Kailasam Viswanathan Iyer:
Load-Leveling in Fault-Tolerant Distributed Computing Systems. IEEE Trans. Software Eng. 12(4): 554-560 (1986)
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-06-10 20:27 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:
