Optimal Time Bounds for Parallel Term Matching
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Rakesh M. Verma, I. V. Ramakrishnan
Optimal Time Bounds for Parallel Term Matching
CADE, 1988.

CADE 1988
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{CADE-1988-VermaR,
	author        = "Rakesh M. Verma and I. V. Ramakrishnan",
	booktitle     = "{Proceedings of the Ninth International Conference on Automated Deduction}",
	doi           = "10.1007/BFb0012867",
	isbn          = "3-540-19343-X",
	pages         = "694--703",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Optimal Time Bounds for Parallel Term Matching}",
	volume        = 310,
	year          = 1988,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.