Rangan c (23 Ergebnisse)

Zustand: Fair. Rebound by library. Date of Publication Unknown. .This book has hardback covers. Ex-library, With usual stamps and markings, In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN. …

8°, Broschiert. Zustand: Sehr gut. XIII/349 Seiten : Leichte Lagerspuren, unterer Schnitt markiert, sonst wie neu B02-03-06B Sprache: Englisch Gewicht in Gramm: 518.

Zustand: Good. 452 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. pp. 442 Illus.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. In English.

Zustand: New. In English.

Sprache: Englisch OriginalKarton. Noch eingeschweißtes Exemplar.

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. In English.

Paperback. Zustand: Brand New. 1st edition. 351 pages. 9.00x6.00x0.50 inches. In Stock.

Paperback. Zustand: Brand New. 1st edition. 452 pages. 9.25x6.25x1.00 inches. In Stock.

Paperback. Zustand: Brand New. 1st edition. 426 pages. 9.00x6.00x0.75 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - INDOCRYPT 2001, the Second Annual Crypto Conference, is proof of the s- ni cant amount of enthusiasm generated among Indian as well as International crypto communities. INDOCRYPT 2001 was organized by the Indian Institute of Technology, Madras and the Institute of Mathematical Sciences, also located in Madras (now Chennai). This event was enthusiastically co-sponsored by eAl- traz ConsultingPrivate Ltd, Chennai, Odyssey Technologies Ltd, Chennai, and Shanmuga Arts Science Technology and Research Academy (SASTRA), Th- javur. The Program Committee Co-chair, Prof.C.Pandu Rangan was responsible for local organization and registration. The Program Committee considered 77 papers and selected 31 papers for presentation. These papers were selected on the basis of perceived originality, quality, and relevance to the eld of cryptography. The proceedings include the revised version of the accepted papers. Revisions were not checked as to their contents and authors bear full responsibility for the contents of their submissions. The selection of papers is a very challengingand demandingtask. We wish to thank the Program Committee members who did an excellent job in reviewing the submissions in spite of severe time constraints imposed by the tight p- cessingschedule. Each submission was reviewed by at least three referees (only a few by two). The Program Committee was ably assisted by a large number of reviewers in their area of expertise. The list of reviewers has been provided separately. Our thanks go to all of them.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Talk.- The Engineering of Some Bipartite Matching Programs.- Session 1(a) - Data Structure I.- General Splay: A Basic Theory and Calculus.- Static Dictionaries Supporting Rank.- Session 1(b) - Parallel & Distributed Computing I.- Multiple Spin-Block Decisions.- Asynchronous Random Polling Dynamic Load Balancing.- Session 2(a) - Approximate Algorithm I.- Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability.- Hardness of Approximating Independent Domination in Circle Graphs.- Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs.- Session 2(b) - Computational Intelligence.- Ordered Binary Decision Diagrams as Knowledge-Bases.- Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots.- Session 3(a) - Online Algorithm.- On-Line Load Balancing of Temporary Tasks Revisited.- Online Routing in Triangulations.- Session 3(b) - Complexity Theory I.- The Query Complexity of Program Checking by Constant-Depth Circuits.- Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle.- Session 4(a) - Approximate Algorithm II.- Efficient Approximation Algorithms for Multi-label Map Labeling.- Approximation Algorithms in Batch Processing.- Session 4(b) - Graph Algorithm I.- LexBFS-Ordering in Asteroidal Triple-Free Graphs.- Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs.- Invited Talk.- Approximation Algorithms for Some Clustering and Classification Problems.- Session 5(a) - Computational Geometry I.- How Many People Can Hide in a Terrain .- Carrying Umbrellas: An Online Relocation Problem on Graphs.- Session 5(b) - Parallel & Distributed Computing II.- Survivable Networks with Bounded Delay: The Edge FailureCase.- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks.- Session 6(a) - Data Structure II.- Constructing the Suffix Tree of a Tree with a Large Alphabet.- An O(1) Time Algorithm for Generating Multiset Permutations.- Session 6(b) - Complexity Theory II.- Upper Bounds for MaxSat: Further Improved.- A Linear Time Algorithm for Recognizing Regular Boolean Functions.- Session 7(a) - Computational Geometry II.- Station Layouts in the Presence of Location Constraints.- Reverse Center Location Problem.- Session 7(b) - Algorithms in Practice.- Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields.- External Memory Algorithms for Outerplanar Graphs.- Session 8(a) - Approximate Algorithm III.- A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree.- Approximation Algorithms for Channel Assignment with Constraints.- Session 8(b) - Graph Algorithm II.- Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs.- A Linear Algorithm for Finding Total Colorings of Partial k-Trees.- Invited Talk.- Topology-Oriented Approach to Robust Geometric Computation.- Session 9(a) - Approximate Algorithm IV.- Approximating Multicast Congestion.- Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.- Session 9(b) - Parallel & Distributed Computing III.- Online Scheduling of Parallel Communications with Individual Deadlines.- A Faster Algorithm for Finding Disjoint Paths in Grids.- Session 10(a) - Computational Geometry III.- Output-Sensitive Algorithms for Uniform Partitions of Points.- Convexifying Monotone Polygons.- Session 10(b) - Graph Algorithm III.- Bisecting Two Subsets in 3-Connected Graphs.- Generalized Maximum Independent Sets for Trees in Subquadratic Time. …

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Progress in Cryptology - INDOCRYPT 2007 | 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings | K. Srinathan (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2007 | Springer | EAN 9783540770251 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.…

Paperback. Zustand: Brand New. 1983 edition. 340 pages. 9.52x6.69x0.98 inches. In Stock.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 440 | Sprache: Englisch | Produktart: Bücher | This book constitutes the refereed proceedings of the 8th International Conference on Cryptology in India, INDOCRYPT 2007, held in Chennai, India, in December 2007. The papers and three invited lectures were carefully reviewed and selected. The papers are organized in topical sections on hashing, elliptic curve, cryptoanalysis, information theoretic security, elliptic curve cryptography, signature, side channel attack, symmetric cryptosystem, asymmetric cryptosystem, and short papers.…

Zustand: gut. 2001. Progress in Cryptology - INDOCRYPT 2001: Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001 (Lecture Notes in Computer Science, 2247, Band 2247) In deutscher Sprache. pages.