BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Item Type | Date | Journal or Publication Title | No Grouping
    Number of items: 3.

    ACM Transactions on Algorithms

    Fischer, E. and Lachish, Oded and Matsliah, A. and Newman, I. and Yahalom, O. (2012) On the query complexity of testing orientations for being Eulerian. ACM Transactions on Algorithms 8 (2), pp. 1-41. ISSN 1549-6325.

    Algorithmica

    Lachish, Oded and Newman, I. (2011) Testing periodicity. Algorithmica 60 (2), pp. 401-420. ISSN 0178-4617.

    Computational Complexity

    Lachish, Oded and Newman, I. and Shapira, A. (2008) Space complexity Vs. query complexity. Computational Complexity 17 (1), pp. 70-93. ISSN 1016-3328.

    This list was generated on Tue Dec 7 06:22:21 2021 GMT.