| Publication | Date of Publication | Type |
|---|
The complexity of ferromagnetic 2-spin systems on bounded degree graphs
Theoretical Computer Science | 2025-01-16 | Paper |
A differentiable first-order rule learner for inductive logic programming
Artificial Intelligence | 2024-07-03 | Paper |
Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms
Journal of Artificial Intelligence Research | 2023-03-13 | Paper |
Multi resource allocation with partial preferences
Artificial Intelligence | 2023-01-04 | Paper |
Reasoning about block-based cloud storage systems via separation logic
Theoretical Computer Science | 2022-10-21 | Paper |
Zero-freeness and approximation of real Boolean Holant problems
Theoretical Computer Science | 2022-05-31 | Paper |
Learning from interpretation transition using differentiable logic programming semantics
Machine Learning | 2022-04-20 | Paper |
An adaptation-complete proof system for local reasoning about cloud storage systems
Theoretical Computer Science | 2022-02-01 | Paper |
scientific article; zbMATH DE number 7233822 (Why is no real title available?)
| 2020-08-12 | Paper |
scientific article; zbMATH DE number 7234801 (Why is no real title available?)
| 2020-08-12 | Paper |
scientific article; zbMATH DE number 7204481 (Why is no real title available?)
| 2020-05-27 | Paper |
FPRAS for the Potts Model and the Number of $k$-colorings
| 2019-02-25 | Paper |
The complexity of Boolean Holant problems with nonnegative weights
SIAM Journal on Computing | 2018-07-04 | Paper |
Conditional anonymity with non-probabilistic adversary
Information Sciences | 2018-05-17 | Paper |
Differential privacy in probabilistic systems
Information and Computation | 2017-05-18 | Paper |
Behavioural equivalences of a probabilistic pi-calculus
Science China Information Sciences | 2013-08-20 | Paper |
A new model for model checking: cycle-weighted Kripke structure
Frontiers of Computer Science in China | 2013-07-04 | Paper |
Value-passing CCS with noisy channels
Theoretical Computer Science | 2012-06-25 | Paper |
On Model Checking Boolean BI
Computer Science Logic | 2009-11-12 | Paper |
Approximation algorithm for maximum edge coloring
Theoretical Computer Science | 2009-03-20 | Paper |
Stochastic Modeling and Quality Evaluation of Workflow Systems Based on QWF-Nets
Computational Science – ICCS 2006 | 2009-01-13 | Paper |
Approximation Algorithms for Maximum Edge Coloring Problem
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Completeness of temporal logics over infinite intervals.
Discrete Applied Mathematics | 2004-01-26 | Paper |
scientific article; zbMATH DE number 1979741 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1979783 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1829356 (Why is no real title available?)
| 2002-11-14 | Paper |
Noforking properties of theories of modules when they are fracted.
Advances in Mathematics (Beijing) | 2002-01-29 | Paper |
scientific article; zbMATH DE number 1150406 (Why is no real title available?)
| 1998-05-07 | Paper |
Some preservation of stability of modules
Chinese Science Bulletin | 1998-01-21 | Paper |
scientific article; zbMATH DE number 1004220 (Why is no real title available?)
| 1997-09-07 | Paper |
scientific article; zbMATH DE number 221360 (Why is no real title available?)
| 1993-06-29 | Paper |
