Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Robert Tarjan

Related Topics

In the News (Sun 17 Feb 19)

  Easy Encyclopedia - Online Encyclopedia. Knowledge is Power   (Site not responding. Last check: 2007-10-13)
Robert Endre Tarjan (born April 30, 1948 in Pomona, California) is a renowned computer scientist.
Tarjan obtained a Bachelor's degree in mathematics from the California Institute of Technology in 1969.
Tarjan is currently a professor of Computer Science at Princeton University, and also works for Hewlett-Packard.
www.easyencyclopedia.com /encyclopedia/r/ro/robert_tarjan.html   (139 words)

 Linear Graph Algorithms Have Big Payoffs
Robert Frost and Robert Tarjan both advocate taking the road less traveled, although one is thinking of a yellow wood and the other of a graph, the mathematician's abstraction of a network.
Tarjan has explained that the biconnected component algorithm is one of several algorithms presented in the paper that illustrate how the theoretical properties of depth-first search can be used to devise efficient graph algorithms.
Tarjan's work is the starting point for an entire family of ideas that are part of the fabric of thought in diverse areas of science and engineering.
www.siam.org /siamnews/mtc/mtc393.htm   (2055 words)

 HP Labs : About HP Labs : HP Fellows : Robert Tarjan
Tarjan is responsible for identifying key technological trends and determining how HP can best respond, as well as for helping to coordinate and strengthen research and development efforts at HP.
Tarjan is the inventor or co-inventor of the most efficient known algorithms and data structures for problems in a wide variety of application areas.
Tarjan received a B.S. in mathematics from the California Institute of Technology in 1969, and an M.S. and Ph.D. in computer science from Stanford University in 1971 and 1972, respectively.
www.hpl.hp.com /about/honors/HPfellows/tarjan.html   (249 words)

 Dr. Robert E. Tarjan - 1986 Turing Award Winnter
Robert Endre Tarjan received his undergraduate Bachelor of Science degree in Mathematics from the California Institute of Technology in Pasadena, California in 1969.
Tarjan is also a fellow with the NEC Research Institute in Princeton, New Jersey and stands as InterTrust's Chief Scientist and a Senior Research Fellow in InterTrust's Strategic Technologies and Architectural Research laboratory (STAR Lab).
Tarjan has received multiple honors and distinctions, has been published numerous times in popular journals, and is widely recognized around the world in the field of computer science.
www.cs.wlu.edu /~whaleyt/classes/313/Turing/Mauzy-Tarjan.html   (417 words)

 HP Labs - Inventor interview - Robert Tarjan : The art of the algorithm
Interview with HP Senior Fellow Robert Tarjan, a Turing Award winner, who is the inventor or co-inventor of the most efficient known algorithms and data structures for problems in a wide variety of areas, including chip design, telephone networks and transportation systems.">
Tarjan has developed algorithms useful in everything from improving chip design to routing telephone calls, from optimizing deliveries in transportation networks to improving searches of large data sets.
In the interview that follows, Tarjan talks about creating an elegant algorithm, how he solves difficult problems, his passion for teaching and his views on the future of technology.
www.hpl.hp.com /news/2004/oct_dec/tarjan.html   (2253 words)

 HP Press Release: Compaq Press Release - Compaq Appoints Robert E. Tarjan Corporate Fellow of Research, Development
Tarjan is a pioneer in computer science, internationally known for his expertise in the design and analysis of computer algorithms and data structures.
Among his many honors, Tarjan received the first Nevanlinna Prize in Information Science in 1983 from the International Mathematical Union and the Turing Award in 1986 from the Association for Computing Machinery—the latter is regarded as computer science's Nobel Prize.
Tarjan received his bachelor's degree in mathematics from the California Institute of Technology in 1969, and his master's degree and Ph.D. in computer science from Stanford University in 1971 and 1972.
www.hp.com /hpinfo/newsroom/press/2002pmc/pr2002020401.html   (504 words)

 ZoomInfo Web Summary: Robert Tarjan   (Site not responding. Last check: 2007-10-13)
