Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Clé recherche")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 195

  • Page / 8


Selection :

  • and

Distinguishing attacks on SOBER-t16 and t32EKDAHL, Patrik; JOHANSSON, Thomas.Lecture notes in computer science. 2002, pp 210-224, issn 0302-9743, isbn 3-540-44009-7, 15 p.Conference Paper

Some average performance measures for the B-treeWRIGHT, W. E.Acta informatica. 1985, Vol 21, Num 6, pp 541-557, issn 0001-5903Article

On optimal arrangement of keys with double hashingYAO, A. C.Journal of algorithms (Print). 1985, Vol 6, Num 2, pp 253-264, issn 0196-6774Article

Interpolation-binary searchSANTORO, N; SIDNEY, J. B.Information processing letters. 1985, Vol 20, Num 4, pp 179-181, issn 0020-0190Article

Universal retrieval treesKRICHEVSKY, R. E; RYABKO, B. YA.Discrete applied mathematics. 1985, Vol 12, Num 3, pp 291-302, issn 0166-218XArticle

Achieving Hash table searches in one or two bucket probesLYON, G.Computer journal (Print). 1985, Vol 28, Num 3, pp 313-318, issn 0010-4620Article

Public-key cryptosystem and digital-signature schemes based on linear algebra over a local ringZU-HUA, S.IEE proceedings. Part E. Computers and digital techniques. 1987, Vol 134, Num 5, pp 254-256, issn 0143-7062Article

Partial match retrieval in implicit data structuresALT, H; MEHLHORN, K; MUNRO, J. I et al.Information processing letters. 1984, Vol 19, Num 2, pp 61-65, issn 0020-0190Article

Optimal multiway search trees for variable size keysSZWARCFITER, J. L.Acta informatica. 1984, Vol 21, Num 1, pp 47-60, issn 0001-5903Article

A new attack against KhazadMULLER, Frédéric.Lecture notes in computer science. 2003, pp 347-358, issn 0302-9743, isbn 3-540-20592-6, 12 p.Conference Paper

Hash table reorganizationSZYMANSKI, T. G.Journal of algorithms (Print). 1985, Vol 6, Num 3, pp 322-335, issn 0196-6774Article

Split sequence hash searchLODI, E; LUCCIO, F.Information processing letters. 1985, Vol 20, Num 3, pp 131-136, issn 0020-0190Article

Partitioned encryption and achieving simultaneity by partitioningGALIL, Z; YUNG, M.Information processing letters. 1987, Vol 26, Num 2, pp 81-88, issn 0020-0190Article

An optimal algorithm for assigning cryptographic keys to control access in a hierarchyMACKINNON, S. J; TAYLOR, P. D; MEIJER, H et al.IEEE transactions on computers. 1985, Vol 34, Num 9, pp 797-802, issn 0018-9340Article

Known orders : unusual locators in indexesHASS WEINBERG, Bella.Indexer. 2007, Vol 25, Num 4, pp 243-253, issn 0019-4131, 11 p.Article

The boomerang attack on 5 and 6-round reduced AESBIRYUKOV, Alex.Lecture notes in computer science. 2005, pp 11-15, issn 0302-9743, isbn 3-540-26557-0, 5 p.Conference Paper

Probabilities related to father-son distances in binary search treesLANGENHOP, C. E; WRIGHT, W. E.SIAM journal on computing (Print). 1986, Vol 15, Num 2, pp 520-530, issn 0097-5397Article

Binary search trees with limited rotationSHOU-HSUAN STEPHEN HUANG; WONG, C. K.BIT (Nordisk Tidskrift for Informationsbehandling). 1983, Vol 23, Num 4, pp 436-455, issn 0006-3835Article

Cryptanalysis of SOBER-t32BABBAGE, Steve; DE CANNIERE, Christophe; LANO, Joseph et al.Lecture notes in computer science. 2003, pp 111-128, issn 0302-9743, isbn 3-540-20449-0, 18 p.Conference Paper

Rank order distributions and secondary key indexingSAMSON, W. B; BENDELL, A.Computer journal (Print). 1985, Vol 28, Num 3, pp 309-312, issn 0010-4620Article

Algorithme de décomposition de clés = Key decomposition algorithmPICHAT, E.R.A.I.R.O. Informatique théorique. 1985, Vol 19, Num 3, pp 213-232, issn 0399-0540Article

Optimal information retrieval when queries are not randomCHANG, C. C.Information sciences. 1984, Vol 34, Num 3, pp 199-223, issn 0020-0255Article

Multidimensional search trees that provide new types of memory reductionsWILLARD, D. E.Journal of the Association for Computing Machinery. 1987, Vol 34, Num 4, pp 846-858, issn 0004-5411Article

On the number of keys in minimal 2-3 brother treesSASTRY, V. U. K; MURTHY, T. N. V.International journal of computer mathematics. 1986, Vol 19, Num 3-4, pp 267-269, issn 0020-7160Article

Searchable encryption revisited : Consistency properties, relation to anonymous IBE, and extensionsABDALLA, Michel; BELLARE, Mihir; CATALANO, Dario et al.Lecture notes in computer science. 2005, pp 205-222, issn 0302-9743, isbn 3-540-28114-2, 1Vol, 18 p.Conference Paper

  • Page / 8