Efficient dependency tracking for relevant events in shared-memory systems
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Efficient dependency tracking for relevant events in concurrent systems
Distributed Computing
Variants of Online Chain Partition Problem of Posets
Electronic Notes in Theoretical Computer Science (ENTCS)
On-line Chain Partitioning as a Model for Real-time Scheduling
Electronic Notes in Theoretical Computer Science (ENTCS)
On the online track assignment problem
Discrete Applied Mathematics
Lower bounds for randomized algorithms for online chain partitioning
Information Processing Letters
On first-fit coloring of ladder-free posets
European Journal of Combinatorics
| Hi-index | 0.00 |