Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
Verification of relational data-centric dy- namic systems with external services
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Extends Petri nets with identifiers for object- and resource-aware systems and defines generalized correctness criteria with decidability analysis.
citing papers explorer
-
Correctness Notions for Petri Nets with Identifiers
Extends Petri nets with identifiers for object- and resource-aware systems and defines generalized correctness criteria with decidability analysis.