Vishv M. Malhotra

Orcid: 0000-0002-5732-8467

Affiliations:
  • LNM Institute of Information Technology, Jaipur, Rajasthan, India
  • University of Tasmania, Hobart, Australia (former)


According to our database1, Vishv M. Malhotra authored at least 29 papers between 1978 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Teaching a University-Wide Programming Laboratory: Managing a C Programming Laboratory for a Large Class with Diverse Interests.
Proceedings of the Twenty-First Australasian Computing Education Conference, 2019

2018
IBAtS - Image Based Attendance System: A Low Cost Solution to Record Student Attendance in a Classroom.
Proceedings of the 2018 IEEE International Symposium on Multimedia, 2018

FACE - Face At Classroom Environment: Dataset and Exploration.
Proceedings of the Eighth International Conference on Image Processing Theory, 2018

2015
Optimisation in the Design of Environmental Sensor Networks with Robustness Consideration.
Sensors, 2015

Do Managers Understand Importance of Securing IT Resources?
Int. J. Virtual Communities Soc. Netw., 2015

2013
Scheduling Data Communication based Services on the Personal Mobile Devices.
Proceedings of the ICEIS 2013, 2013

Multi-objective optimization model in mobile data communication scheduling.
Proceedings of the 8th International Conference on Information Technology in Asia, 2013

2012
Analysis of mobile authentication protocols by SVO logic.
Proceedings of the First International Conference on Security of Internet of Things, 2012

2009
Multicasting Key Management in Wireless Networks.
Proceedings of the NBiS 2009, 2009

A Membership-Oriented Group Key Management for Application Services.
Proceedings of the NBiS 2009, 2009

Using interactivity to help users understand the impact of spam filter settings.
Proceedings of the Thriving on Diversity: Information Opportunities in a Pluralistic World, 2009

2006
More Effective Web Search Using Bigrams and Trigrams.
Webology, 2006

An Algorithm to Use Feedback on Viewed Documents to Improve Web Query.
Proceedings of the Web Information Systems and Technologies, International Conferences, 2006

An Algorithm to Use Feedback on Viewed Documents to Improve Web Query - Enabling Naïve Searchers to Search the Web Smartly.
Proceedings of the WEBIST 2006, 2006

2005
Characteristics of the Boolean Web Search Query: Estimating Success from Characteristics.
Proceedings of the WEBIST 2005, 2005

Synthesise Web Queries: Search the Web by Examples.
Proceedings of the ICEIS 2005, 2005

2004
Network of browsers - a multi-processor computer.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2004

Model Checking an Object-Oriented Design.
Proceedings of the ICEIS 2004, 2004

2001
A Decision Support System Model for Subjective Decisions.
Proceedings of the ICEIS 2001, 2001

1996
Storage-Efficient Data Structure for Large Lookup Dictionaries.
Inf. Process. Lett., 1996

Binary Translation: Static, Dynamic, Retargetable?
Proceedings of the 1996 International Conference on Software Maintenance (ICSM '96), 1996

1990
An Algorithm for Optimal Back-Striding in Prolog.
Proceedings of the Logic Programming, 1990

1989
An Improved Data-Dependency-Based Backtracking Scheme for Prolog.
Inf. Process. Lett., 1989

1988
A New Computation Rule for Prolog.
Inf. Process. Lett., 1988

1987
Extension of Weakest Precondition Formalism to a Low Level Language.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

A Look-Ahead Interpreter for Sequential Prolog and Its Implementation.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986
Automatic Retargetable Code Generation: A New Technique.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

1981
A data-flow language for specifying business data processing applications.
Proceedings of the 1981 conference on Functional programming languages and computer architecture, 1981

1978
An O(|V|³) Algorithm for Finding Maximum Flows in Networks.
Inf. Process. Lett., 1978


  Loading...