12 citations · 38 across the 19 of their papers we have counts for
5 papers · 1 filter
RSVP: Beyond Weisfeiler Lehman Graph Isomorphism Test
Sourav Dutta, Arnab Bhattacharya
Graph isomorphism, a classical algorithmic problem, determines whether two input graphs are structurally identical or not. Interestingly, it is one of the few problems that is not…
Learning fine-grained search space pruning and heuristics for combinatorial optimization
Juho Lauri, Sourav Dutta, Marco Grassia +1
Combinatorial optimization problems arise in a wide range of applications from diverse domains. Many of these problems are NP-hard and designing efficient heuristics for them requi…
SONIK: Efficient In-situ All Item Rank Generation using Bit Operations
Sourav Dutta
Sorting, a classical combinatorial process, forms the bedrock of numerous algorithms with varied applications. A related problem involves efficiently finding the corresponding rank…
Perfectly Balanced Allocation With Estimated Average Using Expected Constant Retries
Sourav Dutta, Souvik Bhattacherjee, Ankur Narang
Balanced allocation of online balls-into-bins has long been an active area of research for efficient load balancing and hashing applications.There exists a large number of results…
Multidimensional Balanced Allocation for Multiple Choice & (1 + Beta) Processes
Ankur Narang, Sourav Dutta, Souvik Bhattacherjee
Allocation of balls into bins is a well studied abstraction for load balancing problems.The literature hosts numerous results for sequential(single dimensional) allocation case whe…