Theoretical Computer Science Essays in Memory of Shimon Even /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Goldreich, Oded (Επιμελητής έκδοσης), Rosenberg, Arnold L. (Επιμελητής έκδοσης), Selman, Alan L. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
• Σειρά: Lecture Notes in Computer Science, 3895
• Θέματα: Computer science.; Computer communication systems.; Data structures (Computer science).; Computers.; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Computer Science.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Numeric Computing.; Computer Communication Networks.; Data Structures, Cryptology and Information Theory.

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

Πίνακας περιεχομένων:

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