LEADER 05201nam  22008415  450 
001 996466126403316
005 20230405225523.0
010   $a3-540-32881-5
024 7 $a10.1007/11685654
035   $a(CKB)1000000000232869
035   $a(SSID)ssj0000320367
035   $a(PQKBManifestationID)11253490
035   $a(PQKBTitleCode)TC0000320367
035   $a(PQKBWorkID)10247397
035   $a(PQKB)10269395
035   $a(DE-He213)978-3-540-32881-0
035   $a(MiAaPQ)EBC3067564
035   $a(PPN)123132436
035   $a(EXLCZ)991000000000232869
100   $a20100929d2006      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTheoretical Computer Science$b[electronic resource] $eEssays in Memory of Shimon Even /$fedited by Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman
205   $a1st ed. 2006.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006.
215   $a1 online resource (XII, 399 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3895
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-32880-7 
320   $aIncludes bibliographical references and index.
327   $aThe 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 & Fischer -- On Teaching the Basics of Complexity Theory -- State.
330   $aOn 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3895
606   $aComputer science
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aNumerical analysis
606   $aComputer networks
606   $aData structures (Computer science)
606   $aInformation theory
606   $aTheory of Computation
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aNumerical Analysis
606   $aComputer Communication Networks
606   $aData Structures and Information Theory
615  0$aComputer science.
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aNumerical analysis.
615  0$aComputer networks.
615  0$aData structures (Computer science).
615  0$aInformation theory.
615 14$aTheory of Computation.
615 24$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aNumerical Analysis.
615 24$aComputer Communication Networks.
615 24$aData Structures and Information Theory.
676   $a004.0151
702   $aGoldreich$b Oded$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRosenberg$b Arnold L$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aSelman$b Alan L$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 02$aSpringerLink (Online service)
906   $aBOOK
912   $a996466126403316
996   $aTheoretical computer science$9104541
997   $aUNISA