◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

I. A. Stewart

7 papers hereh-index 221.7k citations122 works total

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

author position
  • sole author2
  • middle author2
  • last author3

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

fields
  • cs.DC3
  • cs.DM2
  • cs.LO1
  • math.LO1

identity via Semantic Scholar / OpenAlex

activity
19962024
most citedAn Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar

12 citations · 13 across the 7 of their papers we have counts for

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2001★ 1 cited

Program schemes with binary write-once arrays and the complexity classes they capture

Iain A. Stewart

We study a class of program schemes, NPSB, in which, aside from basic assignments, non-deterministic guessing and while loops, we have access to arrays; but where these arrays are…

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