Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
Towards understanding and demystifying bitcoin mixing services
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Designs optimal and approximately optimal mechanisms for buyer utility and welfare objectives in budget-feasible procurement, including prior-free constant-factor approximations for welfare and Bayesian near-optimal mechanisms for utility.
GARG-AML detects smurfing in anti-money laundering using second-order graph neighborhood densities combined with machine learning classifiers for scalable and interpretable results.
citing papers explorer
-
A Near-Optimal Parallel Algorithm for Finding Matroid Bases
Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
-
From Welfare to Utility: Generalized Objectives in Budget-Feasible Procurement
Designs optimal and approximately optimal mechanisms for buyer utility and welfare objectives in budget-feasible procurement, including prior-free constant-factor approximations for welfare and Bayesian near-optimal mechanisms for utility.
-
GARG-AML against Smurfing: A Scalable and Interpretable Graph-Based Framework for Anti-Money Laundering
GARG-AML detects smurfing in anti-money laundering using second-order graph neighborhood densities combined with machine learning classifiers for scalable and interpretable results.