scientific article; zbMATH DE number 1305416

MaRDI QIDQ4252298zbMATH OpenFDO

Authors Przemka Kanarek, Mirosław Kutyłowski, Krzysztof Loryś, Artur Czumaj

Publication date 8 July 1999

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Data encryption (aspects in computer science) (68P25) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• Delayed path coupling and generating random permutations
• Efficient distributed random walks with applications
• Random Walk Delayed on Percolation Clusters
• scientific article; zbMATH DE number 4180428
• Distributed algorithms with dynamical random transitions
• Distributed random walks
• scientific article; zbMATH DE number 475330
• Random asynchronous iterations in distributed coordination algorithms

Cited in

(7)

• Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs
• Practically efficient secure single-commodity multi-market auctions
• Provable unlinkability against traffic analysis with low message overhead
• Delayed path coupling and generating random permutations
• scientific article; zbMATH DE number 1563189 (Why is no real title available?)
• Very rapidly mixing Markov chains for \(2\Delta\)-colorings and for independent sets in a graph with maximum degree 4
• Reverse cycle walking and its applications

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 Q4252298)