Buch, Englisch, Band 3895, 399 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1280 g
Buch, Englisch, Band 3895, 399 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1280 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-32880-3
Verlag: Springer-Verlag GmbH
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
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.