Publisher: Elsevier

Related content
Volume 67, Number 4, 31 August 1998

< previous issue | all issues | next issue >

Favourites:Add to Favourites

Parity OBDDs cannot be handled efficiently enough
pp. 163-168(6)
Authors: Eiler, J.M.; Farley, K.A.; Stolper, E.M.; Lobbing, M.; Sieling, D.; Wegener, I.

Favourites:Add to Favourites

Pair algebras and Galois connections
pp. 169-175(7)
Authors: Huh, Y.; Tsoi, M.; Zaitsev, A.; Edmond, J.M.; Lin, W.W.; Yang, J.C.; Lee, D.J.; Backhouse, R.

Favourites:Add to Favourites

Self-organizing maps for drawing large graphs
pp. 177-184(8)
Authors: Sephton, M.A.; Pillinger, C.T.; Gilmour, I.; Bonabeau, E.; Henaux, F.

Favourites:Add to Favourites

An improvement of algorithms for solving interface equations
pp. 185-190(6)
Authors: Zhu, P.; Macdougall, J.D.; Martinelli, F.

Favourites:Add to Favourites

A quorum based k-mutual exclusion by weighted k-quorum systems
pp. 191-197(7)
Authors: Terakado, Y.; Fujitani, T.; Fujita, S.

Favourites:Add to Favourites

Embeddings and the trace of finite sets
pp. 199-203(5)
Authors: Frei, R.; Nagler, T.F.; Schonberg, R.; Kramers, J.D.; Fossa, M.; Guglielmini, G.; Greco, G.

Favourites:Add to Favourites

On the complexity of interactive proofs with bounded communication
pp. 205-214(10)
Authors: Bogard, D.D.; Garrison, D.H.; Cuesta, I.; Grau, F.X.; Giralt, F.; Cohen, Y.; Goldreich, O.; Hastad, J.

Favourites:Add to Favourites

On the complexity of Boolean unification
pp. 215-220(6)
Authors: Hoehler, T.M.; Alperin, M.J.; Albert, D.B.; Martens, C.S.; Wang, B.X.; Jintao, Z.; Peng, X.F.; Baader, F.

Share Content

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