Books

• The LaTEX Web Companion. Goosen, M. and Rahtz, S. with Gurari, E., Moore, R., and Sutor R., Addison-Wesley, 1999.

• TEX and LaTEX: Drawing and Literate Programming. Gurari, E., McGraw-Hill, 1994. (A manual for DraTeX, AlDraTex, ProTeX, and AlProTeX.)

• Writing with TEX. Gurari, E., McGraw-Hill, 1994.

• An Introduction to the Theory of Computation. Gurari, E., Computer Science Press — an imprint of E. H. Freeman, 1989.

Journals

• On Deadlock Detection in Systems of Communicating Finite State Machines, Gouda, E., Gurari, E., Lai, T., and Rosier, L., Journal of Computers and Artificial Intelligence 6 (1987), 209-228.

• Two-way Counter Machines and Finite-state Transducers. Gurari, E., International Journal of Computer Mathematics 17 (1985), 229-235.

• Decidable Problems for Powerful Programs. Gurari, E., Journal of the Association for Computing Machinery 32 (1985), 466-483.

• Improved Dynamic Programming Algorithms for Bandwidth Minimization and the Min-cut Linear Arrangement Problem. Gurari, E. and Sudborough, I., Journal of Algorithms 5 (1984), 531-546.

• A Note on Finite Valued and Finitely Ambiguous Transducers. Gurari, E. and Ibarra, O., Mathematical Systems Theory 16 (1983), 61-66.

• On the Difficulties Involved in the Segmentation of Pictures. Gurari, E. and Wechsler, H., IEEE Transactions on Pattern Analysis and Machine Intelligence 4 (1982), 304-306.

• Two-way Counter Machines and Diophantine Equations. Gurari, E. and Ibarra, O., Journal of the Association for Computing Machinery 29 (1982), 863-873.

• (Semi) Alternating Stack Automata. Gurari, E. and Ibarra, O., Mathematical Systems Theory 15 (1982), 211-224.

• The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable. Gurari, E., SIAM Journal on Computing 11 (1982), 448-452.

• Some Simplified Undecidable and NP-Hard Problems for Simple Programs. Gurari, E. and Ibarra, O., Theoretical Computer Science 17 (1982), 55-73.

• The Complexity of Decision Problems for Finite-Turn Multicounter Machines. Gurari, E. and Ibarra, O., Journal of Computer and System Sciences 22 (1981), 220-229.

• The Complexity of the Equivalence Problem for Simple Programs. Gurari, E. and Ibarra, O., Journal of the Association for Computing Machinery 28 (1981), 535-560.

• The Complexity of the Equivalence Problem for Two Characterizations of Presburger Sets. Gurari, E. and Ibarra, O., Theoretical Computer Science 13 (1981), 295-314.

• Path Systems: Constructions, Solutions, and Applications. Gurari, E. and Ibarra, O., SIAM Journal of Computing 9 (1980), 348-374.

• On the space complexity of recursive algorithms. Gurari, E. and Ibarra, O., Information Processing Letters 8 (1979), 267-271.

• Some Decision Problems Concerning Sequential Transducers and Checking Automata. Gurari, E. and Ibarra, O., Journal of Computer and System Sciences 18 (1979), 18-34.

• An NP-Complete Number-Theoretic Problem. Gurari, E. and Ibarra, O., Journal of the Association for Computing Machinery 26 (1979), 567-581.

• Simple Counter Machines and Number-Theoretic Problems. Gurari, E. and Ibarra, O., Journal of Computer and System Sciences 19 (1979), 145-162.

Conference Presentations

• LaTeX Conversion into Normalized Forms and Speech. Gurari, E., TUG 2007: Practicing TeX, San Diego, USA, July 2007. In LaTeX conversion into normalized forms and speech, Proceedings of the 2007 Annual Meeting, TUGboat 28:3, 2007, 363–368.

• Spatial Math Exercises and Worksheets. Bagchee, N. and Gurari, E., TUG 2005 International Typesetting Conference, Wuhan, China, August 2005. In SwiExr: Spatial math exercises and worksheets, in Braille and print, Proceedings of the 2005 Annual Meeting, TUGboat 26:2, 2005, 501–507.

• MathML via TeX4ht and other tools. Gurari, E., Practical TeX 2005, Chapel Hill, North Carolina.

• XML and MathML production through LaTeX. Gurari, E., Second European Workshop on MathML & Scientific e-Contents, Kuopio, Finland, September 2004, (keynote speaker).

• TeX4ht: HTML production. Gurari, E., TUGboat Practical TEX 2004 Conference Proceedings 25:1, p. 39–47.

• From LaTeX to MathML and Beyond. Gurari, E., The 24th Annual Meeting of the TEX Users Group, Big Island, Hawaii, 2003.

• From LaTEX to MathML and Back with TEX4ht and PassiveTEX. Gurari, E. and Rahtz, R., The first MathML International Conference, Urbana-Champaign, Illinois, 2000.

• LaTEX to XML/MathML. Gurari, E. and Rahtz, R., The 20th Annual Meeting of the TEX Users Group, Vancouver, British Columbia, 1999.

• A Demonstration of TEX4ht. Gurari, E., The 18th Annual Meeting of the TEX Users Group, San Francisco, California, 1997.

• Drawing with DraTeX. Gurari, E., The 18th Annual Meeting of the TEX Users Group, San Francisco, California, 1997.

• A WYSIWYG Literate Programming System (Preliminary Report). Gurari, E. and Wu, J., Nineteenth ACM Computer Science Conference (1991), 94–104.

• Two-Way Counter Machines and Diophantine Equations. Gurari, E. and Ibarra, O., Proceedings of the Twenty-Second Annual IEEE Symposium on Foundations of Computer Science (1981), 45-52.

• Cutwidth Problems in Graphs. Gurari, E. and Sudborough, O., Proceedings of the Nineteenth Annual Allerton Conference on Communication, Control, and Computing (1981), 752-761.

• The Complexity of Decision Problems for Finite-Turn Multicounter Machines. Gurari, E. and Ibarra, O., Proceedings of the Eighth International Colloquium on Automata, Languages and Programming (1981), 495-505.

• The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable. Gurari, E., Proceedings of the Twenty-First Annual IEEE Symposium on Foundations of Computer Science (1980), 83-85.

• The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets and Simple Programs. Gurari, E. and Ibarra, O., Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing (1979), 142-152.

• An NP-Complete Number Theoretic Problem. Gurari, E. and Ibarra, O., Proceedings of the Tenth Annual ACM Symposium on Theory of Computing (1978), 205-215.

Unpublished Reports

• Transducers with Decidable Equivalence Problem. Gurari, E., Technical Report, University of Wisconsin-Milwaukee (1979). Revised version, State University of New York at Buffalo (1981).

[back to home page]