default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXian Xu 0001
Person information
- affiliation: East China University of Science and Technology, Shanghai, China
- affiliation: Shanghai Jiao Tong University, China
Other persons with the same name
- Xian Xu — disambiguation page
- Xian Xu 0002 — State University of New York at Buffalo
- Xian Xu 0003 — Institute of Image Processing & Pattern Recognition, Shanghai Jiaotong University
- Xian Xu 0004 — Department of Mathematics, Xuzhou Normal University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Chenke Wang
, Zhonghui Ge, Yu Long, Xian Xu, Shi-Feng Sun, Dawu Gu:
BlindShuffler: Universal and Trustless Mixing for Confidential Transactions. AsiaCCS 2024- [i5]Hao Wu, Yuxi Fu, Huan Long, Xian Xu, Wenbo Zhang:
Analyzing Divergence for Nondeterministic Probabilistic Models. CoRR abs/2403.00491 (2024) - 2023
- [c18]Zhonghui Ge, Jiayuan Gu, Chenke Wang, Yu Long, Xian Xu, Dawu Gu:
Accio: Variable-Amount, Optimized-Unlinkable and NIZK-Free Off-Chain Payments via Hubs. CCS 2023: 1541-1555 - [c17]Yu Song, Yu Long, Xian Xu, Dawu Gu:
FaBFT: Flexible Asynchronous BFT Protocol Using DAG. Inscrypt (2) 2023: 343-355 - [i4]Zhonghui Ge, Jiayuan Gu, Chenke Wang, Yu Long, Xian Xu, Dawu Gu:
Accio: Variable-Amount, Optimized-Unlinkable and NIZK-Free Off-Chain Payments via Hubs. IACR Cryptol. ePrint Arch. 2023: 1326 (2023) - [i3]Yu Song, Yu Long, Xian Xu, Dawu Gu:
FaBFT: Flexible Asynchronous BFT Protocol Using DAG. IACR Cryptol. ePrint Arch. 2023: 1660 (2023) - 2022
- [c16]Yan Huang, Xian Xu:
Two-stage cost-sensitive local models for heterogeneous cross-project defect prediction. COMPSAC 2022: 819-828 - [c15]Yu Song, Guoshun Fan, Yu Long, Zhen Liu, Xian Xu, Dawu Gu:
Grape: Efficient Hybrid Consensus Protocol Using DAG. DPM/CBT@ESORICS 2022: 258-274 - [c14]Jiajun Du, Zhonghui Ge, Yu Long, Zhen Liu, Shifeng Sun, Xian Xu, Dawu Gu:
MixCT: Mixing Confidential Transactions from Homomorphic Commitment. ESORICS (3) 2022: 763-769 - [i2]Jiajun Du, Zhonghui Ge, Yu Long, Zhen Liu, Shifeng Sun, Xian Xu, Dawu Gu:
MixCT: Mixing Confidential Transactions from Homomorphic Commitment. IACR Cryptol. ePrint Arch. 2022: 951 (2022) - 2021
- [j8]Wenbo Zhang, Xian Xu, Qiang Yin, Huan Long:
On the Interactive Power of Higher-order Processes Extended with Parameterization. Formal Aspects Comput. 33(2): 151-183 (2021) - 2020
- [c13]Wenbo Zhang, Qiang Yin, Huan Long, Xian Xu:
Bisimulation Equivalence of Pushdown Automata Is Ackermann-Complete. ICALP 2020: 141:1-141:14
2010 – 2019
- 2019
- [j7]Xian Xu:
Parameterizing higher-order processes on names and processes. RAIRO Theor. Informatics Appl. 53(3-4): 153-206 (2019) - [c12]Wenbo Zhang, Huan Long, Xian Xu:
Uniform Random Process Model Revisited. APLAS 2019: 388-404 - 2018
- [j6]Davide Sangiorgi, Xian Xu:
Trees from Functions as Processes. Log. Methods Comput. Sci. 14(3) (2018) - [i1]Davide Sangiorgi, Xian Xu:
Trees from Functions as Processes. CoRR abs/1804.05797 (2018) - 2017
- [j5]Qiang Yin, Xian Xu, Huan Long:
On parameterization of higher-order processes. Int. J. Comput. Math. 94(7): 1451-1478 (2017) - [c11]Denghong Liu, Xian Xu, Yu Long:
On member search engine selection using artificial neural network in meta search engine. ICIS 2017: 865-868 - 2016
- [c10]Xian Xu:
Higher-order Processes with Parameterization over Names and Processes. EXPRESS/SOS 2016: 15-29 - 2015
- [j4]Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu:
A behavioural theory for a π-calculus with preorders. J. Log. Algebraic Methods Program. 84(6): 806-825 (2015) - [c9]Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu:
A Behavioural Theory for a π-calculus with Preorders. FSEN 2015: 143-158 - [c8]Xian Xu, Qiang Yin, Huan Long:
On the Computation Power of Name Parameterization in Higher-order Processes. ICE 2015: 114-127 - 2014
- [c7]Davide Sangiorgi, Xian Xu:
Trees from Functions as Processes. CONCUR 2014: 78-92 - 2013
- [c6]Xian Xu, Qiang Yin, Huan Long:
On the Expressiveness of Parameterization in Process-Passing. WS-FM 2013: 147-167 - [c5]Xian Xu:
On Context Bisimulation for Parameterized Higher-order Processes. ICE 2013: 37-51 - 2012
- [j3]Xian Xu:
Distinguishing and relating higher-order and first-order processes by expressiveness. Acta Informatica 49(7-8): 445-484 (2012)
2000 – 2009
- 2009
- [j2]Xian Xu:
Expressing First-Order pi-Calculus in Higher-Order Calculus of Communicating Systems. J. Comput. Sci. Technol. 24(1): 122-137 (2009) - [j1]Xian Xu:
On Bisimulation Theory in Linear Higher-Order pi-Calculus. Trans. Petri Nets Other Model. Concurr. 3: 244-274 (2009) - 2007
- [c4]Xian Xu:
P Systems and Finite Automata. CISIS 2007: 135-138 - 2006
- [c3]Xian Xu, Xiaoju Dong, Yuxi Fu:
A Model in kappa for DNA Addition. MeCBIC@ICALP 2006: 209-222 - 2005
- [c2]Zhupeng Dong, Xiaoju Dong, Xian Xu, Yuxi Fu, Zhizhou Zhang, Lin He:
An Implementation for Mapping SBML to BioSPI. FSKD (2) 2005: 1128-1131 - 2004
- [c1]Xian Xu, Ruonan Rao, Zhaoqing Jia, Jinyuan You:
Grid Service and JCA: An Effective Integration Strategy. IEEE SCC 2004: 571-574
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
