( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Corrigendum to "Health information seeking in the Web 2.0 age: Trust in social media, uncertainty reduction, and self-disclosure" Computers in Human Behavior 56 (2016) 289-294.

, , , и . Comput. Hum. Behav., (2016)

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.

Xinzhi Li

Xinzhi Yao

Zhang Zhang

Meng Zhang

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

Yue Zhang

 

Другие публикации лиц с тем же именем

'Voting with Dollars': A Cross-Polity and Multilevel Analysis of Political Consumerism. International Journal of Consumer Studies, 39 (5): 422-436 (2015)(ISSP).Extending media system dependency theory to informational media use and environmentalism: A cross-national study., и . Telematics Informatics, (2020)Recent progress in devices and circuits based on wafer-scale transition metal dichalcogenides., , , , , , и . Sci. China Inf. Sci., 62 (12): 220401 (2019)Sample complexity of single-parameter revenue maximization., , и . SIGecom Exch., 17 (2): 62-70 (2019)Corrigendum to "Health information seeking in the Web 2.0 age: Trust in social media, uncertainty reduction, and self-disclosure" Computers in Human Behavior 56 (2016) 289-294., , , и . Comput. Hum. Behav., (2016)A Knowledge-Enriched Model for Emotional Conversation Generation., , , , и . WWW (Companion Volume), стр. 52-53. ACM / IW3C2, (2020)Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method., , и . CoRR, (2022)A Pilot Study for Understanding Users' Attitudes Towards a Conversational Agent for News Recommendation., , , и . CUI, стр. 36:1-36:6. ACM, (2022)Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem., , , и . COLT, том 134 из Proceedings of Machine Learning Research, стр. 2248-2288. PMLR, (2021)An improved approximation algorithm for the minimum k-edge connected multi-subgraph problem., , , и . STOC, стр. 1612-1620. ACM, (2022)