callback( { "result":{ "query":":facetid:toc:\"db/conf/focs/focs81.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"91.77" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"52", "@dc":"52", "@oc":"52", "@id":"43395284", "text":":facetid:toc:db/conf/focs/focs81.bht" } }, "hits":{ "@total":"52", "@computed":"52", "@sent":"30", "@first":"0", "hit":[{ "@score":"1", "@id":"7089996", "info":{"authors":{"author":[{"@pid":"a/LeonardMAdleman","text":"Leonard M. Adleman"},{"@pid":"o/AndrewMOdlyzko","text":"Andrew M. Odlyzko"}]},"title":"Irreducibility Testing and Factorization of Polynomials (Extended Abstract)","venue":"FOCS","pages":"409-418","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/AdlemanO81","doi":"10.1109/SFCS.1981.20","ee":"https://doi.org/10.1109/SFCS.1981.20","url":"https://dblp.org/rec/conf/focs/AdlemanO81"}, "url":"URL#7089996" }, { "@score":"1", "@id":"7089997", "info":{"authors":{"author":[{"@pid":"04/4857","text":"Z. Aviad"},{"@pid":"48/4092","text":"Eli Shamir 0001"}]},"title":"A Direct Dynamic Solution to Range Search and Related Problems for Product Regions","venue":"FOCS","pages":"123-126","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/AviadS81","doi":"10.1109/SFCS.1981.5","ee":"https://doi.org/10.1109/SFCS.1981.5","url":"https://dblp.org/rec/conf/focs/AviadS81"}, "url":"URL#7089997" }, { "@score":"1", "@id":"7089998", "info":{"authors":{"author":{"@pid":"22/6416","text":"Michael Ben-Or"}},"title":"Probabilistic Algorithms in Finite Fields","venue":"FOCS","pages":"394-398","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Ben-Or81","doi":"10.1109/SFCS.1981.37","ee":"https://doi.org/10.1109/SFCS.1981.37","url":"https://dblp.org/rec/conf/focs/Ben-Or81"}, "url":"URL#7089998" }, { "@score":"1", "@id":"7089999", "info":{"authors":{"author":{"@pid":"54/4061","text":"Norbert Blum"}},"title":"An Omega(n4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution","venue":"FOCS","pages":"101-108","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Blum81","doi":"10.1109/SFCS.1981.10","ee":"https://doi.org/10.1109/SFCS.1981.10","url":"https://dblp.org/rec/conf/focs/Blum81"}, "url":"URL#7089999" }, { "@score":"1", "@id":"7090000", "info":{"authors":{"author":[{"@pid":"58/2261","text":"Ronald V. Book"},{"@pid":"89/995","text":"Christopher B. Wilson"},{"@pid":"22/1575","text":"Mei-rui Xu"}]},"title":"Relativizing Time and Space (Preliminary Report)","venue":"FOCS","pages":"254-259","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/BookWX81","doi":"10.1109/SFCS.1981.39","ee":"https://doi.org/10.1109/SFCS.1981.39","url":"https://dblp.org/rec/conf/focs/BookWX81"}, "url":"URL#7090000" }, { "@score":"1", "@id":"7090001", "info":{"authors":{"author":{"@pid":"22/2067","text":"James E. Burns"}},"title":"Symmetry in Systems of Asynchronous Processes","venue":"FOCS","pages":"169-174","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Burns81","doi":"10.1109/SFCS.1981.42","ee":"https://doi.org/10.1109/SFCS.1981.42","url":"https://dblp.org/rec/conf/focs/Burns81"}, "url":"URL#7090001" }, { "@score":"1", "@id":"7090002", "info":{"authors":{"author":[{"@pid":"26/159","text":"Don Coppersmith"},{"@pid":"w/ShmuelWinograd","text":"Shmuel Winograd"}]},"title":"On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)","venue":"FOCS","pages":"82-90","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/CoppersmithW81","doi":"10.1109/SFCS.1981.27","ee":"https://doi.org/10.1109/SFCS.1981.27","url":"https://dblp.org/rec/conf/focs/CoppersmithW81"}, "url":"URL#7090002" }, { "@score":"1", "@id":"7090003", "info":{"authors":{"author":{"@pid":"d/DannyDolev","text":"Danny Dolev"}},"title":"Unanimity in an Unknown and Unreliable Environment","venue":"FOCS","pages":"159-168","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Dolev81","doi":"10.1109/SFCS.1981.53","ee":"https://doi.org/10.1109/SFCS.1981.53","url":"https://dblp.org/rec/conf/focs/Dolev81"}, "url":"URL#7090003" }, { "@score":"1", "@id":"7090004", "info":{"authors":{"author":[{"@pid":"d/DannyDolev","text":"Danny Dolev"},{"@pid":"y/AndrewChiChihYao","text":"Andrew Chi-Chih Yao"}]},"title":"On the Security of Public Key Protocols (Extended Abstract)","venue":"FOCS","pages":"350-357","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/DolevY81","doi":"10.1109/SFCS.1981.32","ee":"https://doi.org/10.1109/SFCS.1981.32","url":"https://dblp.org/rec/conf/focs/DolevY81"}, "url":"URL#7090004" }, { "@score":"1", "@id":"7090005", "info":{"authors":{"author":[{"@pid":"06/4129","text":"Pavol Duris"},{"@pid":"g/ZviGalil","text":"Zvi Galil"}]},"title":"A Time-Space Tradeoff for Language Recognition","venue":"FOCS","pages":"53-57","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/DurisG81","doi":"10.1109/SFCS.1981.9","ee":"https://doi.org/10.1109/SFCS.1981.9","url":"https://dblp.org/rec/conf/focs/DurisG81"}, "url":"URL#7090005" }, { "@score":"1", "@id":"7090006", "info":{"authors":{"author":[{"@pid":"93/3191","text":"Ephraim Feig"},{"@pid":"w/ShmuelWinograd","text":"Shmuel Winograd"}]},"title":"On the Direct Sum Conjecture (Extended Summary)","venue":"FOCS","pages":"91-94","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/FeigW81","doi":"10.1109/SFCS.1981.28","ee":"https://doi.org/10.1109/SFCS.1981.28","url":"https://dblp.org/rec/conf/focs/FeigW81"}, "url":"URL#7090006" }, { "@score":"1", "@id":"7090007", "info":{"authors":{"author":[{"@pid":"f/PFlajolet","text":"Philippe Flajolet"},{"@pid":"32/2419","text":"Jean-Marc Steyaert"}]},"title":"A Complexity Calculus for Classes of Recursive Search Programs over Tree Structures","venue":"FOCS","pages":"386-393","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/FlajoletS81","doi":"10.1109/SFCS.1981.2","ee":"https://doi.org/10.1109/SFCS.1981.2","url":"https://dblp.org/rec/conf/focs/FlajoletS81"}, "url":"URL#7090007" }, { "@score":"1", "@id":"7090008", "info":{"authors":{"author":{"@pid":"f/GregNFrederickson","text":"Greg N. Frederickson"}},"title":"Implicit Data Structures for the Weighted Dictionary Problem (preliminary version)","venue":"FOCS","pages":"133-139","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Frederickson81","doi":"10.1109/SFCS.1981.19","ee":"https://doi.org/10.1109/SFCS.1981.19","url":"https://dblp.org/rec/conf/focs/Frederickson81"}, "url":"URL#7090008" }, { "@score":"1", "@id":"7090009", "info":{"authors":{"author":[{"@pid":"85/2593","text":"Merrick L. Furst"},{"@pid":"95/1805","text":"James B. Saxe"},{"@pid":"s/MichaelSipser","text":"Michael Sipser"}]},"title":"Parity, Circuits, and the Polynomial-Time Hierarchy","venue":"FOCS","pages":"260-270","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/FurstSS81","doi":"10.1109/SFCS.1981.35","ee":"https://doi.org/10.1109/SFCS.1981.35","url":"https://dblp.org/rec/conf/focs/FurstSS81"}, "url":"URL#7090009" }, { "@score":"1", "@id":"7090010", "info":{"authors":{"author":{"@pid":"g/PGacs","text":"Péter Gács"}},"title":"On the Relation between Descriptional Complexity and Algorithmic Probability","venue":"FOCS","pages":"296-303","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Gacs81","doi":"10.1109/SFCS.1981.31","ee":"https://doi.org/10.1109/SFCS.1981.31","url":"https://dblp.org/rec/conf/focs/Gacs81"}, "url":"URL#7090010" }, { "@score":"1", "@id":"7090011", "info":{"authors":{"author":[{"@pid":"g/EitanMGurari","text":"Eitan M. Gurari"},{"@pid":"i/OscarHIbarra","text":"Oscar H. Ibarra"}]},"title":"Two-Way Counter Machines and Diophantine Equations","venue":"FOCS","pages":"45-52","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/GurariI81","doi":"10.1109/SFCS.1981.52","ee":"https://doi.org/10.1109/SFCS.1981.52","url":"https://dblp.org/rec/conf/focs/GurariI81"}, "url":"URL#7090011" }, { "@score":"1", "@id":"7090012", "info":{"authors":{"author":[{"@pid":"h/JosephYHalpern","text":"Joseph Y. Halpern"},{"@pid":"r/JohnHReif","text":"John H. Reif"}]},"title":"The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract)","venue":"FOCS","pages":"322-334","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/HalpernR81","doi":"10.1109/SFCS.1981.49","ee":"https://doi.org/10.1109/SFCS.1981.49","url":"https://dblp.org/rec/conf/focs/HalpernR81"}, "url":"URL#7090012" }, { "@score":"1", "@id":"7090013", "info":{"authors":{"author":[{"@pid":"h/DavidHarel","text":"David Harel"},{"@pid":"p/AmirPnueli","text":"Amir Pnueli"},{"@pid":"72/4558","text":"Jonathan Stavi"}]},"title":"Propositional Dynamic Logic of Context-Free Programs","venue":"FOCS","pages":"310-321","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/HarelPS81","doi":"10.1109/SFCS.1981.38","ee":"https://doi.org/10.1109/SFCS.1981.38","url":"https://dblp.org/rec/conf/focs/HarelPS81"}, "url":"URL#7090013" }, { "@score":"1", "@id":"7090014", "info":{"authors":{"author":[{"@pid":"27/3914","text":"Alon Itai"},{"@pid":"99/2864","text":"Michael Rodeh"}]},"title":"Symmetry Breaking in Distributive Networks","venue":"FOCS","pages":"150-158","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/ItaiR81","doi":"10.1109/SFCS.1981.41","ee":"https://doi.org/10.1109/SFCS.1981.41","url":"https://dblp.org/rec/conf/focs/ItaiR81"}, "url":"URL#7090014" }, { "@score":"1", "@id":"7090015", "info":{"authors":{"author":{"@pid":"j/JosephJaJa","text":"Joseph F. JáJá"}},"title":"Computation of Algebraic Functions with Root Extractions","venue":"FOCS","pages":"95-100","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/JaJa81","doi":"10.1109/SFCS.1981.14","ee":"https://doi.org/10.1109/SFCS.1981.14","url":"https://dblp.org/rec/conf/focs/JaJa81"}, "url":"URL#7090015" }, { "@score":"1", "@id":"7090016", "info":{"authors":{"author":[{"@pid":"j/DavidSJohnson","text":"David S. Johnson"},{"@pid":"11/4223","text":"Anthony C. Klug"}]},"title":"Optimizing Conjunctive Queries When Attribute Domains Are not Disjoint (Extended Abstract)","venue":"FOCS","pages":"203-211","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/JohnsonK81","doi":"10.1109/SFCS.1981.33","ee":"https://doi.org/10.1109/SFCS.1981.33","url":"https://dblp.org/rec/conf/focs/JohnsonK81"}, "url":"URL#7090016" }, { "@score":"1", "@id":"7090017", "info":{"authors":{"author":[{"@pid":"k/ParisCKanellakis","text":"Paris C. Kanellakis"},{"@pid":"p/CHPapadimitriou","text":"Christos H. Papadimitriou"}]},"title":"The Complexity of Distributed Concurrency Control","venue":"FOCS","pages":"185-197","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/KanellakisP81","doi":"10.1109/SFCS.1981.45","ee":"https://doi.org/10.1109/SFCS.1981.45","url":"https://dblp.org/rec/conf/focs/KanellakisP81"}, "url":"URL#7090017" }, { "@score":"1", "@id":"7090018", "info":{"authors":{"author":{"@pid":"k/RaviKannan","text":"Ravi Kannan"}},"title":"Towards Separating Nondeterministic Time from Deterministic Time","venue":"FOCS","pages":"235-243","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Kannan81a","doi":"10.1109/SFCS.1981.51","ee":"https://doi.org/10.1109/SFCS.1981.51","url":"https://dblp.org/rec/conf/focs/Kannan81a"}, "url":"URL#7090018" }, { "@score":"1", "@id":"7090019", "info":{"authors":{"author":{"@pid":"k/RaviKannan","text":"Ravi Kannan"}},"title":"A Circuit-Size Lower Bound","venue":"FOCS","pages":"304-309","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Kannan81b","doi":"10.1109/SFCS.1981.1","ee":"https://doi.org/10.1109/SFCS.1981.1","url":"https://dblp.org/rec/conf/focs/Kannan81b"}, "url":"URL#7090019" }, { "@score":"1", "@id":"7090020", "info":{"authors":{"author":[{"@pid":"k/RichardMKarp","text":"Richard M. Karp"},{"@pid":"s/MichaelSipser","text":"Michael Sipser"}]},"title":"Maximum Matchings in Sparse Random Graphs","venue":"FOCS","pages":"364-375","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/KarpS81","doi":"10.1109/SFCS.1981.21","ee":"https://doi.org/10.1109/SFCS.1981.21","url":"https://dblp.org/rec/conf/focs/KarpS81"}, "url":"URL#7090020" }, { "@score":"1", "@id":"7090021", "info":{"authors":{"author":[{"@pid":"k/ZviMKedem","text":"Zvi M. Kedem"},{"@pid":"z/AZorat","text":"Alessandro Zorat"}]},"title":"On Relations Between Input and Communication/Computation in VLSI (Preliminary Report)","venue":"FOCS","pages":"37-44","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/KedemZ81","doi":"10.1109/SFCS.1981.26","ee":"https://doi.org/10.1109/SFCS.1981.26","url":"https://dblp.org/rec/conf/focs/KedemZ81"}, "url":"URL#7090021" }, { "@score":"1", "@id":"7090022", "info":{"authors":{"author":{"@pid":"00/5675","text":"Maria M. Klawe"}},"title":"Non-Existence of One-Dimensional Expanding Graphs","venue":"FOCS","pages":"109-114","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Klawe81","doi":"10.1109/SFCS.1981.23","ee":"https://doi.org/10.1109/SFCS.1981.23","url":"https://dblp.org/rec/conf/focs/Klawe81"}, "url":"URL#7090022" }, { "@score":"1", "@id":"7090023", "info":{"authors":{"author":{"@pid":"l/FrankThomsonLeighton","text":"Frank Thomson Leighton"}},"title":"New Lower Bound Techniques for VLSI","venue":"FOCS","pages":"1-12","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Leighton81","doi":"10.1109/SFCS.1981.22","ee":"https://doi.org/10.1109/SFCS.1981.22","url":"https://dblp.org/rec/conf/focs/Leighton81"}, "url":"URL#7090023" }, { "@score":"1", "@id":"7090024", "info":{"authors":{"author":[{"@pid":"l/CELeiserson","text":"Charles E. Leiserson"},{"@pid":"95/1805","text":"James B. Saxe"}]},"title":"Optimizing Synchronous Systems","venue":"FOCS","pages":"23-36","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/LeisersonS81","doi":"10.1109/SFCS.1981.34","ee":"https://doi.org/10.1109/SFCS.1981.34","url":"https://dblp.org/rec/conf/focs/LeisersonS81"}, "url":"URL#7090024" }, { "@score":"1", "@id":"7090025", "info":{"authors":{"author":[{"@pid":"l/RichardJLipton","text":"Richard J. Lipton"},{"@pid":"33/6572","text":"Jacobo Valdes"}]},"title":"Census Functions: an Approach to VLSI Upper Bounds (Preliminary Version)","venue":"FOCS","pages":"13-22","year":"1981","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/LiptonV81","doi":"10.1109/SFCS.1981.13","ee":"https://doi.org/10.1109/SFCS.1981.13","url":"https://dblp.org/rec/conf/focs/LiptonV81"}, "url":"URL#7090025" } ] } } } )