Author： Aspinall David Compagnoni Adriana
Publisher： Springer Publishing Company
ISSN： 0168-7433
Source： Journal of Automated Reasoning, Vol.31, Iss.3-4, 2003-11, pp. : 261-302
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
By Fraenkel
Theoretical Computer Science, Vol. 252, Iss. 1, 2001-02 ,pp. :
Access to resources
Recommend
Comparator networks for binary heap construction
By Brodal
Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. :
Asymptotic behavior in a heap model with two pieces
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
Research Demonstration of a Hardware Reference-Counting Heap
By Wise D.S.
LISP and Symbolic Computation, Vol. 10, Iss. 2, 1997-07 ,pp. :
Pushdown automata with bounded nondeterminism and bounded ambiguity
By Herzog C.
Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. :