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 TA, Kupferman O, Rajamani S. Fair simulation. In: Proceedings of the 8th International Conference on Concurrency Theory. Vol 1243. Springer; 1997:273-287. doi:10.1007/3-540-63141-0_19
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4520
Gupta V, Henzinger TA, Jagadeesan R. Robust timed automata. In: Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems. Vol 1201. Springer; 1997:331-345. doi:10.1007/BFb0014736
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4583
Alur R, Henzinger TA. Modularity for timed and hybrid systems. In: 8th International Conference on Concurrency Theory. Vol 1243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1997:74-88. doi:10.1007/3-540-63141-0_6
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 4584
Alur R, Henzinger TA. Real-time system = discrete system + clock variables. Software Tools For Technology Transfer. 1997;1(1-2):86-109. doi:10.1007/s100090050007
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4605
Alur R, Henzinger TA, Wong Toi H. Symbolic analysis of hybrid systems. In: Proceedings of the 36th IEEE Conference on Decision and Control. IEEE; 1997:702-707. doi:10.1109/CDC.1997.650717
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 4607
Alur R, Courcoubetis C, Henzinger TA. Computing accumulated delays in real-time systems. Formal Methods in System Design. 1997;11(2):137-156. doi:10.1023/A:1008626013578
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4608
Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. Partial-order reduction in symbolic state-space exploration. In: 9th International Conference on Computer Aided Verification. Vol 1254. Springer; 1997:340-351. doi:10.1007/3-540-63166-6_34
View
| DOI
1997 | Published | Conference Paper | IST-REx-ID: 4609
Alur R, Henzinger TA, Kupferman O. Alternating-time temporal logic. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science. Association for Computing Machinery (ACM); 1997:100-109. doi:10.1145/585265.585270
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 8527
Hunt BR, Kaloshin V. How projections affect the dimension spectrum of fractal measures. Nonlinearity. 1997;10(5):1031-1046. doi:10.1088/0951-7715/10/5/002
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 8528
Kaloshin V. Prevalence in the space of finitely smooth maps. Functional Analysis and Its Applications. 1997;31(2):95-99. doi:10.1007/bf02466014
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 11666
Anderson JM, Berc LM, Dean J, et al. Continuous profiling: Where have all the cycles gone? ACM Transactions on Computer Systems. 1997;15(4):357-390. doi:10.1145/265924.265925
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 11765
Henzinger MH. A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. Journal of Algorithms. 1997;24(1):194-220. doi:10.1006/jagm.1997.0855
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 11767 | 
Henzinger MH, Klein P, Rao S, Subramanian S. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences. 1997;55(1):3-23. doi:10.1006/jcss.1997.1493
[Published Version]
View
| DOI
| Download Published Version (ext.)
1997 | Published | Conference Paper | IST-REx-ID: 11803
Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs. In: 24th International Colloquium on Automata, Languages and Programming. Vol 1256. Springer Nature; 1997:594–604. doi:10.1007/3-540-63165-8_214
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 11849 |
Anderson JM, Berc LM, Dean J, et al. Continuous profiling: Where have all the cycles gone? ACM SIGOPS Operating Systems Review. 1997;31(5):1-14. doi:10.1145/269005.266637
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
1997 | Published | Journal Article | IST-REx-ID: 11883
Henzinger MH, Thorup M. Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms. 1997;11(4):369-379. doi:10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x
View
| DOI