Works matching IS 01290541 AND DT 2003 AND VI 14 AND IP 3


Results: 10
    1
    2

    INTERPROCEDURAL INDUCTION VARIABLE ANALYSIS.

    Published in:
    International Journal of Foundations of Computer Science, 2003, v. 14, n. 3, p. 405, doi. 10.1142/S0129054103001819
    By:
    • Tang, Peiyi;
    • Yew, Pen-Chung
    Publication type:
    Article
    3
    4
    5

    M-HEAP: A MODIFIED HEAP DATA STRUCTURE.

    Published in:
    International Journal of Foundations of Computer Science, 2003, v. 14, n. 3, p. 491, doi. 10.1142/S0129054103001856
    By:
    • Bansal, S.;
    • Sreekanth, S.;
    • Gupta, P.
    Publication type:
    Article
    6

    SUPERNODE BINARY SEARCH TREES.

    Published in:
    International Journal of Foundations of Computer Science, 2003, v. 14, n. 3, p. 465, doi. 10.1142/S0129054103001844
    By:
    • Jung, Haejae;
    • Sahni, Sartaj
    Publication type:
    Article
    7
    8

    BLOCK SORTING IS HARD.

    Published in:
    International Journal of Foundations of Computer Science, 2003, v. 14, n. 3, p. 425, doi. 10.1142/S0129054103001820
    By:
    • Bein, Wolfgang W.;
    • Larmore, Lawrence L.;
    • Latifi, Shahram;
    • Sudborough, I. Hal
    Publication type:
    Article
    9
    10