Covering the edge set of a directed graph with trees. - K. Vidyasankar (Discret. Math., 1978)

Covers and strong covers in directed bipartite graphs. - Krishnamurthy Vidyasankar (J. Graph Theory, 1980)

A Simple Characterization of Database Serializability. - K. Vidyasankar (FSTTCS, 1985)

An Optimistic Resiliency Control Scheme for Distributed Database Systems. - K. Vidyasankar; Toshimi Minoura (WDAG, 1987)

Generalized Theory of Serializability. - K. Vidyasankar (Acta Informatica, 1987)

Version Consistency and Serializability in Design Databases. - K. Vidyasankar; Christopher N. G. Dampney (ICDT, 1988)

Serializable Graphs. - K. Vidyasankar (WG, 1988)

Converting Lamport's Regular Register to Atomic Register. - K. Vidyasankar (Inf. Process. Lett., 1988)

Concurrency and Trie Hashing. - Witold Litwin; Yehoshua Sagiv; K. Vidyasankar (Acta Informatica, 1989)

An Elegant 1-Writer Multireader Multivalued Atomic Register. - K. Vidyasankar (Inf. Process. Lett., 1989)

Concurrent Reading While Writing Revisited. - K. Vidyasankar (Distributed Comput., 1990)

Atomicity of Global Transactions in Distributed Heterogeneous Database Systems. - K. Vidyasankar (DEXA, 1991)

Unified theory of database serializability. - K. Vidyasankar (Fundam. Informaticae, 1991)

A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable. - K. Vidyasankar (Inf. Process. Lett., 1991)

A Non-Two Phase Locking Protocol for Global Concurrency Control in Distributed Heterogeneous Database Systems. - K. Vidyasankar (IEEE Trans. Knowl. Data Eng., 1991)

Counteraxamples to a One Writer Multireader Atomic Variable Construction of Burns and Peterson. - Sibsankar Haldar; K. Vidyasankar (ACM SIGOPS Oper. Syst. Rev., 1992)

Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables. - Sibsankar Haldar; K. Vidyasankar (J. ACM, 1995)

Buffer-Optimal Constructions of 1-Writer Multireader Multivalued Atomic Shared Variables. - Sibsankar Haldar; K. Vidyasankar (J. Parallel Distributed Comput., 1995)

Space-Efficient Construction of Buffer-Optimal 1-Writer 1-Reader Multivalued Atomic Variable (Abstract). - Sibsankar Haldar; K. Vidyasankar (PODC, 1996)

Simple Extensions of 1-writer Atomic Variable Constructions to Multiwriter Ones. - Sibsankar Haldar; K. Vidyasankar (Acta Informatica, 1996)

Fair and Efficient Mutual Exclusion Algorithms (Extended Abstract). - K. Alagarsamy; K. Vidyasankar (DISC, 1999)

Flexible Integration of Optimistic and Pessimistic Concurrency Control in Mobile Environments. - K. A. Momin; K. Vidyasankar (ADBIS-DASFAA, 2000)

A highly concurrent group mutual /-exclusion algorithm0. - K. Vidyasankar (PODC, 2002)

A simple group mutual l-exclusion algorithm. - K. Vidyasankar (Inf. Process. Lett., 2003)

A Nested Transaction Model for LDAP Transactions. - Debmalya Biswas; K. Vidyasankar (ICDCIT, 2004)

A Distributed Implementation of Sequential Consistency with Multi-Object Operations. - Michel Raynal; K. Vidyasankar (ICDCS, 2004)

A Multi-Level Model for Web Service Composition. - K. Vidyasankar; Gottfried Vossen (ICWS, 2004)

Spheres of Visibility. - Debmalya Biswas; K. Vidyasankar (ECOWS, 2005)

A Lazy Replication Scheme for Loosely Synchronized UDDI Registries. - Mahantesh Surgihalli; K. Vidyasankar (IASTED PDCS, 2005)

Monitoring for Hierarchical Web Services Compositions. - Debmalya Biswas; Krishnamurthy Vidyasankar (TES, 2005)

Binding and Execution of Web Service Compositions. - K. Vidyasankar; V. S. Ananthanarayana (WISE, 2005)

Modeling Visibility in Hierarchical Systems. - Debmalya Biswas; K. Vidyasankar (ER, 2006)

Dynamic Primary Copy with Piggy-Backing Mechanism for Replicated UDDI Registry. - V. S. Ananthanarayana; K. Vidyasankar (ICDCIT, 2006)

A Highly Concurrent Group Mutual L-exclusion Algorithm. - K. Vidyasankar (Parallel Process. Lett., 2006)

A Multi-level Model for Activity Commitments in E-contracts. - K. Vidyasankar; P. Radha Krishna 001; Kamalakar Karlapalem (OTM Conferences (1), 2007)