Tarjan has held positions at Stanford and Berkeley University and is currently Princeton Professor and HP Senior Fellow.
Tarjan, who has also received the prestigious A.M. Turing Award, is a well-known expert in the design and analysis of computer algorithms.
Tarjan received a bachelor's degree in mathematics from the California Institute of Technology in 1969 and an master's and doctorate.
www.zoominfo.com /Search/PersonDetail.aspx?PersonID=566389   (1570 words)

 [No title]
Tarjan, “Iterative algorithms for global flow analysis,” Algorithms and Complexity: New Directions and Recent Results, J. Traub, ed., Academic Press, New York (1976), 71-102.
Tarjan and M. Yannakakis, “Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs,” SIAM J. Computing 13 (1984), 566-579; Addendum, ibid.
Tarjan and J. Westbrook, “Maintaining bridge-connected and biconnected components on-line,” Algorithmica 7 (1992), 433-464.
www.cs.princeton.edu /~ret/Vitae05.doc   (5151 words)

 INFORMS: The Institute For Operations Research and The Management Sciences
"Robert Tarjan is the world's leading expert in the design, analysis, and use of data structures.
The book is divided into two parts, the first introducing a collection of fundamental data structures and the second illustrating their application to the problems of finding minimum spanning trees, shortest paths, network flows, and maximum matchings.
Tarjan has a gift for seeing through the details to what is essential and important, and the resulting unified presentation is both comprehensive and a model of precision and clarity."
www.informs.org /article.php?id=962   (636 words)

 ACM: Paris Kanellakis Award 1999   (Site not responding. Last check: 2007-10-13)
Sleator and Tarjan introduced to characterize their performance, have also had a major impact on the general field of algorithm design and analysis.
Tarjan is the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University, as well as the Chief Scientist of InterTrust Technologies Corporation and a Senior Research Fellow in InterTrust's STAR Lab.
Dr Tarjan is the author of "Data Structures and Network Algorithms" and coauthor of "Notes in Introductory Combinatorics." He jointly holds a patent on data compression.
www.acm.org /announcements/pk_award_1999.html   (640 words)

 Amazon.com: Data Structures and Network Algorithms (CBMS-NSF Regional Conference Series in Applied Mathematics) ...   (Site not responding. Last check: 2007-10-13)
Robert Tarjan was awarded the ACM's Turing award, computer sciences closest equivalent to the Nobel Prize for his contibutions to the theory of algorithms.
Until Tarjan used this approach to develop superior algorithms for a number of classical problems, the state of the art had been to limit the resources consumed by each step and bound total complexity by multipying the number of steps by the worst case resource consumption per step.
Robert Tarjan (the author) has written many papers on efficient graph algorithms, and appears to be a pioneer in applying proofs of efficiency to graph algorithm.
www.amazon.com /Structures-Algorithms-CBMS-NSF-Conference-Mathematics/dp/0898711878   (1722 words)

 Robert Tarjan - Wikipedia, la enciclopedia libre
Robert Endre Tarjan (30 de abril de 1948, Pomona, California) es un científico de la computación.
Tarjan obtuvo su licenciatura en matemáticas por el Instituto de Tecnología de California en 1969.
En 2006, Tarjan es profesor de ciencias de la computación en la Universidad de Princeton, aunque también trabaja para Hewlett-Packard.
es.wikipedia.org /wiki/Robert_Tarjan   (211 words)

 Citations: Self-adjusting binary search trees - Sleator, Tarjan (ResearchIndex)
This paper is inspired by the observation that one can in fact achieve a 1 e ra tio against the best static object in hindsight for a wide range of data structure problems via weighted experts techniques from Machine Learning, if computational decision making costs are not considered.
Online algorithms for lists have subsequently been well studied, with upper and lower bounds of 1.6 and 1.5 respectively, on the competitive ratio of randomized algorithms for this problem [AvW95, Tei93] The case of trees appears much harder: it is not known whether splay trees or il:....
Using an amortized analysis, Sleator and Tarjan have shown that splay trees worst case time performance is at least competitive (within a constant factor) with that of any conventional binary tree, for a sufficiently long sequence of inputs.
citeseer.ist.psu.edu /context/334977/0   (3176 words)

 Strongly Connected Components, CS 410 Opt
