default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAjay D. Kshemkalyani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j56]Anshuman Misra, Ajay D. Kshemkalyani:
Detecting causality in the presence of Byzantine processes: The case of synchronous systems. Inf. Comput. 301: 105212 (2024)- [j55]Anshuman Misra
, Ajay D. Kshemkalyani:
Byzantine-Tolerant Causal Ordering for Unicasts, Multicasts, and Broadcasts. IEEE Trans. Parallel Distributed Syst. 35(5): 814-828 (2024) - [c90]Anshuman Misra, Ajay D. Kshemkalyani:
Towards Stronger Blockchains: Security Against Front-Running Attacks. NETYS 2024: 171-187 - [c89]Anshuman Misra, Ajay D. Kshemkalyani:
Solvability of Byzantine Fault-Tolerant Causal Ordering: Synchronous Systems Case. SAC 2024: 251-256 - [c88]Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma:
Brief Announcement: Agent-Based Leader Election, MST, and Beyond. DISC 2024: 50:1-50:7 - [i9]Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma:
Agent-based MST Construction. CoRR abs/2403.13716 (2024) - [i8]Ajay D. Kshemkalyani, Manaswini Piduguralla, Sathya Peri, Anshuman Misra:
Construction of a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers. CoRR abs/2405.19457 (2024) - 2023
- [c87]Anshuman Misra, Ajay D. Kshemkalyani:
Byzantine Fault-Tolerant Causal Ordering. ICDCN 2023: 100-109 - [c86]Anshuman Misra, Ajay D. Kshemkalyani:
Brief Announcement: Byzantine-Tolerant Detection of Causality in Synchronous Systems. SSS 2023: 57-61 - [c85]Anshuman Misra, Ajay D. Kshemkalyani:
Byzantine Fault-Tolerant Causal Order Satisfying Strong Safety. SSS 2023: 111-125 - [c84]Anshuman Misra, Ajay D. Kshemkalyani:
Detecting Causality in the Presence of Byzantine Processes: The Synchronous Systems Case. TIME 2023: 11:1-11:14 - [i7]Anshuman Misra, Ajay D. Kshemkalyani:
Towards Stronger Blockchains: Security Against Front-Running Attacks. CoRR abs/2311.10253 (2023) - 2022
- [j54]Abdullah Alourani, Ajay D. Kshemkalyani:
Cost-Effective Spot Instances Provisioning Using Features of Cloud Markets. Int. J. Cloud Appl. Comput. 12(1): 1-27 (2022) - [j53]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Dispersion of mobile robots using global communication. J. Parallel Distributed Comput. 161: 100-117 (2022) - [c83]Anshuman Misra, Ajay D. Kshemkalyani:
Causal Ordering in the Presence of Byzantine Processes. ICPADS 2022: 130-138 - [c82]Anshuman Misra, Ajay D. Kshemkalyani:
Byzantine Fault-Tolerant Causal Broadcast on Incomplete Graphs. NCA 2022: 63-71 - [c81]Anshuman Misra, Ajay D. Kshemkalyani:
Detecting Causality in the Presence of Byzantine Processes: There is No Holy Grail. NCA 2022: 73-80 - [c80]Anshuman Misra, Ajay D. Kshemkalyani:
Causal Ordering Properties of Byzantine Reliable Broadcast Primitives. NCA 2022: 115-122 - [c79]Anshuman Misra, Ajay D. Kshemkalyani:
Solvability of Byzantine Fault-Tolerant Causal Ordering Problems. NETYS 2022: 87-103 - 2021
- [j52]Tommaso Pozzetti, Ajay D. Kshemkalyani:
Resettable Encoded Vector Clock for Causality Analysis With an Application to Dynamic Race Detection. IEEE Trans. Parallel Distributed Syst. 32(4): 772-785 (2021) - [c78]Ta-Yuan Hsu, Ajay D. Kshemkalyani:
CaDRoP: Cost Optimized Convergent Causal Consistency in Social Network Systems. CCGRID 2021: 426-435 - [c77]Ta-Yuan Hsu, Ajay D. Kshemkalyani:
Convergent Causal Consistency for Social Media Posts. PaPoC@EuroSys 2021: 10:1-10:8 - [c76]Anshuman Misra, Ajay D. Kshemkalyani:
The Bloom Clock for Causality Testing. ICDCIT 2021: 3-23 - [c75]Zahra Bayramzadeh, Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Weak Amnesiac Flooding. ISPDC 2021: 122-129 - [c74]Zahra Bayramzadeh, Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Weak Amnesiac Flooding of Multiple Messages. NETYS 2021: 88-94 - [c73]Ajay D. Kshemkalyani, Gokarna Sharma:
Near-Optimal Dispersion on Arbitrary Anonymous Graphs. OPODIS 2021: 8:1-8:19 - [i6]Ajay D. Kshemkalyani, Gokarna Sharma:
Near-Optimal Dispersion on Arbitrary Anonymous Graphs. CoRR abs/2106.03943 (2021) - [i5]Anshuman Misra, Ajay D. Kshemkalyani:
Byzantine Fault Tolerant Causal Ordering. CoRR abs/2112.11337 (2021) - 2020
- [j51]Ajay D. Kshemkalyani, Min Shen, Bhargav Voleti:
Prime clock: Encoded vector clock to characterize causality in distributed systems. J. Parallel Distributed Comput. 140: 37-51 (2020) - [j50]Abdullah Alourani, Ajay D. Kshemkalyani, Mark Grechanik:
T-BASIR: Finding Shutdown Bugs for Cloud-Based Applications in Cloud Spot Markets. IEEE Trans. Parallel Distributed Syst. 31(8): 1912-1924 (2020) - [c72]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Dispersion of Mobile Robots in the Global Communication Model. ICDCN 2020: 12:1-12:10 - [c71]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Efficient Dispersion of Mobile Robots on Dynamic Graphs. ICDCS 2020: 732-742 - [c70]Abdullah Alourani, Ajay D. Kshemkalyani:
Provisioning Spot Instances Without Employing Fault-Tolerance Mechanisms. ISPDC 2020: 126-133 - [c69]Ajay D. Kshemkalyani, Anshuman Misra:
The Bloom Clock to Characterize Causality in Distributed Systems. NBiS 2020: 269-279 - [c68]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Dispersion of Mobile Robots on Grids. WALCOM 2020: 183-197 - [i4]Abdullah Alourani, Ajay D. Kshemkalyani:
Provisioning Spot Instances Without Employing Fault-Tolerance Mechanisms. CoRR abs/2003.13846 (2020) - [i3]Anshuman Misra, Ajay D. Kshemkalyani:
The Bloom Clock for Causality Testing. CoRR abs/2011.11744 (2020)
2010 – 2019
- 2019
- [c67]Abdullah Alourani, Ajay D. Kshemkalyani, Mark Grechanik:
Testing for Bugs of Cloud-Based Applications Resulting from Spot Instance Revocations. CLOUD 2019: 243-250 - [c66]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Fast Dispersion of Mobile Robots on Arbitrary Graphs. ALGOSENSORS 2019: 23-40 - [c65]Ajay D. Kshemkalyani, Bhargav Voleti:
On the Growth of the Prime Numbers Based Encoded Vector Clock. ICDCIT 2019: 169-184 - [c64]Ajay D. Kshemkalyani, Faizan Ali:
Efficient dispersion of mobile robots on graphs. ICDCN 2019: 218-227 - [c63]Ta Yuan Hsu, Ajay D. Kshemkalyani:
A Proactive, Cost-aware, Optimized Data Replication Strategy in Geo-distributed Cloud Datastores. UCC 2019: 143-153 - [i2]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Dispersion of Mobile Robots in the Global Communication Model. CoRR abs/1909.01957 (2019) - 2018
- [j49]Ta Yuan Hsu, Ajay D. Kshemkalyani, Min Shen:
Causal consistency algorithms for partially replicated and fully replicated systems. Future Gener. Comput. Syst. 86: 1118-1133 (2018) - [j48]Ta Yuan Hsu, Ajay D. Kshemkalyani:
Value the Recent Past: Approximate Causal Consistency for Partially Replicated Systems. IEEE Trans. Parallel Distributed Syst. 29(1): 212-225 (2018) - [c62]Ajay D. Kshemkalyani, Faizan Ali:
Fast Graph Exploration by a Mobile Robot. AIKE 2018: 115-118 - [c61]Ajay D. Kshemkalyani, Ashfaq Khokhar, Min Shen:
Encoded Vector Clock: Using Primes to Characterize Causality in Distributed Systems. ICDCN 2018: 12:1-12:8 - [c60]Anmol Agrawal, Vaskar Raychoudhury, Divya Saxena, Ajay D. Kshemkalyani:
Efficient Taxi and Passenger Searching in Smart City using Distributed Coordination. ITSC 2018: 1920-1927 - [c59]Kanika Bathla, Vaskar Raychoudhury, Divya Saxena, Ajay D. Kshemkalyani:
Real-Time Distributed Taxi Ride Sharing. ITSC 2018: 2044-2051 - [i1]Ajay D. Kshemkalyani, Faizan Ali:
Efficient Dispersion of Mobile Robots on Graphs. CoRR abs/1805.12242 (2018) - 2016
- [c58]Ta Yuan Hsu, Ajay D. Kshemkalyani:
Performance of Causal Consistency Algorithms for Partially Replicated Systems. IPDPS Workshops 2016: 525-534 - [c57]Ta Yuan Hsu, Ajay D. Kshemkalyani:
Performance of Approximate Causal Consistency for Partially Replicated Systems. ARMS-CC@PODC 2016: 7-13 - 2015
- [j47]Ta Yuan Hsu, Ajay D. Kshemkalyani:
Variable social vector clocks for exploring user interactions in social communication networks. Int. J. Space Based Situated Comput. 5(1): 39-52 (2015) - [c56]Ta Yuan Hsu, Ajay D. Kshemkalyani:
Modeling Social Network Topology with Variable Social Vector Clocks. ASONAM 2015: 584-589 - [c55]Min Shen, Ajay D. Kshemkalyani, Ta Yuan Hsu:
OPCAM: Optimal Algorithms Implementing Causal Memories in Shared Memory Systems. ICDCN 2015: 16:1-16:4 - [c54]Min Shen, Ajay D. Kshemkalyani, Ta Yuan Hsu:
Causal Consistency for Geo-Replicated Cloud Storage under Partial Replication. IPDPS Workshops 2015: 509-518 - [c53]Ajay D. Kshemkalyani, Ta Yuan Hsu:
Approximate causal consistency for partially replicated geo-replicated cloud storage. NDM@SC 2015: 3:1-3:8 - 2014
- [j46]Min Shen, Ajay D. Kshemkalyani, Ashfaq A. Khokhar:
Detecting stable locality-aware predicates. J. Parallel Distributed Comput. 74(1): 1971-1983 (2014) - [j45]Vaskar Raychoudhury, Ajay D. Kshemkalyani, Daqing Zhang, Jiannong Cao:
Automatic Event Scheduling in Mobile Social Network Communities. IEEE Trans. Parallel Distributed Syst. 25(11): 2772-2782 (2014) - [j44]Min Shen, Ajay D. Kshemkalyani:
Hierarchical Detection of Strong Unstable Conjunctive Predicates in Large-Scale Systems. IEEE Trans. Parallel Distributed Syst. 25(11): 2899-2908 (2014) - [c52]Ta Yuan Hsu, Ajay D. Kshemkalyani, Min Shen:
Modeling User Interactions in Social Communication Networks with Variable Social Vector Clocks. AINA Workshops 2014: 96-101 - 2013
- [j43]Ajay D. Kshemkalyani, Mukesh Singhal:
Efficient distributed snapshots in an anonymous asynchronous message-passing system. J. Parallel Distributed Comput. 73(5): 621-629 (2013) - [j42]Ajay D. Kshemkalyani, Jiannong Cao:
Predicate Detection in Asynchronous Pervasive Environments. IEEE Trans. Computers 62(9): 1823-1836 (2013) - [c51]Min Shen, Ajay D. Kshemkalyani:
A Fault-Tolerant Strong Conjunctive Predicate Detection Algorithm for Large-Scale Networks. IPDPS Workshops 2013: 1460-1469 - [c50]Min Shen, Ajay D. Kshemkalyani, Ashfaq A. Khokhar:
Detecting Unstable Conjunctive Locality-Aware Predicates in Large-Scale Systems. ISPDC 2013: 127-134 - [c49]Vaskar Raychoudhury, Ajay D. Kshemkalyani, Daqing Zhang, Jiannong Cao, Mohit Bakshi, Kanik Gupta, Vishal Mittal, Siddharth Maheshwari:
Automatic Event Scheduling in Mobile Social Network Communities. SocialCom 2013: 403-410 - 2012
- [j41]Ajay D. Kshemkalyani, Ashfaq A. Khokhar, Min Shen:
Execution and Time Models for Pervasive Sensor Networks. Int. J. Netw. Comput. 2(1): 2-17 (2012) - [j40]Ajay D. Kshemkalyani:
Immediate detection of predicates in pervasive environments. J. Parallel Distributed Comput. 72(2): 219-230 (2012) - [c48]Min Shen, Ajay D. Kshemkalyani, Ashfaq A. Khokhar:
Detecting Tree Distributed Predicates. ICPP Workshops 2012: 598-599 - [c47]Mohamed Hefeida, Min Shen, Ajay D. Kshemkalyani, Ashfaq A. Khokhar:
Cross-layer protocols for WSNs: A simple design and simulation paradigm. IWCMC 2012: 844-849 - [c46]Vaskar Raychoudhury, Jiannong Cao, Weiping Zhu, Ajay D. Kshemkalyani:
Context Map for Navigating the Physical World. PDP 2012: 146-153 - 2011
- [j39]Ajay D. Kshemkalyani:
Repeated detection of conjunctive predicates in distributed executions. Inf. Process. Lett. 111(9): 447-452 (2011) - [j38]Juzheng Li, Sol M. Shatz, Ajay D. Kshemkalyani:
Mobile Sampling of Sensor Field Data Using Controlled Broadcast. IEEE Trans. Mob. Comput. 10(6): 881-896 (2011) - [c45]Mohamed Hefeida, Turkmen Canli, Ajay D. Kshemkalyani, Ashfaq A. Khokhar:
Context modeling in collaborative sensor network applications. CTS 2011: 274-279 - [c44]Ajay D. Kshemkalyani, Ashfaq A. Khokhar, Min Shen:
Execution and Time Models for Pervasive Sensor Networks. IPDPS Workshops 2011: 639-647 - [c43]Sangyoon Lee, Ajay D. Kshemkalyani, Min Shen:
Performance Evaluation of Incremental Vector Clocks. ISPDC 2011: 117-124 - [c42]Vaskar Raychoudhury, Ajay D. Kshemkalyani, Jiannong Cao:
Querying context maps using relative timing predicates in pervasive environments. MidSens 2011: 3 - 2010
- [j37]Zhiguo Zhang, Ajay D. Kshemkalyani, Sol M. Shatz:
Dynamic multiroot, multiquery processing based on data sharing in sensor networks. ACM Trans. Sens. Networks 6(3): 25:1-25:38 (2010) - [j36]Ajay D. Kshemkalyani:
Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems. IEEE Trans. Parallel Distributed Syst. 21(9): 1281-1289 (2010) - [c41]Ajay D. Kshemkalyani:
Middleware clocks for sensing the physical world. MidSens 2010: 15-21 - [c40]Ajay D. Kshemkalyani:
Immediate detection of predicates in pervasive environments. ARM 2010: 18-25
2000 – 2009
- 2009
- [c39]Ajay D. Kshemkalyani:
A symmetric O(n log n) message distributed snapshot algorithm for large-scale systems. CLUSTER 2009: 1-4 - 2008
- [j35]Bin Wu, Ajay D. Kshemkalyani:
Modeling message propagation in random graph networks. Comput. Commun. 31(17): 4138-4148 (2008) - [j34]Bin Wu, Ajay D. Kshemkalyani:
Analysis models for unguided search in unstructured P2P networks. Int. J. Ad Hoc Ubiquitous Comput. 3(4): 255-263 (2008) - [j33]Punit Chandra, Ajay D. Kshemkalyani:
Data-stream-based global event monitoring using pairwise interactions. J. Parallel Distributed Comput. 68(6): 729-751 (2008) - [c38]Zhiguo Zhang, Ajay D. Kshemkalyani, Sol M. Shatz:
Multi-root, Multi-Query Processing in Sensor Networks. DCOSS 2008: 432-450 - 2007
- [j32]Bartlomiej Sieka, Ajay D. Kshemkalyani:
Establishing Authenticated Channels and Secure Identifiers in Ad-hoc Networks. Int. J. Netw. Secur. 5(1): 51-61 (2007) - [j31]Ranganath Atreya, Neeraj Mittal, Ajay D. Kshemkalyani, Vijay K. Garg, Mukesh Singhal:
Efficient detection of a locally stable predicate in a distributed system. J. Parallel Distributed Comput. 67(4): 369-385 (2007) - [j30]Ajay D. Kshemkalyani:
Temporal Predicate Detection Using Synchronized Clocks. IEEE Trans. Computers 56(11): 1578-1584 (2007) - [j29]Ajay D. Kshemkalyani, Bin Wu:
Detecting Arbitrary Stable Properties Using Efficient Snapshots. IEEE Trans. Software Eng. 33(5): 330-346 (2007) - 2006
- [j28]Bin Wu, Ajay D. Kshemkalyani:
Objective-Optimal Algorithms for Long-Term Web Prefetching. IEEE Trans. Computers 55(1): 2-17 (2006) - [c37]Bartlomiej Sieka, Ajay D. Kshemkalyani:
Fully self-organized key agreement for ad-hoc wireless networks. CCNC 2006: 80-85 - [c36]Bin Wu, Ajay D. Kshemkalyani:
Evaluation of Models for Analyzing Unguided Search in Unstructured Networks. EUC Workshops 2006: 163-172 - [c35]Bin Wu, Ajay D. Kshemkalyani:
Analysis Models for Blind Search in Unstructured Overlays. NCA 2006: 223-226 - 2005
- [j27]Bharath Sundararaman, Ugo A. Buy, Ajay D. Kshemkalyani:
Clock synchronization for wireless sensor networks: a survey. Ad Hoc Networks 3(3): 281-323 (2005) - [j26]Punit Chandra, Ajay D. Kshemkalyani:
Causality-Based Predicate Detection across Space and Time. IEEE Trans. Computers 54(11): 1438-1453 (2005) - [c34]Punit Chandra, Ajay D. Kshemkalyani:
Global State Detection Based on Peer-to-Peer Interactions. EUC 2005: 560-571 - [c33]Ajay D. Kshemkalyani, Bin Wu:
Nonintrusive Snapshots Using Thin Slices. EUC 2005: 572-583 - [c32]Ajay D. Kshemkalyani:
Predicate Detection Using Event Streams in Ubiquitous Environments. EUC Workshops 2005: 807-816 - [c31]Punit Chandra, Ajay D. Kshemkalyani:
Analysis of Interval-Based Global State Detection. ICDCIT 2005: 203-216 - [e2]Ajit Pal, Ajay D. Kshemkalyani, Rajeev Kumar, Arobinda Gupta:
Distributed Computing - IWDC 2005, 7th International Workshop, Kharagpur, India, December 27-30, 2005, Proceedings. Lecture Notes in Computer Science 3741, Springer 2005, ISBN 3-540-30959-4 [contents] - 2004
- [j25]Ajay D. Kshemkalyani:
The power of logical clock abstractions. Distributed Comput. 17(2): 131-150 (2004) - [j24]Punit Chandra, Pranav Gambhire, Ajay D. Kshemkalyani:
Performance of the Optimal Causal Multicast Algorithm: A Statistical Analysis. IEEE Trans. Parallel Distributed Syst. 15(1): 40-52 (2004) - [c30]Liujia Hu, Ajay D. Kshemkalyani:
HRED: A Simple and Efficient Active Queue Management Algorithm. ICCCN 2004: 387-393 - [c29]Kandarp Jani, Ajay D. Kshemkalyani:
Performance of Fair Distributed Mutual Exclusion Algorithms. IWDC 2004: 2-15 - [c28]Punit Chandra, Ajay D. Kshemkalyani:
Causal Multicast in Mobile Networks. MASCOTS 2004: 213-220 - [c27]Bin Wu, Ajay D. Kshemkalyani:
Objective-Greedy Algorithms for Long-Term Web Prefetching. NCA 2004: 61-68 - [c26]Bartlomiej Sieka, Ajay D. Kshemkalyani, Mukesh Singhal:
On the Security of Polling Protocols in Peer-to-Peer Systems. Peer-to-Peer Computing 2004: 36-44 - 2003
- [j23]Punit Chandra, Ajay D. Kshemkalyani:
Distributed algorithm to detect strong conjunctive predicates. Inf. Process. Lett. 87(5): 243-249 (2003) - [j22]Ajay D. Kshemkalyani:
A Fine-Grained Modality Classification for Global Predicates. IEEE Trans. Parallel Distributed Syst. 14(8): 807-816 (2003) - [c25]Punit Chandra, Ajay D. Kshemkalyani:
Global Predicate Detection under Fine-Grained Modalities. ASIAN 2003: 91-109 - [c24]Ajay D. Kshemkalyani:
A Note on Modalities for Nonconjunctive Global Predicates. IWDC 2003: 11-25 - [c23]Mayank Rawat, Ajay D. Kshemkalyani:
SWIFT: Scheduling in Web Servers for Fast Response Time. NCA 2003: 51-58 - 2002
- [j21]Ajay D. Kshemkalyani, Roshan Kamath:
Orthogonal relations for reasoning about posets. Int. J. Intell. Syst. 17(12): 1101-1110 (2002) - [j20]Ajay D. Kshemkalyani, Mukesh Singhal:
Communication Patterns in Distributed Computations. J. Parallel Distributed Comput. 62(6): 1104-1119 (2002) - [c22]Punit Chandra, Ajay D. Kshemkalyani:
Detection of Orthogonal Interval Relations. HiPC 2002: 323-333 - [c21]Vivek Shikaripura, Ajay D. Kshemkalyani:
A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm. ISAAC 2002: 550-562 - 2001
- [c20]Ajay D. Kshemkalyani, Roshan Kamath:
Orthogonal Relations for Reasoning about Abstract Events. ECSQARU 2001: 726-735 - [c19]Sandeep Lodha, Punit Chandra, Ajay D. Kshemkalyani, Mayank Rawat:
Efficient Synchronization of Asynchronous Processes. Euro-Par 2001: 352-357 - [c18]Punit Chandra, Ajay D. Kshemkalyani:
Compact Routing in Directed Networks with Stretch Factor of Two. HiPC 2001: 24-46 - [e1]Ajay D. Kshemkalyani, Nir Shavit:
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001. ACM 2001, ISBN 1-58113-383-9 [contents] - 2000
- [j19]Sandeep Lodha, Ajay D. Kshemkalyani:
A Fair Distributed Mutual Exclusion Algorithm. IEEE Trans. Parallel Distributed Syst. 11(6): 537-549 (2000) - [c17]Ajay D. Kshemkalyani:
Concurrent Knowledge and Logical Clock Abstractions. FSTTCS 2000: 489-502 - [c16]Pranav Gambhire, Ajay D. Kshemkalyani:
Reducing False Causality in Causal Message Ordering. HiPC 2000: 61-72 - [c15]Pranav Gambhire, Ajay D. Kshemkalyani:
Evaluation of the Optimal Causal Message Ordering Algorithm. HiPC 2000: 83-95
1990 – 1999
- 1999
- [j18]Ajay D. Kshemkalyani, Mukesh Singhal:
A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases. IEEE Trans. Knowl. Data Eng. 11(6): 880-895 (1999) - [c14]Ajay D. Kshemkalyani, Mukesh Singhal:
Universal Constructs in Distributed Computations. Euro-Par 1999: 795-805 - [c13]Ajay D. Kshemkalyani, Mukesh Singhal:
Two Classes of Communication Patterns. PODC 1999: 277 - 1998
- [j17]Mohammad Peyravian, Ajay D. Kshemkalyani:
Decentralized Network Connection Preemption Algorithms. Comput. Networks 30(11): 1029-1043 (1998) - [j16]Mohammad Peyravian, Allen Roginsky, Ajay D. Kshemkalyani:
On probabilities of hash value matches. Comput. Secur. 17(2): 171-176 (1998) - [j15]Ajay D. Kshemkalyani, Mukesh Singhal:
Necessary and Sufficient Conditions on Information for Causal Message Ordering and Their Optimal Implementation. Distributed Comput. 11(2): 91-111 (1998) - [j14]Ajay D. Kshemkalyani:
Causality and Atomicity in Distributed Computations. Distributed Comput. 11(4): 169-189 (1998) - [j13]Ajay D. Kshemkalyani, George Samaras, Andrew Citron:
Context management and its applications to distributed transactions. Distributed Syst. Eng. 5(1): 1-11 (1998) - [j12]Ajay D. Kshemkalyani:
A Framework for Viewing Atomic Events in Distributed Computations. Theor. Comput. Sci. 196(1-2): 45-70 (1998) - [c12]Ajay D. Kshemkalyani:
Significance and Uses of Fine-Grained Synchronization Relations. Euro-Par 1998: 578-590 - [c11]Ajay D. Kshemkalyani:
Testing of Synchronization Conditions for Distributed Real-Time Applications. IPPS/SPDP Workshops 1998: 1140-1152 - [c10]Ajay D. Kshemkalyani:
Efficient Evaluation of Causality Relations Between Nonatomic Events. PODC 1998: 322 - 1997
- [j11]Ajay D. Kshemkalyani:
Reasoning About Causality Between Distributed Nonatomic Events. Artif. Intell. 92(1-2): 301-315 (1997) - [j10]Mohammad Peyravian, Ajay D. Kshemkalyani:
Network path caching: : Issues, algorithms and a simulation study. Comput. Commun. 20(8): 605-614 (1997) - [j9]George Samaras, Andrew Citron, Ajay D. Kshemkalyani:
Reconciling chained and unchained transactional support for distributed systems. J. Syst. Archit. 43(1-5): 229-243 (1997) - [j8]James P. Gray, Ajay D. Kshemkalyani, Stephen M. Matyas, Mohammad Peyravian, Gene Tsudik:
ATM cell encryption and key update synchronization. Telecommun. Syst. 7(4): 391-408 (1997) - [c9]Ajay D. Kshemkalyani:
Causality between Nonatomic Poset Events in Distributed Computations. FTDCS 1997: 276-283 - [c8]Ajay D. Kshemkalyani, Mukesh Singhal:
Distributed Detection of Generalized Deadlocks. ICDCS 1997: 553-560 - [c7]Mohammad Peyravian, Ajay D. Kshemkalyani:
Connection Preemption: Issues, Algorithms, and a Simulation Study. INFOCOM 1997: 143-151 - 1996
- [j7]Ajay D. Kshemkalyani:
Temporal Interactions of Intervals in Distributed Systems. J. Comput. Syst. Sci. 52(2): 287-298 (1996) - [c6]Ajay D. Kshemkalyani:
A Framework for Viewing Atomic Events in Distributed Computations. Euro-Par, Vol. I 1996: 496-505 - [c5]George Samaras, Ajay D. Kshemkalyani, Andrew Citron:
Context Management and its Applications to Distributed Transactions. ICDCS 1996: 683-691 - [c4]Ajay D. Kshemkalyani, Mukesh Singhal:
An Optimal Algorithm for Generalized Causal Message Ordering (Abstract). PODC 1996: 87 - 1995
- [j6]Ajay D. Kshemkalyani, Michel Raynal, Mukesh Singhal:
An introduction to snapshot algorithms in distributed computing. Distributed Syst. Eng. 2(4): 224-233 (1995) - [j5]Wendy S. Arnette, Ajay D. Kshemkalyani, Wayne B. Riley, Jack P. Sanders, Peter Schwaller, J. Chuck Terrien, John Q. Walker II:
CPI-C: An API for Distributed Applications. IBM Syst. J. 34(3): 501-518 (1995) - 1994
- [j4]Ajay D. Kshemkalyani, Mukesh Singhal:
On Characterization and Correctness of Distributed Deadlock Detection. J. Parallel Distributed Comput. 22(1): 44-59 (1994) - [j3]Ajay D. Kshemkalyani, Mukesh Singhal:
Efficient Detection and Resolution of Generalized Distributed Deadlocks. IEEE Trans. Software Eng. 20(1): 43-54 (1994) - 1993
- [c3]George Samaras, Andrew Citron, Ajay D. Kshemkalyani:
Unchained Transactionsd and SNA LU6.2. HPTS 1993 - 1992
- [j2]Mukesh Singhal, Ajay D. Kshemkalyani:
An Efficient Implementation of Vector Clocks. Inf. Process. Lett. 43(1): 47-52 (1992) - 1991
- [j1]Ajay D. Kshemkalyani, Mukesh Singhal:
Invariant-Based Verification of a Distributed Deadlock Detection Algorithm. IEEE Trans. Software Eng. 17(8): 789-799 (1991) - 1990
- [c2]Mohan Ahuja, Ajay D. Kshemkalyani, Timothy Carlson:
A Basic Unit of Computation in Distributed Systems. ICDCS 1990: 12-19 - [c1]Ajay D. Kshemkalyani, Mukesh Singhal:
Correct Two-Phase and One-Phase Deadlock Detection Algorithms for Distributed Systems. SPDP 1990: 126-129
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 2024-10-25 20:15 CEST 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:
