◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Andrew Twigg

6 papers hereh-index 154.5k citations36 works total

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

author position
  • sole author2
  • first author2
  • last author2

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

fields
  • cs.DS6

identity via Semantic Scholar / OpenAlex

activity
20082017
most citedLower bounds for distributed markov chain problems

8 citations · 16 across the 6 of their papers we have counts for

collaborators
Showing 2011Show all

2 papers · 1 filter

cs.DS2011★ 1 cited

Optimal query/update tradeoffs in versioned dictionaries

Andrew Byde, Andy Twigg

External-memory dictionaries are a fundamental data structure in file systems and databases. Versioned (or fully-persistent) dictionaries have an associated version tree where quer…

cs.DS2011★ 4 cited

Stratified B-trees and versioning dictionaries

Andy Twigg, Andrew Byde, Grzegorz Milos +3

A classic versioned data structure in storage and computer science is the copy-on-write (CoW) B-tree -- it underlies many of today's file systems and databases, including WAFL, ZFS…

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