Salil vadhan (22 résultats)

Etat : good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Soft cover. Etat : As New. 1st Edition. This is a fine, as new, first printing paperback copy, maroon-silver spine.

Etat : As New. Unread book in perfect condition.

Etat : New.

paperback. Etat : Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority.

Etat : New.

Etat : As New. Unread book in perfect condition.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Counting Distinct Elements in a Data Stream.- On Testing Convexity and Submodularity.- -Regular Languages Are Testable with a Constant Number of Queries.- Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes.- Counting and Sampling H-Colourings.- Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.- On the 2-Colorability of Random Hypergraphs.- Percolation on Finite Cayley Graphs.- Computing Graph Properties by Randomized Subcube Partitions.- Bisection of Random Cubic Graphs.- Small k-Dominating Sets of Regular Graphs.- Finding Sparse Induced Subgraphs of Semirandom Graphs.- Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View.- Quantum Walks on the Hypercube.- Randomness-Optimal Characterization of Two NP Proof Systems.- A Probabilistic-Time Hierarchy Theorem for 'Slightly Non-uniform' Algorithms.- Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good.- Is Constraint Satisfaction Over Two Variables Always Easy .- Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications.- On the Eigenvalue Power Law.- Classifying Special Interest Groups in Web Graphs. …

Taschenbuch. Etat : Neu. Randomization and Approximation Techniques in Computer Science | 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings | Jose D. P. Rolim (u. a.) | Taschenbuch | viii | Englisch | 2002 | Springer | EAN 9783540441472 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Etat : As New. Unread book in perfect condition.

Etat : New.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 4th Theory of Cryptography Conference, TCC 2007, held in Amsterdam, The Netherlands in February 2007. The 31 revised full papers cover encryption, universally composable security, arguments and zero knowledge, notions of security, obfuscation, secret sharing and multiparty computation, signatures and watermarking, private approximation and black-box reductions, and key establishment.…

Taschenbuch. Etat : Neu. Theory of Cryptography | 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings | Salil P. Vadhan | Taschenbuch | xi | Englisch | 2007 | Springer | EAN 9783540709350 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Etat : New. pp. 612.

Kartoniert / Broschiert. Etat : New. This book constitutes the refereed proceedings of the 4th Theory of Cryptography Conference, TCC 2007, held in Amsterdam, The Netherlands in February 2007. The 31 revised full papers cover encryption, universally composable security, arguments and zero k.

PF. Etat : New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Counting Distinct Elements in a Data Stream.- On Testing Convexity and Submodularity.- ?-Regular Languages Are Testable with a Constant Number of Queries.- Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes.- Counting and Sampling H-Colourings.…

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume contains the papers presented at the 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RAN- DOM 2002), which took place at Harvard University, Cambridge, Massachusetts, from September 13 15, 2002. RANDOM 2002 was concerned with applications of randomness to computational and combinatorial problems, and was the sixth workshop in the series following Bologna, Barcelona, Berkeley, Geneva, and B- keley again. The volume contains 21 contributed papers, selected by the program c- mittee from 48 submissions received in response to the call for papers. We thank all of the authors who submitted papers, our invited speakers, the members of the program committee: Dimitris Achlioptas, Microsoft Research Martin Dyer, U. of Leeds Uriel Feige, Weizmann Institute Russell Impagliazzo, UC San Diego Sampath Kannan, U. of Pennsylvania David Karger, MIT Nati Linial, Hebrew U. Rafail Ostrovsky, Telcordia Technologies Paul Spirakis, U. of Patras and CTI Angelika Steger, TU Munich R udiger Urbanke, Swiss Federal Inst. of Tech. Salil Vadhan, Harvard U., chair, and the external reviewers: N. Alon, R. Alur, A. Ambainis, T. Batu, J. Feig- baum, S. Gerke, Y. Gertner, A. Goerdt, L. Goldberg, J. Hastad, C. Iliopoulos, Y. Ishai, V. Kabanets, S. Khot, L. Kirousis, S. Kontogiannis, M. Krivelevich, M. Mavronicolas, A. McGregor, F. McSherry, D. van Melkebeek, M. Molloy, E. Mossel, S. Nikoletseas, R. Raz, D. Ron, P. Tetali, L. Trevisan, E. Vigoda, J. Watrous, and P. Winkler. 292 pp. Englisch. …

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Counting Distinct Elements in a Data Stream.- On Testing Convexity and Submodularity.- -Regular Languages Are Testable with a Constant Number of Queries.- Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes.- Counting and Sampling H-Colourings.- Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.- On the 2-Colorability of Random Hypergraphs.- Percolation on Finite Cayley Graphs.- Computing Graph Properties by Randomized Subcube Partitions.- Bisection of Random Cubic Graphs.- Small k-Dominating Sets of Regular Graphs.- Finding Sparse Induced Subgraphs of Semirandom Graphs.- Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View.- Quantum Walks on the Hypercube.- Randomness-Optimal Characterization of Two NP Proof Systems.- A Probabilistic-Time Hierarchy Theorem for 'Slightly Non-uniform' Algorithms.- Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good.- Is Constraint Satisfaction Over Two Variables Always Easy .- Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications.- On the Eigenvalue Power Law.- Classifying Special Interest Groups in Web Graphs.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 292 pp. Englisch.…

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 4th Theory of Cryptography Conference, TCC 2007, held in Amsterdam, The Netherlands in February 2007. The 31 revised full papers cover encryption, universally composable security, arguments and zero knowledge, notions of security, obfuscation, secret sharing and multiparty computation, signatures and watermarking, private approximation and black-box reductions, and key establishment. 595 pp. Englisch. …

Etat : New. Print on Demand pp. 612 Illus.

Etat : New. PRINT ON DEMAND pp. 612.