The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are unknown to the algorithms. A consequence of this assumption is that an algorithm efficient in the cache oblivious model is automatically efficient in a multi-level memory model. Arge et al. recently presented the first optimal cache oblivious priority queue, and demonstr...

L arge-scale lexical semantic resources that provide relational information about words have recently received much focus in Natural Language Processing (NLP). In particular, corpora with predicate-argument structure annotation have been employed as the backbone for the development of shallow semantic parsing systems that automatically identify the semantic relationships, or semantic roles, con...

Larvae of the argid sawfly, Arge pullata (Zaddach) (Hymenoptera: Argidae), feeds on leaves of birch (Betula spp.) in China, Europe, Siberia, and Japan. Parasitoids of A. pullata were studied in Shennongjia National Nature Reserve, Hubei Province, China, in 2009 and 2010. Five parasitoid species were found: Pleolophus suigensis (Uchida), Mastrus nigrus Sheng, Endasys parviventris nipponicus (Uch...

We leave the proof to you. Both the space and query complexities are known to be optimal (the optimality proof requires knowledge about some sophisticated lower bounds in the cell probe model, and is beyond the scope of this course). We will focus on the dynamic setting of the problem, where the structure needs to support insertions and deletions, and yet, still answer queries efficiently. The ...

ARGE INCREASES in glutamic-oxalacetic transaminase (GOT) activity in blood serum have been reported for patients suffering from heart or liver tissue damage. The determination of this enzyme as described by Karmen (1) and modified by Steinberg, Baldwin, and Ostrow (2) couples the transaminase reaction with the malic dehydrogenase reaction wherein the disappearance of added reduced diphosphopyri...

We give a randomized algorithm for sorting strings in external memory. For K binary strings comprising N words in total, our algorithm finds the sorted order and the longest common prefix sequence of the strings using O( B logM/B( K M ) log( K ) + N B ) I/Os. This bound is never worse than O( B logM/B( K M ) log logM/B( K M ) + N B ) I/Os, and improves on the (deterministic) algorithm of Arge e...