![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/icalp/ChierichettiH18
@inproceedings{DBLP:conf/icalp/ChierichettiH18, author = {Flavio Chierichetti and Shahrzad Haddadan}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {On the Complexity of Sampling Vertices Uniformly from a Graph}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {149:1--149:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.149}, doi = {10.4230/LIPICS.ICALP.2018.149}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/ChierichettiH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/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.