N. H. Barton, “The geometry of adaptation,” Nature, vol. 395, no. 6704. Nature Publishing Group, pp. 751–752, 1998.

N. H. Barton, “Genetics and analysis of quantitative traits,” Genetical Research, vol. 72, no. 1. Cambridge University Press, pp. 73–73, 1998.

J. Preußig, S. Kowalewski, H. Wong Toi, and T. A. Henzinger, “An algorithm for the approximative analysis of rectangular automata,” in Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Lyngby, Denmark, 1998, vol. 1486, pp. 228–240.

J. Raskin, P. Schobbens, and T. A. Henzinger, “Axioms for real-time logics,” in Proceedings of the 9th Interantional Conference on Concurrency Theory, Nice, France, 1998, vol. 1466, pp. 219–236.

T. A. Henzinger and V. Rusu, “Reachability verification for hybrid automata,” in Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control, Berkely, CA, United States of America, 1998, vol. 1386, pp. 190–204.

T. A. Henzinger, Ed., HSCC: Hybrid Systems—Computation and Control, vol. 1386. Springer, 1998.

T. A. Henzinger, S. Qadeer, S. Rajamani, and S. Tasiran, “An assume-guarantee rule for checking simulation,” in Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, Palo Alto, CA, United States of America, 1998, vol. 1522, pp. 421–432.

T. A. Henzinger, J. Raskin, and P. Schobbens, “The regular real-time languages,” in Proceedings of the 25th International Colloqium on Automata, Languages and Programming, Aalborg, Denmark, 1998, vol. 1443, pp. 580–591.

T. A. Henzinger, O. Kupferman, and S. Qadeer, “From pre-historic to post-modern symbolic model checking,” in Proceedings of the 10th International Conference on Computer Aided Verification, Vancouver, Canada, 1998, vol. 1427, pp. 195–206.

T. A. Henzinger, S. Qadeer, and S. Rajamani, “You assume, we guarantee: Methodology and case studies,” in Proceedings of the 10th International Conference on Computer Aided Verification, Vancouver, Canada, 1998, vol. 1427, pp. 440–451.

T. A. Henzinger, P. Ho, and H. Wong Toi, “Algorithmic analysis of nonlinear hybrid systems,” IEEE Transactions on Automatic Control, vol. 43, no. 4. IEEE, pp. 540–554, 1998.

T. A. Henzinger, P. Kopke, A. Puri, and P. Varaiya, “What’s decidable about hybrid automata?,” Journal of Computer and System Sciences, vol. 57, no. 1. Elsevier, pp. 94–124, 1998.

T. A. Henzinger, “It’s about time: Real-time logics reviewed,” in Proceedings of the 9th Interantional Conference on Concurrency Theory, Nice, France, 1998, vol. 1466, pp. 439–454.

R. Alur, T. A. Henzinger, and S. Rajamani, “Symbolic exploration of transition hierarchies,” in Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal, 1998, vol. 1384, pp. 330–344.

R. Alur, T. A. Henzinger, O. Kupferman, and M. Vardi, “Alternating refinement relations,” in Proceedings of the 9th Interantional Conference on Concurrency Theory, Nice, France, 1998, vol. 1466, pp. 163–178.

R. Alur, T. A. Henzinger, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran, “Mocha: Modularity in model checking,” in Proceedings of the 10th International Conference on Computer Aided Verification, Vancouver, Canada, 1998, vol. 1427, pp. 521–525.

L. De Alfaro, T. A. Henzinger, and O. Kupferman, “Concurrent reachability games,” in  Proceedings 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, United States of America, 1998, pp. 564–575.

M. de Bono and C. I. Bargmann, “Natural variation in a neuropeptide Y receptor homolog modifies social behavior and food response in C. elegans,” Cell, vol. 94, no. 5. Elsevier, pp. 679–689, 1998.