Sartaj Sahni

Sartaj Sahni

Infobox academic
name = Dr. Sartaj Sahni


image_size = 150px
birth_date =
birth_place =
nationality = Indian
field = Computer Science
work_institutions = University of Florida
alma_mater = Cornell University
doctoral_advisor =
doctoral_students =
known_for = Being a pioneer in the field of data structure
prizes =

Sartaj Kumar Sahni is a computer scientist and is one of the pioneers in the field of data structures. He is currently distinguished professor and chairman of the CISE department at the University of Florida. He is a member of the European Academy of Sciences, a Fellow of the Institute of Electrical and Electronics Engineers (IEEE), the Association for Computing Machinery (ACM), the American Association for the Advancement of Science (AAAS), and Minnesota Supercomputer Institute, and a Distinguished Alumnus of the Indian Institute of Technology, Kanpur. In 1997, he was awarded the IEEE Computer Society Taylor L. Booth Education Award, in 2003, he was awarded the IEEE Computer Society W. Wallace McDowell Award. Sahni was awarded the 2003 ACM Karl Karlstrom Outstanding Educator Award. Sahni received his B.Tech. in Electrical Engineering degree from the Indian Institute of Technology, Kanpur, and the M.S. and Ph.D. degrees in Computer Science from Cornell University. Sahni has published over two hundred and eighty research papers and written 15 texts. [ [http://www.cise.ufl.edu/~sahni/s.htm#BOOKS List of books] authored by Prof. Sahni as available at [http://www.cise.ufl.edu/~sahni/ his official Web site] .] His research publications are on the design and analysis of efficient algorithms, data structures, parallel computing, interconnection networks, design automation, and medical algorithms.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Double-ended priority queue — Not to be confused with Double ended queue. A double ended priority queue (DEPQ)[1] is an abstract data type similar to a priority queue except that it allows for efficient removal of both the maximum and minimum element. It is a data structure… …   Wikipedia

  • Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… …   Wikipedia

  • Leftist tree — A leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node has an s value which is the distance to the nearest leaf. In contrast to a binary heap , a leftist tree attempts to be very unbalanced. In… …   Wikipedia

  • Pairing heap — Pairing heaps are a type of heap data structure with relatively simple implementation and excellent practical amortized performance. However, it has proven very difficult to determine the precise asymptotic running time of pairing heaps.Pairing… …   Wikipedia

  • Algorithmus von Prim — Der Algorithmus von Prim dient der Berechnung eines minimalen Spannbaumes in einem zusammenhängenden, ungerichteten, kantengewichteten Graphen. Der Algorithmus wurde 1930 vom tschechischen Mathematiker Vojtěch Jarník entwickelt. 1957 wurde er… …   Deutsch Wikipedia

  • Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

  • Data structure — In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.[1][2] Different kinds of data structures are suited to different kinds of applications, and some are highly …   Wikipedia

  • Priority queue — A priority queue is an abstract data type in computer programming. It is exactly like a regular queue or stack data structure, but additionally, each element is associated with a priority . stack: elements are pulled in last in first out order (e …   Wikipedia

  • Recursive acronym — A recursive acronym (synonymous with metacronym,[1] recursive initialism, and recursive backronym) is an acronym or initialism that refers to itself in the expression for which it stands. The term was first used in print in April 1986.[2]… …   Wikipedia

  • External sorting — is a term for a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted does not fit into the main memory of a computing device (usually RAM) and a slower kind of memory… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”