| 2009 |
|---|
| 37 | EE | Sibsankar Haldar,
Krishnamurthy Vidyasankar:
On space-optimality of buffer-based conflict-free constructions of 1-writer 1-reader multivalued atomic variables from safe bits.
J. Parallel Distrib. Comput. 69(1): 20-27 (2009) |
| 2008 |
|---|
| 36 | EE | Debmalya Biswas,
Krishnamurthy Vidyasankar:
A Highly Flexible Data Structure for Multi-level Visibility of P2P Communities.
ICDCN 2008: 363-374 |
| 35 | EE | Krishnamurthy Vidyasankar,
P. Radha Krishna,
Kamalakar Karlapalem:
Study of Execution Centric Payment Issues in E-contracts.
IEEE SCC (2) 2008: 135-142 |
| 2007 |
|---|
| 34 | EE | K. Vidyasankar,
P. Radha Krishna,
Kamalakar Karlapalem:
A Multi-level Model for Activity Commitments in E-contracts.
OTM Conferences (1) 2007: 300-317 |
| 33 | EE | Sibsankar Haldar,
K. Vidyasankar:
On specification of Read/Write shared variables.
J. ACM 54(6): (2007) |
| 2006 |
|---|
| 32 | EE | Debmalya Biswas,
K. Vidyasankar:
Modeling Visibility in Hierarchical Systems.
ER 2006: 155-167 |
| 31 | EE | V. S. Ananthanarayana,
K. Vidyasankar:
Dynamic Primary Copy with Piggy-Backing Mechanism for Replicated UDDI Registry.
ICDCIT 2006: 389-402 |
| 30 | EE | K. Vidyasankar:
A Highly Concurrent Group Mutual L-exclusion Algorithm.
Parallel Processing Letters 16(4): 467-484 (2006) |
| 2005 |
|---|
| 29 | EE | Debmalya Biswas,
K. Vidyasankar:
Spheres of Visibility.
ECOWS 2005: 2-13 |
| 28 | | Mahantesh Surgihalli,
K. Vidyasankar:
A Lazy Replication Scheme for Loosely Synchronized UDDI Registries.
IASTED PDCS 2005: 477-482 |
| 27 | EE | Debmalya Biswas,
Krishnamurthy Vidyasankar:
Monitoring for Hierarchical Web Services Compositions.
TES 2005: 98-112 |
| 26 | EE | K. Vidyasankar,
V. S. Ananthanarayana:
Binding and Execution of Web Service Compositions.
WISE 2005: 258-272 |
| 2004 |
|---|
| 25 | EE | Debmalya Biswas,
K. Vidyasankar:
A Nested Transaction Model for LDAP Transactions.
ICDCIT 2004: 117-126 |
| 24 | EE | Michel Raynal,
K. Vidyasankar:
A Distributed Implementation of Sequential Consistency with Multi-Object Operations.
ICDCS 2004: 544-551 |
| 23 | EE | K. Vidyasankar,
Gottfried Vossen:
A Multi-Level Model for Web Service Composition.
ICWS 2004: 462- |
| 2003 |
|---|
| 22 | EE | K. Vidyasankar:
A simple group mutual l-exclusion algorithm.
Inf. Process. Lett. 85(2): 79-85 (2003) |
| 2002 |
|---|
| 21 | EE | K. Vidyasankar:
A highly concurrent group mutual /-exclusion algorithm0.
PODC 2002: 130 |
| 2000 |
|---|
| 20 | EE | K. A. Momin,
K. Vidyasankar:
Flexible Integration of Optimistic and Pessimistic Concurrency Control in Mobile Environments.
ADBIS-DASFAA 2000: 346-353 |
| 1999 |
|---|
| 19 | EE | K. Alagarsamy,
K. Vidyasankar:
Fair and Efficient Mutual Exclusion Algorithms (Extended Abstract).
DISC 1999: 166-179 |
| 1996 |
|---|
| 18 | | Sibsankar Haldar,
K. Vidyasankar:
Space-Efficient Construction of Buffer-Optimal 1-Writer 1-Reader Multivalued Atomic Variable (Abstract).
PODC 1996: 178 |
| 17 | | Sibsankar Haldar,
K. Vidyasankar:
Simple Extensions of 1-writer Atomic Variable Constructions to Multiwriter Ones.
Acta Inf. 33(2): 177-202 (1996) |
| 1995 |
|---|
| 16 | EE | Sibsankar Haldar,
K. Vidyasankar:
Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables.
J. ACM 42(1): 186-203 (1995) |
| 15 | | Sibsankar Haldar,
K. Vidyasankar:
Buffer-Optimal Constructions of 1-Writer Multireader Multivalued Atomic Shared Variables.
J. Parallel Distrib. Comput. 31(2): 174-180 (1995) |
| 1992 |
|---|
| 14 | | Sibsankar Haldar,
K. Vidyasankar:
Counteraxamples to a One Writer Multireader Atomic Variable Construction of Burns and Peterson.
Operating Systems Review 26(1): 78-88 (1992) |
| 1991 |
|---|
| 13 | | K. Vidyasankar:
Atomicity of Global Transactions in Distributed Heterogeneous Database Systems.
DEXA 1991: 321-326 |
| 12 | | K. Vidyasankar:
Unified theory of database serializability.
Fundam. Inform. 14(2): 147-183 (1991) |
| 11 | EE | K. Vidyasankar:
A Non-Two Phase Locking Protocol for Global Concurrency Control in Distributed Heterogeneous Database Systems.
IEEE Trans. Knowl. Data Eng. 3(2): 256-261 (1991) |
| 10 | | K. Vidyasankar:
A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable.
Inf. Process. Lett. 37(6): 323-326 (1991) |
| 1990 |
|---|
| 9 | | K. Vidyasankar:
Concurrent Reading While Writing Revisited.
Distributed Computing 4: 81-85 (1990) |
| 1989 |
|---|
| 8 | | Witold Litwin,
Yehoshua Sagiv,
K. Vidyasankar:
Concurrency and Trie Hashing.
Acta Inf. 26(7): 597-614 (1989) |
| 7 | | K. Vidyasankar:
An Elegant 1-Writer Multireader Multivalued Atomic Register.
Inf. Process. Lett. 30(5): 221-223 (1989) |
| 1988 |
|---|
| 6 | EE | K. Vidyasankar,
Christopher N. G. Dampney:
Version Consistency and Serializability in Design Databases.
ICDT 1988: 368-382 |
| 5 | | K. Vidyasankar:
Serializable Graphs.
WG 1988: 107-121 |
| 4 | | K. Vidyasankar:
Converting Lamport's Regular Register to Atomic Register.
Inf. Process. Lett. 28(6): 287-290 (1988) |
| 1987 |
|---|
| 3 | | K. Vidyasankar,
Toshimi Minoura:
An Optimistic Resiliency Control Scheme for Distributed Database Systems.
WDAG 1987: 297-309 |
| 2 | | K. Vidyasankar:
Generalized Theory of Serializability.
Acta Inf. 24(1): 105-119 (1987) |
| 1985 |
|---|
| 1 | | K. Vidyasankar:
A Simple Characterization of Database Serializability.
FSTTCS 1985: 329-345 |
