Walking randomly, massively, and efficiently
Saved in:
| Published in | Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/3357713.3384303 |
Cover
| BookMark | eNotjztPwzAURj3AAIW5a35AU659_SgjqnhJlVhAHa0bxxdZOG6VFFD-PanI9B19w5HOtbgohxKFWEpYS6nNHaJxTuIacaMR8Eqs9pS_UvmseirtocvjqupoGNJPPOP0VZE5hRTLKY834pIpD_F23oX4eHp8377Uu7fn1-3DriZlN6c6QAM06W0IjYsMGttJYkGaCJoUs1IRgRun2DRa3ltihzGQMdZxazUuBPx7v8uRxl_K2R_71FE_egn-HOLnED-H4B8ZMUJj |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/3357713.3384303 |
| DatabaseName | Unpaywall for CDI: Periodical Content Unpaywall |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 10.1145/3357713.3384303 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-c0b0a4306ccb7ef043deff6015e04a2ff22e30fb72f5b4196af73eca5567fd643 |
| IEDL.DBID | UNPAY |
| IngestDate | Sun Oct 26 03:20:13 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-c0b0a4306ccb7ef043deff6015e04a2ff22e30fb72f5b4196af73eca5567fd643 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/3357713.3384303 |
| ParticipantIDs | unpaywall_primary_10_1145_3357713_3384303 |
| PublicationTitle | Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing |
| Score | 2.3259826 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | Walking randomly, massively, and efficiently |
| URI | https://dl.acm.org/doi/pdf/10.1145/3357713.3384303 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA5jO4gXFScqKj14EZaZNr_Wo4hjCI4dHM5Tyc-LXTdci9S_3petThEvu4WQpE3Dy_deX74vCF2H5JD1gmLBPcGAUAYr6WPMFdUy5tLZNBCcn8ZiNGWPMz5roeSbC2NzGGe-TuEHm15a3wja8ltKuYSQqg9BFaNB4LMjOPjfbdSZjid3r41uzz8t99FeVSxV_aHy_Bd4DA82hL7VWnMwnBl561el7pvPP4qMu73XIer-kPWiyRaGjlDLFceo96Ly8BM8Aiiyi3le96I5uMmwtYUi1EVurR0BkJPXXTQdPjzfj3BzMQJWiRiU2BBNFDxLGKOl84RRC50gtOKOMJV4nySOEq9l4rlmYGPKS-qM4lxIb8EHOUHtYlG4UxQ5k1pKhYpjJ1lKLJgvA5N0qR6EnGx8hm623y5bbgQwsg2ZmWfNzLNm5uc7tL1A7fK9cpeA6KW-apbwC3vdnHg |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA5jO4gXFScqKj14EZaZNr_Wo4hjCI4dHM5Tyc-LXTdci9S_3petThEvu4WQpE3Dy_deX74vCF2H5JD1gmLBPcGAUAYr6WPMFdUy5tLZNBCcn8ZiNGWPMz5roeSbC2NzGGe-TuEHm15a3wja8ltKuYSQqg9BFaNB4LMjOPjfbdSZjid3r41uzz8t99FeVSxV_aHy_Bd4DA82hL7VWnMwnBl561el7pvPP4qMu73XIer-kPWiyRaGjlDLFceo96Ly8BM8Aiiyi3le96I5uMmwtYUi1EVurR0BkJPXXTQdPjzfj3BzMQJWiRiU2BBNFDxLGKOl84RRC50gtOKOMJV4nySOEq9l4rlmYGPKS-qM4lxIb8EHOUHtYlG4UxQ5k1pKhYpjJ1lKLJgvA5N0qR6EnGx8hm623y5bbgQwsg2ZmWfNzLNm5uc7tL1A7fK9cpeA6KW-apbwC3vdnHg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+52nd+Annual+ACM+SIGACT+Symposium+on+Theory+of+Computing&rft.atitle=Walking+randomly%2C+massively%2C+and+efficiently&rft_id=info:doi/10.1145%2F3357713.3384303&rft.externalDocID=10.1145%2F3357713.3384303 |