1

Advances in Cryptology || Blind Signatures for Untraceable Payments

Year:
1983
Language:
english
File:
PDF, 606 KB
english, 1983
2

Time bounds for selection

Year:
1973
Language:
english
File:
PDF, 957 KB
english, 1973
4

STATISTICAL ANALYSIS OF THE HAGELIN CRYPTOGRAPH

Year:
1981
Language:
english
File:
PDF, 255 KB
english, 1981
5

Orthogonal Packings in Two Dimensions

Year:
1980
Language:
english
File:
PDF, 1.12 MB
english, 1980
6

Expected time bounds for selection

Year:
1975
Language:
english
File:
PDF, 3.44 MB
english, 1975
7

A ‘greedy’ channel router

Year:
1983
Language:
english
File:
PDF, 701 KB
english, 1983
8

Training a 3-node neural network is NP-complete

Year:
1992
Language:
english
File:
PDF, 956 KB
english, 1992
9

Constructing optimal binary decision trees is NP-complete

Year:
1976
Language:
english
File:
PDF, 247 KB
english, 1976
10

Inferring decision trees using the minimum description lenght principle

Year:
1989
Language:
english
File:
PDF, 1.25 MB
english, 1989
11

On the Polyhedral Decision Problem

Year:
1980
Language:
english
File:
PDF, 552 KB
english, 1980
12

Learning decision lists

Year:
1987
Language:
english
File:
PDF, 965 KB
english, 1987
14

“FORWARDS AND BACKWARDS” ENCRYPTION

Year:
1980
File:
PDF, 170 KB
1980
15

How to expose an eavesdropper

Year:
1984
Language:
english
File:
PDF, 286 KB
english, 1984
17

Game tree searching by min/max approximation

Year:
1987
Language:
english
File:
PDF, 931 KB
english, 1987
18

The subgraph homeomorphism problem

Year:
1980
Language:
english
File:
PDF, 1.12 MB
english, 1980
20

Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam

Year:
1979
Language:
english
File:
PDF, 123 KB
english, 1979
21

Tweakable Block Ciphers

Year:
2011
Language:
english
File:
PDF, 426 KB
english, 2011
23

Piecemeal Graph Exploration by a Mobile Robot

Year:
1999
Language:
english
File:
PDF, 252 KB
english, 1999
24

Linear expected time of a simple union-find algorithm

Year:
1976
Language:
english
File:
PDF, 446 KB
english, 1976
25

Results on learnability and the Vapnik-Chervonenkis dimension

Year:
1991
Language:
english
File:
PDF, 982 KB
english, 1991
26

How to reuse a “write-once≓ memory

Year:
1982
Language:
english
File:
PDF, 815 KB
english, 1982
27

On the Worst-Case Behavior of String-Searching Algorithms

Year:
1977
Language:
english
File:
PDF, 589 KB
english, 1977
28

Piecemeal learning of an unknown environment

Year:
1995
Language:
english
File:
PDF, 1.61 MB
english, 1995
29

Learning Decision Lists

Year:
1987
Language:
english
File:
PDF, 1.02 MB
english, 1987
30

Piecemeal Learning of an Unknown Environment

Year:
1995
Language:
english
File:
PDF, 3.09 MB
english, 1995
35

REMARKS ON A PROPOSED CRYPTANALYTIC ATTACK ON THE M.I.T. PUBLIC-KEY CRYPTOSYSTEM

Year:
1978
Language:
english
File:
PDF, 416 KB
english, 1978
36

On self-organizing sequential search heuristics

Year:
1976
Language:
english
File:
PDF, 2.83 MB
english, 1976
38

Algorithmen - Eine Einführung || 6. Heapsort

Year:
2017
Language:
german
File:
PDF, 374 KB
german, 2017
40

Permutation Polynomials Modulo 2w

Year:
2001
Language:
english
File:
PDF, 235 KB
english, 2001
41

The game of “N questions” on a tree

Year:
1977
Language:
english
File:
PDF, 330 KB
english, 1977
42

Editors' foreword

Year:
1983
File:
PDF, 29 KB
1983
44

Complete variable-length “fix-free” codes

Year:
1995
Language:
english
File:
PDF, 263 KB
english, 1995
46

Asymptotic bounds for the number of convex n-ominoes

Year:
1974
Language:
english
File:
PDF, 819 KB
english, 1974
48

Vortex air rings

Year:
1992
File:
PDF, 305 KB
1992
49

The Case against Regulating Encryption Technology

Year:
1998
Language:
english
File:
PDF, 175 KB
english, 1998