◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nishant Doshi

3 papers here

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

author position
  • sole author1
  • last author2

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

fields
  • cs.CR2
  • cs.CC1
ORCID 0000-0003-3443-7561
same name
  • Nishant Doshi — 4 papers, h 20
  • Nishant Doshi — 3 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

activity
20102022
most citedA secure email login system using virtual password

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

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2014★ 1 cited

Approximation for the Path Complexity of Binary Search Tree

Nishant Doshi

The complexity of an algorithm is an important parameter to determine its effi-ciency. They are of different types viz. Time complexity, Space complexity, etc. However, none of the…

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