◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Tianyi Zhang

15 papers hereh-index 10307 citations25 works total

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

author position
  • sole author2
  • first author1
  • middle author1
  • last author10

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

fields
  • cs.DS11
  • cs.DC1
  • cs.GT1
  • cs.LG1
  • math.CO1
same name
  • Tianyi Zhang — 24 papers, h 9
  • Tianyi Zhang — 18 papers, h 30
  • Tianyi Zhang — 17 papers, h 12
  • Tianyi Zhang — 14 papers, h 5
  • Tianyi Zhang — 13 papers, h 7
  • Tianyi Zhang — 11 papers, h 4

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

activity
20162023
most citedFrom block-Toeplitz matrices to differential equations on graphs: towards a general theory for scalable masked Transformers

7 citations · 15 across the 11 of their papers we have counts for

collaborators
Showing 2021Show all

4 papers · 1 filter

cs.DS2021★ 2 cited

Gomory-Hu Trees in Quadratic Time

Tianyi Zhang

Gomory-Hu tree [Gomory and Hu, 1961] is a succinct representation of pairwise minimum cuts in an undirected graph. When the input graph has general edge weights, classic algorithms…

math.CO2021

Fusion rules for pastures and tracts

Matthew Baker, Tianyi Zhang

Baker and Bowler defined a category of algebraic objects called tracts which generalize both partial fields and hyperfields. They also defined a notion of weak and strong matroids…

cs.LG2021★ 7 cited

From block-Toeplitz matrices to differential equations on graphs: towards a general theory for scalable masked Transformers

Krzysztof Choromanski, Han Lin, Haoxian Chen +7

In this paper we provide, to the best of our knowledge, the first comprehensive approach for incorporating various masking mechanisms into Transformers architectures in a scalable…

cs.DS2021

Faster Cut-Equivalent Trees in Simple Graphs

Tianyi Zhang

Let G=(V,E) be an undirected connected simple graph on n vertices. A cut-equivalent tree of G is an edge-weighted tree on the same vertex set V, such that for any pair o…

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