Skip to main content

11 Result(s)

within Ajay D. Kshemkalyani Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Dispersion of Mobile Robots on Grids

    The dispersion problem on graphs asks \(k\le n\) robots initially placed arbitrarily on the nodes of an n-node anonymous graph to reposition autonomously to reach a configuration in which each robot is on a dist...

    Ajay D. Kshemkalyani, Anisur Rahaman Molla… in WALCOM: Algorithms and Computation (2020)

  2. No Access

    Chapter and Conference Paper

    Fast Dispersion of Mobile Robots on Arbitrary Graphs

    The dispersion problem on graphs asks \(k\le n\) robots placed initially arbitrarily on the nodes of an n-node anonymous graph to reposition autonomously to reach a configuration in which each robot is on a dist...

    Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma in Algorithms for Sensor Systems (2019)

  3. No Access

    Book and Conference Proceedings

    Distributed Computing – IWDC 2005

    7th International Workshop, Kharagpur, India, December 27-30, 2005. Proceedings

    Ajit Pal, Ajay D. Kshemkalyani… in Lecture Notes in Computer Science (2005)

  4. No Access

    Chapter and Conference Paper

    Analysis of Interval-Based Global State Detection

    The problem of global state observation is fundamental to distributed systems. All interactions in distributed systems can be analyzed in terms of the building block formed by the pairwise interactions of inte...

    Punit Chandra, Ajay D. Kshemkalyani in Distributed Computing and Internet Technology (2005)

  5. No Access

    Chapter and Conference Paper

    A Note on Modalities for Nonconjunctive Global Predicates

    Global predicate detection is an important problem in distributed executions. A conjunctive predicate is one in which each conjunct is defined over variables local to a single process. Polynomial space and tim...

    Ajay D. Kshemkalyani in Distributed Computing - IWDC 2003 (2003)

  6. No Access

    Chapter and Conference Paper

    Detection of Orthogonal Interval Relations

    The complete set ℜ of orthogonal temporal interactions between pairs of intervals, formulated by Kshemkalyani, allows the detailed specification of the manner in which intervals can be related to one another i...

    Punit Chandra, Ajay D. Kshemkalyani in High Performance Computing — HiPC 2002 (2002)

  7. No Access

    Chapter and Conference Paper

    A Simple, Memory-Efficient Bounded Concurrent Timestam** Algorithm

    Several constructions have been proposed for implementing a Bounded Concurrent Timestamp System (BCTS). Some constructions are based on a recursively defined Precedence Graph. Such constructions have been viewed ...

    Vivek Shikaripura, Ajay D. Kshemkalyani in Algorithms and Computation (2002)

  8. No Access

    Chapter and Conference Paper

    Compact Routing in Directed Networks with Stretch Factor of Two

    This paper presents a compact routing algorithm with stretch less than 3for directed networks. Although for stretch less than 3, the lower bound for the total routing information in the network is Ω(n ...

    Punit Chandra, Ajay D. Kshemkalyani in High Performance Computing — HiPC 2001 (2001)

  9. No Access

    Chapter and Conference Paper

    Reducing False Causality in Causal Message Ordering

    A significant shortcoming of causal message ordering systems is their inefficiency because of false causality. False causality is the result of the inability of the “happens before” relation to model true caus...

    Pranav Gambhire, Ajay D. Kshemkalyani in High Performance Computing — HiPC 2000 (2000)

  10. No Access

    Chapter and Conference Paper

    Evaluation of the Optimal Causal Message Ordering Algorithm

    An optimal causal message ordering algorithm was recently proposed by Kshemkalyani and Singhal, and its optimality was proved theoretically. For a system of n processes, although the space complexity of this algo...

    Pranav Gambhire, Ajay D. Kshemkalyani in High Performance Computing — HiPC 2000 (2000)

  11. No Access

    Chapter and Conference Paper

    Concurrent Knowledge and Logical Clock Abstractions

    Vector and matrix clocks are exte sively used i asy chroous distributed systems.This paper asks,“how does the clock abstractio generalize?” and casts the problem in terms of concurrent knowledge. To this end, ...

    Ajay D. Kshemkalyani in FST TCS 2000: Foundations of Software Tech… (2000)