
J.C. Bermond and G. Memmi.
A graph theoretical characterization of minimal deadlocks in Petri nets.
In Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984),
WileyIntersci. Publ.,
New York,
pages 7387,
1985.
Wiley.
@inproceedings{MR812658,
AUTHOR = {Bermond, J.C. and Memmi, G.},
TITLE = {A graph theoretical characterization of minimal deadlocks in {P}etri nets},
BOOKTITLE = {Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984)},
SERIES = {WileyIntersci. Publ.},
PAGES = {7387},
PUBLISHER = {Wiley},
ADDRESS = {New York},
YEAR = {1985},
}

A. Ferreira.
Algoritmos heurìsticos para otimização de PLA's.
In Proceedings of the 5th Brazilian Symposium of Microelectronics,
1985.
University of São Paulo Press.
@INPROCEEDINGS{pla1:cn,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Proceedings of the 5th Brazilian Symposium of Microelectronics},
KEY = {qfcongnat},
PUBLISHER = {University of S\~ao Paulo Press},
TITLE = {{Algoritmos heur{\'\i}sticos para otimiza{\c c\~ao} de {PLA's}}},
YEAR = {1985},
}

W. Jalby,
J. Maillard,
and P. Mussi.
Evaluation of Parallel Execution of Program Tree Structures.
In Parallel Computing 85,
pages 279285,
1985.
@inproceedings{JaMaMu85,
author = {W. Jalby and J. Maillard and P. Mussi},
booktitle = {Parallel Computing 85},
pages = 279285,
title = {Evaluation of Parallel Execution of Program Tree Structures},
year = {1985},
}