Explicit near-Ramanujan graphs of every degree
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.3384231 |
Cover
| BookMark | eNotzzFvwjAQBWAPZaDQmdV_IKnP5xAzVoiWSkhIVTtbF_tCUwUTGWjJvy-I6A3vTU_6HsVDPEQWYgYqBzDFM2JRloA5ojUaYSzy1aVrG9-cZGRK2QftKZ5_KMpdou77KA-15F9OvQy8S8xTMaqpPfLT0BPx9br6XK6zzfbtffmyyUjP7SkjAusxVMaisohzoqJUBhB94Ap5oTRrDJ78wvqi1Gyhvob4uigY5XEi1P33HDvq_6htXZeaPaXegXI3ihsobqDgP4CxQsM |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/3357713.3384231 |
| 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.3384231 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-aa18c3db48308336aa5704133cdeb3e902e23dcac98c572e81f1f1ae2e8ad40c3 |
| IEDL.DBID | UNPAY |
| IngestDate | Thu Oct 30 06:00:03 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-aa18c3db48308336aa5704133cdeb3e902e23dcac98c572e81f1f1ae2e8ad40c3 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/3357713.3384231 |
| ParticipantIDs | unpaywall_primary_10_1145_3357713_3384231 |
| PublicationTitle | Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing |
| Score | 2.3043907 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | Explicit near-Ramanujan graphs of every degree |
| URI | https://dl.acm.org/doi/pdf/10.1145/3357713.3384231 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwGA1jO4gXFScqKjl48ZDaJU2bHEUcQ3AMcTBP5WuSwnTLxtYi86_3W1eniJcRCDmEkJ-875G8F0KutchsBEqypBNZFgnMQHDNHIQglMskr3TcT_24N4weR3LUIPxbC2Mn2M60usJfn-m5zWtDW3krhEyQUgVIqjAGQMbTiiXG303SGvYHd6-1b88_NffJXunnsPqAyeQXeHQPNoK-ZeU5uH4z8h6URRaYzz-OjLv165C0f8R6dLCFoSPScP6YBOu3dWMzLqjHrcyeYQq-fANPK4PqJZ3l1OEmXlHrkHC7Nhl2H17ue6z-GoEBj1XBADrKCJtFSmAMJWIAmYSIR8JYZMdOh9xxYQ0YrYxMuFOdHBM4LIGNQiNOSNPPvDslNDGh5oCsKMxzRHMDoBPAqErGOnPg4jNys529dL6xwEg3cmaZ1mNP67Gf71D3gjSLRekuEdOL7KpexC_aEZ2O |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwGA1jO4gXFScqKjl48ZDaJU2bHEUcQ3AMcTBP5WuSwnTLxtYi86_3W1eniJcRCDmEkJ-875G8F0KutchsBEqypBNZFgnMQHDNHIQglMskr3TcT_24N4weR3LUIPxbC2Mn2M60usJfn-m5zWtDW3krhEyQUgVIqjAGQMbTiiXG303SGvYHd6-1b88_NffJXunnsPqAyeQXeHQPNoK-ZeU5uH4z8h6URRaYzz-OjLv165C0f8R6dLCFoSPScP6YBOu3dWMzLqjHrcyeYQq-fANPK4PqJZ3l1OEmXlHrkHC7Nhl2H17ue6z-GoEBj1XBADrKCJtFSmAMJWIAmYSIR8JYZMdOh9xxYQ0YrYxMuFOdHBM4LIGNQiNOSNPPvDslNDGh5oCsKMxzRHMDoBPAqErGOnPg4jNys529dL6xwEg3cmaZ1mNP67Gf71D3gjSLRekuEdOL7KpexC_aEZ2O |
| 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=Explicit+near-Ramanujan+graphs+of+every+degree&rft_id=info:doi/10.1145%2F3357713.3384231&rft.externalDocID=10.1145%2F3357713.3384231 |