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
T. A. Henzinger, O. Kupferman, and S. Rajamani, “Fair simulation,” in Proceedings of the 8th International Conference on Concurrency Theory, Warsaw, Poland, 1997, vol. 1243, pp. 273–287.
View | DOI
 

1997 | Published | Conference Paper | IST-REx-ID: 4520
V. Gupta, T. A. Henzinger, and R. Jagadeesan, “Robust timed automata,” in Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems, Grenoble, France, 1997, vol. 1201, pp. 331–345.
View | DOI
 

1997 | Published | Conference Paper | IST-REx-ID: 4583
R. Alur and T. A. Henzinger, “Modularity for timed and hybrid systems,” in 8th International Conference on Concurrency Theory, Warsaw, Poland, 1997, vol. 1243, pp. 74–88.
View | DOI
 

1997 | Published | Journal Article | IST-REx-ID: 4584
R. Alur and T. A. Henzinger, “Real-time system = discrete system + clock variables,” Software Tools For Technology Transfer, vol. 1, no. 1–2. Springer, pp. 86–109, 1997.
View | DOI
 

1997 | Published | Conference Paper | IST-REx-ID: 4605
R. Alur, T. A. Henzinger, and H. Wong Toi, “Symbolic analysis of hybrid systems,” in Proceedings of the 36th IEEE Conference on Decision and Control, San Diego, CA, USA, 1997, pp. 702–707.
View | DOI
 

1997 | Published | Journal Article | IST-REx-ID: 4607
R. Alur, C. Courcoubetis, and T. A. Henzinger, “Computing accumulated delays in real-time systems,” Formal Methods in System Design, vol. 11, no. 2. Springer, pp. 137–156, 1997.
View | DOI
 

1997 | Published | Conference Paper | IST-REx-ID: 4608
R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order reduction in symbolic state-space exploration,” in 9th International Conference on Computer Aided Verification, Haifa, Israel, 1997, vol. 1254, pp. 340–351.
View | DOI
 

1997 | Published | 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
 

1997 | Published | Journal Article | IST-REx-ID: 8527
B. R. Hunt and V. Kaloshin, “How projections affect the dimension spectrum of fractal measures,” Nonlinearity, vol. 10, no. 5. IOP Publishing, pp. 1031–1046, 1997.
View | DOI
 

1997 | Published | Journal Article | IST-REx-ID: 8528
V. Kaloshin, “Prevalence in the space of finitely smooth maps,” Functional Analysis and Its Applications, vol. 31, no. 2. Springer Nature, pp. 95–99, 1997.
View | DOI
 

1997 | Published | Journal Article | IST-REx-ID: 11666
J. M. Anderson et al., “Continuous profiling: Where have all the cycles gone?,” ACM Transactions on Computer Systems, vol. 15, no. 4. Association for Computing Machinery, pp. 357–390, 1997.
View | DOI
 

1997 | Published | Journal Article | IST-REx-ID: 11765
M. H. Henzinger, “A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity,” Journal of Algorithms, vol. 24, no. 1. Elsevier, pp. 194–220, 1997.
View | DOI
 

1997 | Published | Journal Article | IST-REx-ID: 11767 | OA
M. H. Henzinger, P. Klein, S. Rao, and S. Subramanian, “Faster shortest-path algorithms for planar graphs,” Journal of Computer and System Sciences, vol. 55, no. 1. Elsevier, pp. 3–23, 1997.
[Published Version] View | DOI | Download Published Version (ext.)
 

1997 | Published | Conference Paper | IST-REx-ID: 11803
M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,” in 24th International Colloquium on Automata, Languages and Programming, Bologna, Italy, 1997, vol. 1256, pp. 594–604.
View | DOI
 

1997 | Published | Journal Article | IST-REx-ID: 11849 | OA
J. M. Anderson et al., “Continuous profiling: Where have all the cycles gone?,” ACM SIGOPS Operating Systems Review, vol. 31, no. 5. Association for Computing Machinery, pp. 1–14, 1997.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

1997 | Published | Journal Article | IST-REx-ID: 11883
M. H. Henzinger and M. Thorup, “Sampling to provide or to bound: With applications to fully dynamic graph algorithms,” Random Structures and Algorithms, vol. 11, no. 4. Wiley, pp. 369–379, 1997.
View | DOI
 

Filters and Search Terms

year=1997

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed