◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Sankaranarayanan

40 papers hereh-index 448.7k citations251 works total

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

author position
  • sole author1
  • first author1
  • middle author10
  • last author28

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

fields
  • math.OC13
  • eess.SY9
  • cs.RO5
  • cs.LG4
  • cs.GT2
  • cs.PL2
same name
  • S. Sankaranarayanan — 36 papers, h 51
  • S. Sankaranarayanan — 16 papers, h 19
  • S. Sankaranarayanan — 6 papers, h 8
  • S. Sankaranarayanan — 1 paper, h 1
  • S. Sankaranarayanan — 1 paper, h 2
  • S. Sankaranarayanan — 1 paper, h 13

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
20122024
most citedOutput Range Analysis for Deep Neural Networks

75 citations · 261 across the 31 of their papers we have counts for

collaborators
Showing 2018Show all

4 papers · 1 filter

math.OC2018

Mixed-integer bilevel representability

Amitabh Basu, Christopher Thomas Ryan, Sriram Sankaranarayanan

We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints…

cs.RO2018

Path-Following through Control Funnel Functions

Hadi Ravanbakhsh, Sina Aghli, Christoffer Heckman +1

We present an approach to path following using so-called control funnel functions. Synthesizing controllers to "robustly" follow a reference trajectory is a fundamental problem for…

eess.SY2018★ 74 cited

Learning Control Lyapunov Functions from Counterexamples and Demonstrations

Hadi Ravanbakhsh, Sriram Sankaranarayanan

We present a technique for learning control Lyapunov-like functions, which are used in turn to synthesize controllers for nonlinear dynamical systems that can stabilize the system,…

math.OC2018

Can cut generating functions be good and efficient?

Amitabh Basu, Sriram Sankaranarayanan

Making cut generating functions (CGFs) computationally viable is a central question in modern integer programming research. One would like to find CGFs that are simultaneously good…

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