Efficient coroutine generation of constrained Gray sequences

Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees

Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data

Efficient Fully-Compressed Sequence Representations

Efficient Generation ε-close to G(n,p) and Generalizations

Efficient Hashing with Lookups in two Memory Accesses

Efficient Higher Order Derivatives of Objective Functions Composed of Matrix Operations

Efficient Isomorphism Testing for a Class of Group Extensions

Efficient Local Search Algorithms for Known and New Neighborhoods for the Generalized Traveling Salesman Problem

Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions

Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement

Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems

Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics

Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs

Efficient Pattern Matching on Binary Strings

Efficient pebbling for list traversal synopses

Efficient Seeds Computation Revisited

Efficient Sketches for the Set Query Problem

Efficient Submodular Function Maximization under Linear Packing Constraints