On Balanced Versus Unbalanced Computation Trees

U. Hertrampf, H. Vollmer, K.W. Wagner

Open source

DOI
10.1007/s002240000024
Published
1996
Container
Mathematical Systems Theory
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/s002240000024,
  title = {On Balanced Versus Unbalanced Computation Trees},
  author = {U. Hertrampf and H. Vollmer and K.W. Wagner},
  year = {1996},
  journal = {Mathematical Systems Theory},
  doi = {10.1007/s002240000024},
  url = {https://doi.org/10.1007/s002240000024}
}

RIS

TY  - JOUR
TI  - On Balanced Versus Unbalanced Computation Trees
AU  - U. Hertrampf
AU  - H. Vollmer
AU  - K.W. Wagner
PY  - 1996
JO  - Mathematical Systems Theory
DO  - 10.1007/s002240000024
UR  - https://doi.org/10.1007/s002240000024
ER  - 

APA

Hertrampf, U., Vollmer, H., & Wagner, K. (1996). On Balanced Versus Unbalanced Computation Trees. Mathematical Systems Theory. https://doi.org/10.1007/s002240000024

Source records