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.

52 Publications


1995 | Published | Conference Paper | IST-REx-ID: 4500
The expressive power of clocks
T.A. Henzinger, P. Kopke, H. Wong Toi, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, pp. 417–428.
View | DOI | Download None (ext.)
 

1995 | Published | Conference Paper | IST-REx-ID: 4502 | OA
What's decidable about hybrid automata?
T.A. Henzinger, P. Kopke, A. Puri, P. Varaiya, in:, Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM, 1995, pp. 373–382.
[Published Version] View | DOI | Download Published Version (ext.)
 

1995 | Published | Conference Paper | IST-REx-ID: 4518
Hybrid automata with finite bisimulations
T.A. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, pp. 324–335.
View | DOI | Download None (ext.)
 

1995 | Published | Conference Paper | IST-REx-ID: 4587
Local liveness for compositional modeling of fair reactive systems
R. Alur, T.A. Henzinger, in:, 7th International Conference on Computer Aided Verification, Springer, 1995, pp. 166–179.
View | DOI | Download None (ext.)
 

1995 | Published | Journal Article | IST-REx-ID: 4613
The algorithmic analysis of hybrid systems
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, Theoretical Computer Science 138 (1995) 3–34.
View | DOI | Download None (ext.)
 

1995 | Published | Journal Article | IST-REx-ID: 11677
Fully dynamic biconnectivity in graphs
M.H. Henzinger, Algorithmica 13 (1995) 503–538.
View | DOI
 

1995 | Published | Conference Paper | IST-REx-ID: 11684
Fully dynamic biconnectivity and transitive closure
M.H. Henzinger, V. King, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 1995, pp. 664–672.
View | DOI
 

1995 | Published | Conference Paper | IST-REx-ID: 11805
Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
M.H. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms, Springer Nature, 1995, pp. 171–184.
View | DOI
 

1995 | Published | Conference Paper | IST-REx-ID: 11806
Approximating minimum cuts under insertions
M.H. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming, Springer Nature, 1995, pp. 280–291.
View | DOI
 

1995 | Published | Conference Paper | IST-REx-ID: 11928 | OA
Average case analysis of dynamic graph algorithms
D. Alberts, M.H. Henzinger, in:, 6th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 1995, pp. 312–321.
[Published Version] View | Files available | Download Published Version (ext.)
 

1995 | Published | Journal Article | IST-REx-ID: 6162 View | DOI | PubMed | Europe PMC
 

1995 | Published | Journal Article | IST-REx-ID: 1943 | OA [Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

Filters and Search Terms

year=1995

Search

Filter Publications

Display / Sort

Export / Embed