![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Louchard G.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.218, Iss.2, 1999-05, pp. : 249-262
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the asymptotic behaviour of primitive recursive algorithms
By David R.
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Asymptotic bias of some election methods
Annals of Operations Research, Vol. 215, Iss. 1, 2014-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Asymptotic Properties of Monotonic Nonexpansive Mappings
Discrete Event Dynamic Systems, Vol. 14, Iss. 1, 2004-01 ,pp. :