The following pages link to Xiaowei Wu (Q724227):
Displaying 40 items.
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- Adaptive-weight burden test for associations between quantitative traits and genotype data with complex correlations (Q1620998) (← links)
- Modeling neutral evolution using an infinite-allele Markov branching process (Q1952470) (← links)
- A note on the path to extinction of critical Markov branching processes (Q2267600) (← links)
- Diffusion operator and spectral analysis for directed hypergraph Laplacian (Q2317870) (← links)
- Fast maximum likelihood estimation of mutation rates using a birth-death process (Q2415725) (← links)
- Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs (Q2946426) (← links)
- Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks (Q3190148) (← links)
- (Q3501675) (← links)
- (Q3516616) (← links)
- DAMAGE SPREADING ON THE HOMO- AND HETERO-CELL LATTICES WITH COMPETING GLAUBER AND KAWASAKI DYNAMICS (Q3611535) (← links)
- (Q4488014) (← links)
- Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity (Q4554339) (← links)
- Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907) (← links)
- Beating ratio 0.5 for weighted oblivious matching problems (Q4606268) (← links)
- (Q4636505) (← links)
- (Q4935932) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- (Q5002758) (← links)
- (Q5009506) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Fully Online Matching (Q5133972) (← links)
- Towards a better understanding of randomized greedy matching (Q5144995) (← links)
- How to match when all vertices arrive online (Q5230273) (← links)
- Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model (Q5236370) (← links)
- DAMAGE SPREADING ON A SET OF HIERARCHICAL TRIVALENT STRUCTURES (Q5485745) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
- Well-behaved online load balancing against strategic jobs (Q6090218) (← links)
- Approximate and strategyproof maximin share allocation of chores with ordinal preferences (Q6120928) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Approximately EFX allocations for indivisible chores (Q6152663) (← links)
- Estimating mutation rates in a Markov branching process using approximate Bayesian computation (Q6174199) (← links)
- Distributed PageRank computation with improved round complexities (Q6195176) (← links)
- Stackelberg security games with contagious attacks on a network: reallocation to the rescue (Q6488790) (← links)
- Almost proportional allocations of indivisible chores: computation, approximation and efficiency (Q6566645) (← links)
- Improved competitive ratio for edge-weighted online stochastic matching (Q6609171) (← links)
- One quarter each (on average) ensures proportionality (Q6609175) (← links)
- A Unified Analysis of Structured Sonar-Terrain Data Using Bayesian Functional Mixed Models (Q6622414) (← links)
- Association testing for binary trees -- a Markov branching process approach (Q6628394) (← links)
