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.
12 Publications
2024 | Journal Article | IST-REx-ID: 15045 | 
Varshney, Atul, et al. “Classical ‘Spin’ Filtering with Two Degrees of Freedom and Dissipation.” Few-Body Systems, vol. 65, 12, Springer Nature, 2024, doi:10.1007/s00601-024-01880-x.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 6972 |
Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7109
Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.” Journal of the ACM, vol. 66, no. 3, 19, ACM, 2019, doi:10.1145/3286976.
View
| DOI
| WoS
2019 | Journal Article | IST-REx-ID: 7108 |
Goaoc, Xavier, et al. “Shellability Is NP-Complete.” Journal of the ACM, vol. 66, no. 3, 21, ACM, 2019, doi:10.1145/3314024.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 11768 |
Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” Journal of the ACM, vol. 65, no. 6, Association for Computing Machinery, 2018, pp. 1–40, doi:10.1145/3218657.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2002 | Journal Article | IST-REx-ID: 4595
Alur, Rajeev, et al. “Alternating-Time Temporal Logic.” Journal of the ACM, vol. 49, no. 5, ACM, 2002, pp. 672–713, doi:10.1145/585265.585270.
View
| DOI
2000 | Journal Article | IST-REx-ID: 4010
Cheng, Siu, et al. “Sliver Exudation.” Journal of the ACM, vol. 47, no. 5, ACM, 2000, pp. 883–904, doi:10.1145/355483.355487.
View
| DOI
1999 | Journal Article | IST-REx-ID: 11769
Henzinger, Monika H., and Valerie King. “Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation.” Journal of the ACM, vol. 46, no. 4, Association for Computing Machinery, 1999, pp. 502–16, doi:10.1145/320211.320215.
View
| DOI
1997 | Conference Paper | IST-REx-ID: 4609
Alur, Rajeev, et al. “Alternating-Time Temporal Logic.” Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Association for Computing Machinery (ACM), 1997, pp. 100–09, doi:10.1145/585265.585270.
View
| DOI
1996 | Journal Article | IST-REx-ID: 4610
Alur, Rajeev, et al. “The Benefits of Relaxing Punctuality.” Journal of the ACM, vol. 43, no. 1, ACM, 1996, pp. 116–46, doi:10.1145/227595.227602.
View
| DOI
| Download None (ext.)
1994 | Journal Article | IST-REx-ID: 4591
Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.” Journal of the ACM, vol. 41, no. 1, ACM, 1994, pp. 181–204, doi:10.1145/174644.174651.
View
| DOI
| Download None (ext.)
1992 | Journal Article | IST-REx-ID: 4046
Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” Journal of the ACM, vol. 39, no. 1, ACM, 1992, pp. 1–54, doi:10.1145/147508.147511.
View
| DOI
| Download None (ext.)