Lithuanian Mathematical Journal [ejournal].

Get full text

Making greed work in networks a game-theoretic analysis of switch service disciplines. by Shenker, Scott

Conflict-free channel assignment for an optical cluster-based shuffle network configuration. by Aly, Khaled A.

Routing reserved bandwith multi-point connections. by Verma, Dinesh C.

Structural complexity and execution efficiency of distributed application protocols. by Ravindran, K.

Asymmetric k-center is log* n-hard to approximate. by Chuzhoy, Julia

Boosting textual compression in optimal linear time. by Ferragina, Paolo

Edge-disjoint routing in plane switch graphs in linear time. by Hochstein, J.M

Explicit OR-dispersers with polylogarithmic degree. by Saks, Michael

Sparsification-a technique for speeding up dynamic graph algorithms. by Eppstein, David