This chapter outlines an algorithm by Robert Tarjan, ref [1], that identifies all strongly connected components in a directed graph G with entry point e.
Strongly connected components (SCC) are those subgrahs of G in which every node can be reach from every node in the SCC.
Tarjan's algorithm is an extremely simple and efficient method of finding all SCCs of G.
web.cecs.pdx.edu /~herb/cs410f99/scc.htm   (666 words)

 Robert Endre Tarjan   (Site not responding. Last check: 2007-10-13)
Peter J. Downey, Ravi Sethi, and Robert Endre Tarjan.
Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan.
David R. Karger, Philip N. Klein, and Robert E. Tarjan.
theory.lcs.mit.edu /~jacm/Authors/tarjanrobertendre.html   (89 words)

 [No title]   (Site not responding. Last check: 2007-10-13)
To: all-ai Subject: GSB Friday Dec 10, 5:30 PM in 7th Floor Playroom --text follows this line-- This being the last GSB of the term, and the funds box having accumulated a small but perceptible cash surplus, we have scheduled a special event.
Not only will there be the finest selection of Belgian, UK, Guinnean and Lithuanian beers (at regular prices), but Robert Tarjan, Michael Dukakis and Jacquelyn Onassis will be making a special appearance to present some recent joint work.
Our algorithm is efficient in that no more than O((1/epsilon)log(n)) memory accesses or message transmittals are necessary in a given iteration to guarantee the desired probability of correctness.
projects.csail.mit.edu /gsb/old-archive/gsb-archive/gsb93-12dec10   (344 words)

 Scientific Commons: Robert E. Tarjan
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the priority queue, can be...
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when there are up to n elements in the priority queue, can be converted into a...
Based on a new version of Hopcroft and Tarjan's planarity testing algorithm, we develop an O (mlogn)-time algorithm to find a maximal planar subgraph.
de.scientificcommons.org /robert_e_tarjan   (2283 words)

 Learn more about Robert Tarjan in the online encyclopedia.   (Site not responding. Last check: 2007-10-13)
Learn more about Robert Tarjan in the online encyclopedia.
Enter a phrase or search word in the box below.
Hint: Play with putting spaces before and after your words to see the different results you get.
www.onlineencyclopedia.org /r/ro/robert_tarjan.html   (226 words)

 Splay tree - Wikipedia, the free encyclopedia
For many non-uniform sequences of operations, splay trees perform better than other search trees, even when the specific pattern of the sequence is unknown.
The splay tree was invented by Daniel Sleator and Robert Tarjan.
In addition to the proven performance guarantees for splay trees there is an unproven conjecture of great interest from the original Sleator and Tarjan paper.
en.wikipedia.org /wiki/Splay_tree   (1454 words)

 Workshops, ALADDIN Center
I will present techniques for writing and analyzing programs that automatically adjust their output to changes in their input and consider several applications.
In this talk I will give a brief overview of a linear-time algorithm for finding dominators (this part is joint work with Robert Tarjan).
Then I will present experimental results for various algorithms that solve this problem efficiently in practice (this part is joint work with Renato Werneck, Robert Tarjan, Spyros Triantafyllis and David August).
www.aladdin.cs.cmu.edu /workshops/lamps04/abstracts.html   (1958 words)

 Jeff's Academic Genealogy   (Site not responding. Last check: 2007-10-13)
John's advisor was Robert Tarjan, whose other students include Monika Henzinger (who introduced Raimund to his wife Martina) and Danny Sleator.
Bob Tarjan's advisor was Robert Floyd, whose other students include Zohar Manna (whose student Tom Henzinger is the husband of my great aunt Monika (incest?)) and Ron Rivest.
Bob Floyd didn't have a Ph.D.; he sprang forth fully formed from the primordial academic ooze like the legendary creature who climbed out of the sea to found the Merovingian dynasty back in the 5th century.
compgeom.cs.uiuc.edu /~jeffe/loop.html   (346 words)

 Floyd Tree
