![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)."
@article{DBLP:journals/jacm/RoughgardenVW18, author = {Tim Roughgarden and Sergei Vassilvitskii and Joshua R. Wang}, title = {Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)}, journal = {J. {ACM}}, volume = {65}, number = {6}, pages = {41:1--41:24}, year = {2018}, url = {https://doi.org/10.1145/3232536}, doi = {10.1145/3232536}, timestamp = {Thu, 09 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/RoughgardenVW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/RoughgardenVW16, author = {Tim Roughgarden and Sergei Vassilvitskii and Joshua R. Wang}, editor = {Christian Scheideler and Seth Gilbert}, title = {Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation)}, booktitle = {Proceedings of the 28th {ACM} Symposium on Parallelism in Algorithms and Architectures, {SPAA} 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}, pages = {1--12}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2935764.2935799}, doi = {10.1145/2935764.2935799}, timestamp = {Tue, 06 Nov 2018 16:59:33 +0100}, biburl = {https://dblp.org/rec/conf/spaa/RoughgardenVW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.