You are here

Algorithm

Prof. Adi Shamir
12.09.2010
Prof. Adi Shamir, together with two colleagues from the United States, developed an algorithm (now called RSA, for the last...
This diagram is part of a proof that a certain class of algorithms cannot compute the determinant of a matrix in polynomial time. From the research of Prof. Ran Raz
30.08.2010

Where is the dividing line between the possible and the impossible in computation?

Dr. Anat Levin
01.11.2009

Dr. Anat Levin: "Computer files contain a lot of information, and I hope to research their properties to reveal new ways to get at and use that...

Degrees of Similarity
01.11.2007
What makes two pictures, or two people, look alike to us? Why does one voice remind us of another? How can we tell if two genes, or...
(l-r) Prof. Oded Goldreich and Prof. Dana Ron. Super efficiency
01.05.2006

Its hard to be perfect. It's much easier to be almost perfect

Dr. Omer Reingold
15.03.2006

WEIZMANN INSTITUTE PROFESSOR WINS ACM AWARD FOR COMPUTATIONAL COMPLEXITY

 
Lineage Trees for Cells
28.10.2005

 might answer some fundamental open questions in biology. 

(l-r) Prof. Irun Cohen and Prof. Eytan Domany. Profiling the immune system
01.05.2005
An immunologist and a physicist team up to reveal the "fingerprints" of autoimmune disease...
Dr. Omer Reingold. Memory saver
01.05.2005
Why should a computer scientist care about mazes?
Prof. Adi Shamir. Encryption
01.10.2003

Prof. Adi Shamir receives the world's most prestigious award in computer science

Pages