The following pages link to Kalpesh Kapoor (Q277634):
Displaying 16 items.
- On del-robust primitive words (Q277635) (← links)
- Fine-grained concurrency with separation logic (Q763473) (← links)
- Characterization of dense patterns having distinct squares (Q831749) (← links)
- On multiset of factors of a word (Q1943616) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- Motion planning in Cartesian product graphs (Q2450121) (← links)
- On reachability in graphs with obstacles (Q2788738) (← links)
- On the Language of Primitive Partial Words (Q2799195) (← links)
- ON <i>mRJ</i> REACHABILITY IN TREES (Q4903641) (← links)
- On Complete S-Reachable Graphs (Q5069738) (← links)
- (Q5389010) (← links)
- Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching (Q5410652) (← links)
- Formal Approaches to Software Testing (Q5710645) (← links)
- The square density of words having a sequence of FS-double squares (Q6069178) (← links)
- (Q6150948) (← links)
- Density of distinct squares in non-primitive words (Q6161432) (← links)
