Kenneth Steiglitz

Kenneth Steiglitz

Dr. Kenneth "Ken" Steiglitz is a professor of computer science at Princeton University. He was born in Weehawken, New Jersey on January 30 1939. He received his Doctor of Engineering Science from New York University in 1963. In 1997 he was inducted as a Fellow of the Association for Computing Machinery.

He has been teaching at Princeton University since 1963. His current research interests include Alternative models of computation, computing with solutions; auction theory and applications, agent-based market simulation.

He is Director of the Program in Applications of Computing.

He is a Fellow of the IEEE and ACM and has received numerous awards.

In June 2007 he was named Eugene Higgins Professor of Computer Science.

Bibliography:

*"A DSP Primer, with Applications to Digital Audio & Computer Music", Prentice-Hall, Englewood Cliffs, New Jersey, 1996.
*"Combinatorial Optimization: Algorithms and Complexity" (with C. H. Papadimitriou), Prentice-Hall, Englewood Cliffs, New Jersey, 1982 (& 1998)
*"Introduction to Discrete Systems", John Wiley, New York, New York, 1974.

New Book:

* [http://www.amazon.com/dp/0691127131/ SHILLS, & SHARKS: eBAY and HUMAN BEHAVIOR] Now Available from Princeton University Press

External links

* [http://www.cs.princeton.edu/~ken/ Personal website] , which includes his publications
* [http://www.powells.com/tqa/steiglitz.html Powells.com technica q&a interview with Ken Steiglitz ] (from June 2007)


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …   Wikipedia

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • Pathological science — Distinguish from the genuine medical related science called pathology. Pathological science is the process in science in which people are tricked into false results ... by subjective effects, wishful thinking or threshold interactions . [Irving… …   Wikipedia

  • Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… …   Wikipedia

  • Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… …   Wikipedia

  • Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… …   Wikipedia

  • Christos Papadimitriou — Professor Christos Papadimitriou giving a talk at the EPFL on 30 June 2009. Christos Harilaos Papadimitriou (Greek: Χρίστος Χαρίλαος Παπαδημητρίου; born August 16, 1949, Athens) is a Professor in the Computer Science Division at the University of …   Wikipedia

  • Bland's rule — In applied mathematics, Bland s rule (also known as Bland s algorithm or Bland s anti cycling rule) is a technique used in the simplex method for ensuring that a linear optimization problem always converges to an answer. cite book | title =… …   Wikipedia

  • Leah Jamieson — Infobox Scientist name = Leah Jamieson caption = birth date = birth date and age|1949|8|27 birth place = Trenton, NJ, USA death date = death place = residence = United States nationality = American field = Signal Processing work institution =… …   Wikipedia

  • Greedy-Algorithmus — Greedy Algorithmen oder gierige Algorithmen bilden eine spezielle Klasse von Algorithmen, die in der Informatik auftreten. Sie zeichnen sich dadurch aus, dass sie schrittweise den Folgezustand auswählen, der zum Zeitpunkt der Wahl den größten… …   Deutsch Wikipedia

Share the article and excerpts

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