Milestones

HOME

MILESTONES By Year

Year	Milestone Title
1949	The First Department of Applied Mathematics in Israel
1952	What the earth can tell us
1952	Prospecting for oil and water
1954	WEIZAC, the first computer in Israel
1963	The Responsa ("shut") Project
1964	Mathematical Economics
1969	The first Computer Science program in Israel
1970	Opening of Department of Theoretical Mathematics
1970	Combinatorial Game Theory
1970	Fostering mathematical education of youth and amateurs
1971	Advances in Polynomial Identity Theory
1972	Pioneering modern multi-scale computations
1974	A new class of isospectral problems
1974	Just-In-Time Scheduling and partitions of the integers
1976	Contributions to the Langlands Program in Number Theory
1976	Trace Formulas
1977	Are Partial Differential Equations of Various Types that Different?
1977	The Interpretation of Structure from Motion
1977	Temporal logic
1977	RSA: Constructing Public Key Encryption and Digital Signatures Schemes
1979	How to Share a Secret
1982	Probabilistic encryption and laying rigorous foundations to cryptography
1983	Stability and stabilization
1983	Real semi-algebraic geometry in Dynamics, Analysis, and Number Theory
1984	Visual routines: how the brain composes programs
1984	Statecharts and reactive systems
1984	Pseudorandomness: Objects that look random although they are not
1985	Maximizing smoothness: A computational model of human movements
1985	A greater understanding of the immune system
1986	A new geometry
1986	Zero-Knowledge: Proofs that yield nothing but their validity
1987	Secure Multi-Party Protocols: Emulating a Trusted Party
1987	Local Theory of Normed Spaces
1988	Classification of Primitive Ideals
1988	Reproducing Kernel Spaces
1990	On The Navier-Stokes and Euler Equations
1990	Chaotic dynamics and its applications
1990	The power of interactive proofs
1990	Linear lower bound on depth of Monotone circuits for Matching
1990	Differential cryptanalysis
1990	Compact representations for large networks
1991	Commitment Schemes: Hiding, Binding, and Non-Malleability
1991	Super-Resolution
1991	PCP: Locally (and Probabilistically) Checkable Proofs
1994	Qualitative Theory of Differential Equations
1995	When circles touch
1995	The Effect of Parallel Repetition (on games of partial information)
1996	Percolation beyond Euclidean Lattices
1996	Property Testing: Ultra-fast approximate decisions
1998	Approximation algorithms
1997	Introducing the Stochastic Loewner Evolution
1998	Sharp thresholds and the k-SAT problem
1999	Object Recognition
1999	Exponential Separation of Quantum and Classical Communication Complexity
2000	Spectral theory on metric graphs
2000	Character Formulae
2000	Introducing local limits of graphs
2001	Harmonic Analysis of Reflected Light
2002	Explicit Lossless Expanders
2003	Multilinear Formulas for Permanent and Determinant require Super-Polynomial Size
2003	Purifying randomness
2003	An algorithmic paradigm based on metrics of bounded dimension
2005	Deterministic simulation of random walks
2006	Random walks in random environments
2006	PCP: Gradual gap amplification
2006	A genomic code for the packaging of DNA within cells
2007	Coupled slow and fast dynamics
2007	Non-Compact Gelfand Pairs
2008	Dynamical systems theory applied to medical problems
2008	A Constructive Solution to the Infinitesimal Hilbert 16th Problem
2008	Detecting and separating signals from noise
2009	Learning from Crowdsourced Data
2011	A Fixed point theorem for all L1 Spaces
2011	Random surfaces as Gaussian fields
2011	Homomorphic Encryption: Processing Encrypted Data
2012	Zhelobenko Invariants
2012	Domain Topology of Chromosomes
2013	Bounded Distortion Deformation Spaces
2013	Symbolic dynamics: making sense out of chaos
2013	Counting Representations
2013	Nonstandard Random walks