000 03357nam a22003975i 4500
001 296099
003 MX-SnUAN
005 20160429155255.0
007 cr nn 008mamaa
008 150903s2006 gw | o |||| 0|eng d
020 _a9783540328810
_99783540328810
024 7 _a10.1007/11685654
_2doi
035 _avtls000348531
039 9 _a201509030745
_bVLOAD
_c201404121132
_dVLOAD
_c201404090909
_dVLOAD
_y201402071030
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aGoldreich, Oded.
_eeditor.
_9330950
245 1 0 _aTheoretical Computer Science :
_bEssays in Memory of Shimon Even /
_cedited by Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
300 _axii, 399 páginas Also available online.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3895
500 _aSpringer eBooks
505 0 _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.
520 _aThis volume commemorates Shimon Even, one of founding fathers of Computer Science in Israel, who passed away on May 1, 2004. This Festschrift contains research contributions, surveys and educational essays in theoretical computer science, written by former students and close collaborators of Shimon. In accordance with Shimon's style and principles, the essays address natural computational problems and are intended to be accessible to most researchers in theoretical computer science. To make these research contributions accessible to a wide range of researchers - rather than merely to experts in the area - the contributions have been refereed both by experts and by non-experts. The contributions are of three different types, reflecting three main scientific activities of Shimon: original research, technical surveys, and educational essays.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aRosenberg, Arnold L.
_eeditor.
_9300001
700 1 _aSelman, Alan L.
_eeditor.
_9315945
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540328803
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/11685654
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c296099
_d296099