Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
11 Publications
2019 | Published | Journal Article | IST-REx-ID: 6972 | 
Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).
2019 | Published | Journal Article | IST-REx-ID: 7108 |
Shellability is NP-complete
X. Goaoc, P. Patak, Z. Patakova, M. Tancer, U. Wagner, Journal of the ACM 66 (2019).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
X. Goaoc, P. Patak, Z. Patakova, M. Tancer, U. Wagner, Journal of the ACM 66 (2019).
2019 | Published | Journal Article | IST-REx-ID: 7109
From real-time logic to timed automata
T. Ferrere, O. Maler, D. Ničković, A. Pnueli, Journal of the ACM 66 (2019).
View
| DOI
| WoS
T. Ferrere, O. Maler, D. Ničković, A. Pnueli, Journal of the ACM 66 (2019).
2018 | Published | Journal Article | IST-REx-ID: 11768 |
Decremental single-source shortest paths on undirected graphs in near-linear total update time
M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.
2002 | Published | Journal Article | IST-REx-ID: 4595
Alternating-time temporal logic
R. Alur, T.A. Henzinger, O. Kupferman, Journal of the ACM 49 (2002) 672–713.
View
| DOI
R. Alur, T.A. Henzinger, O. Kupferman, Journal of the ACM 49 (2002) 672–713.
2000 | Published | Journal Article | IST-REx-ID: 4010
Sliver exudation
S. Cheng, T. Dey, H. Edelsbrunner, M. Facello, S. Teng, Journal of the ACM 47 (2000) 883–904.
View
| DOI
S. Cheng, T. Dey, H. Edelsbrunner, M. Facello, S. Teng, Journal of the ACM 47 (2000) 883–904.
1999 | Published | Journal Article | IST-REx-ID: 11769
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
M.H. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.
View
| DOI
M.H. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.
1997 | Published | Conference Paper | IST-REx-ID: 4609
Alternating-time temporal logic
R. Alur, T.A. Henzinger, O. Kupferman, in:, Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Association for Computing Machinery (ACM), 1997, pp. 100–109.
View
| DOI
R. Alur, T.A. Henzinger, O. Kupferman, in:, Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Association for Computing Machinery (ACM), 1997, pp. 100–109.
1996 | Published | Journal Article | IST-REx-ID: 4610
The benefits of relaxing punctuality
R. Alur, T. Feder, T.A. Henzinger, Journal of the ACM 43 (1996) 116–146.
View
| DOI
| Download None (ext.)
R. Alur, T. Feder, T.A. Henzinger, Journal of the ACM 43 (1996) 116–146.
1994 | Published | Journal Article | IST-REx-ID: 4591
A really temporal logic
R. Alur, T.A. Henzinger, Journal of the ACM 41 (1994) 181–204.
View
| DOI
| Download None (ext.)
R. Alur, T.A. Henzinger, Journal of the ACM 41 (1994) 181–204.
1992 | Published | Journal Article | IST-REx-ID: 4046
An optimal algorithm for intersecting line segments in the plane
B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.