Table of contents for Theoretical computer science : essays in memory of Shimon Even / Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman (eds.) .
Bibliographic record and links to related information available from the Library of Congress catalog
Information from electronic data provided by the publisher. May be incomplete or contain other coding.
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.
Library of Congress subject headings for this publication: