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


2002 | Journal Article | IST-REx-ID: 4595
R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,” Journal of the ACM, vol. 49, no. 5. ACM, pp. 672–713, 2002.
View | DOI
 

2000 | Journal Article | IST-REx-ID: 4010
S. Cheng, T. Dey, H. Edelsbrunner, M. Facello, and S. Teng, “Sliver exudation,” Journal of the ACM, vol. 47, no. 5. ACM, pp. 883–904, 2000.
View | DOI
 

1999 | Journal Article | IST-REx-ID: 11769
M. H. Henzinger and V. King, “Randomized fully dynamic graph algorithms with polylogarithmic time per operation,” Journal of the ACM, vol. 46, no. 4. Association for Computing Machinery, pp. 502–516, 1999.
View | DOI
 

1997 | Conference Paper | IST-REx-ID: 4609
R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,” in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Washington, DC, United States, 1997, pp. 100–109.
View | DOI
 

1996 | Journal Article | IST-REx-ID: 4610
R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,” Journal of the ACM, vol. 43, no. 1. ACM, pp. 116–146, 1996.
View | DOI | Download None (ext.)
 

1994 | Journal Article | IST-REx-ID: 4591
R. Alur and T. A. Henzinger, “A really temporal logic,” Journal of the ACM, vol. 41, no. 1. ACM, pp. 181–204, 1994.
View | DOI | Download None (ext.)
 

1992 | Journal Article | IST-REx-ID: 4046
B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments in the plane,” Journal of the ACM, vol. 39, no. 1. ACM, pp. 1–54, 1992.
View | DOI | Download None (ext.)
 

Filters and Search Terms

issn=0004-5411

Search

Filter Publications