Theoretical Computer Science
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Complexity of bifix-free regular languages
Theoretical Computer Science - Tập 787 - Trang 14-27 - 2019
A new logic for electronic commerce protocols
Theoretical Computer Science - Tập 291 - Trang 223-283 - 2003
A loopless algorithm for generating the permutations of a multiset
Theoretical Computer Science - Tập 307 - Trang 415-431 - 2003
Abstract functional dependency structures
Theoretical Computer Science - Tập 81 - Trang 117-126 - 1991
The poset of infinitary traces
Theoretical Computer Science - Tập 120 - Trang 101 - 1993
Partially commutative monoids, also called trace monoids, are among the most-studied formalisms to describe the behaviour of distributed systems. In order to model systems which never stop, we have to consider an extension of traces, namely infinite traces. Finite-trace monoids are strongly related to partial-order sets (PoSets), domains and event structures, which are other models to describe the......
Inapproximability results for the minimum integral solution problem with preprocessing overℓ ∞
Theoretical Computer Science - Tập 478 - Trang 127-131 - 2013
Game authority for robust and scalable distributed selfish-computer systems
Theoretical Computer Science - Tập 411 - Trang 2459-2466 - 2010
On counting problems and the polynomial-time hierarchy
Theoretical Computer Science - Tập 12 - Trang 161-173 - 1980
Tổng số: 6,756
- 1
- 2
- 3
- 4
- 5
- 6
- 10