E = I + T: The internal extent formula for compacted tries

EAH: A New Encoder based on Adaptive Variable-length Codes

Edge-coloring series-parallel multigraphs

Edges and Switches, Tunnels and Bridges

Edit Distance to Monotonicity in Sliding Windows

Efficient algorithm for the vertex connectivity of trapezoid graphs

Efficient Algorithms and Data Structures for Massive Data Sets

Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures

Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks

Efficient Algorithms for Dualizing Large-Scale Hypergraphs

Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination

Efficient Algorithms for Several Constrained Activity Scheduling Problems in the Time and Space Domains

Efficient Algorithms for Several Constrained Resource Allocation, Management and Discovery Problems

Efficient algorithms for the basis of finite Abelian groups

Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation

Efficient Approximation Algorithms for Optimal Large-scale Network Monitoring

Efficient Approximation of Convex Recolorings

Efficient Clustering with Limited Distance Information

Efficient Computation of Distance Sketches in Distributed Networks

Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method