◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Sourabh

2 papers hereh-index 579 citations20 works total

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

author position
  • first author2

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

fields
  • cs.DS1
  • eess.IV1
same name
  • S. Sourabh — 7 papers, h 9
  • S. Sourabh — 3 papers, h 6

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 citedHow robust is quicksort average complexity?

8 citations · 8 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2008★ 8 cited

How robust is quicksort average complexity?

Suman Kumar Sourabh, Soubhik Chakraborty

The paper questions the robustness of average case time complexity of the fast and popular quicksort algorithm. Among the six standard probability distributions examined in the pap…

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