Delayed path coupling and generating random permutations via distributed stochastic processes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 271-280

  Czumaj, Artur ^a   Kanarek, Przemka ^a   Kutylowski, Miroslaw ^a   Lorys, Krzysztof ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; FAULT TOLERANT COMPUTER SYSTEMS; MARKOV PROCESSES; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBABILITY DISTRIBUTIONS; RANDOM ACCESS STORAGE; SECURITY OF DATA; TELECOMMUNICATION TRAFFIC;

DELAYED PATH COUPLING; PARALLEL RANDOM ACCESS MEMORY (PRAM); PERMUTATION;

NETWORK PROTOCOLS;

EID: 0032761596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)