Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. Ganesan 0001
Person information
- affiliation: Florida Atlantic University, Department of Computer Science and Engineering, Boca Raton, FL, USA
- affiliation (former): Boston University, MA, USA
Other persons with the same name
- K. Ganesan 0002
![[0000-0002-4532-0222]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-4532-0222")
(aka: Ganesan Kandasamy) — SRM University, Department of Mathematics, Kattankulathur, India (and 1 more) - K. Ganesan 0003 (aka: Ganesan Kaliyaperumal) — Vellore of Institute of Technology, School of Computing Sciences, India
- K. Ganesan 0004 — PSR Engineering College, Department of Mechanical Engineering, Sivakasi, India
- K. Ganesan 0005 — SRM Institute of Science and Technology, Department of Mathematics, Kattankulathur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j6]K. Ganesan, Taghi M. Khoshgoftaar, Edward B. Allen:
Case-Based Software Quality Prediction. Int. J. Softw. Eng. Knowl. Eng. 10(2): 139-152 (2000)
1990 – 1999
- 1998
- [j5]S. M. Smith, K. Ganesan, Pak Cheung Edgar An, S. E. Dunn:
Strategies for simultaneous multiple autonomous underwater vehicle operation and control. Int. J. Syst. Sci. 29(10): 1045-1063 (1998) - 1997
- [c5]Taghi M. Khoshgoftaar, K. Ganesan, Edward B. Allen, Fletcher D. Ross, Rama Munikoti, Nishith Goel, Amit Nandi:
Predicting fault-prone modules with case-based reasoning. ISSRE 1997: 27-35 - 1996
- [j4]C. Vasudevan, K. Ganesan:
Case-based path planning for autonomous underwater vehicles. Auton. Robots 3(2-3): 79-89 (1996) - 1994
- [j3]K. Ganesan:
One-Way Functions and the Isomorphism Conjecture. Theor. Comput. Sci. 129(2): 309-321 (1994) - 1992
- [j2]K. Ganesan, Steven Homer:
Complete Problems and Strong Polynomial Reducibilities. SIAM J. Comput. 21(4): 733-742 (1992) - [c4]K. Ganesan:
One-way Functions and Isomorphism Conjecture. FSTTCS 1992: 152-163 - 1991
- [j1]K. B. Lakshmanan, Bala Ravikumar, K. Ganesan:
Coping with Erroneous Information while Sorting. IEEE Trans. Computers 40(9): 1081-1084 (1991)
1980 – 1989
- 1989
- [c3]K. Ganesan, Steven Homer:
Complete Problems and Strong Polynomial Reducibilities. STACS 1989: 240-250 - 1987
- [c2]Bala Ravikumar, K. Ganesan, K. B. Lakshmanan:
On Selecting the Largest Element in Spite of Erroneous Information. STACS 1987: 88-99
1970 – 1979
- 1976
- [c1]Wen C. Lin, K. Ganesan:
Study of an on-line, adaptive speaker-independent word recognition system based on acoustic-phonetic analysis and statistical pattern recognition techniques. ICASSP 1976: 194-197
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-25 02:37 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:
