In memory of Shimon Even 2006

Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman (Eds.): Theoretical Computer Science, Essays in Memory of Shimon Even. Lecture Notes in Computer Science 3895 Springer 2006, ISBN 3-540-32880-7

Web page of this book

• Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil:
  The Reduced Automata Technique for Graph Exploration Space Lower Bounds. 1-26
  
• Oded Goldreich:
  Concurrent Zero-Knowledge with Timing, Revisited. 27-87
  
• Richard M. Karp:
  Fair Bandwidth Allocation Without Per-Flow State. 88-110
  
• Richard M. Karp, Till Nierhoff, Till Tantau:
  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . 111-128
  
• Ami Litman:
  Parceling the Butterfly and the Batcher Sorting Network. 129-142
  
• Xuan Zhou, James Geller, Yehoshua Perl, Michael Halper:
  An Application Intersection Marketing Ontology. 143-163
  
• Ronald L. Rivest, Adi Shamir, Yael Tauman:
  How to Leak a Secret: Theory and Applications of Ring Signatures. 164-186
  
• Oded Yacobi, Yacov Yacobi:
  A New Related Message Attack on RSA. 187-195
  
• Reuven Bar-Yehuda, Dror Rawitz:
  A Tale of Two Methods. 196-217
  
• Yefim Dinitz:
  Dinitz' Algorithm: The Original Version and Even's Version. 218-240
  
• Christian Glaßer, Alan L. Selman, Liyu Zhang:
  Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems. 241-253
  
• Oded Goldreich:
  On Promise Problems: A Survey. 254-290
  
• Grzegorz Malewicz, Arnold L. Rosenberg:
  A Pebble Game for Internet-Based Computing. 291-312
  
• Guy Even:
  On Teaching Fast Adder Designs: Revisiting Ladner & Fischer. 313-347
  
• Oded Goldreich:
  On Teaching the Basics of Complexity Theory. 348-374
  
• Arnold L. Rosenberg:
  State. 375-398