On May 1, 2004, the world of theoretical computer science su?ered a stunning loss: Shimon Even passed away. Few computer scientists have had as long, s- tained, and in?uential a career as Shimon. Shimon Even was born in Tel-Aviv in 1935. He received a B.Sc. in Elect- cal Engineering from the Technion in 1959, an M.A. in Mathematics from the University of Northern Carolina in 1961, and a Ph.D. in Applied Mathematics from Harvard University in 1963. He held positions at the Technion (1964–67 and 1974–2003), Harvard University (1967–69), the Weizmann Institute (1969– 74), and the Tel-Aviv Academic College (2003-04). He visited many universities and research institutes, including Bell Laboratories, Boston University, Cornell, Duke, Lucent Technologies, MIT, Paderborn, Stanford, UC-Berkeley, USC and UT-Dallas. Shimon Even played a major role in establishing computer science education in Israel and led the development of academic programs in two major insti- tions: the Weizmann Institute and the Technion. In 1969 he established at the Weizmann the ?rst computer science education program in Israel, and led this program for ?ve years. In 1974 he joined the newly formed computer science department at the Technion and shaped its academic development for several decades. These two academic programs turned out to have a lasting impact on the evolution of computer science in Israel.
Author(s): Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum (auth.), Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman (eds.)
Series: Lecture Notes in Computer Science 3895 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 399
City: Berlin
Tags: Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Computer Communication Networks; Data Structures, Cryptology and Information Theory; Data Encryption
Front Matter....Pages -
The Reduced Automata Technique for Graph Exploration Space Lower Bounds....Pages 1-26
Concurrent Zero-Knowledge with Timing, Revisited....Pages 27-87
Fair Bandwidth Allocation Without Per-Flow State....Pages 88-110
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities....Pages 111-128
Parceling the Butterfly and the Batcher Sorting Network....Pages 129-142
An Application Intersection Marketing Ontology....Pages 143-163
How to Leak a Secret: Theory and Applications of Ring Signatures....Pages 164-186
A New Related Message Attack on RSA....Pages 187-195
A Tale of Two Methods....Pages 196-217
Dinitz’ Algorithm: The Original Version and Even’s Version....Pages 218-240
Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems....Pages 241-253
On Promise Problems: A Survey....Pages 254-290
A Pebble Game for Internet-Based Computing....Pages 291-312
On Teaching Fast Adder Designs: Revisiting Ladner & Fischer....Pages 313-347
On Teaching the Basics of Complexity Theory....Pages 348-374
State....Pages 375-398
Back Matter....Pages -
