Xudong Fu

Orcid: 0000-0003-0744-0546

According to our database1, Xudong Fu authored at least 16 papers between 1996 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
CP3d: A comprehensive Euler-Lagrange solver for direct numerical simulation of particle-laden flows.
Comput. Phys. Commun., May, 2023

2022
Automatic Extraction of Mountain River Surface and Width Based on Multisource High-Resolution Satellite Images.
Remote. Sens., 2022

A high order finite difference solver for simulations of turbidity currents with high parallel efficiency.
Comput. Math. Appl., 2022

2021
A pencil distributed direct numerical simulation solver with versatile treatments for viscous term.
Comput. Math. Appl., 2021

2020
A D8-compatible high-efficient channel head recognition method.
Environ. Model. Softw., 2020

2017
Variable-Weighted Linear Combination Model for Landslide Susceptibility Mapping: Case Study in the Shennongjia Forestry District, China.
ISPRS Int. J. Geo Inf., 2017

2014
Conceptual Model for Simulating the Adjustments of Bankfull Characteristics in the Lower Yellow River, China.
J. Appl. Math., 2014

2013
A High-performance temporal-spatial discretization method for the parallel computing of river basins.
Comput. Geosci., 2013

Multi-tree Coding Method (MCM) for drainage networks supporting high-efficient search.
Comput. Geosci., 2013

2012
Maximum speedup ratio curve (MSC) in parallel computing of the binary-tree-based drainage network.
Comput. Geosci., 2012

2011
A common parallel computing framework for modeling hydrological processes of river basins.
Parallel Comput., 2011

1999
Matroids with the Circuit Cover Property.
Eur. J. Comb., 1999

1996
On the complexity of proof systems.
PhD thesis, 1996

Simplified Lower Bounds for Propositional Proofs.
Notre Dame J. Formal Log., 1996

Modular Coloring Formulas Are Hard for Cutting Planes Proofs.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Lower bounds on sizes of cutting plane proofs for modular coloring principles.
Proceedings of the Proof Complexity and Feasible Arithmetics, 1996


  Loading...