5 citations · 13 across the 20 of their papers we have counts for
24 papers
Lattice Linear Predicate Algorithms for the Constrained Stable Marriage Problem with Ties
Vijay K. Garg
We apply Lattice-Linear Predicate Detection Technique to derive parallel and distributed algorithms for various variants of the stable matching problem. These problems are: (a) the…
Minimal Envy Matchings in the Hospitals/Residents Problem with Lower Quotas
Changyong Hu, Vijay K. Garg
In the Hospitals/Residents problem, every hospital has an upper quota that limits the number of residents assigned to it. While, in some applications, each hospital also has a lowe…
Characterization of Super-stable Matchings
Changyong Hu, Vijay K. Garg
An instance of the super-stable matching problem with incomplete lists and ties is an undirected bipartite graph , with an adjacency list being a linearly ordere…
Who Needs Consensus? A Distributed Monetary System Between Rational Agents via Hearsay
Yanni Georghiades, Robert Streit, Vijay Garg
We propose a novel distributed monetary system called Hearsay that tolerates both Byzantine and rational behavior without the need for agents to reach consensus on executed transac…
A Lattice Linear Predicate Parallel Algorithm for the Dynamic Programming Problems
Vijay K. Garg
It has been shown that the parallel Lattice Linear Predicate (LLP) algorithm solves many combinatorial optimization problems such as the shortest path problem, the stable marriage…
Amortized Constant Round Atomic Snapshot in Message-Passing Systems
Vijay Garg, Saptaparni Kumar, Lewis Tseng +1
We study the lattice agreement (LA) and atomic snapshot problems in asynchronous message-passing systems where up to nodes may crash. Our main result is a crash-tolerant atomic…