callback( { "result":{ "query":":facetid:toc:\"db/conf/focs/focs87.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"65.52" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"56", "@dc":"56", "@oc":"56", "@id":"43382492", "text":":facetid:toc:db/conf/focs/focs87.bht" } }, "hits":{ "@total":"56", "@computed":"56", "@sent":"30", "@first":"0", "hit":[{ "@score":"1", "@id":"7012750", "info":{"authors":{"author":[{"@pid":"a/YAfek","text":"Yehuda Afek"},{"@pid":"a/BaruchAwerbuch","text":"Baruch Awerbuch"},{"@pid":"g/EliGafni","text":"Eli Gafni"}]},"title":"Applying Static Network Protocols to Dynamic Networks","venue":"FOCS","pages":"358-370","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/AfekAG87","doi":"10.1109/SFCS.1987.7","ee":"https://doi.org/10.1109/SFCS.1987.7","url":"https://dblp.org/rec/conf/focs/AfekAG87"}, "url":"URL#7012750" }, { "@score":"1", "@id":"7012751", "info":{"authors":{"author":[{"@pid":"a/YAfek","text":"Yehuda Afek"},{"@pid":"a/BaruchAwerbuch","text":"Baruch Awerbuch"},{"@pid":"43/732","text":"Serge A. Plotkin"},{"@pid":"s/MichaelESaks","text":"Michael E. Saks"}]},"title":"Local Management of a Global Resource in a Communication Network","venue":"FOCS","pages":"347-357","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/AfekAPS87","doi":"10.1109/SFCS.1987.38","ee":"https://doi.org/10.1109/SFCS.1987.38","url":"https://dblp.org/rec/conf/focs/AfekAPS87"}, "url":"URL#7012751" }, { "@score":"1", "@id":"7012752", "info":{"authors":{"author":[{"@pid":"75/3050","text":"Alok Aggarwal"},{"@pid":"56/4267","text":"Ashok K. Chandra"},{"@pid":"40/3047","text":"Marc Snir"}]},"title":"Hierarchical Memory with Block Transfer","venue":"FOCS","pages":"204-216","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/AggarwalCS87","doi":"10.1109/SFCS.1987.31","ee":"https://doi.org/10.1109/SFCS.1987.31","url":"https://dblp.org/rec/conf/focs/AggarwalCS87"}, "url":"URL#7012752" }, { "@score":"1", "@id":"7012753", "info":{"authors":{"author":[{"@pid":"a/WilliamAiello","text":"William Aiello"},{"@pid":"47/3155","text":"Johan Håstad"}]},"title":"Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds","venue":"FOCS","pages":"439-448","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/AielloH87","doi":"10.1109/SFCS.1987.47","ee":"https://doi.org/10.1109/SFCS.1987.47","url":"https://dblp.org/rec/conf/focs/AielloH87"}, "url":"URL#7012753" }, { "@score":"1", "@id":"7012754", "info":{"authors":{"author":{"@pid":"90/6947","text":"Miklós Ajtai"}},"title":"Recursive Construction for 3-Regular Expanders","venue":"FOCS","pages":"295-304","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Ajtai87","doi":"10.1109/SFCS.1987.50","ee":"https://doi.org/10.1109/SFCS.1987.50","url":"https://dblp.org/rec/conf/focs/Ajtai87"}, "url":"URL#7012754" }, { "@score":"1", "@id":"7012755", "info":{"authors":{"author":[{"@pid":"a/NAlon","text":"Noga Alon"},{"@pid":"a/YAzar","text":"Yossi Azar"}]},"title":"The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms","venue":"FOCS","pages":"489-498","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/AlonA87","doi":"10.1109/SFCS.1987.54","ee":"https://doi.org/10.1109/SFCS.1987.54","url":"https://dblp.org/rec/conf/focs/AlonA87"}, "url":"URL#7012755" }, { "@score":"1", "@id":"7012756", "info":{"authors":{"author":[{"@pid":"a/MikhailJAtallah","text":"Mikhail J. Atallah"},{"@pid":"96/5516","text":"Richard Cole 0001"},{"@pid":"g/MichaelTGoodrich","text":"Michael T. Goodrich"}]},"title":"Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms","venue":"FOCS","pages":"151-160","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/AtallahCG87","doi":"10.1109/SFCS.1987.12","ee":"https://doi.org/10.1109/SFCS.1987.12","url":"https://dblp.org/rec/conf/focs/AtallahCG87"}, "url":"URL#7012756" }, { "@score":"1", "@id":"7012757", "info":{"authors":{"author":[{"@pid":"a/HagitAttiya","text":"Hagit Attiya"},{"@pid":"b/AmotzBarNoy","text":"Amotz Bar-Noy"},{"@pid":"d/DannyDolev","text":"Danny Dolev"},{"@pid":"k/DaphneKoller","text":"Daphne Koller"},{"@pid":"p/DavidPeleg","text":"David Peleg"},{"@pid":"r/RReischuk","text":"Rüdiger Reischuk"}]},"title":"Achievable Cases in an Asynchronous Environment (Extended Abstract)","venue":"FOCS","pages":"337-346","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/AttiyaBDKPR87","doi":"10.1109/SFCS.1987.5","ee":"https://doi.org/10.1109/SFCS.1987.5","url":"https://dblp.org/rec/conf/focs/AttiyaBDKPR87"}, "url":"URL#7012757" }, { "@score":"1", "@id":"7012758", "info":{"authors":{"author":[{"@pid":"36/3770","text":"Piotr Berman"},{"@pid":"17/3143","text":"Robert Roos"}]},"title":"Learning One-Counter Languages in Polynomial Time (Extended Abstract)","venue":"FOCS","pages":"61-67","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/BermanR87","doi":"10.1109/SFCS.1987.36","ee":"https://doi.org/10.1109/SFCS.1987.36","url":"https://dblp.org/rec/conf/focs/BermanR87"}, "url":"URL#7012758" }, { "@score":"1", "@id":"7012759", "info":{"authors":{"author":[{"@pid":"b/ManuelBlum","text":"Manuel Blum 0001"},{"@pid":"i/RImpagliazzo","text":"Russell Impagliazzo"}]},"title":"Generic Oracles and Oracle Classes (Extended Abstract)","venue":"FOCS","pages":"118-126","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/BlumI87","doi":"10.1109/SFCS.1987.30","ee":"https://doi.org/10.1109/SFCS.1987.30","url":"https://dblp.org/rec/conf/focs/BlumI87"}, "url":"URL#7012759" }, { "@score":"1", "@id":"7012760", "info":{"authors":{"author":{"@pid":"47/5657","text":"Ravi B. Boppana"}},"title":"Eigenvalues and Graph Bisection: An Average-Case Analysis (Extended Abstract)","venue":"FOCS","pages":"280-285","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Boppana87","doi":"10.1109/SFCS.1987.22","ee":"https://doi.org/10.1109/SFCS.1987.22","url":"https://dblp.org/rec/conf/focs/Boppana87"}, "url":"URL#7012760" }, { "@score":"1", "@id":"7012761", "info":{"authors":{"author":[{"@pid":"09/4301","text":"Andrei Z. Broder"},{"@pid":"48/4092","text":"Eli Shamir 0001"}]},"title":"On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)","venue":"FOCS","pages":"286-294","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/BroderS87","doi":"10.1109/SFCS.1987.45","ee":"https://doi.org/10.1109/SFCS.1987.45","url":"https://dblp.org/rec/conf/focs/BroderS87"}, "url":"URL#7012761" }, { "@score":"1", "@id":"7012762", "info":{"authors":{"author":{"@pid":"c/JohnFCanny","text":"John F. Canny"}},"title":"A New Algebraic Method for Robot Motion Planning and Real Geometry","venue":"FOCS","pages":"39-48","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Canny87","doi":"10.1109/SFCS.1987.1","ee":"https://doi.org/10.1109/SFCS.1987.1","url":"https://dblp.org/rec/conf/focs/Canny87"}, "url":"URL#7012762" }, { "@score":"1", "@id":"7012763", "info":{"authors":{"author":[{"@pid":"c/JohnFCanny","text":"John F. Canny"},{"@pid":"r/JohnHReif","text":"John H. Reif"}]},"title":"New Lower Bound Techniques for Robot Motion Planning Problems","venue":"FOCS","pages":"49-60","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/CannyR87","doi":"10.1109/SFCS.1987.42","ee":"https://doi.org/10.1109/SFCS.1987.42","url":"https://dblp.org/rec/conf/focs/CannyR87"}, "url":"URL#7012763" }, { "@score":"1", "@id":"7012764", "info":{"authors":{"author":{"@pid":"c/BernardChazelle","text":"Bernard Chazelle"}},"title":"Polytope Range Searching and Integral Geometry (Extended Abstract)","venue":"FOCS","pages":"1-10","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Chazelle87","doi":"10.1109/SFCS.1987.48","ee":"https://doi.org/10.1109/SFCS.1987.48","url":"https://dblp.org/rec/conf/focs/Chazelle87"}, "url":"URL#7012764" }, { "@score":"1", "@id":"7012765", "info":{"authors":{"author":[{"@pid":"26/159","text":"Don Coppersmith"},{"@pid":"r/PRaghavan","text":"Prabhakar Raghavan"},{"@pid":"t/MartinTompa","text":"Martin Tompa"}]},"title":"Parallel Graph Algorithms that Are Efficient on Average","venue":"FOCS","pages":"260-269","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/CoppersmithRT87","doi":"10.1109/SFCS.1987.46","ee":"https://doi.org/10.1109/SFCS.1987.46","url":"https://dblp.org/rec/conf/focs/CoppersmithRT87"}, "url":"URL#7012765" }, { "@score":"1", "@id":"7012766", "info":{"authors":{"author":{"@pid":"41/2063","text":"Stavros S. Cosmadakis"}},"title":"Database Theory and Cylindric Lattices (Extended Abstract)","venue":"FOCS","pages":"411-420","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Cosmadakis87","doi":"10.1109/SFCS.1987.17","ee":"https://doi.org/10.1109/SFCS.1987.17","url":"https://dblp.org/rec/conf/focs/Cosmadakis87"}, "url":"URL#7012766" }, { "@score":"1", "@id":"7012767", "info":{"authors":{"author":[{"@pid":"d/DavidPDobkin","text":"David P. Dobkin"},{"@pid":"13/1525","text":"Steven J. Friedman"},{"@pid":"03/4374","text":"Kenneth J. Supowit"}]},"title":"Delaunay Graphs are Almost as Good as Complete Graphs","venue":"FOCS","pages":"20-26","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/DobkinFS87","doi":"10.1109/SFCS.1987.18","ee":"https://doi.org/10.1109/SFCS.1987.18","url":"https://dblp.org/rec/conf/focs/DobkinFS87"}, "url":"URL#7012767" }, { "@score":"1", "@id":"7012768", "info":{"authors":{"author":[{"@pid":"06/4129","text":"Pavol Duris"},{"@pid":"g/ZviGalil","text":"Zvi Galil"}]},"title":"Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version)","venue":"FOCS","pages":"326-330","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/DurisG87","doi":"10.1109/SFCS.1987.60","ee":"https://doi.org/10.1109/SFCS.1987.60","url":"https://dblp.org/rec/conf/focs/DurisG87"}, "url":"URL#7012768" }, { "@score":"1", "@id":"7012769", "info":{"authors":{"author":[{"@pid":"e/HerbertEdelsbrunner","text":"Herbert Edelsbrunner"},{"@pid":"18/2119","text":"János Pach"},{"@pid":"s/JacobTSchwartz","text":"Jacob T. Schwartz"},{"@pid":"s/MichaSharir","text":"Micha Sharir"}]},"title":"On the Lower Envelope of Bivariate Functions and its Applications","venue":"FOCS","pages":"27-37","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/EdelsbrunnerPSS87","doi":"10.1109/SFCS.1987.44","ee":"https://doi.org/10.1109/SFCS.1987.44","url":"https://dblp.org/rec/conf/focs/EdelsbrunnerPSS87"}, "url":"URL#7012769" }, { "@score":"1", "@id":"7012770", "info":{"authors":{"author":{"@pid":"37/6931","text":"Paul Feldman"}},"title":"A Practical Scheme for Non-interactive Verifiable Secret Sharing","venue":"FOCS","pages":"427-437","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Feldman87","doi":"10.1109/SFCS.1987.4","ee":"https://doi.org/10.1109/SFCS.1987.4","url":"https://dblp.org/rec/conf/focs/Feldman87"}, "url":"URL#7012770" }, { "@score":"1", "@id":"7012771", "info":{"authors":{"author":[{"@pid":"24/5866","text":"Shaodi Gao"},{"@pid":"k/MichaelKaufmann1","text":"Michael Kaufmann 0001"}]},"title":"Channel Routing of Multiterminal Nets","venue":"FOCS","pages":"316-325","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/GaoK87","doi":"10.1109/SFCS.1987.13","ee":"https://doi.org/10.1109/SFCS.1987.13","url":"https://dblp.org/rec/conf/focs/GaoK87"}, "url":"URL#7012771" }, { "@score":"1", "@id":"7012772", "info":{"authors":{"author":[{"@pid":"g/JvzGathen","text":"Joachim von zur Gathen"},{"@pid":"k/DexterKozen","text":"Dexter Kozen"},{"@pid":"44/6965","text":"Susan Landau 0001"}]},"title":"Functional Decomposition of Polynomials","venue":"FOCS","pages":"127-131","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/GathenKL87","doi":"10.1109/SFCS.1987.29","ee":"https://doi.org/10.1109/SFCS.1987.29","url":"https://dblp.org/rec/conf/focs/GathenKL87"}, "url":"URL#7012772" }, { "@score":"1", "@id":"7012773", "info":{"authors":{"author":[{"@pid":"64/5022","text":"Hillel Gazit"},{"@pid":"m/GaryLMiller","text":"Gary L. Miller"}]},"title":"A Parallel Algorithm for Finding a Separator in Planar Graphs","venue":"FOCS","pages":"238-248","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/GazitM87","doi":"10.1109/SFCS.1987.3","ee":"https://doi.org/10.1109/SFCS.1987.3","url":"https://dblp.org/rec/conf/focs/GazitM87"}, "url":"URL#7012773" }, { "@score":"1", "@id":"7012774", "info":{"authors":{"author":[{"@pid":"15/1751","text":"Mihály Geréb-Graus"},{"@pid":"k/DannyKrizanc","text":"Danny Krizanc"}]},"title":"The Complexity of Parallel Comparison Merging","venue":"FOCS","pages":"195-201","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/Gereb-GrausK87","doi":"10.1109/SFCS.1987.55","ee":"https://doi.org/10.1109/SFCS.1987.55","url":"https://dblp.org/rec/conf/focs/Gereb-GrausK87"}, "url":"URL#7012774" }, { "@score":"1", "@id":"7012775", "info":{"authors":{"author":[{"@pid":"41/4476","text":"Subir Kumar Ghosh"},{"@pid":"m/DavidMMount","text":"David M. Mount"}]},"title":"An Output Sensitive Algorithm for Computing Visibility Graphs","venue":"FOCS","pages":"11-19","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/GhoshM87","doi":"10.1109/SFCS.1987.6","ee":"https://doi.org/10.1109/SFCS.1987.6","url":"https://dblp.org/rec/conf/focs/GhoshM87"}, "url":"URL#7012775" }, { "@score":"1", "@id":"7012776", "info":{"authors":{"author":[{"@pid":"g/MarkKGoldberg","text":"Mark K. Goldberg"},{"@pid":"79/5372","text":"Thomas H. Spencer"}]},"title":"A New Parallel Algorithm for the Maximal Independent Set Problem","venue":"FOCS","pages":"161-165","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/GoldbergS87","doi":"10.1109/SFCS.1987.2","ee":"https://doi.org/10.1109/SFCS.1987.2","url":"https://dblp.org/rec/conf/focs/GoldbergS87"}, "url":"URL#7012776" }, { "@score":"1", "@id":"7012777", "info":{"authors":{"author":[{"@pid":"g/OdedGoldreich","text":"Oded Goldreich 0001"},{"@pid":"m/YishayMansour","text":"Yishay Mansour"},{"@pid":"s/MichaelSipser","text":"Michael Sipser"}]},"title":"Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract)","venue":"FOCS","pages":"449-461","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/GoldreichMS87","doi":"10.1109/SFCS.1987.35","ee":"https://doi.org/10.1109/SFCS.1987.35","url":"https://dblp.org/rec/conf/focs/GoldreichMS87"}, "url":"URL#7012777" }, { "@score":"1", "@id":"7012778", "info":{"authors":{"author":[{"@pid":"g/DimaGrigoriev","text":"Dima Grigoriev"},{"@pid":"k/MarekKarpinski","text":"Marek Karpinski"}]},"title":"The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract)","venue":"FOCS","pages":"166-172","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/GrigorievK87","doi":"10.1109/SFCS.1987.56","ee":"https://doi.org/10.1109/SFCS.1987.56","url":"https://dblp.org/rec/conf/focs/GrigorievK87"}, "url":"URL#7012778" }, { "@score":"1", "@id":"7012779", "info":{"authors":{"author":[{"@pid":"g/VinceGrolmusz","text":"Vince Grolmusz"},{"@pid":"12/3497","text":"Prabhakar Ragde"}]},"title":"Incomparability in Parallel Computation","venue":"FOCS","pages":"89-98","year":"1987","type":"Conference and Workshop Papers","access":"closed","key":"conf/focs/GrolmuszR87","doi":"10.1109/SFCS.1987.34","ee":"https://doi.org/10.1109/SFCS.1987.34","url":"https://dblp.org/rec/conf/focs/GrolmuszR87"}, "url":"URL#7012779" } ] } } } )