default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDE. V. Krishnamurthy
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j41]V. Kris Murthy, E. V. Krishnamurthy:
Learning to capture the functions of genetic regulatory networks using graph motifs. Int. J. Adv. Intell. Paradigms 4(2): 185-197 (2012)- 2011
- [c31]E. V. Krishnamurthy:
Multi-agent Self-organizing Scheme for Chemical Patent Datamining. SocProS (2) 2011: 41-51 - 2010
- [c30]Venu K. Murthy, Edayathu V. Krishnamurthy:
Can Graph Motifs Capture the Functions of a Complex Network? BIOCOMP 2010: 134-139 - [c29]Edayathu V. Krishnamurthy:
Swarming - A Classical Analog of Hardy's Quantum Gravity Computational Paradigm. FCS 2010: 103-108
2000 – 2009
- 2009
- [p3]Venu K. Murthy, E. V. Krishnamurthy:
Multiset of Agents in a Network for Simulation of Complex Systems. Recent Advances in Nonlinear Dynamics and Synchronization 2009: 153-200 - 2008
- [c28]Venu K. Murthy, Edayathu V. Krishnamurthy:
Multi-sensor Information Fusion: Distributed agents-Based paradigm. IKE 2008: 223-229 - 2007
- [c27]V. Kris Murthy, E. V. Krishnamurthy:
Cooperating sensory agents for detecting temporal consistency among events. Parallel and Distributed Computing and Networks 2007: 361-366 - [p2]Venu K. Murthy, E. V. Krishnamurthy:
Interacting Agents in a Network for in silico Modeling of Nature-Inspired Smart Systems. Computational Intelligence for Agent-based Systems 2007: 177-231 - 2006
- [j40]E. V. Krishnamurthy, V. Kris Murthy:
Distributed agent paradigm for soft and hard computation. J. Netw. Comput. Appl. 29(2-3): 124-146 (2006) - [c26]Venu K. Murthy, Edayathu V. Krishnamurthy:
Can Artificial Life Emerge in a Network of Interacting Agents? FUZZ-IEEE 2006: 106-113 - [p1]E. V. Krishnamurthy, Vikram Krishnamurthy:
Multiset Rule-Based Programming Paradigm for Soft-Computing in Complex Systems. Handbook of Nature-Inspired and Innovative Computing 2006: 77-109 - 2005
- [c25]Venu K. Murthy, E. V. Krishnamurthy:
Contextual information management using contract: based workflow. Conf. Computing Frontiers 2005: 236-245 - [c24]E. V. Krishnamurthy, Venu K. Murthy:
Nature-Inspired Computations Using an Evolving Multi-set of Agents. ICNC (2) 2005: 784-794 - [c23]E. V. Krishnamurthy, V. Kris Murthy:
On Engineering Smart Systems. KES (3) 2005: 505-512 - [r4]Venu K. Murthy, E. V. Krishnamurthy:
Agent-Based Negotiation in E-Marketing. Encyclopedia of Information Science and Technology (I) 2005: 88-92 - [r3]Venu K. Murthy, E. V. Krishnamurthy:
Contract-Based Workflow Design Patterns in M-Commerce. Encyclopedia of Information Science and Technology (I) 2005: 584-589 - [r2]Venu K. Murthy, Edayathu V. Krishnamurthy:
E-Business Transaction in Web Integrated Network Environment. Encyclopedia of Information Science and Technology (II) 2005: 934-938 - [r1]Venu K. Murthy, Edayathu V. Krishnamurthy:
Multimedia Computing Environment for Telemedical Applications. Encyclopedia of Information Science and Technology (IV) 2005: 2045-2050 - 2004
- [c22]E. V. Krishnamurthy, Venu K. Murthy, Vikram Krishnamurthy:
Biologically inspired rule-based multiset programming paradigm for soft-computing. Conf. Computing Frontiers 2004: 140-149 - [c21]E. V. Krishnamurthy, Venu K. Murthy:
Contextual-Knowledge Management in Peer to Peer Computing. KES 2004: 87-94 - [c20]Venu K. Murthy, E. V. Krishnamurthy:
Collaborating Agents in Distributed Networks and Emergence of Collective Knowledge. KES 2004: 95-102 - [c19]E. V. Krishnamurthy, Vikram Krishnamurthy:
Simulating Complex Dynamical Systems in a Distributed Programming Environment. NPC 2004: 272-279 - 2003
- [c18]E. V. Krishnamurthy:
Algorithmic Entropy, Phase Transition, and Smart Systems. International Conference on Computational Science 2003: 333-342 - [c17]E. V. Krishnamurthy:
Problems and Prospects for Quantum Computational Speed-up. International Conference on Computational Science 2003: 779-788 - [c16]Venu K. Murthy, E. V. Krishnamurthy:
Interacting Agents in Networks: E-Auction and Emergence in E-Marketing. ICDCS Workshops 2003: 628-633 - 2002
- [c15]Venu K. Murthy, E. V. Krishnamurthy:
Scalable Performance in Workstation Cluster: Influence of a Programming Paradigm. ICPP Workshops 2002: 352-359 - [c14]Venu K. Murthy, E. V. Krishnamurthy:
Software Pattern Design for Cluster Computing. ICPP Workshops 2002: 360-367
1990 – 1999
- 1999
- [c13]E. V. Krishnamurthy:
Integrability and Quantum Parallel Computational Complexity. IC-AI 1999: 91-97 - [c12]E. V. Krishnamurthy:
Open Problems in the Design of Quantum Control and Computational Systems. IC-AI 1999: 98-101 - 1998
- [c11]Venu K. Murthy, Edayathu V. Krishnamurthy, A. Pham:
Distributed Object Models, Mobile Computing And Electronic Commerce. ICPP Workshops 1998: 134-143 - [c10]Venu K. Murthy, E. V. Krishnamurthy:
Integrated network computing models, programming modes and software tools. SAC 1998: 551-557 - 1997
- [c9]Venu K. Murthy, E. V. Krishnamurthy:
Heterogeneous programming with concurrent objects. SAC 1997: 454-463 - 1996
- [c8]Venu K. Murthy, E. V. Krishnamurthy:
Gamma Programming Paradigm and Heterogeneous Computing. HICSS (1) 1996: 273-281 - 1995
- [j39]V. Kris Murthy, E. V. Krishnamurthy:
Probabilistic parallel programming based on multiset transformation. Future Gener. Comput. Syst. 11(3): 283-293 (1995) - [c7]E. V. Krishnamurthy:
Neural networks-competence and performance. ICNN 1995: 7-10 - [c6]Venu K. Murthy, E. V. Krishnamurthy:
Automating Problem Solving Using Transactional Paradigm. IEA/AIE 1995: 721-729 - [c5]Pin Chen, E. V. Krishnamurthy:
ABCOM: A Parallelism Revelation Model. Parallel and Distributed Computing and Systems 1995: 428-432 - 1994
- [j38]E. V. Krishnamurthy:
Unsolvability, complexity, and neural networks. Neural Networks 7(5): 847-848 (1994) - [j37]Lujuan Chen, E. V. Krishnamurthy, Iain MacLeod:
Generalised Matrix Inversion and Rank Computation by Successive Matrix Powering. Parallel Comput. 20(3): 297-311 (1994) - [j36]E. V. Krishnamurthy, Vikram Krishnamurthy:
An ANN Model Perceptron Algorithm Using Generalized Matrix Inversion. Parallel Comput. 20(5): 799-806 (1994) - 1993
- [j35]Lujuan Chen, Iain MacLeod, Edayathu V. Krishnamurthy:
Suffix parallel computation and operator splitting for fast solution of PDE's. Neural Parallel Sci. Comput. 1: 287-300 (1993) - [j34]E. V. Krishnamurthy, Chen Pin:
Data Parallel Evaluation-Interpolation Algorithm for Polynomial Matrix Inversion. Parallel Comput. 19(5): 577-589 (1993) - [c4]Lujuan Chen, E. V. Krishnamurthy, Iain MacLeod:
Generalised Matrix Inversion by Successive Matrix Squaring. ICPP (3) 1993: 124-127 - 1992
- [j33]Venu K. Murthy, E. V. Krishnamurthy, Pin Chen:
Systolic algorithm for rational interpolation and Padé approximation. Parallel Comput. 18(1): 75-83 (1992) - [c3]Chen Pin, E. V. Krishnamurthy:
Data Parallel Evaluation-Interpolation Algorithm for Solving Functional Matrix Equations. CONPAR 1992: 781-782 - 1991
- [j32]Heiko Schröder, E. V. Krishnamurthy:
Systolic computation of characteristic polynomials of Hessenberg matrices. Parallel Comput. 17(2-3): 273-277 (1991) - [j31]E. V. Krishnamurthy, Heiko Schröder:
Systolic algorithm for multivariable approximation using tensor products of basis functions. Parallel Comput. 17(4-5): 483-492 (1991) - [j30]Heiko Schröder, Venu K. Murthy, E. V. Krishnamurthy:
Systolic algorithm for polynomial interpolation and related problems. Parallel Comput. 17(4-5): 493-503 (1991) - 1990
- [j29]E. V. Krishnamurthy, Manfred Kunde, Manfred Schimmler, Heiko Schröder:
Systolic algorithm for tensor products of matrices: implementation and applications. Parallel Comput. 13(3): 301-308 (1990)
1980 – 1989
- 1989
- [b3]Edayathu V. Krishnamurthy:
Parallel processing - principles and practice. International computer science series, Addison-Wesley 1989, ISBN 978-0-201-17532-5, pp. I-XI, 1-332 - 1988
- [j28]Olivier Y. de Vel, E. V. Krishnamurthy:
An Iterative Pipelined Array Architecture for the Generalized Matrix Inversion. Inf. Process. Lett. 26(5): 263-267 (1988) - 1987
- [j27]E. V. Krishnamurthy, B. P. Vickers:
Compact Numeral Representation with Combinators. J. Symb. Log. 52(2): 519-525 (1987) - 1985
- [b2]Edayathu V. Krishnamurthy:
Error-Free Polynomial Matrix Computations. Texts and Monographs in Computer Science, Springer 1985, ISBN 978-0-387-96146-0, pp. I-XV, 1-154 - [j26]E. V. Krishnamurthy:
Symbolic Iterative Algorithm for Generalised Inversion of Rational Polynomial Matrices. J. Symb. Comput. 1(3): 271-281 (1985) - 1984
- [b1]Robert T. Gregory, Edayathu V. Krishnamurthy:
Methods and applications of error-free computation. Texts and Monographs in Computer Science, Springer 1984, ISBN 978-3-540-90967-5, pp. I-XII, 1-194 - [j25]E. V. Krishnamurthy:
Functional programming with combinators for symbolic computation. SIGSAM Bull. 18(2): 24 (1984) - [j24]Edayathu V. Krishnamurthy:
High-order tensor product approximation for two- and three-dimensional image blocks with application to multiresolution image representation. Comput. Vis. Graph. Image Process. 25(3): 393-398 (1984) - 1983
- [j23]E. V. Krishnamurthy:
Fast Parallel Exact Computation of the Moore-Penrose Inverse and Rank of a Matrix. J. Inf. Process. Cybern. 19(1/2): 95-98 (1983) - [j22]E. V. Krishnamurthy:
On the Conversion of Hensel Codes to Farey Rationals. IEEE Trans. Computers 32(4): 331-337 (1983) - [j21]E. V. Krishnamurthy, Venu K. Murthy:
Fast Iterative Division of p-adic Numbers. IEEE Trans. Computers 32(4): 396-398 (1983) - 1982
- [j20]Les Kitchen, E. V. Krishnamurthy:
Fast, parallel, relaxation screening for chemical patent data-base search. J. Chem. Inf. Comput. Sci. 22(1): 44-48 (1982) - [j19]E. V. Krishnamurthy:
WISENOM. A formal organic chemical nomenclature system. J. Chem. Inf. Comput. Sci. 22(3): 152-160 (1982) - 1981
- [j18]E. V. Krishnamurthy, Reinhard Klette:
Fast Parallel Realization of Matrix Multiplication. J. Inf. Process. Cybern. 17(4-6): 279-292 (1981)
1970 – 1979
- 1977
- [j17]E. V. Krishnamurthy:
Matrix Processors Using p-adic Arithmetic for Exact Linear Computations. IEEE Trans. Computers 26(7): 633-639 (1977) - 1976
- [j16]S. Krishnan, E. V. Krishnamurthy:
Compact grammer for algorithmic Wiswesser notation using morgan name. Inf. Process. Manag. 12(1): 19-34 (1976) - 1975
- [c2]E. V. Krishnamurthy:
Matrix processors using p-ADIC arithmetic for exact linear computations. IEEE Symposium on Computer Arithmetic 1975: 92-97 - 1974
- [j15]E. V. Krishnamurthy, T. Mahadeva Rao, K. Subramanian, S. S. Prabhu:
Reconstruction of objects from their projections using generalized inverses. Comput. Graph. Image Process. 3(4): 336-345 (1974) - [j14]Syamal K. Sen, E. V. Krishnamurthy:
Rank-Augmented LU-Algorithm for Computing Generalized Matrix Inverses. IEEE Trans. Computers 23(2): 199-201 (1974) - 1973
- [j13]P. V. Sankar, Sangeeta Chakrabarti, E. V. Krishnamurthy:
Arithmetic Algorithms in a Negative Base. IEEE Trans. Computers 22(2): 120-125 (1973) - [j12]P. V. Sankar, Sangeeta Chakrabarti, E. V. Krishnamurthy:
Deterministic Division Algorithm in a Negative Base. IEEE Trans. Computers 22(2): 125-128 (1973) - 1972
- [j11]P. V. Sankar, Syamal Kumar Sen, E. V. Krishnamurthy:
Simply Invertible Matrices. IEEE Trans. Computers 21(5): 512-513 (1972) - [c1]Gururaj S. Rao, E. V. Krishnamurthy, M. Negesh Rao:
A polarizer for negative binary numbers. IEEE Symposium on Computer Arithmetic 1972: 1-4 - 1971
- [j10]E. V. Krishnamurthy:
Economical Iterative and Range-Transformation Schemes for Division. IEEE Trans. Computers 20(4): 470-472 (1971) - [j9]E. V. Krishnamurthy:
Complementary Two-Way Algorithms for Negative Radix Conversions. IEEE Trans. Computers 20(5): 543-550 (1971) - [j8]B. P. Sarkar, E. V. Krishnamurthy:
Economic Pseudodivision Processes for Obtaining Square Root, Logarithm, and Arctan. IEEE Trans. Computers 20(12): 1589-1593 (1971) - 1970
- [j7]E. V. Krishnamurthy:
On Range-Transformation Techniques for Division. IEEE Trans. Computers 19(2): 157-160 (1970) - [j6]E. V. Krishnamurthy:
On Optimal Ierative Schemes for High-Speed Division. IEEE Trans. Computers 19(3): 227-231 (1970)
1960 – 1969
- 1967
- [j5]Salil K. Nandi, E. V. Krishnamurthy:
A simple technique for digital division. Commun. ACM 10(5): 299-301 (1967) - [j4]E. V. Krishnamurthy, Salil K. Nandi:
On the normalization requirement of divisor in divide-and-correct methods. Commun. ACM 10(12): 809-813 (1967) - 1965
- [j3]Edayathu V. Krishnamurthy:
On a divide-and-correct method for variable precision division. Commun. ACM 8(3): 179-181 (1965) - 1964
- [j2]E. V. Krishnamurthy:
A Simple Algorithm for Evaluating Positive Values of the Function xy. IEEE Trans. Electron. Comput. 13(1): 55 (1964) - 1963
- [j1]Edayathu V. Krishnamurthy:
On Computer Multiplication and Division Using Binary Logarithms. IEEE Trans. Electron. Comput. 12(3): 319-320 (1963)
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 05:50 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:
