Skip to main content

Publisher: Elsevier

Volume 65, Number 1, 15 January 1998

A simplified NP-complete MAXSAT problem
pp. 1-6(6)
Authors: Boe, R.; Raman, V.; Ravikumar, B.; Rao, S.S.

Favourites:
ADD

An attack on a recursive authentication protocol A cautionary tale
pp. 7-10(4)
Authors: Adams, T.M.; Abdel-Khalik, S.I.; Jeter, S.M.; Qureshi, Z.H.; Ryan, P.Y.A.; Schneider, S.A.

Favourites:
ADD

A polynomial algorithm for the extendability problem in bipartite graphs
pp. 11-16(6)
Authors: Winterton, R.H.S.; Lakhal, J.; Litzler, L.

Favourites:
ADD

An improved upper bound on the non-3-colourability threshold
pp. 17-23(7)
Authors: Dunne, P.E.; Zito, M.

Favourites:
ADD

On secret sharing schemes
pp. 25-32(8)
Authors: Bieniasz, B.; Blundo, C.; de Santis, A.; Vaccaro, U.

Favourites:
ADD

The time complexity of updating snapshot memories
pp. 33-40(8)
Authors: Dalal, D.C.; Datta, N.; Mukherjea, S.K.; Israeli, A.; Shirazi, A.

Favourites:
ADD

On rotations in fringe-balanced binary trees
pp. 41-46(6)
Authors: Shibahara, M.; Kotake, S.; Mahmoud, H.M.

Favourites:
ADD

Secret sets and applications
pp. 47-55(9)
Authors: Molva, R.; Tsudik, G.

Favourites:
ADD

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more