default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrishnamurthy Vidyasankar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c40]Debmalya Biswas, Krishnamurthy Vidyasankar:
A Privacy Framework for Hierarchical Federated Learning. CIKM Workshops 2021
2010 – 2019
- 2018
- [j27]K. Vidyasankar:
Atomicity of batches in stream processing. J. Ambient Intell. Humaniz. Comput. 9(1): 19-29 (2018) - [c39]K. Vidyasankar:
Consistency of Continuous Queries in Fog Computing. EUSPN/ICTH 2018: 16-23 - [c38]Krishnamurthy Vidyasankar:
Distributing Computations in Fog Architectures. TOPIC@PODC 2018: 3-8 - 2017
- [j26]K. Vidyasankar:
Batch Composite Transactions in Stream Processing. Trans. Large Scale Data Knowl. Centered Syst. 34: 13-32 (2017) - [c37]K. Vidyasankar:
On Continuous Queries in Stream Processing. ANT/SEIT 2017: 640-647 - [c36]Zaynab Musa, K. Vidyasankar:
A Fog Computing Framework for Blackberry Supply Chain Management. EUSPN/ICTH 2017: 178-185 - [c35]Md. Asaduzzaman, Krishnamurthy Vidyasankar:
A Priority Algorithm to Control the Traffic Signal for Emergency Vehicles. VTC Fall 2017: 1-7 - 2016
- [c34]K. Vidyasankar:
A Transaction Model for Executions of Compositions of Internet of Things Services. ANT/SEIT 2016: 195-202 - [c33]K. Vidyasankar:
Transactional Composition of Executions in Stream Processing. DEXA Workshops 2016: 114-118 - [c32]K. Vidyasankar:
On Atomic Batch Executions in Stream Processing. EUSPN/ICTH 2016: 72-79 - 2015
- [c31]K. Vidyasankar:
Transactional properties of compositions of Internet of Things services. ISC2 2015: 1-6 - [c30]Mitu Kumar Debnath, Saeed Samet
, Krishnamurthy Vidyasankar:
A secure revocable personal health record system with policy-based fine-grained access control. PST 2015: 109-116 - 2014
- [j25]Debmalya Biswas, Krishnamurthy Vidyasankar:
Privacy preserving and transactional advertising for mobile services. Computing 96(7): 613-630 (2014) - [c29]Priyanka Kumar, Sathya Peri, K. Vidyasankar:
A TimeStamp Based Multi-version STM Algorithm. ICDCN 2014: 212-226 - 2013
- [j24]Debmalya Biswas, Krishnamurthy Vidyasankar:
Secure Cloud Transactions. Comput. Syst. Sci. Eng. 28(6) (2013) - [j23]Sathya Peri, K. Vidyasankar:
Correctness of concurrent executions of closed nested transactions in transactional memory systems. Theor. Comput. Sci. 496: 125-153 (2013) - 2012
- [c28]Sathya Peri, Krishnamurthy Vidyasankar:
An Efficient Scheduler for Closed Nested Transactions that Satisfies All-Reads-Consistency and Non-interference. ICDCN 2012: 409-423 - [c27]Debmalya Biswas, Krishnamurthy Vidyasankar:
Privacy Preserving Cloud Transactions. OTM Conferences (2) 2012: 511-526 - [c26]Debmalya Biswas, Krishnamurthy Vidyasankar:
Privacy Preserving Profiling for Mobile Services. ANT/MobiWIS 2012: 569-576 - 2011
- [j22]Samuil Angelov, Jochem Vonk, Paul W. P. J. Grefen, Krishnamurthy Vidyasankar:
Enhancing Business Collaborations with Client-Oriented Process Control. Int. J. Cooperative Inf. Syst. 20(1): 1-37 (2011) - [j21]Debmalya Biswas, Krishnamurthy Vidyasankar:
Optimal Compensation for Hierarchical Web Services Compositions Under Restricted Visibility. Int. J. Inf. Syst. Serv. Sect. 3(4): 22-38 (2011) - [j20]K. Vidyasankar, Gottfried Vossen:
Multi-Level Modeling of Web Service Compositions with Transactional Properties. J. Database Manag. 22(2): 1-31 (2011) - [c25]Sathya Peri, Krishnamurthy Vidyasankar:
Correctness of Concurrent Executions of Closed Nested Transactions in Transactional Memory Systems. ICDCN 2011: 95-106
2000 – 2009
- 2009
- [j19]Debmalya Biswas, Krishnamurthy Vidyasankar:
Formalizing visibility characteristics in hierarchical systems. Data Knowl. Eng. 68(8): 748-774 (2009) - [j18]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 Distributed Comput. 69(1): 20-27 (2009) - [c24]Krishnamurthy Vidyasankar, P. Radha Krishna, Kamalakar Karlapalem:
Study of Dependencies in Executions of E-Contract Activities. ADBIS 2009: 301-313 - [c23]Debmalya Biswas, Krishnamurthy Vidyasankar:
Optimal compensation for hierarchical Web services compositions under restricted visibility. APSCC 2009: 293-300 - [c22]Samuil Angelov, Jochem Vonk, Krishnamurthy Vidyasankar, Paul W. P. J. Grefen:
Supporting Cross-Organizational Process Control. PRO-VE 2009: 415-422 - [r1]K. Vidyasankar:
Serializability. Encyclopedia of Database Systems 2009: 2626-2632 - 2008
- [c21]Krishnamurthy Vidyasankar, P. Radha Krishna, Kamalakar Karlapalem:
Study of Execution Centric Payment Issues in E-contracts. IEEE SCC (2) 2008: 135-142 - [c20]Debmalya Biswas, Krishnamurthy Vidyasankar:
A Highly Flexible Data Structure for Multi-level Visibility of P2P Communities. ICDCN 2008: 363-374 - 2007
- [j17]Sibsankar Haldar, K. Vidyasankar:
On specification of Read/Write shared variables. J. ACM 54(6): 31 (2007) - [c19]K. Vidyasankar, P. Radha Krishna, Kamalakar Karlapalem:
A Multi-level Model for Activity Commitments in E-contracts. OTM Conferences (1) 2007: 300-317 - 2006
- [j16]K. Vidyasankar:
A Highly Concurrent Group Mutual L-exclusion Algorithm. Parallel Process. Lett. 16(4): 467-484 (2006) - [c18]Debmalya Biswas, K. Vidyasankar:
Modeling Visibility in Hierarchical Systems. ER 2006: 155-167 - [c17]V. S. Ananthanarayana, K. Vidyasankar:
Dynamic Primary Copy with Piggy-Backing Mechanism for Replicated UDDI Registry. ICDCIT 2006: 389-402 - 2005
- [c16]Debmalya Biswas, K. Vidyasankar:
Spheres of Visibility. ECOWS 2005: 2-13 - [c15]Mahantesh Surgihalli, K. Vidyasankar:
A Lazy Replication Scheme for Loosely Synchronized UDDI Registries. IASTED PDCS 2005: 477-482 - [c14]Debmalya Biswas, Krishnamurthy Vidyasankar:
Monitoring for Hierarchical Web Services Compositions. TES 2005: 98-112 - [c13]K. Vidyasankar, V. S. Ananthanarayana:
Binding and Execution of Web Service Compositions. WISE 2005: 258-272 - 2004
- [c12]Debmalya Biswas, K. Vidyasankar:
A Nested Transaction Model for LDAP Transactions. ICDCIT 2004: 117-126 - [c11]Michel Raynal, K. Vidyasankar:
A Distributed Implementation of Sequential Consistency with Multi-Object Operations. ICDCS 2004: 544-551 - [c10]K. Vidyasankar, Gottfried Vossen:
A Multi-Level Model for Web Service Composition. ICWS 2004: 462- - 2003
- [j15]K. Vidyasankar:
A simple group mutual l-exclusion algorithm. Inf. Process. Lett. 85(2): 79-85 (2003) - 2002
- [c9]K. Vidyasankar:
A highly concurrent group mutual /-exclusion algorithm0. PODC 2002: 130 - 2000
- [c8]K. A. Momin, K. Vidyasankar:
Flexible Integration of Optimistic and Pessimistic Concurrency Control in Mobile Environments. ADBIS-DASFAA 2000: 346-353
1990 – 1999
- 1999
- [c7]K. Alagarsamy, K. Vidyasankar:
Fair and Efficient Mutual Exclusion Algorithms (Extended Abstract). DISC 1999: 166-179 - 1996
- [j14]Sibsankar Haldar, K. Vidyasankar:
Simple Extensions of 1-writer Atomic Variable Constructions to Multiwriter Ones. Acta Informatica 33(2): 177-202 (1996) - [c6]Sibsankar Haldar, K. Vidyasankar:
Space-Efficient Construction of Buffer-Optimal 1-Writer 1-Reader Multivalued Atomic Variable (Abstract). PODC 1996: 178 - 1995
- [j13]Sibsankar Haldar, K. Vidyasankar:
Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables. J. ACM 42(1): 186-203 (1995) - [j12]Sibsankar Haldar, K. Vidyasankar:
Buffer-Optimal Constructions of 1-Writer Multireader Multivalued Atomic Shared Variables. J. Parallel Distributed Comput. 31(2): 174-180 (1995) - 1992
- [j11]Sibsankar Haldar, K. Vidyasankar:
Counteraxamples to a One Writer Multireader Atomic Variable Construction of Burns and Peterson. ACM SIGOPS Oper. Syst. Rev. 26(1): 78-88 (1992) - 1991
- [j10]K. Vidyasankar:
Unified theory of database serializability. Fundam. Informaticae 14(2): 147-183 (1991) - [j9]K. Vidyasankar:
A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable. Inf. Process. Lett. 37(6): 323-326 (1991) - [j8]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) - [c5]K. Vidyasankar:
Atomicity of Global Transactions in Distributed Heterogeneous Database Systems. DEXA 1991: 321-326 - 1990
- [j7]K. Vidyasankar:
Concurrent Reading While Writing Revisited. Distributed Comput. 4: 81-85 (1990)
1980 – 1989
- 1989
- [j6]Witold Litwin, Yehoshua Sagiv, K. Vidyasankar:
Concurrency and Trie Hashing. Acta Informatica 26(7): 597-614 (1989) - [j5]K. Vidyasankar:
An Elegant 1-Writer Multireader Multivalued Atomic Register. Inf. Process. Lett. 30(5): 221-223 (1989) - 1988
- [j4]K. Vidyasankar:
Converting Lamport's Regular Register to Atomic Register. Inf. Process. Lett. 28(6): 287-290 (1988) - [c4]K. Vidyasankar, Christopher N. G. Dampney:
Version Consistency and Serializability in Design Databases. ICDT 1988: 368-382 - [c3]K. Vidyasankar:
Serializable Graphs. WG 1988: 107-121 - 1987
- [j3]K. Vidyasankar:
Generalized Theory of Serializability. Acta Informatica 24(1): 105-119 (1987) - [c2]K. Vidyasankar, Toshimi Minoura:
An Optimistic Resiliency Control Scheme for Distributed Database Systems. WDAG 1987: 297-309 - 1985
- [c1]K. Vidyasankar:
A Simple Characterization of Database Serializability. FSTTCS 1985: 329-345 - 1980
- [j2]Krishnamurthy Vidyasankar:
Covers and strong covers in directed bipartite graphs. J. Graph Theory 4(3): 279-286 (1980)
1970 – 1979
- 1978
- [j1]K. Vidyasankar:
Covering the edge set of a directed graph with trees. Discret. Math. 24(1): 79-85 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
