◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Corwin Sinnamon

1 paper here

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

author position
  • first author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.DS1
ORCID 0000-0003-0280-9498
same name
  • Corwin Sinnamon — 6 papers, h 7

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 citedA Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion

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

collaborators

1 paper

cs.DS2022★ 1 cited

A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion

Corwin Sinnamon, Robert Tarjan

The pairing heap is a simple "self-adjusting" implementation of a heap (priority queue). Inserting an item into a pairing heap or decreasing the key of an item takes O(1) time wors…

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