J. Howard Johnson

According to our database, J. Howard Johnson authored at least 19 papers between 1982 and 2010.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2010

Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization.

J. Howard Johnson

Proceedings of the Implementation and Application of Automata, 2010

2005

Collapsing <i>epsilon</i>-Loops in Weighted Finite-State Machines.

J. Howard Johnson

Proceedings of the Finite-State Methods and Natural Language Processing, 2005

2002

Introduction.

Michael A. Bauer, Gene F. Hoffnagle, J. Howard Johnson, Gabriel M. Silberman

Inf. Syst. Frontiers, 2002

2000

Lessons from INR in the Specification of Transductions.

J. Howard Johnson

Proceedings of the Implementation and Application of Automata, 2000

Witan web and the software engineering of web-based applications.

J. Howard Johnson, Stephen A. MacKay

Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative Research, 2000

1999

Gigabit Ethernet: From 100 to 1000 Mbps.

Howard Frazier, J. Howard Johnson

IEEE Internet Comput., 1999

1996

Instruction Computation in Subset Construction.

J. Howard Johnson, Derick Wood

Proceedings of the Automata Implementation, 1996

Navigating the textual redundancy web in legacy source.

J. Howard Johnson

Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative Research, 1996

1995

Using an integrated toolset for program understanding.

Michael J. Whitney, Morris Bernstein, Renato de Mori, Kostas Kontogiannis, Brian Corrie, Hausi A. Müller, Scott R. Tilley, Ettore Merlo, John Mylopoulos, Kenny Wong, J. Howard Johnson, James McDaniel, Martin Stanley

Proceedings of the 1995 Conference of the Centre for Advanced Studies on Collaborative Research, 1995

Using textual redundancy to understand change.

J. Howard Johnson

Proceedings of the 1995 Conference of the Centre for Advanced Studies on Collaborative Research, 1995

1994

Investigating Reverse Engineering Technologies for the CAS Program Understanding Project.

Erich B. Buss, Renato de Mori, W. Morven Gentleman, John Henshaw, J. Howard Johnson, Kostas Kontogiannis, Ettore Merlo, Hausi A. Müller, John Mylopoulos, Santanu Paul, Atul Prakash, Martin Stanley, Scott R. Tilley, Joel Troster, Kenny Wong

IBM Syst. J., 1994

Substring Matching for Clone Detection and Change Tracking.

J. Howard Johnson

Proceedings of the International Conference on Software Maintenance, 1994

Visualizing textual redundancy in legacy source.

J. Howard Johnson

Proceedings of the 1994 Conference of the Centre for Advanced Studies on Collaborative Research, October 31, 1994

1993

Identifying redundancy in source code using fingerprints.

J. Howard Johnson

Proceedings of the 1993 Conference of the Centre for Advanced Studies on Collaborative Research, 1993

1989

A Unified Framework for Disambiguating Finite Transductions.

J. Howard Johnson

Theor. Comput. Sci., 1989

1987

Single-Valued Finite Transduction.

J. Howard Johnson

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Rational Equivalence Relations.

J. Howard Johnson

Theor. Comput. Sci., 1986

1985

Do Rational Equivalence Relations have Regular Cross-Sections?

J. Howard Johnson

Proceedings of the Automata, 1985

1982

Dominating Sets in Chordal Graphs.

Kellogg S. Booth, J. Howard Johnson

SIAM J. Comput., 1982