Wait-free k-set agreement is impossible: the topology of public knowledge
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Computational topology: ambient isotopic approximation of 2-manifolds
Theoretical Computer Science - Topology in computer science
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Exploring an information-based approach to computation and computational complexity
ACM-SE 38 Proceedings of the 38th annual on Southeast regional conference
Some Remarks on Sets of Communicating Sequential Processes in Topological Rough Set Framework
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Automating proofs in category theory
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Ordered fractal semigroups as a model of computation
Mathematical and Computer Modelling: An International Journal
Sequence spaces and asymmetric norms in the theory of computational complexity
Mathematical and Computer Modelling: An International Journal
Nuprl as logical framework for automating proofs in category theory
Logic and Program Semantics
Some Remarks on Sets of Communicating Sequential Processes in Topological Rough Set Framework
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
| Hi-index | 0.00 |