callback( { "result":{ "query":":facetid:toc:\"db/journals/siamcomp/siamcomp36.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"68.42" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"75", "@dc":"75", "@oc":"75", "@id":"43469169", "text":":facetid:toc:db/journals/siamcomp/siamcomp36.bht" } }, "hits":{ "@total":"75", "@computed":"75", "@sent":"30", "@first":"0", "hit":[{ "@score":"1", "@id":"5493683", "info":{"authors":{"author":[{"@pid":"a/MichaelAlekhnovich","text":"Mikhail Alekhnovich"},{"@pid":"02/476","text":"Eli Ben-Sasson"}]},"title":"Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1248-1263","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/AlekhnovichB07","doi":"10.1137/S0097539704440107","ee":"https://doi.org/10.1137/S0097539704440107","url":"https://dblp.org/rec/journals/siamcomp/AlekhnovichB07"}, "url":"URL#5493683" }, { "@score":"1", "@id":"5493684", "info":{"authors":{"author":[{"@pid":"22/222","text":"Max A. Alekseyev"},{"@pid":"p/PAPevzner","text":"Pavel A. Pevzner"}]},"title":"Whole Genome Duplications and Contracted Breakpoint Graphs.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1748-1763","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/AlekseyevP07","doi":"10.1137/05064727X","ee":"https://doi.org/10.1137/05064727X","url":"https://dblp.org/rec/journals/siamcomp/AlekseyevP07"}, "url":"URL#5493684" }, { "@score":"1", "@id":"5493688", "info":{"authors":{"author":[{"@pid":"a/LArge","text":"Lars Arge"},{"@pid":"b/MichaelABender","text":"Michael A. Bender"},{"@pid":"d/ErikDDemaine","text":"Erik D. Demaine"},{"@pid":"75/1405","text":"Bryan Holland-Minkley"},{"@pid":"m/JIanMunro","text":"J. Ian Munro"}]},"title":"An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1672-1695","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/ArgeBDHM07","doi":"10.1137/S0097539703428324","ee":"https://doi.org/10.1137/S0097539703428324","url":"https://dblp.org/rec/journals/siamcomp/ArgeBDHM07"}, "url":"URL#5493688" }, { "@score":"1", "@id":"5493695", "info":{"authors":{"author":[{"@pid":"12/959","text":"Boaz Ben-Moshe"},{"@pid":"k/MatthewJKatz","text":"Matthew J. Katz"},{"@pid":"m/JosephSBMitchell","text":"Joseph S. B. Mitchell"}]},"title":"A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1631-1647","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/Ben-MosheKM07","doi":"10.1137/S0097539704446384","ee":"https://doi.org/10.1137/S0097539704446384","url":"https://dblp.org/rec/journals/siamcomp/Ben-MosheKM07"}, "url":"URL#5493695" }, { "@score":"1", "@id":"5493698", "info":{"authors":{"author":[{"@pid":"b/DanBoneh","text":"Dan Boneh"},{"@pid":"c/RanCanetti","text":"Ran Canetti"},{"@pid":"65/4781","text":"Shai Halevi"},{"@pid":"k/JonathanKatz","text":"Jonathan Katz"}]},"title":"Chosen-Ciphertext Security from Identity-Based Encryption.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1301-1328","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/BonehCHK07","doi":"10.1137/S009753970544713X","ee":"https://doi.org/10.1137/S009753970544713X","url":"https://dblp.org/rec/journals/siamcomp/BonehCHK07"}, "url":"URL#5493698" }, { "@score":"1", "@id":"5493699", "info":{"authors":{"author":[{"@pid":"82/6711","text":"Alin Bostan"},{"@pid":"94/2869","text":"Pierrick Gaudry"},{"@pid":"07/1002","text":"Éric Schost"}]},"title":"Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1777-1806","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/BostanGS07","doi":"10.1137/S0097539704443793","ee":"https://doi.org/10.1137/S0097539704443793","url":"https://dblp.org/rec/journals/siamcomp/BostanGS07"}, "url":"URL#5493699" }, { "@score":"1", "@id":"5493704", "info":{"authors":{"author":[{"@pid":"47/6529-6","text":"Ke Chen 0006"},{"@pid":"06/894","text":"Amos Fiat"},{"@pid":"48/3950","text":"Haim Kaplan"},{"@pid":"89/5744","text":"Meital Levy"},{"@pid":"m/JiriMatousek","text":"Jirí Matousek 0001"},{"@pid":"m/EMossel","text":"Elchanan Mossel"},{"@pid":"18/2119","text":"János Pach"},{"@pid":"s/MichaSharir","text":"Micha Sharir"},{"@pid":"65/4137","text":"Shakhar Smorodinsky"},{"@pid":"65/3538-1","text":"Uli Wagner 0001"},{"@pid":"w/EmoWelzl","text":"Emo Welzl"}]},"title":"Online Conflict-Free Coloring for Intervals.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1342-1359","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/ChenFKLMMPSSWW07","doi":"10.1137/S0097539704446682","ee":"https://doi.org/10.1137/S0097539704446682","url":"https://dblp.org/rec/journals/siamcomp/ChenFKLMMPSSWW07"}, "url":"URL#5493704" }, { "@score":"1", "@id":"5493711", "info":{"authors":{"author":[{"@pid":"c/MChrobak","text":"Marek Chrobak"},{"@pid":"g/LeszekGasieniec","text":"Leszek Gasieniec"},{"@pid":"43/6109","text":"Dariusz R. Kowalski"}]},"title":"The Wake-Up Problem in MultiHop Radio Networks.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1453-1471","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/ChrobakGK07","doi":"10.1137/S0097539704442726","ee":"https://doi.org/10.1137/S0097539704442726","url":"https://dblp.org/rec/journals/siamcomp/ChrobakGK07"}, "url":"URL#5493711" }, { "@score":"1", "@id":"5493712", "info":{"authors":{"author":[{"@pid":"c/MChrobak","text":"Marek Chrobak"},{"@pid":"48/1093","text":"Wojciech Jawor"},{"@pid":"s/JiriSgall","text":"Jirí Sgall"},{"@pid":"85/1537","text":"Tomás Tichý"}]},"title":"Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1709-1728","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/ChrobakJST07","doi":"10.1137/S0097539704446608","ee":"https://doi.org/10.1137/S0097539704446608","url":"https://dblp.org/rec/journals/siamcomp/ChrobakJST07"}, "url":"URL#5493712" }, { "@score":"1", "@id":"5493713", "info":{"authors":{"author":[{"@pid":"99/3386","text":"Julia Chuzhoy"},{"@pid":"n/JosephNaor","text":"Joseph Naor"}]},"title":"The Hardness of Metric Labeling.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1376-1386","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/ChuzhoyN07","doi":"10.1137/06065430X","ee":"https://doi.org/10.1137/06065430X","url":"https://dblp.org/rec/journals/siamcomp/ChuzhoyN07"}, "url":"URL#5493713" }, { "@score":"1", "@id":"5493719", "info":{"authors":{"author":[{"@pid":"32/3977","text":"Zeev Dvir"},{"@pid":"11/3816","text":"Amir Shpilka"}]},"title":"Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1404-1434","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/DvirS07","doi":"10.1137/05063605X","ee":"https://doi.org/10.1137/05063605X","url":"https://dblp.org/rec/journals/siamcomp/DvirS07"}, "url":"URL#5493719" }, { "@score":"1", "@id":"5493720", "info":{"authors":{"author":[{"@pid":"83/6616","text":"Cynthia Dwork"},{"@pid":"n/MoniNaor","text":"Moni Naor"}]},"title":"Zaps and Their Applications.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1513-1543","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/DworkN07","doi":"10.1137/S0097539703426817","ee":"https://doi.org/10.1137/S0097539703426817","url":"https://dblp.org/rec/journals/siamcomp/DworkN07"}, "url":"URL#5493720" }, { "@score":"1", "@id":"5493722", "info":{"authors":{"author":[{"@pid":"e/DEppstein","text":"David Eppstein"},{"@pid":"g/MichaelTGoodrich","text":"Michael T. Goodrich"},{"@pid":"h/DanielSHirschberg","text":"Daniel S. Hirschberg"}]},"title":"Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1360-1375","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/EppsteinGH07","doi":"10.1137/050631847","ee":"https://doi.org/10.1137/050631847","url":"https://dblp.org/rec/journals/siamcomp/EppsteinGH07"}, "url":"URL#5493722" }, { "@score":"1", "@id":"5493724", "info":{"authors":{"author":[{"@pid":"20/2997","text":"Lisa Fleischer"},{"@pid":"80/2691","text":"Martin Skutella"}]},"title":"Quickest Flows Over Time.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1600-1630","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/FleischerS07","doi":"10.1137/S0097539703427215","ee":"https://doi.org/10.1137/S0097539703427215","url":"https://dblp.org/rec/journals/siamcomp/FleischerS07"}, "url":"URL#5493724" }, { "@score":"1", "@id":"5493725", "info":{"authors":{"author":[{"@pid":"f/AlanMFrieze","text":"Alan M. Frieze"},{"@pid":"60/1574","text":"Gregory B. Sorkin"}]},"title":"The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1435-1452","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/FriezeS07","doi":"10.1137/S0097539701391518","ee":"https://doi.org/10.1137/S0097539701391518","url":"https://dblp.org/rec/journals/siamcomp/FriezeS07"}, "url":"URL#5493725" }, { "@score":"1", "@id":"5493727", "info":{"authors":{"author":{"@pid":"g/HaroldNGabow","text":"Harold N. Gabow"}},"title":"Finding Paths and Cycles of Superpolylogarithmic Length.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1648-1671","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/Gabow07","doi":"10.1137/S0097539704445366","ee":"https://doi.org/10.1137/S0097539704445366","url":"https://dblp.org/rec/journals/siamcomp/Gabow07"}, "url":"URL#5493727" }, { "@score":"1", "@id":"5493731", "info":{"authors":{"author":[{"@pid":"h/EranHalperin","text":"Eran Halperin"},{"@pid":"80/4876","text":"Guy Kortsarz"},{"@pid":"k/RobertKrauthgamer","text":"Robert Krauthgamer"},{"@pid":"s/AravindSrinivasan","text":"Aravind Srinivasan"},{"@pid":"w/NanWang","text":"Nan Wang 0001"}]},"title":"Integrality Ratio for Group Steiner Trees and Directed Steiner Trees.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1494-1511","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/HalperinKKSW07","doi":"10.1137/S0097539704445718","ee":"https://doi.org/10.1137/S0097539704445718","url":"https://dblp.org/rec/journals/siamcomp/HalperinKKSW07"}, "url":"URL#5493731" }, { "@score":"1", "@id":"5493733", "info":{"authors":{"author":[{"@pid":"h/LaneAHemaspaandra","text":"Lane A. Hemaspaandra"},{"@pid":"h/VPless","text":"Christopher M. Homan"},{"@pid":"14/925","text":"Sven Kosub"},{"@pid":"w/KlausWWagner","text":"Klaus W. Wagner"}]},"title":"The Complexity of Computing the Size of an Interval.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1264-1300","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/HemaspaandraHKW07","doi":"10.1137/S0097539705447013","ee":"https://doi.org/10.1137/S0097539705447013","url":"https://dblp.org/rec/journals/siamcomp/HemaspaandraHKW07"}, "url":"URL#5493733" }, { "@score":"1", "@id":"5493734", "info":{"authors":{"author":{"@pid":"57/747","text":"John M. Hitchcock"}},"title":"Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1696-1708","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/Hitchcock07","doi":"10.1137/050647517","ee":"https://doi.org/10.1137/050647517","url":"https://dblp.org/rec/journals/siamcomp/Hitchcock07"}, "url":"URL#5493734" }, { "@score":"1", "@id":"5493736", "info":{"authors":{"author":[{"@pid":"30/518","text":"Yoko Kamidoi"},{"@pid":"18/247","text":"Noriyoshi Yoshida"},{"@pid":"47/6485","text":"Hiroshi Nagamochi"}]},"title":"A Deterministic Algorithm for Finding All Minimum k-Way Cuts.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1329-1341","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/KamidoiYN07","doi":"10.1137/050631616","ee":"https://doi.org/10.1137/050631616","url":"https://dblp.org/rec/journals/siamcomp/KamidoiYN07"}, "url":"URL#5493736" }, { "@score":"1", "@id":"5493737", "info":{"authors":{"author":[{"@pid":"94/1777","text":"Jesse Kamp"},{"@pid":"z/DZuckerman","text":"David Zuckerman"}]},"title":"Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1231-1247","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/KampZ07","doi":"10.1137/S0097539705446846","ee":"https://doi.org/10.1137/S0097539705446846","url":"https://dblp.org/rec/journals/siamcomp/KampZ07"}, "url":"URL#5493737" }, { "@score":"1", "@id":"5493741", "info":{"authors":{"author":[{"@pid":"27/5687","text":"Hartmut Klauck"},{"@pid":"16/2356","text":"Robert Spalek"},{"@pid":"w/RonalddeWolf","text":"Ronald de Wolf"}]},"title":"Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1472-1493","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/KlauckSW07","doi":"10.1137/05063235X","ee":"https://doi.org/10.1137/05063235X","url":"https://dblp.org/rec/journals/siamcomp/KlauckSW07"}, "url":"URL#5493741" }, { "@score":"1", "@id":"5493743", "info":{"authors":{"author":[{"@pid":"k/BartKuijpers","text":"Bart Kuijpers"},{"@pid":"71/4080","text":"Gabriel M. Kuper"},{"@pid":"p/JParedaens","text":"Jan Paredaens"},{"@pid":"01/1005","text":"Luc Vandeurzen"}]},"title":"First-Order Languages Expressing Constructible Spatial Database Queries.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1570-1599","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/KuijpersKPV07","doi":"10.1137/S0097539702407199","ee":"https://doi.org/10.1137/S0097539702407199","url":"https://dblp.org/rec/journals/siamcomp/KuijpersKPV07"}, "url":"URL#5493743" }, { "@score":"1", "@id":"5493756", "info":{"authors":{"author":[{"@pid":"53/4745","text":"Leonard J. Schulman"},{"@pid":"81/4477","text":"Tal Mor"},{"@pid":"61/2818","text":"Yossi Weinstein"}]},"title":"Physical Limits of Heat-Bath Algorithmic Cooling.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1729-1747","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/SchulmanMW07","doi":"10.1137/050666023","ee":"https://doi.org/10.1137/050666023","url":"https://dblp.org/rec/journals/siamcomp/SchulmanMW07"}, "url":"URL#5493756" }, { "@score":"1", "@id":"5493757", "info":{"authors":{"author":[{"@pid":"07/592","text":"David Soloveichik"},{"@pid":"26/4609","text":"Erik Winfree"}]},"title":"Complexity of Self-Assembled Shapes.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1544-1569","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/SoloveichikW07","doi":"10.1137/S0097539704446712","ee":"https://doi.org/10.1137/S0097539704446712","url":"https://dblp.org/rec/journals/siamcomp/SoloveichikW07"}, "url":"URL#5493757" }, { "@score":"1", "@id":"5493758", "info":{"authors":{"author":[{"@pid":"v/KasturiRVaradarajan","text":"Kasturi R. Varadarajan"},{"@pid":"v/SrinivasanVenkatesh","text":"Srinivasan Venkatesh 0001"},{"@pid":"42/1372-1","text":"Yinyu Ye 0001"},{"@pid":"10/239-6","text":"Jiawei Zhang 0006"}]},"title":"Approximating the Radii of Point Sets.","venue":"SIAM J. Comput.","volume":"36","number":"6","pages":"1764-1776","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/VaradarajanVYZ07","doi":"10.1137/050627472","ee":"https://doi.org/10.1137/050627472","url":"https://dblp.org/rec/journals/siamcomp/VaradarajanVYZ07"}, "url":"URL#5493758" }, { "@score":"1", "@id":"5493759", "info":{"authors":{"author":{"@pid":"48/4265","text":"Emanuele Viola"}},"title":"Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates.","venue":"SIAM J. Comput.","volume":"36","number":"5","pages":"1387-1403","year":"2007","type":"Journal Articles","access":"closed","key":"journals/siamcomp/Viola07","doi":"10.1137/050640941","ee":"https://doi.org/10.1137/050640941","url":"https://dblp.org/rec/journals/siamcomp/Viola07"}, "url":"URL#5493759" }, { "@score":"1", "@id":"5678369", "info":{"authors":{"author":[{"@pid":"34/4066","text":"Dimitris Achlioptas"},{"@pid":"m/CristopherMoore","text":"Cristopher Moore"}]},"title":"Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold.","venue":"SIAM J. Comput.","volume":"36","number":"3","pages":"740-762","year":"2006","type":"Journal Articles","access":"closed","key":"journals/siamcomp/AchlioptasM06","doi":"10.1137/S0097539703434231","ee":"https://doi.org/10.1137/S0097539703434231","url":"https://dblp.org/rec/journals/siamcomp/AchlioptasM06"}, "url":"URL#5678369" }, { "@score":"1", "@id":"5678370", "info":{"authors":{"author":[{"@pid":"a/PankajKAgarwal","text":"Pankaj K. Agarwal"},{"@pid":"o/MarkHOvermars","text":"Mark H. Overmars"},{"@pid":"s/MichaSharir","text":"Micha Sharir"}]},"title":"Computing Maximally Separated Sets in the Plane.","venue":"SIAM J. Comput.","volume":"36","number":"3","pages":"815-834","year":"2006","type":"Journal Articles","access":"closed","key":"journals/siamcomp/AgarwalOS06","doi":"10.1137/S0097539704446591","ee":"https://doi.org/10.1137/S0097539704446591","url":"https://dblp.org/rec/journals/siamcomp/AgarwalOS06"}, "url":"URL#5678370" }, { "@score":"1", "@id":"5678371", "info":{"authors":{"author":[{"@pid":"52/1053","text":"Noa Agmon"},{"@pid":"p/DavidPeleg","text":"David Peleg"}]},"title":"Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots.","venue":"SIAM J. Comput.","volume":"36","number":"1","pages":"56-82","year":"2006","type":"Journal Articles","access":"closed","key":"journals/siamcomp/AgmonP06","doi":"10.1137/050645221","ee":"https://doi.org/10.1137/050645221","url":"https://dblp.org/rec/journals/siamcomp/AgmonP06"}, "url":"URL#5678371" } ] } } } )