Tree of Robert Floyd's students for the Computer History Exhibits
Professor Robert W Floyd (1965 CMU, moved to Stanford 1967, retired 1994, deceased 2002)
1971 Robert Tarjan (1972 Cornell, 1973 UC Berkeley, 1974 Stanford, 1980 AT&T Bell Labs, 1985 Princeton)
infolab.stanford.edu /pub/voy/museum/floydtree.html   (169 words)

 SAILDART/2006-06   (Site not responding. Last check: 2007-10-13)
STAN-CS-80-794 (AD-A091 122), Robert Endre Tarjan, %2Recent Developments in the Complexity of Combinatorial Algorithms%1, 28 pages, June 1980.
STAN-CS-79-816, Robert L. Blum, M.D., %2Automating the Study of Clinical Hypotheses on a Time-Oriented Data Base: The RX Project%1, 12 pages, November 1979.
STAN-CS-80-830, David Matula, Yossi Shiloach and Robert Tarjan, %2Two Linear-Time Algorithms for Five-Coloring a Planar Graph%1, 23 pages, December 1980.
www.saildart.org /prog/CSR/html/000995?537,9600   (970 words)

 [No title]
Executive Committee The Executive Committee sets general policy for the Center, makes decisions about programs and members and units, and advises the Director.
Fred S. Roberts, Director Mel Janowitz, Associate Director Robert Sedgewick, Co-Director - Princeton Joseph G. Rosenstein, Associate Director for Education Lance Fortnow, NEC Research Institute Peter.
It is charged with soliciting such proposals from the DIMACS members and from the community outside of DIMACS.
www.cs.cmu.edu /afs/cs/project/pscico-guyb/nsfstc00/DIMACS-committees   (289 words)

 The Mathematics Genealogy Project - Robert Floyd
Click here to see the students listed in chronological order.
According to our current on-line database, Robert Floyd has 8 students and 166 descendants.
If you have additional information or corrections regarding this mathematician, please use the update form.
www.genealogy.ams.org /html/id.phtml?id=69223   (78 words)

 DIMACS Comittees
Fred S. Roberts, DIMACS Director, Special Focus on Computational and Mathematical Epidemiology Chair, Special Focus on Computation and Socio-Economic Sciences Chair, and Information Processing in Biology Chair
Fred S. Roberts, DIMACS Director, Information Processing in Biology, Computational and Mathematical Epidemiology and Computation and the Socio-Economic Sciences
The Projects Committee reviews proposals for special focus activities, workshops, and grant-funded research activitis that might be sponsored by DIMACS.
dimacs.rutgers.edu /About/committees.html   (671 words)

 Tarjan Books - Signed, used, new, out-of-print
Sociobehavioral studies in mental retardation : papers in honor of Harvey F. Dingman
by Armen Charles Tarjan, B. Hopper, Society of Nematologists
We guarantee the condition of every book, new or used.
www.alibris.com /search/books/author/Tarjan   (229 words)

 People-Aladdin Center
Princeton University: Bernard Chazelle, Robert Sedgewick, Robert Tarjan
Robert Rwebangira, Rachel Rue, Amitabh Sinha, Muralidhar Talupur, Robin Trew, Chris Twigg, Shobha Venkataraman, Luis Von Ahn, Chris Wallace, Adam Wierman, Ryan Williams, Shan-leung (Maverick) Woo, Ke Yang, Tallys Yunes, Giacomo Zambelli, Martin Zinkevich, Luis Zuluaga
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the
rioja.sangria.cs.cmu.edu /aladdin-www/www/people   (201 words)

 Books by Fred S. Roberts, compare prices
by Fred S. Roberts (Foreword By), Melvyn B. Nathanson, Robert Tarjan (Foreword By), DIMACS WORKSHOP ON UNUSUAL APPLICATIONS
Contemporary Trends in Discrete Mathematics : From Dimacs and Dimatia to the Future Dimatia-Dimacs Conference, May 19-25, 1997, Stirin Castle, Czech Republic
by Fred S. Roberts, American Mathematical Society, Frank Hwang, Dimacs (Group), Dimacs Workshop on Reliability of Computer and Communication Networks, Clyde L. Monma, Clyde L. Monma (Editor)
www.allbookstores.com /author/Fred_S_Roberts.html   (333 words)

Try your search on: Qwika (all wikis)

  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.