Author:
Klonowski Marek,Kutyłowski Mirosław
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Lecture Notes in Mathematics;D. Aldous,1981
2. Lecture Notes in Computer Science;V. Auletta,2000
3. Lecture Notes in Computer Science;R. Berman,2004
4. Bubley, B., Dyer, M.: Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. ACM-SIAM FOCS 38, 223–231 (1997)
5. Czumaj, A., Kanarek, P., Kutyłowski, M., Loryś, K.: Switching Networks for Generating Random Permutations. In: Switching Networks: Recent Advances, pp. 25–61. Kluwer Academic Publishers, Dordrecht (2001); ISBN 0-7923-6953-X
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ObliDC;Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security;2019-07-02
2. Prochlo;Proceedings of the 26th Symposium on Operating Systems Principles;2017-10-14
3. Privacy-Preserving Computation with Trusted Computing via Scramble-then-Compute;Proceedings on Privacy Enhancing Technologies;2017-07-01
4. Fair Trade Metaphor as a Control Privacy Method for Pervasive Environments: Concepts and Evaluation;Sensors;2015-06-16
5. Anonymous Card Shuffling and Its Applications to Parallel Mixnets;Automata, Languages, and Programming;2012