CODE SELECTION BY INVERSION OF ORDER-SORTED DERIVORS

Giegerich R (1990)
THEORETICAL COMPUTER SCIENCE 73(2): 177-211.

Download
No fulltext has been uploaded. References only!
Conference Paper | Published | English

No fulltext has been uploaded

Publishing Year
ISSN
PUB-ID

Cite this

Giegerich R. CODE SELECTION BY INVERSION OF ORDER-SORTED DERIVORS. THEORETICAL COMPUTER SCIENCE. 1990;73(2):177-211.
Giegerich, R. (1990). CODE SELECTION BY INVERSION OF ORDER-SORTED DERIVORS. THEORETICAL COMPUTER SCIENCE, 73(2), 177-211. doi:10.1016/0304-3975(90)90145-8
Giegerich, R. (1990). CODE SELECTION BY INVERSION OF ORDER-SORTED DERIVORS. THEORETICAL COMPUTER SCIENCE 73, 177-211.
Giegerich, R., 1990. CODE SELECTION BY INVERSION OF ORDER-SORTED DERIVORS. THEORETICAL COMPUTER SCIENCE, 73(2), p 177-211.
R. Giegerich, “CODE SELECTION BY INVERSION OF ORDER-SORTED DERIVORS”, THEORETICAL COMPUTER SCIENCE, vol. 73, 1990, pp. 177-211.
Giegerich, R.: CODE SELECTION BY INVERSION OF ORDER-SORTED DERIVORS. THEORETICAL COMPUTER SCIENCE. 73, 177-211 (1990).
Giegerich, Robert. “CODE SELECTION BY INVERSION OF ORDER-SORTED DERIVORS”. THEORETICAL COMPUTER SCIENCE 73.2 (1990): 177-211.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar