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

Springer eBooks

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 & Fischer -- On Teaching the Basics of Complexity Theory -- State.

This 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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.