◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Niranka Banerjee

5 papers hereh-index 475 citations12 works total

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

author position
  • first author5

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

fields
  • cs.DS4
  • quant-ph1

identity via Semantic Scholar / OpenAlex

activity
20162026
most citedImproved Space efficient linear time algorithms for BFS, DFS and applications

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

collaborators
Showing quant-phShow all

1 paper · 1 filter

quant-ph2026

Quantum Query Complexity for List Search

Niranka Banerjee, Akinori Kawachi

Searching in a linked list is one of the most basic problems in classical algorithms. Although the nodes of the list come with memory addresses, classically those addresses play no…

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