@inproceedings{Grigoriev_1987,
    doi = {10.1109/sfcs.1987.56},
    url = {https://doi.org/10.1109%2Fsfcs.1987.56},
    year = {1987},
    month = {oct},
    publisher = {{IEEE}},
    author = {Dima Yu. Grigoriev and Marek Karpinski},
    title = {The matching problem for bipartite graphs with polynomially bounded permanents is in {NC}},
    booktitle = {28th Annual Symposium on Foundations of Computer Science (sfcs 1987)}
}

@inproceedings{Grigoriev_1987, doi = {10.1109/sfcs.1987.56}, url = {https://doi.org/10.1109%2Fsfcs.1987.56}, year = {1987}, month = {oct}, publisher = {{IEEE}}, author = {Dima Yu. Grigoriev and Marek Karpinski}, title = {The matching problem for bipartite graphs with polynomially bounded permanents is in {NC}}, booktitle = {28th Annual Symposium on Foundations of Computer Science (sfcs 1987)} }