External Links

    Journal: J. Comput. Syst. Sci.

    Volume 28, Issue 3

    345 -- 358Manfred K. Warmuth, David Haussler. On the Complexity of Iterated Shuffle
    359 -- 378Michael C. Loui. Minimizing Access Pointers into Trees and Arrays
    379 -- 394Dan E. Willard. New Trie Data Structures Which Support Very Fast Search Operations
    395 -- 419Harry B. Hunt III, Daniel J. Rosenkrantz. The Complexity of Monadic Recursion Schemes: Exponential Time Bounds
    420 -- 438Errol L. Lloyd, S. S. Ravi. One-Layer Routing without Component Constraints
    439 -- 466Robin Milner. A Complete Inference System for a Class of Regular Behaviours
    runs on