K. Vidyasankar

Available identifiers

Publication	Date of Publication	Type
Serializable graphs	2024-02-28	Paper
Correctness of concurrent executions of closed nested transactions in transactional memory systems	2014-01-10	Paper
On specification of Read/Write shared variables	2008-12-21	Paper
A Highly Flexible Data Structure for Multi-level Visibility of P2P Communities	2008-03-06	Paper
A simple group mutual \(l\)-exclusion algorithm.	2003-01-21	Paper
Weak atomicity: A helpful notion in the construction of atomic shared variables	2002-02-18	Paper
Constructing 1-writer multireader multivalued atomic variables from regular variables	1998-02-02	Paper
Simple extensions of 1-writer atomic variable constructions to multiwriter ones	1995-11-16	Paper
A very simple construction of 1-writer multireader multivalued atomic variable	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5748878	1991-01-01	Paper
Concurrent reading while writing revisited	1990-01-01	Paper
Concurrency and trie hashing	1989-01-01	Paper
Converting Lamport's regular register to atomic register	1988-01-01	Paper
Generalized theory of serializability	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3732990	1985-01-01	Paper
Covers and strong covers in directed bipartite graphs	1980-01-01	Paper
Covering the edge set of a directed graph with trees	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4187851	1978-01-01	Paper
A Minimax Equality Related to the Longest Directed Path in an Acyclic Graph	1975-01-01	Paper

This page was built for person: K. Vidyasankar