◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jason Necaise

9 papers hereh-index 4254 citations10 works total

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

author position
  • first author1
  • middle author8

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

fields
  • quant-ph7
  • cond-mat.str-el1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

activity
20212026
most citedApplication-Oriented Performance Benchmarks for Quantum Computing

148 citations · 151 across the 9 of their papers we have counts for

collaborators
Showing 2024 · cs.DSShow all

1 paper · 2 filters

cs.DS2024

A Sierpinski Triangle Data Structure for Efficient Array Value Update and Prefix Sum Calculation

Brent Harrison, Jason Necaise, Andrew Projansky +1

The binary indexed tree, or Fenwick tree, is a data structure that can efficiently update values and calculate prefix sums in an array. It allows both of these operations to be per…

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