◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Supratik Chakraborty

I.I.T. Bombay

32 papers hereh-index 222.1k citations110 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author15
  • middle author9
  • last author7

Across the 31 of 32 papers where every author was matched, so the position is known.

fields
  • cs.LO19
  • cs.AI4
  • cs.PL3
  • cs.FL2
  • cs.SE2
  • cs.DS1
affiliations
  • I.I.T. Bombay
Homepage
same name
  • Supratik Chakraborty — 9 papers, h 3
  • Supratik Chakraborty — 3 papers, h 4
  • Supratik Chakraborty — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102022
most citedBalancing Scalability and Uniformity in SAT Witness Generator

82 citations · 214 across the 25 of their papers we have counts for

collaborators
Showing cs.AIShow all

4 papers · 1 filter

cs.AI2021★ 1 cited

Projected Model Counting: Beyond Independent Support

Jiong Yang, Supratik Chakraborty, Kuldeep S. Meel

The past decade has witnessed a surge of interest in practical techniques for projected model counting. Despite significant advancements, however, performance scaling remains the A…

cs.AI2015★ 55 cited

Constrained Sampling and Counting: Universal Hashing Meets SAT Solving

Kuldeep S. Meel, Moshe Vardi, Supratik Chakraborty +5

Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to con…

cs.AI2015★ 31 cited

Approximate Probabilistic Inference via Word-Level Counting

Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry +1

Hashing-based model counting has emerged as a promising approach for large-scale probabilistic inference on graphical models. A key component of these techniques is the use of xor-…

cs.AI2014

Distribution-Aware Sampling and Weighted Model Counting for SAT

Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel +2

Given a CNF formula and a weight for each assignment of values to variables, two natural problems are weighted model counting and distribution-aware sampling of satisfying assignme…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.