{"id":"https://openalex.org/W4234903623","doi":"https://doi.org/10.1145/780542","title":"Proceedings of the thirty-fifth annual ACM symposium on Theory of computing","display_name":"Proceedings of the thirty-fifth annual ACM symposium on Theory of computing","publication_year":2003,"publication_date":"2003-06-09","ids":{"openalex":"https://openalex.org/W4234903623","doi":"https://doi.org/10.1145/780542"},"language":"en","primary_location":{"id":"doi:10.1145/780542","is_oa":false,"landing_page_url":"https://doi.org/10.1145/780542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"},"type":"paratext","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":true,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9789999723434448,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/honor","display_name":"Honor","score":0.631004273891449},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6169955730438232},{"id":"https://openalex.org/keywords/library-science","display_name":"Library science","score":0.5014564990997314}],"concepts":[{"id":"https://openalex.org/C2779438500","wikidata":"https://www.wikidata.org/wiki/Q27070331","display_name":"Honor","level":2,"score":0.631004273891449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6169955730438232},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.5014564990997314},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/780542","is_oa":false,"landing_page_url":"https://doi.org/10.1145/780542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4244591268","https://openalex.org/W4205253569","https://openalex.org/W2476169496","https://openalex.org/W2595572529","https://openalex.org/W4233800182","https://openalex.org/W2360048061","https://openalex.org/W2483767897","https://openalex.org/W2592404050","https://openalex.org/W1687359194"],"abstract_inverted_index":{"The":[0,27,58,91,101,113,217],"papers":[1,96,102,130,158],"in":[2,20,65,69,81,118,145,150,210],"this":[3,192],"volume":[4],"were":[5,52,55,115],"presented":[6],"at":[7],"the":[8,32,82,88,99,160,194,203,213,222,245,251],"Thirty-Fifth":[9],"Annual":[10],"ACM":[11,33],"Symposium":[12,28],"on":[13,37,72],"Theory":[14,41],"of":[15,107,109,128,133,141,212,239],"Computing":[16],"(STOC":[17],"2003),":[18],"held":[19],"San":[21],"Diego,":[22],"California,":[23],"June":[24],"9-11,":[25],"2003.":[26],"is":[29,137],"sponsored":[30],"by":[31,176],"Special":[34],"Interest":[35],"Group":[36],"Algorithms":[38],"and":[39,78,86,126,179,182,255],"Computation":[40],"(SIGACT).In":[42],"response":[43],"to":[44,75,229],"a":[45,66,104,119,146,257],"call":[46],"for":[47,123,159,233],"papers,":[48],"270":[49],"paper":[50,235],"submissions":[51,114],"received.":[53],"All":[54],"submitted":[56],"electronically.":[57],"program":[59,92,153,218],"committee":[60,93,154,219],"conducted":[61],"its":[62],"deliberations":[63],"partly":[64,79],"physical":[67,89],"meeting":[68],"Baltimore,":[70],"MD,":[71],"January":[73],"12":[74],"14,":[76],"2003":[77],"electronically":[80],"ten":[83],"days":[84],"before":[85],"after":[87],"meeting.":[90],"selected":[94,156],"80":[95],"from":[97],"among":[98],"submissions.":[100],"encompass":[103],"wide":[105],"variety":[106],"areas":[108],"theoretical":[110],"computer":[111],"science.":[112],"not":[116],"refereed":[117],"detailed":[120],"fashion":[121],"as":[122],"journal":[124],"submissions,":[125],"many":[127],"these":[129],"represented":[131],"reports":[132],"continuing":[134],"research.":[135],"It":[136],"expected":[138],"that":[139],"most":[140],"them":[142],"will":[143],"appear":[144],"more":[147],"complete":[148],"form":[149],"scientific":[151],"journal.The":[152],"has":[155,200,220],"two":[157],"STOC":[161,195],"Best":[162,196,206,225],"Paper":[163,198,208,227],"Award.":[164],"These":[165],"are":[166],"\"Derandomizing":[167],"Polynomial":[168],"Identity":[169],"Tests":[170],"Means":[171],"Proving":[172],"Circuit":[173],"Lower":[174],"Bounds\"":[175],"Valentine":[177],"Kabanets":[178],"Russell":[180],"Impagliazzo":[181],"\"New":[183],"Lattice":[184],"Based":[185],"Cryptographic":[186],"Constructions\"":[187],"By":[188],"Oded":[189],"Regev.":[190],"Starting":[191],"year,":[193],"Student":[197,207,226],"Award":[199,209,228],"been":[201],"renamed":[202],"Danny":[204,223],"Lewin":[205,224],"honor":[211],"late":[214],"Daniel":[215],"Lewin.":[216],"awarded":[221,250],"Thomas":[230],"P.":[231],"Hayes":[232],"his":[234],"\"Randomly":[236],"Coloring":[237],"Graphs":[238],"Girth":[240],"At":[241],"Least":[242],"Five.\"":[243],"During":[244],"conference,":[246],"Mikl\u00f3s":[247],"Ajtai":[248],"was":[249],"Donald":[252],"E.Knuth":[253],"Prize":[254],"gave":[256],"plenary":[258],"talk.":[259]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}