e99 Online Shopping Mall

Geometry.Net - the online learning center Help  
Home  - Sports - Hashing (Books)

  Back | 61-72 of 72
A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

click price to see details     click image to enlarge     click link to go to the store

 
61. Application of finite fields to
 
62. Load balancing and hot spot relief
 
63. On-the-fly compression of logical
 
64. An O(n log n) algorithm for finding
 
65. Hello, are you human? (GIT-CC)
 
66. LEND and faster algorithms for
 
67. The correctness proof of a quadratic-hash
 
68. A composition theorem for universal
 
69. Implementation of a perfect hash
 
70. Un algorithme parallele de fermeture
 
71. Hash table collision resolution
 
72.

61. Application of finite fields to memory interleaving (HP Laboratories technical report)
by Abraham Lempel
 Unknown Binding: 13 Pages (1992)

Asin: B0006RFM3C
Canada | United Kingdom | Germany | France | Japan

62. Load balancing and hot spot relief for hash routing among a collection of proxy caches (Research report RC. International Business Machines Corporation. Research Division)
by Kun-Lung Wu
 Unknown Binding: 20 Pages (1999)

Asin: B0006R7L7C
Canada | United Kingdom | Germany | France | Japan

63. On-the-fly compression of logical circuits (Research report RC. International Business Machines Corporation. Research Division)
by Malay K Ganai
 Unknown Binding: 7 Pages (2000)

Asin: B0006REXJ6
Canada | United Kingdom | Germany | France | Japan

64. An O(n log n) algorithm for finding minimal perfect hash functions (TR)
by E. A Fox
 Unknown Binding: 44 Pages (1989)

Asin: B00072ET1C
Canada | United Kingdom | Germany | France | Japan

65. Hello, are you human? (GIT-CC)
by Jun Xu
 Unknown Binding: Pages (2001)

Asin: B0006RQFTW
Canada | United Kingdom | Germany | France | Japan

66. LEND and faster algorithms for constructing minimal perfect hash functions
by E. A Fox
 Unknown Binding: 12 Pages (1992)

Asin: B0006QU99K
Canada | United Kingdom | Germany | France | Japan

67. The correctness proof of a quadratic-hash algorithm
by A. Nico Habermann
 Unknown Binding: 17 Pages (1975)

Asin: B0006W3MJI
Canada | United Kingdom | Germany | France | Japan

68. A composition theorem for universal one-way hash functions (Research report / International Business Machines Corporation. Research Division)
by Victor Shoup
 Unknown Binding: 10 Pages (1999)

Asin: B0006RBRUE
Canada | United Kingdom | Germany | France | Japan

69. Implementation of a perfect hash function scheme (TR)
by Sanjeev Datta
 Unknown Binding: 44 Pages (1989)

Asin: B00072X25G
Canada | United Kingdom | Germany | France | Japan

70. Un algorithme parallele de fermeture transitive utilisant un placement par hachage =: A parallel transitive closure algorithm using hash-based clustering ... Recherche en Informatique et en Automatique)
by Jean-Pierre Cheiney
 Paperback: 22 Pages (1988)

Asin: B0007BS39W
Canada | United Kingdom | Germany | France | Japan

71. Hash table collision resolution with direct-chaining (Computer Science technical report series. University of Maryland)
by Gary D Knott
 Unknown Binding: 16 Pages (1985)

Asin: B000716AKQ
Canada | United Kingdom | Germany | France | Japan

72.
 

Canada | United Kingdom | Germany | France | Japan

  Back | 61-72 of 72
A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

Prices listed on this site are subject to change without notice.
Questions on ordering or shipping? click here for help.

site stats