◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Balázs Gerencsér

3 papers here

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

author position
  • middle author3

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

fields
  • cs.CC1
  • cs.DM1
  • math.OC1
ORCID 0000-0002-3885-4146
same name
  • Balázs Gerencsér — 9 papers, h 4
  • Balázs Gerencsér — 7 papers, 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

most citedImproved bound on the worst case complexity of Policy Iteration

6 citations · 9 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2014★ 6 cited

Improved bound on the worst case complexity of Policy Iteration

Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne +1

Solving Markov Decision Processes (MDPs) is a recurrent task in engineering. Even though it is known that solutions for minimizing the infinite horizon expected reward can be found…

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