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.
9198 Publications
1998 |Published| Conference (Editor) | IST-REx-ID: 4430
Henzinger, T. A. (Ed.). (1998). HSCC: Hybrid Systems—Computation and Control (Vol. 1386). Presented at the HSCC: Hybrid Systems: Computation and Control, Berkeley, CA, United States of America: Springer. https://doi.org/10.1007/3-540-64358-3
View
| DOI
1998 |Published| Conference Paper | IST-REx-ID: 4486
Henzinger, T. A., Qadeer, S., Rajamani, S., & Tasiran, S. (1998). An assume-guarantee rule for checking simulation. In Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design (Vol. 1522, pp. 421–432). Palo Alto, CA, United States of America: Springer. https://doi.org/10.1007/3-540-49519-3_27
View
| DOI
1998 |Published| Conference Paper | IST-REx-ID: 4490
Henzinger, T. A., Raskin, J., & Schobbens, P. (1998). The regular real-time languages. In Proceedings of the 25th International Colloqium on Automata, Languages and Programming (Vol. 1443, pp. 580–591). Aalborg, Denmark: Springer. https://doi.org/10.1007/BFb0055086
View
| DOI
1998 |Published| Conference Paper | IST-REx-ID: 4489
Henzinger, T. A., Kupferman, O., & Qadeer, S. (1998). From pre-historic to post-modern symbolic model checking. In Proceedings of the 10th International Conference on Computer Aided Verification (Vol. 1427, pp. 195–206). Vancouver, Canada: Springer. https://doi.org/10.1007/BFb0028745
View
| DOI
1998 |Published| Conference Paper | IST-REx-ID: 4488
Henzinger, T. A., Qadeer, S., & Rajamani, S. (1998). You assume, we guarantee: Methodology and case studies. In Proceedings of the 10th International Conference on Computer Aided Verification (Vol. 1427, pp. 440–451). Vancouver, Canada: Springer. https://doi.org/10.1007/BFb0028765
View
| DOI
1998 |Published| Journal Article | IST-REx-ID: 4491
Henzinger, T. A., Ho, P., & Wong Toi, H. (1998). Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control. IEEE. https://doi.org/10.1109/9.664156
View
| DOI
1998 |Published| Journal Article | IST-REx-ID: 4492 | 
Henzinger, T. A., Kopke, P., Puri, A., & Varaiya, P. (1998). What’s decidable about hybrid automata? Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1006/jcss.1998.1581
[Published Version]
View
| DOI
| Download Published Version (ext.)
1998 |Published| Conference Paper | IST-REx-ID: 4515
Henzinger, T. A. (1998). It’s about time: Real-time logics reviewed. In Proceedings of the 9th Interantional Conference on Concurrency Theory (Vol. 1466, pp. 439–454). Nice, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/BFb0055640
View
| DOI
1998 |Published| Conference Paper | IST-REx-ID: 4606
Alur, R., Henzinger, T. A., & Rajamani, S. (1998). Symbolic exploration of transition hierarchies. In Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 1384, pp. 330–344). Lisbon, Portugal: Springer. https://doi.org/10.1007/BFb0054181
View
| DOI
1998 |Published| Conference Paper | IST-REx-ID: 4603
Alur, R., Henzinger, T. A., Kupferman, O., & Vardi, M. (1998). Alternating refinement relations. In Proceedings of the 9th Interantional Conference on Concurrency Theory (Vol. 1466, pp. 163–178). Nice, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/BFb0055622
View
| DOI
1998 |Published| Conference Paper | IST-REx-ID: 4604
Alur, R., Henzinger, T. A., Mang, F., Qadeer, S., Rajamani, S., & Tasiran, S. (1998). Mocha: Modularity in model checking. In Proceedings of the 10th International Conference on Computer Aided Verification (Vol. 1427, pp. 521–525). Vancouver, Canada: Springer. https://doi.org/10.1007/BFb0028774
View
| DOI
1998 |Published| Conference Paper | IST-REx-ID: 4639
De Alfaro, L., Henzinger, T. A., & Kupferman, O. (1998). Concurrent reachability games. In Proceedings 39th Annual Symposium on Foundations of Computer Science (pp. 564–575). Palo Alto, CA, United States of America: IEEE. https://doi.org/10.1109/SFCS.1998.743507
View
| DOI
1998 |Published| Journal Article | IST-REx-ID: 6160
de Bono, M., & Bargmann, C. I. (1998). Natural variation in a neuropeptide Y receptor homolog modifies social behavior and food response in C. elegans. Cell. Elsevier. https://doi.org/10.1016/s0092-8674(00)81609-8
View
| DOI
| PubMed | Europe PMC
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: 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| 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| 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
1997 |Published| Journal Article | IST-REx-ID: 2493
Acsády, L., Katona, I., Gulyás, A., Shigemoto, R., & Freund, T. (1997). Immunostaining for substance P receptor labels GABAergic cells with distinct termination patterns in the hippocampus. Journal of Comparative Neurology. Wiley-Blackwell. https://doi.org/10.1002/(SICI)1096-9861(19970217)378:3<320::AID-CNE2>3.0.CO;2-5
View
| DOI
| PubMed | Europe PMC