default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIGACT News (ACM), Volume 15
Volume 15, Number 1, Winter - Spring 1983
- Hamid R. Amirazizi, Martin E. Hellman:
Time-memory-processor tradeoffs. 18-19 - Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri:
Compact knapsacks are polynomially solvable. 20-22 - Manuel Blum:
Coin flipping by telephone a protocol for solving impossible problems. 23-27 - Gilles Brassard:
An optimally secure relativized cryptosystem. 28-33 - Shimon Even:
A protocol for signing contracts. 34-39 - Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri:
On the necessity of cryptanalytic exhaustive search. 40-44 - Ernst Henze:
The solution of a general equation for the public key system. 45-49 - Tore Herlestam:
On the feasibility of computing discrete logarithms using Adleman's subexponential algorithm. 50-55 - Ingemar Ingemarsson:
Are all injective knapsacks partly solvable after multiplication modulo q? 56-60 - John P. Jordan:
A variant of a public key cryptosystem based on Goppa Codes. 61-66 - Don R. Morrison:
Subtractive encryptors: alternatives to the DES. 67-77 - Stephen Wiesner:
Conjugate coding. 78-88 - Abstracts computing research laboratory. 93-104
Volume 15, Number 2, Spring - Summer 1983
- Irène Guessarian, Francesco Parisi-Presicce:
Iterative vs. regular factor algebras. 32-44 - Alistair Moffat:
The effect of paged memory upon algorithm performance: short note. 45-52 - Cristian Calude:
On a class of independent problems related to Rice theorem. 53-57 - Stanley Coren:
The game of academe. 58-62 - Abstracts. 63-74
- Dan R. Olsen, Norman I. Badler:
An expression model for graphical command languages. 76 - Nicholas V. Findler, Robert F. Cromp:
An artificial intelligence technique to generate self-optimizing experimental designs. 77 - Nicholas V. Findler, Ron Lo:
A note on the functional estimation of values of hidden variables: an extended module for expert systems. 78
Volume 15, Number 3, Summer - Fall 1983
- Leona F. Fass:
Learning context-free languages from their structured sentences. 24-35 - D. John Cooke:
On non-hierachical systems of binary operators. 36-44 - Irène Guessarian:
Survey on classes of interpretations and some of their applications. 45-71 - Abstracts and available technical reports. 72-95
Volume 15, Number 4, Winter - Spring 1984
- Barbara Simons:
The reentry Computer Science Program at U.C. Berkeley. 36 - W. Richard Stark:
Combinatory automaton. 37 - Abstracts. 48-56
- Jonathan S. Turner:
On the general graph embedding problem with applications to circuit layout. 59 - S. Louis Hakimi, Oded Kariv:
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs. 60 - Ronald V. Book:
Relativizations of complexity classes. 61 - John Franco:
Duality, finite improvement and efficiently solved optimization problems. 62 - Eitan M. Gurari, Ten-Hwang Lai:
Deadlock detection in communicating finite state machines. 63-64
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
