◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Corwin Sinnamon

University of Waterloo

10 papers hereh-index 7110 citations19 works total

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

author position
  • sole author1
  • first author3
  • middle author1
  • last author4

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

fields
  • cs.DS6
  • cs.FL4
affiliations
  • University of Waterloo

identity via Semantic Scholar / OpenAlex

activity
20162023
most citedUnrestricted State Complexity of Binary Operations on Regular and Ideal Languages

6 citations · 10 across the 9 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

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.