◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Weisheng Si

3 papers hereh-index 151.7k citations49 works total

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

author position
  • sole author1
  • first author1
  • middle author1

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

fields
  • cs.NI2
  • cs.SI1
same name
  • Weisheng Si — 1 paper

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
20132022
most citedMeasuring Network Robustness by Average Network Flow

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

collaborators
Showing 2013Show all

1 paper · 1 filter

cs.NI2013

Are Yao Graph and Theta Graph Void Free?

Weisheng Si

Greedy Forwarding algorithm is a widely-used routing algorithm for wireless networks. However, it can fail if network topologies (usually modeled by geometric graphs) contain voids…

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