An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs.

Yangjun Chen|Theo Härder


Anthology ID:DBLP:conf/cikm/ChenH94
Volume:Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94), Gaithersburg, Maryland, USA, November 29 - December 2, 1994
Year:1994
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:34-41
URL:https://doi.org/10.1145/191246.191257
DOI:https://doi.org/10.1145/191246.191257
DBLP:conf/cikm/ChenH94
BibTeX:
@inproceedings{chen-1994-optimal, author = {Yangjun Chen and Theo H\"{a}rder}, title = {{An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs}}, booktitle = {{Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94), Gaithersburg, Maryland, USA, November 29 - December 2, 1994}}, pages = {34--41}, publisher = {ACM}, year = {1994}, url = {https://doi.org/10.1145/191246.191257}, doi = {https://doi.org/10.1145/191246.191257} }