◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Karthik R. Narasimhan

13 papers hereh-index 5389 citations18 works total

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

author position
  • middle author8
  • last author3

Across the 11 of 13 papers where every author was matched, so the position is known.

fields
  • cs.AI6
  • cs.CL1
  • cs.CR1
  • cs.HC1
  • cs.IR1
  • cs.LG1
same name
  • Karthik R. Narasimhan — 2 papers, h 3

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

collaborators
Showing stat.MLShow all

1 paper · 1 filter

stat.ML2026

An Efficient Algorithm for Thresholding Monte Carlo Tree Search

Shoma Nameki, Atsuyoshi Nakamura, Junpei Komiyama +1

We introduce the Thresholding Monte Carlo Tree Search problem, in which, given a tree T and a threshold θ, a player must answer whether the root node value of $\mathc…

◍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.