3 papers
cs.PL2026
Bounding Fixed Points of Non-Monotone Processes: Theory to Practice
Abdullah H. Rasheed, Vijay K. Garg
Many modern solvers and program analyzers rely on non-monotone reasoning (e.g. negation-as-failure, speculative updates, backtracking) for which classical monotone fixed-point meth…
cs.DC2026
A common parallel framework for LLP combinatorial problems
David Ribeiro Alves, Vijay K. Garg
Traditional lock-free parallel algorithms for combinatorial optimization problems, such as shortest paths, stable matching, and job scheduling require programmers to write problem-…
cs.DC2023
Parallel Algorithms for Equilevel Predicates
Vijay K. Garg, Robert P. Streit
We define a new class of predicates called equilevel predicates on a distributive lattice which eases the analysis of parallel algorithms. Many combinatorial problems such as the v…