scientific article; zbMATH DE number 1775423

MaRDI QIDQ4542556zbMATH OpenFDO

Authors Bruce M. Maggs, Friedhelm Meyer auf der Heide, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking, Richard Cole, Michael Mitzenmacher, Andrea Richa

Publication date 27 January 2004

zbMATH Keywords

randomized algorithms

Mathematics Subject Classification ID

Network protocols (68M12) Randomized algorithms (68W20)

Recommendations

• Randomized Routing and Sorting on Fixed-Connection Networks
• Static and dynamic low-congested interval routing schemes
• scientific article; zbMATH DE number 7774260
• Low-congested interval routing schemes for hypercubelike networks
• Routing-proofness in congestion-prone networks
• A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing
• Routing algorithms for switching networks with probabilistic traffic

Cited in

(7)

• On the k-orientability of random graphs
• Minimum congestion redundant assignments to tolerate random faults
• Costly circuits, submodular schedules and approximate Carathéodory theorems
• Randomized allocation processes
• scientific article; zbMATH DE number 176074 (Why is no real title available?)
• Balanced allocation: memory performance tradeoffs
• scientific article; zbMATH DE number 7774260 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542556)