( en | de | ru )

 

Disambiguation of "Zhang, Jinshan"

Author of the publication

copydeleteadd this publication to your clipboard
An analysis of a random algorithm for estimating all the matchings

, , and . CoRR, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jinshan Zhang

Jinshan Liu

Zhang Zhang

Meng Zhang

Methods and implementations of road-network matching. TU München, (2009)

Shuying Zhang

 

Other publications of authors with the same name

Approximating Partition Functions of Two-State Spin Systems, , and . CoRR, (2009)Strong Spatial Mixing and Approximating Partition Functions of Two-State Spin Systems without Hard Constrains. CoRR, (2008)Gait Planning and Simulation Analysis of a New Amphibious Quadruped Robots., , , , and . J. Robotics Mechatronics, 30 (2): 257-264 (2018)Improved Truthful Rank Approximation for Rank-Maximal Matchings., , , and . WINE, volume 14413 of Lecture Notes in Computer Science, page 637-653. Springer, (2023)Exchange of indivisible goods under matroid constraints., , and . Inf. Comput., 295 (Part B): 105110 (December 2023)Large-Scale Monitoring of Glacier Surges by Integrating High-Temporal- and -Spatial-Resolution Satellite Observations: A Case Study in the Karakoram., , , , and . Remote. Sens., 14 (18): 4668 (2022)Approximating partition functions of the two-state spin system., , and . Inf. Process. Lett., 111 (14): 702-710 (2011)HARDSEA: Hybrid Analog-ReRAM Clustering and Digital-SRAM In-Memory Computing Accelerator for Dynamic Sparse Self-Attention in Transformer., , , , , , , , and . IEEE Trans. Very Large Scale Integr. Syst., 32 (2): 269-282 (February 2024)Size Versus Truthfulness in the House Allocation Problem., , , and . Algorithmica, 81 (9): 3422-3463 (2019)An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs., and . Theor. Comput. Sci., 412 (4-5): 419-429 (2011)