K. Vidyasankar

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Serializable graphs Graph-Theoretic Concepts in Computer Science	2024-02-28	Paper
Correctness of concurrent executions of closed nested transactions in transactional memory systems Theoretical Computer Science	2014-01-10	Paper
On specification of Read/Write shared variables Journal of the ACM	2008-12-21	Paper
A Highly Flexible Data Structure for Multi-level Visibility of P2P Communities Distributed Computing and Networking	2008-03-06	Paper
A simple group mutual \(l\)-exclusion algorithm. Information Processing Letters	2003-01-21	Paper
Weak atomicity: A helpful notion in the construction of atomic shared variables Sādhanā	2002-02-18	Paper
Constructing 1-writer multireader multivalued atomic variables from regular variables Journal of the ACM	1998-02-02	Paper
Simple extensions of 1-writer atomic variable constructions to multiwriter ones Acta Informatica	1995-11-16	Paper
A very simple construction of 1-writer multireader multivalued atomic variable Information Processing Letters	1991-01-01	Paper
scientific article; zbMATH DE number 4182805 (Why is no real title available?)	1991-01-01	Paper
Concurrent reading while writing revisited Distributed Computing	1990-01-01	Paper
Concurrency and trie hashing Acta Informatica	1989-01-01	Paper
Converting Lamport's regular register to atomic register Information Processing Letters	1988-01-01	Paper
Generalized theory of serializability Acta Informatica	1987-01-01	Paper
scientific article; zbMATH DE number 3965471 (Why is no real title available?)	1985-01-01	Paper
Covers and strong covers in directed bipartite graphs Journal of Graph Theory	1980-01-01	Paper
Covering the edge set of a directed graph with trees Discrete Mathematics	1978-01-01	Paper
scientific article; zbMATH DE number 3625432 (Why is no real title available?)	1978-01-01	Paper
A Minimax Equality Related to the Longest Directed Path in an Acyclic Graph Canadian Journal of Mathematics	1975-01-01	Paper

Research outcomes over time

This page was built for person: K. Vidyasankar