Background
Tarjan, Robert Endre was born on April 30, 1948 in Pomona, California, United States. Son of George and Helen Emma (Blome) Tarjan.
(In the winter of 1978, Professor George P61ya and I joint...)
In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.
http://www.amazon.com/gp/product/0817631704/?tag=2022091-20
(There has been an explosive growth in the field of combin...)
There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in network optimization are covered in detail, including a development of the data structures they use and an analysis of their running time. Data Structures and Network Algorithms attempts to provide the reader with both a practical understanding of the algorithms, described to facilitate their easy implementation, and an appreciation of the depth and beauty of the field of graph algorithms.
http://www.amazon.com/gp/product/0898711878/?tag=2022091-20
Tarjan, Robert Endre was born on April 30, 1948 in Pomona, California, United States. Son of George and Helen Emma (Blome) Tarjan.
Bachelor of Science in Mathematics, California Institute of Technology, 1969. Master of Science in Computer science, Stanford University, 1971. Doctor of Philosophy in Computer science, minor in Mathematics, Stanford University, 1972.
Assistant professor computer science Cornell University, Ithaca, New York, 1972-1973. Miller research fellow University California, Berkeley, 1973-1975. Assistant professor computer science Stanford University, Palo Alto, California, 1974—1977, associate professor computer science, 1977-1980.
Member technical staff American Telephone & Telegraph Company Bell Laboratories, Murray Hill, New Jersey, 1980-1990. Adjunct professor New York University, 1981-1985. James S. McDonnell Distinguished University professor computer science Princeton University, New Jersey, since 1985.
Fellow Nippon Electric Corporation Research Institute, Princeton, 1989-1997. Co-director National Science Foundation Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) Princeton University and Rutgers University, 1989-1994, since 2001. Chief scientist, InterTrust, and senior research fellow, STAR Labs, Inter Trust Technologies, Corporation, Sunnyvale, California, 1997-2001.
Chief scientist Hewlett Packard, Palo, Alto, California, 2002-2003, senior fellow, since 2003. Visiting scientist, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1996. Corporation fellow, Compaq Computer Corporation, Houston, Texas, 2002.
Member of program committee or organizing committee for conferences and symposiums. Member National Advisory Board, Coputer Professional for Social Responsibility, since 1987.
(In the winter of 1978, Professor George P61ya and I joint...)
(There has been an explosive growth in the field of combin...)
Fellow American Association for the Advancement of Science, American Academy Arts and Sciences, Association Computing Machinery (A.M. Turing award 1986, Paris Kanellakis award in Theory and Practice, 1999), New York Academy of Sciences. Member National Academy of Sciences (award for Initiatives in Research, 1984, member class membership committee, 1991, 92), National Academy of Engineering (Computer Science and Engineering Peer Committee, 1989-1992), American Philosophical Society, Society Industrial and Applied Mathematics. Foundation Fellow, Institute for Combinatorics and its Applications, 1991.
Married Gail Maria Zawacki, April 22, 1978 (divorced June 1992). Children: Alice Marisha, Zosia Emma Zawacki, Lily Maxine.