-
F. Baccelli and P. Mussi.
An asynchronous parallel interpreter for arithmetic expressions and its evaluation.
IEEE Transactions on Computers,
C35-3:245--256,
March 1986.
@ARTICLE{BaMu86,
AUTHOR = {F. Baccelli and P. Mussi},
JOURNAL = {{ IEEE Transactions on Computers}},
PUBLISHER= {IEEE},
TITLE = {{An asynchronous parallel interpreter for arithmetic expressions and its evaluation}},
MONTH={March},
YEAR = {1986},
PAGES={245--256},
VOLUME = {C35-3}
}
-
J.-C. Bermond,
C. Delorme,
and J.-J. Quisquater.
Strategies for interconnection networks: some methods from graph theory.
J. Parallel Distributed Computing,
3(4):433--449,
1986.
[WWW
]
@article{BDQ86,
author = {J.-C. Bermond and C. Delorme and J.-J. Quisquater},
title = {Strategies for interconnection networks: some methods from graph theory},
journal = {J. Parallel Distributed Computing},
volume = {3},
number = {4},
year = {1986},
issn = {0743-7315},
pages = {433--449},
url = {http://dx.doi.org/10.1016/0743-7315(86)90008-0},
publisher = {Academic Press, Inc.},
address = {Orlando, FL, USA},
}
-
J.-C. Bermond and M. Paoli.
Research problem: Hamilton powers of graphs.
Discrete Mathematics,
62:329--331,
1986.
@article{BePa86,
author={Bermond, J.-C. and Paoli, M.},
title={Research problem: Hamilton powers of graphs},
journal={Discrete Mathematics},
volume={62},
year={1986},
pages={329--331},
}
-
J.-C. Bermond,
J. Bond,
and C. Peyrat.
Interconnection networks with each node on two buses in Parallel Algorithms and Architectures.
In Proceedings InTernational Workshop on Parallel Algorithms and Architectures,
pages 155--167,
April 1986.
North Holland.
@inproceedings{BBP86,
author={Bermond, J.-C. and Bond, J. and Peyrat, C.},
title={Interconnection networks with each node on two buses in Parallel Algorithms and Architectures},
booktitle={Proceedings InTernational Workshop on Parallel Algorithms and Architectures},
month={April},
year={1986},
publisher={North Holland},
pages={155--167},
}
-
A. Ferreira.
O problema do dobramento optimal de PLA's: uma nova abordagem e seu algoritmo.
In Proceedings of the 6th Brazilian Congress on Computer Science,
1986.
University of Pernambuco Press.
@INPROCEEDINGS{pla2:cn,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Proceedings of the 6th Brazilian Congress on Computer Science},
KEY = {qf-congnat},
PUBLISHER = {University of Pernambuco Press},
TITLE = {{O problema do dobramento optimal de {PLA's}: uma nova abordagem e seu algoritmo}},
YEAR = {1986},
}
-
C. L. Monma,
B. Reed,
and W. T. Trotter, Jr..
A generalization of threshold graphs with tolerances.
In Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986),
volume 55,
pages 187--197,
1986.
@inproceedings {MR885307,
AUTHOR = {Monma, C. L. and Reed, B. and Trotter, Jr., W. T.},
TITLE = {A generalization of threshold graphs with tolerances},
BOOKTITLE = {Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986)},
JOURNAL = {Congr. Numer.},
VOLUME = {55},
YEAR = {1986},
PAGES = {187--197},
}