The SCEAS System
Navigation Menu

Search the dblp DataBase


K. Vidyasankar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.006secs, Finished in 0.008secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002