◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ke Xu

13 papers hereh-index 9451 citations27 works total

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

author position
  • first author1
  • middle author6
  • last author6

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

fields
  • cs.NI4
  • cs.AI3
  • cs.DB2
  • cs.LO2
  • cs.CC1
  • cs.DS1
same name
  • Ke Xu — 8 papers, h 43
  • Ke Xu — 2 papers
  • Ke Xu — 2 papers
  • Ke Xu — 1 paper, h 3

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
20012009
most citedA Situation Calculus-based Approach To Model Ubiquitous Information Services

11 citations · 20 across the 6 of their papers we have counts for

collaborators
Showing 2008Show all

4 papers · 1 filter

cs.NI2008

Time series of Internet AS-level topology graphs: four patterns and one model

Lian-dong Liu, Ke Xu

Researchers have proposed a variety of Internet topology models. However almost all of them focus on generating one graph based on one single static source graph. On the other hand…

cs.AI2008★ 7 cited

Exact phase transition of backtrack-free search with implications on the power of greedy algorithms

Liang Li, Tian Liu, Ke Xu

Backtracking is a basic strategy to solve constraint satisfaction problems (CSPs). A satisfiable CSP instance is backtrack-free if a solution can be found without encountering any…

cs.CC2008

On the Scaling Window of Model RB

Chunyan Zhao, Ke Xu, Zhiming Zheng

This paper analyzes the scaling window of a random CSP model (i.e. model RB) for which we can identify the threshold points exactly, denoted by rcr​ or pcr​. For this model…

cs.DS2008

From k-SAT to k-CSP: Two Generalized Algorithms

Liang Li, Xin Li, Tian Liu +1

Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bou…

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