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.
56 Publications
1997 | Published | Conference Paper | IST-REx-ID: 4496
Henzinger, T. A., Kupferman, O., & Rajamani, S. (1997). Fair simulation. In Proceedings of the 8th International Conference on Concurrency Theory (Vol. 1243, pp. 273–287). Warsaw, Poland: Springer. https://doi.org/10.1007/3-540-63141-0_19
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4520
Gupta, V., Henzinger, T. A., & Jagadeesan, R. (1997). Robust timed automata. In Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems (Vol. 1201, pp. 331–345). Grenoble, France: Springer. https://doi.org/10.1007/BFb0014736
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4583
Alur, R., & Henzinger, T. A. (1997). Modularity for timed and hybrid systems. In 8th International Conference on Concurrency Theory (Vol. 1243, pp. 74–88). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-63141-0_6
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 4584
Alur, R., & Henzinger, T. A. (1997). Real-time system = discrete system + clock variables. Software Tools For Technology Transfer. Springer. https://doi.org/10.1007/s100090050007
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4605
Alur, R., Henzinger, T. A., & Wong Toi, H. (1997). Symbolic analysis of hybrid systems. In Proceedings of the 36th IEEE Conference on Decision and Control (pp. 702–707). San Diego, CA, USA: IEEE. https://doi.org/10.1109/CDC.1997.650717
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 4607
Alur, R., Courcoubetis, C., & Henzinger, T. A. (1997). Computing accumulated delays in real-time systems. Formal Methods in System Design. Springer. https://doi.org/10.1023/A:1008626013578
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4608
Alur, R., Brayton, R., Henzinger, T. A., Qadeer, S., & Rajamani, S. (1997). Partial-order reduction in symbolic state-space exploration. In 9th International Conference on Computer Aided Verification (Vol. 1254, pp. 340–351). Haifa, Israel: Springer. https://doi.org/10.1007/3-540-63166-6_34
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4609
Alur, R., Henzinger, T. A., & Kupferman, O. (1997). Alternating-time temporal logic. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (pp. 100–109). Washington, DC, United States: Association for Computing Machinery (ACM). https://doi.org/10.1145/585265.585270
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 8527
Hunt, B. R., & Kaloshin, V. (1997). How projections affect the dimension spectrum of fractal measures. Nonlinearity. IOP Publishing. https://doi.org/10.1088/0951-7715/10/5/002
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 8528
Kaloshin, V. (1997). Prevalence in the space of finitely smooth maps. Functional Analysis and Its Applications. Springer Nature. https://doi.org/10.1007/bf02466014
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 11666
Anderson, J. M., Berc, L. M., Dean, J., Ghemawat, S., Henzinger, M. H., Leung, S.-T. A., … Weihl, W. E. (1997). Continuous profiling: Where have all the cycles gone? ACM Transactions on Computer Systems. Association for Computing Machinery. https://doi.org/10.1145/265924.265925
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 11765
Henzinger, M. H. (1997). A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. Journal of Algorithms. Elsevier. https://doi.org/10.1006/jagm.1997.0855
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 11767 |

Henzinger, M. H., Klein, P., Rao, S., & Subramanian, S. (1997). Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1006/jcss.1997.1493
[Published Version]
View
| DOI
| Download Published Version (ext.)
1997 | Published | Conference Paper | IST-REx-ID: 11803
Henzinger, M. H., & King, V. (1997). Maintaining minimum spanning trees in dynamic graphs. In 24th International Colloquium on Automata, Languages and Programming (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature. https://doi.org/10.1007/3-540-63165-8_214
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 11849 |

Anderson, J. M., Berc, L. M., Dean, J., Ghemawat, S., Henzinger, M. H., Leung, S.-T. A., … Weihl, W. E. (1997). Continuous profiling: Where have all the cycles gone? ACM SIGOPS Operating Systems Review. Association for Computing Machinery. https://doi.org/10.1145/269005.266637
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
1997 | Published | Journal Article | IST-REx-ID: 11883
Henzinger, M. H., & Thorup, M. (1997). Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x
View
| DOI