On specification of Read/Write shared variables. - Sibsankar Haldar; K. Vidyasankar (J. ACM, 2007)

Study of Execution Centric Payment Issues in E-contracts. - Krishnamurthy Vidyasankar; P. Radha Krishna 001; Kamalakar Karlapalem (IEEE SCC (2), 2008)

A Highly Flexible Data Structure for Multi-level Visibility of P2P Communities. - Debmalya Biswas; Krishnamurthy Vidyasankar (ICDCN, 2008)

Study of Dependencies in Executions of E-Contract Activities. - Krishnamurthy Vidyasankar; P. Radha Krishna 001; Kamalakar Karlapalem (ADBIS, 2009)

Supporting Cross-Organizational Process Control. - Samuil Angelov; Jochem Vonk; Krishnamurthy Vidyasankar; Paul W. P. J. Grefen (PRO-VE, 2009)

Formalizing visibility characteristics in hierarchical systems. - Debmalya Biswas; Krishnamurthy Vidyasankar (Data Knowl. Eng., 2009)

On space-optimality of buffer-based conflict-free constructions of 1-writer 1-reader multivalued atomic variables from safe bits. - Sibsankar Haldar; Krishnamurthy Vidyasankar (J. Parallel Distributed Comput., 2009)

Serializability. - K. Vidyasankar (Encyclopedia of Database Systems, 2009)

Enhancing Business Collaborations with Client-Oriented Process Control. - Samuil Angelov; Jochem Vonk; Paul W. P. J. Grefen; Krishnamurthy Vidyasankar (Int. J. Cooperative Inf. Syst., 2011)

Optimal Compensation for Hierarchical Web Services Compositions Under Restricted Visibility. - Debmalya Biswas; Krishnamurthy Vidyasankar (Int. J. Inf. Syst. Serv. Sect., 2011)

Multi-Level Modeling of Web Service Compositions with Transactional Properties. - K. Vidyasankar; Gottfried Vossen (J. Database Manag., 2011)

An Efficient Scheduler for Closed Nested Transactions that Satisfies All-Reads-Consistency and Non-interference. - Sathya Peri; Krishnamurthy Vidyasankar (ICDCN, 2012)

Privacy Preserving Cloud Transactions. - Debmalya Biswas; Krishnamurthy Vidyasankar (OTM Conferences (2), 2012)

Privacy Preserving Profiling for Mobile Services. - Debmalya Biswas; Krishnamurthy Vidyasankar (ANT/MobiWIS, 2012)

Secure Cloud Transactions. - Debmalya Biswas; Krishnamurthy Vidyasankar (Comput. Syst. Sci. Eng., 2013)

Correctness of concurrent executions of closed nested transactions in transactional memory systems. - Sathya Peri; K. Vidyasankar (Theor. Comput. Sci., 2013)

A TimeStamp Based Multi-version STM Algorithm. - Priyanka Kumar; Sathya Peri; K. Vidyasankar (ICDCN, 2014)

Privacy preserving and transactional advertising for mobile services. - Debmalya Biswas; Krishnamurthy Vidyasankar (Computing, 2014)

Transactional properties of compositions of Internet of Things services. - K. Vidyasankar (ISC2, 2015)

A secure revocable personal health record system with policy-based fine-grained access control. - Mitu Kumar Debnath; Saeed Samet; Krishnamurthy Vidyasankar (PST, 2015)

A Transaction Model for Executions of Compositions of Internet of Things Services. - K. Vidyasankar (ANT/SEIT, 2016)

Transactional Composition of Executions in Stream Processing. - K. Vidyasankar (DEXA Workshops, 2016)

On Atomic Batch Executions in Stream Processing. - K. Vidyasankar (EUSPN/ICTH, 2016)

On Continuous Queries in Stream Processing. - K. Vidyasankar (ANT/SEIT, 2017)

A Fog Computing Framework for Blackberry Supply Chain Management. - Zaynab Musa; K. Vidyasankar (EUSPN/ICTH, 2017)

A Priority Algorithm to Control the Traffic Signal for Emergency Vehicles. - Md. Asaduzzaman; Krishnamurthy Vidyasankar (VTC Fall, 2017)

Batch Composite Transactions in Stream Processing. - K. Vidyasankar (Trans. Large Scale Data Knowl. Centered Syst., 2017)

Consistency of Continuous Queries in Fog Computing. - K. Vidyasankar (EUSPN/ICTH, 2018)

Distributing Computations in Fog Architectures. - Krishnamurthy Vidyasankar (TOPIC@PODC, 2018)

Atomicity of batches in stream processing. - K. Vidyasankar (J. Ambient Intell. Humaniz. Comput., 2018)

A Privacy Framework for Hierarchical Federated Learning. - Debmalya Biswas; Krishnamurthy Vidyasankar (CIKM Workshops, 2021)