5 citations · 14 across the 6 of their papers we have counts for
3 papers · 1 filter
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger +1
The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two clas…
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger +1
Solving parity games, which are equivalent to modal -calculus model checking, is a central algorithmic problem in formal methods. Besides the standard computation model with the…
Fully Dynamic k-Center Clustering in Doubling Metrics
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski +2
Clustering is one of the most fundamental problems in unsupervised learning with a large number of applications. However, classical clustering algorithms assume that the data is st…