Theoretical Computer Science : Essays in Memory of Shimon Even / edited by Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman.

Format:

Book

Contributor:

Goldreich, Oded, editor.

Rosenberg, Arnold L., 1941- editor.

Selman, Alan L., editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3895.

Theoretical Computer Science and General Issues ; 3895

Language:

English

Subjects (All):

Computers.

Algorithms.

Computer science--Mathematics.

Computer science.

Numerical analysis.

Computer networks.

Data structures (Computer science).

Theory of Computation.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Numeric Computing.

Computer Communication Networks.

Data Structures and Information Theory.

Local Subjects:

Theory of Computation.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Numeric Computing.

Computer Communication Networks.

Data Structures and Information Theory.

Physical Description:

1 online resource (XII, 399 pages).

Edition:

First edition 2006.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.

System Details:

text file PDF

Summary:

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.

Contents:

The Reduced Automata Technique for Graph Exploration Space Lower Bounds

Concurrent Zero-Knowledge with Timing, Revisited

Fair Bandwidth Allocation Without Per-Flow State

Optimal Flow Distribution Among Multiple Channels with Unknown Capacities

Parceling the Butterfly and the Batcher Sorting Network

An Application Intersection Marketing Ontology

How to Leak a Secret: Theory and Applications of Ring Signatures

A New Related Message Attack on RSA

A Tale of Two Methods

Dinitz' Algorithm: The Original Version and Even's Version

Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems

On Promise Problems: A Survey

A Pebble Game for Internet-Based Computing

On Teaching Fast Adder Designs: Revisiting Ladner and Fischer

On Teaching the Basics of Complexity Theory

State.

Other Format:

Printed edition:

ISBN:

978-3-540-32881-0

9783540328810

Access Restriction:

Restricted for use by site license.