Maximum likelihood analysis of algorithms and data structures

Laube U, Nebel M (2010)
Theor. Comput. Sci. 411(1): 188--212.

Download
No fulltext has been uploaded. References only!
Journal Article | English

No fulltext has been uploaded

Author
;
Publishing Year
PUB-ID

Cite this

Laube U, Nebel M. Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci. 2010;411(1):188--212.
Laube, U., & Nebel, M. (2010). Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci., 411(1), 188--212. doi:10.1016/j.tcs.2009.09.025
Laube, U., and Nebel, M. (2010). Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci. 411, 188--212.
Laube, U., & Nebel, M., 2010. Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci., 411(1), p 188--212.
U. Laube and M. Nebel, “Maximum likelihood analysis of algorithms and data structures”, Theor. Comput. Sci., vol. 411, 2010, pp. 188--212.
Laube, U., Nebel, M.: Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci. 411, 188--212 (2010).
Laube, Ulrich, and Nebel, Markus. “Maximum likelihood analysis of algorithms and data structures”. Theor. Comput. Sci. 411.1 (2010): 188--212.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar