callback( { "result":{ "query":":facetid:toc:\"db/conf/soda/soda97.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"62.62" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"86", "@dc":"86", "@oc":"86", "@id":"43426565", "text":":facetid:toc:db/conf/soda/soda97.bht" } }, "hits":{ "@total":"86", "@computed":"86", "@sent":"86", "@first":"0", "hit":[{ "@score":"1", "@id":"6671146", "info":{"authors":{"author":[{"@pid":"a/YAfek","text":"Yehuda Afek"},{"@pid":"b/ABremlerBarr","text":"Anat Bremler-Barr"}]},"title":"Self-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract).","venue":"SODA","pages":"111-120","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AfekB97","ee":"http://dl.acm.org/citation.cfm?id=314161.314193","url":"https://dblp.org/rec/conf/soda/AfekB97"}, "url":"URL#6671146" }, { "@score":"1", "@id":"6671147", "info":{"authors":{"author":[{"@pid":"a/PankajKAgarwal","text":"Pankaj K. Agarwal"},{"@pid":"a/BAronov","text":"Boris Aronov"},{"@pid":"s/MichaSharir","text":"Micha Sharir"}]},"title":"Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions.","venue":"SODA","pages":"483-492","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AgarwalAS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314368","url":"https://dblp.org/rec/conf/soda/AgarwalAS97"}, "url":"URL#6671147" }, { "@score":"1", "@id":"6671148", "info":{"authors":{"author":[{"@pid":"a/PankajKAgarwal","text":"Pankaj K. Agarwal"},{"@pid":"50/5983","text":"Pavan K. Desikan"}]},"title":"An Efficient Algorithm for Terraine Simplification.","venue":"SODA","pages":"139-147","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AgarwalD97","ee":"http://dl.acm.org/citation.cfm?id=314161.314199","url":"https://dblp.org/rec/conf/soda/AgarwalD97"}, "url":"URL#6671148" }, { "@score":"1", "@id":"6671149", "info":{"authors":{"author":[{"@pid":"64/5354","text":"Richa Agarwala"},{"@pid":"b/SerafimBatzoglou","text":"Serafim Batzoglou"},{"@pid":"81/6475","text":"Vlado Dancík"},{"@pid":"32/2324","text":"Scott E. Decatur"},{"@pid":"f/MartinFarachColton","text":"Martin Farach"},{"@pid":"59/496","text":"Sridhar Hannenhalli"},{"@pid":"s/StevenSkiena","text":"Steven Skiena"}]},"title":"Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model.","venue":"SODA","pages":"390-399","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AgarwalaBDDFHS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314328","url":"https://dblp.org/rec/conf/soda/AgarwalaBDDFHS97"}, "url":"URL#6671149" }, { "@score":"1", "@id":"6671150", "info":{"authors":{"author":[{"@pid":"75/3050","text":"Alok Aggarwal"},{"@pid":"26/159","text":"Don Coppersmith"},{"@pid":"k/SanjeevKhanna","text":"Sanjeev Khanna"},{"@pid":"m/RajeevMotwani","text":"Rajeev Motwani 0001"},{"@pid":"s/BaruchSchieber","text":"Baruch Schieber"}]},"title":"The Angular-Metric Traveling Salesman Problem.","venue":"SODA","pages":"221-229","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AggarwalCKMS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314259","url":"https://dblp.org/rec/conf/soda/AggarwalCKMS97"}, "url":"URL#6671150" }, { "@score":"1", "@id":"6671151", "info":{"authors":{"author":[{"@pid":"77/5719","text":"Houman Alborzi"},{"@pid":"t/EricTorng","text":"Eric Torng"},{"@pid":"24/5521","text":"Patchrawat Uthaisombut"},{"@pid":"30/6739","text":"Stephen Wagner"}]},"title":"The k-Client Problem.","venue":"SODA","pages":"73-82","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AlborziTUW97","ee":"http://dl.acm.org/citation.cfm?id=314161.314185","url":"https://dblp.org/rec/conf/soda/AlborziTUW97"}, "url":"URL#6671151" }, { "@score":"1", "@id":"6671152", "info":{"authors":{"author":[{"@pid":"a/NAlon","text":"Noga Alon"},{"@pid":"a/YAzar","text":"Yossi Azar"},{"@pid":"w/GJWoeginger","text":"Gerhard J. Woeginger"},{"@pid":"41/4841","text":"Tal Yadid"}]},"title":"Approximation Schemes for Scheduling.","venue":"SODA","pages":"493-500","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AlonAWY97","ee":"http://dl.acm.org/citation.cfm?id=314161.314371","url":"https://dblp.org/rec/conf/soda/AlonAWY97"}, "url":"URL#6671152" }, { "@score":"1", "@id":"6671153", "info":{"authors":{"author":[{"@pid":"48/5890-2","text":"Giuseppe Amato 0002"},{"@pid":"82/288","text":"Giuseppe Cattaneo"},{"@pid":"i/GiuseppeFItaliano","text":"Giuseppe F. Italiano"}]},"title":"Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract).","venue":"SODA","pages":"314-323","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AmatoCI97","ee":"http://dl.acm.org/citation.cfm?id=314161.314314","url":"https://dblp.org/rec/conf/soda/AmatoCI97"}, "url":"URL#6671153" }, { "@score":"1", "@id":"6671154", "info":{"authors":{"author":[{"@pid":"92/5591","text":"Nina Amenta"},{"@pid":"b/MWBern","text":"Marshall W. Bern"},{"@pid":"e/DEppstein","text":"David Eppstein"}]},"title":"Optimal Point Placement for Mesh Smoothing.","venue":"SODA","pages":"528-537","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AmentaBE97","ee":"http://dl.acm.org/citation.cfm?id=314161.314383","url":"https://dblp.org/rec/conf/soda/AmentaBE97"}, "url":"URL#6671154" }, { "@score":"1", "@id":"6671155", "info":{"authors":{"author":[{"@pid":"94/439","text":"Jérôme Amilhastre"},{"@pid":"30/6031","text":"Philippe Janssen"},{"@pid":"02/2880","text":"Marie-Catherine Vilarem"}]},"title":"Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs.","venue":"SODA","pages":"36-42","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/AmilhastreJV97","ee":"http://dl.acm.org/citation.cfm?id=314161.314175","url":"https://dblp.org/rec/conf/soda/AmilhastreJV97"}, "url":"URL#6671155" }, { "@score":"1", "@id":"6671156", "info":{"authors":{"author":[{"@pid":"46/5034","text":"Esther M. Arkin"},{"@pid":"32/1605","text":"Yi-Jen Chiang"},{"@pid":"m/JosephSBMitchell","text":"Joseph S. B. Mitchell"},{"@pid":"s/StevenSkiena","text":"Steven Skiena"},{"@pid":"81/6128","text":"Tae-Cheon Yang"}]},"title":"On the Maximum Scatter TSP (Extended Abstract).","venue":"SODA","pages":"211-220","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/ArkinCMSY97","ee":"http://dl.acm.org/citation.cfm?id=314161.314258","url":"https://dblp.org/rec/conf/soda/ArkinCMSY97"}, "url":"URL#6671156" }, { "@score":"1", "@id":"6671157", "info":{"authors":{"author":{"@pid":"b/LaszloBabai","text":"László Babai"}},"title":"The Growth Rate of Vertex-Transitive Planar Graphs.","venue":"SODA","pages":"564-573","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Babai97","ee":"http://dl.acm.org/citation.cfm?id=314161.314390","url":"https://dblp.org/rec/conf/soda/Babai97"}, "url":"URL#6671157" }, { "@score":"1", "@id":"6671158", "info":{"authors":{"author":[{"@pid":"g/RGiladBachrach","text":"Ran Bachrach"},{"@pid":"04/1896","text":"Ran El-Yaniv"}]},"title":"Online List Accessing Algorithms and Their Applications: Recent Empirical Evidence.","venue":"SODA","pages":"53-62","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/BachrachE97","ee":"http://dl.acm.org/citation.cfm?id=314161.314180","url":"https://dblp.org/rec/conf/soda/BachrachE97"}, "url":"URL#6671158" }, { "@score":"1", "@id":"6671159", "info":{"authors":{"author":[{"@pid":"96/1036","text":"Yair Bartal"},{"@pid":"c/MosesCharikar","text":"Moses Charikar"},{"@pid":"i/PiotrIndyk","text":"Piotr Indyk"}]},"title":"On Page Migration and Other Relaxed Task Systems.","venue":"SODA","pages":"43-52","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/BartalCI97","ee":"http://dl.acm.org/citation.cfm?id=314161.314178","url":"https://dblp.org/rec/conf/soda/BartalCI97"}, "url":"URL#6671159" }, { "@score":"1", "@id":"6671160", "info":{"authors":{"author":[{"@pid":"34/1081","text":"Julien Basch"},{"@pid":"g/LeonidasJGuibas","text":"Leonidas J. Guibas"},{"@pid":"56/510","text":"John Hershberger 0001"}]},"title":"Data Structures for Mobile Data.","venue":"SODA","pages":"747-756","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/BaschGH97","ee":"http://dl.acm.org/citation.cfm?id=314161.314435","url":"https://dblp.org/rec/conf/soda/BaschGH97"}, "url":"URL#6671160" }, { "@score":"1", "@id":"6671161", "info":{"authors":{"author":[{"@pid":"b/YBenAsher","text":"Yosi Ben-Asher"},{"@pid":"27/1084","text":"Eitan Farchi"},{"@pid":"n/IlanNewman","text":"Ilan Newman"}]},"title":"Optimal Search in Trees: Extended Abstract + Appendix.","venue":"SODA","pages":"739-746","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Ben-AsherFN97","ee":"http://dl.acm.org/citation.cfm?id=314161.314433","url":"https://dblp.org/rec/conf/soda/Ben-AsherFN97"}, "url":"URL#6671161" }, { "@score":"1", "@id":"6671162", "info":{"authors":{"author":[{"@pid":"84/2910","text":"Jon Louis Bentley"},{"@pid":"s/RobertSedgewick","text":"Robert Sedgewick"}]},"title":"Fast Algorithms for Sorting and Searching Strings.","venue":"SODA","pages":"360-369","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/BentleyS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314321","url":"https://dblp.org/rec/conf/soda/BentleyS97"}, "url":"URL#6671162" }, { "@score":"1", "@id":"6671163", "info":{"authors":{"author":[{"@pid":"45/6931","text":"Claudia Bertram-Kretzberg"},{"@pid":"69/4773","text":"Hanno Lefmann"}]},"title":"The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract).","venue":"SODA","pages":"296-304","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Bertram-KretzbergL97","ee":"http://dl.acm.org/citation.cfm?id=314161.314311","url":"https://dblp.org/rec/conf/soda/Bertram-KretzbergL97"}, "url":"URL#6671163" }, { "@score":"1", "@id":"6671164", "info":{"authors":{"author":[{"@pid":"b/DanBoneh","text":"Dan Boneh"},{"@pid":"v/RamarathnamVenkatesan","text":"Ramarathnam Venkatesan"}]},"title":"Rounding in Lattices and its Cryptographic Applications.","venue":"SODA","pages":"675-681","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/BonehV97","ee":"http://dl.acm.org/citation.cfm?id=314161.314413","url":"https://dblp.org/rec/conf/soda/BonehV97"}, "url":"URL#6671164" }, { "@score":"1", "@id":"6671165", "info":{"authors":{"author":[{"@pid":"79/561","text":"Russ Bubley"},{"@pid":"82/6798","text":"Martin E. Dyer"}]},"title":"Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT.","venue":"SODA","pages":"248-257","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/BubleyD97","ee":"http://dl.acm.org/citation.cfm?id=314161.314263","url":"https://dblp.org/rec/conf/soda/BubleyD97"}, "url":"URL#6671165" }, { "@score":"1", "@id":"6671166", "info":{"authors":{"author":[{"@pid":"61/1535","text":"Christoph Burnikel"},{"@pid":"f/RudolfFleischer","text":"Rudolf Fleischer"},{"@pid":"m/KurtMehlhorn","text":"Kurt Mehlhorn"},{"@pid":"s/SSchirra","text":"Stefan Schirra"}]},"title":"A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots.","venue":"SODA","pages":"702-709","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/BurnikelFMS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314421","url":"https://dblp.org/rec/conf/soda/BurnikelFMS97"}, "url":"URL#6671166" }, { "@score":"1", "@id":"6671167", "info":{"authors":{"author":{"@pid":"60/3556","text":"Timothy M. Chan"}},"title":"Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming.","venue":"SODA","pages":"464-472","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Chan97","ee":"http://dl.acm.org/citation.cfm?id=314161.314345","url":"https://dblp.org/rec/conf/soda/Chan97"}, "url":"URL#6671167" }, { "@score":"1", "@id":"6671168", "info":{"authors":{"author":[{"@pid":"c/WunTatChan","text":"Wun-Tat Chan"},{"@pid":"c/FrancisYLChin","text":"Francis Y. L. Chin"}]},"title":"Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract).","venue":"SODA","pages":"454-463","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/ChanC97","ee":"http://dl.acm.org/citation.cfm?id=314161.314342","url":"https://dblp.org/rec/conf/soda/ChanC97"}, "url":"URL#6671168" }, { "@score":"1", "@id":"6671169", "info":{"authors":{"author":[{"@pid":"92/3600","text":"Amitabh Chaudhary"},{"@pid":"08/5677","text":"Sundar Vishwanathan"}]},"title":"Approximation Algorithms for the Achromatic Number.","venue":"SODA","pages":"558-563","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/ChaudharyV97","ee":"http://dl.acm.org/citation.cfm?id=314161.314389","url":"https://dblp.org/rec/conf/soda/ChaudharyV97"}, "url":"URL#6671169" }, { "@score":"1", "@id":"6671170", "info":{"authors":{"author":[{"@pid":"82/3212","text":"Chandra Chekuri"},{"@pid":"g/AndrewVGoldberg","text":"Andrew V. Goldberg"},{"@pid":"k/DavidRKarger","text":"David R. Karger"},{"@pid":"81/2891","text":"Matthew S. Levine"},{"@pid":"s/CliffordStein","text":"Clifford Stein 0001"}]},"title":"Experimental Study of Minimum Cut Algorithms.","venue":"SODA","pages":"324-333","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/ChekuriGKLS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314315","url":"https://dblp.org/rec/conf/soda/ChekuriGKLS97"}, "url":"URL#6671170" }, { "@score":"1", "@id":"6671171", "info":{"authors":{"author":[{"@pid":"82/3212","text":"Chandra Chekuri"},{"@pid":"m/RajeevMotwani","text":"Rajeev Motwani 0001"},{"@pid":"37/322","text":"B. Natarajan"},{"@pid":"s/CliffordStein","text":"Clifford Stein 0001"}]},"title":"Approximation Techniques for Average Completion Time Scheduling.","venue":"SODA","pages":"609-618","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/ChekuriMNS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314396","url":"https://dblp.org/rec/conf/soda/ChekuriMNS97"}, "url":"URL#6671171" }, { "@score":"1", "@id":"6671172", "info":{"authors":{"author":[{"@pid":"71/5655","text":"Boris V. Cherkassky"},{"@pid":"g/AndrewVGoldberg","text":"Andrew V. Goldberg"},{"@pid":"s/CraigSilverstein","text":"Craig Silverstein"}]},"title":"Buckets, Heaps, Lists, and Monotone Priority Queues.","venue":"SODA","pages":"83-92","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/CherkasskyGS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314187","url":"https://dblp.org/rec/conf/soda/CherkasskyGS97"}, "url":"URL#6671172" }, { "@score":"1", "@id":"6671173", "info":{"authors":{"author":[{"@pid":"33/1686","text":"Fabián A. Chudak"},{"@pid":"s/DavidBShmoys","text":"David B. Shmoys"}]},"title":"Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract).","venue":"SODA","pages":"581-590","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/ChudakS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314393","url":"https://dblp.org/rec/conf/soda/ChudakS97"}, "url":"URL#6671173" }, { "@score":"1", "@id":"6671174", "info":{"authors":{"author":[{"@pid":"75/2494","text":"Jaime Cohen"},{"@pid":"f/MartinFarachColton","text":"Martin Farach"}]},"title":"Numerical Taxonomy on Data: Experimental Results.","venue":"SODA","pages":"410-417","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/CohenF97","ee":"http://dl.acm.org/citation.cfm?id=314161.314333","url":"https://dblp.org/rec/conf/soda/CohenF97"}, "url":"URL#6671174" }, { "@score":"1", "@id":"6671175", "info":{"authors":{"author":[{"@pid":"24/4011","text":"Scott D. Cohen"},{"@pid":"g/LeonidasJGuibas","text":"Leonidas J. Guibas"}]},"title":"Partial Matching of Planar Polylines Under Similarity Transformations.","venue":"SODA","pages":"777-786","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/CohenG97","ee":"http://dl.acm.org/citation.cfm?id=314161.314445","url":"https://dblp.org/rec/conf/soda/CohenG97"}, "url":"URL#6671175" }, { "@score":"1", "@id":"6671176", "info":{"authors":{"author":[{"@pid":"40/1039","text":"Edith Cohen"},{"@pid":"l/DavidDLewis","text":"David D. Lewis"}]},"title":"Approximating Matrix Multiplication for Pattern Recognition Tasks.","venue":"SODA","pages":"682-691","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/CohenL97","ee":"http://dl.acm.org/citation.cfm?id=314161.314415","url":"https://dblp.org/rec/conf/soda/CohenL97"}, "url":"URL#6671176" }, { "@score":"1", "@id":"6671177", "info":{"authors":{"author":[{"@pid":"40/1039","text":"Edith Cohen"},{"@pid":"z/UriZwick","text":"Uri Zwick"}]},"title":"All-Pairs Small-Stretch Paths.","venue":"SODA","pages":"93-102","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/CohenZ97","ee":"http://dl.acm.org/citation.cfm?id=314161.314190","url":"https://dblp.org/rec/conf/soda/CohenZ97"}, "url":"URL#6671177" }, { "@score":"1", "@id":"6671178", "info":{"authors":{"author":[{"@pid":"c/LenoreCowen","text":"Lenore Cowen"},{"@pid":"00/2242","text":"Wayne Goddard"},{"@pid":"11/6313","text":"C. Esther Jesurum"}]},"title":"Coloring with Defect.","venue":"SODA","pages":"548-557","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/CowenGJ97","ee":"http://dl.acm.org/citation.cfm?id=314161.314387","url":"https://dblp.org/rec/conf/soda/CowenGJ97"}, "url":"URL#6671178" }, { "@score":"1", "@id":"6671179", "info":{"authors":{"author":[{"@pid":"67/5121","text":"Elias Dahlhaus"},{"@pid":"g/JensGustedt","text":"Jens Gustedt"},{"@pid":"41/4249","text":"Ross M. McConnell"}]},"title":"Efficient and Practical Modular Decomposition.","venue":"SODA","pages":"26-35","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/DahlhausGM97","ee":"http://dl.acm.org/citation.cfm?id=314161.314173","url":"https://dblp.org/rec/conf/soda/DahlhausGM97"}, "url":"URL#6671179" }, { "@score":"1", "@id":"6671180", "info":{"authors":{"author":[{"@pid":"12/1709","text":"Bhaskar DasGupta"},{"@pid":"69/1798","text":"Xin He"},{"@pid":"j/TaoJiang-1","text":"Tao Jiang 0001"},{"@pid":"l/MingLi1","text":"Ming Li 0001"},{"@pid":"46/86","text":"John Tromp"},{"@pid":"68/5601","text":"Louxin Zhang"}]},"title":"On Distances between Phylogenetic Trees (Extended Abstract).","venue":"SODA","pages":"427-436","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/DasGuptaHJLTZ97","ee":"http://dl.acm.org/citation.cfm?id=314161.314338","url":"https://dblp.org/rec/conf/soda/DasGuptaHJLTZ97"}, "url":"URL#6671180" }, { "@score":"1", "@id":"6671181", "info":{"authors":{"author":[{"@pid":"d/XiaotieDeng","text":"Xiaotie Deng"},{"@pid":"72/3560","text":"Toshihide Ibaraki"},{"@pid":"47/6485","text":"Hiroshi Nagamochi"}]},"title":"Combinatorial Optimization Games.","venue":"SODA","pages":"720-729","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/DengIN97","ee":"http://dl.acm.org/citation.cfm?id=314161.314428","url":"https://dblp.org/rec/conf/soda/DengIN97"}, "url":"URL#6671181" }, { "@score":"1", "@id":"6671182", "info":{"authors":{"author":[{"@pid":"52/2498","text":"Srinivas Doddi"},{"@pid":"52/991","text":"Madhav V. Marathe"},{"@pid":"m/AndranikMirzaian","text":"Andy Mirzaian"},{"@pid":"18/242","text":"Bernard M. E. Moret"},{"@pid":"z/BinhaiZhu","text":"Binhai Zhu"}]},"title":"Map Labeling and Its Generalizations.","venue":"SODA","pages":"148-157","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/DoddiMMMZ97","ee":"http://dl.acm.org/citation.cfm?id=314161.314250","url":"https://dblp.org/rec/conf/soda/DoddiMMMZ97"}, "url":"URL#6671182" }, { "@score":"1", "@id":"6671183", "info":{"authors":{"author":[{"@pid":"98/2143","text":"Christian A. Duncan"},{"@pid":"g/MichaelTGoodrich","text":"Michael T. Goodrich"},{"@pid":"06/1203","text":"Edgar A. Ramos"}]},"title":"Efficient Approximation and Optimization Algorithms for Computational Metrology.","venue":"SODA","pages":"121-130","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/DuncanGR97","ee":"http://dl.acm.org/citation.cfm?id=314161.314196","url":"https://dblp.org/rec/conf/soda/DuncanGR97"}, "url":"URL#6671183" }, { "@score":"1", "@id":"6671184", "info":{"authors":{"author":{"@pid":"e/DEppstein","text":"David Eppstein"}},"title":"Faster Construction of Planar Two-Centers.","venue":"SODA","pages":"131-138","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Eppstein97","ee":"http://dl.acm.org/citation.cfm?id=314161.314198","url":"https://dblp.org/rec/conf/soda/Eppstein97"}, "url":"URL#6671184" }, { "@score":"1", "@id":"6671185", "info":{"authors":{"author":[{"@pid":"45/1790","text":"Guy Even"},{"@pid":"n/JosephNaor","text":"Joseph Naor"},{"@pid":"r/SRao","text":"Satish Rao"},{"@pid":"s/BaruchSchieber","text":"Baruch Schieber"}]},"title":"Fast Approximate Graph Partitioning Algorithms.","venue":"SODA","pages":"639-648","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/EvenNRS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314405","url":"https://dblp.org/rec/conf/soda/EvenNRS97"}, "url":"URL#6671185" }, { "@score":"1", "@id":"6671186", "info":{"authors":{"author":[{"@pid":"09/2980","text":"Stefan Felsner"},{"@pid":"46/6124","text":"Lorenz Wernisch"}]},"title":"Markov Chains for Linear Extensions, the Two-Dimensional Case.","venue":"SODA","pages":"239-247","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/FelsnerW97","ee":"http://dl.acm.org/citation.cfm?id=314161.314262","url":"https://dblp.org/rec/conf/soda/FelsnerW97"}, "url":"URL#6671186" }, { "@score":"1", "@id":"6671187", "info":{"authors":{"author":{"@pid":"58/4840","text":"Cristina G. Fernandes"}},"title":"A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem.","venue":"SODA","pages":"629-638","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Fernandes97","ee":"http://dl.acm.org/citation.cfm?id=314161.314402","url":"https://dblp.org/rec/conf/soda/Fernandes97"}, "url":"URL#6671187" }, { "@score":"1", "@id":"6671188", "info":{"authors":{"author":[{"@pid":"06/894","text":"Amos Fiat"},{"@pid":"35/6111","text":"Ziv Rosen"}]},"title":"Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard?","venue":"SODA","pages":"63-72","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/FiatR97","ee":"http://dl.acm.org/citation.cfm?id=314161.314182","url":"https://dblp.org/rec/conf/soda/FiatR97"}, "url":"URL#6671188" }, { "@score":"1", "@id":"6671189", "info":{"authors":{"author":[{"@pid":"12/3138","text":"Ulrich Finkler"},{"@pid":"m/KurtMehlhorn","text":"Kurt Mehlhorn"}]},"title":"Runtime Prediction of Real Programs on Real Machines.","venue":"SODA","pages":"380-389","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/FinklerM97","ee":"http://dl.acm.org/citation.cfm?id=314161.314326","url":"https://dblp.org/rec/conf/soda/FinklerM97"}, "url":"URL#6671189" }, { "@score":"1", "@id":"6671190", "info":{"authors":{"author":[{"@pid":"f/GregNFrederickson","text":"Greg N. Frederickson"},{"@pid":"58/628","text":"Roberto Solis-Oba"}]},"title":"Efficient Algorithms for Robustness in Matroid Optimization.","venue":"SODA","pages":"659-668","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/FredericksonS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314411","url":"https://dblp.org/rec/conf/soda/FredericksonS97"}, "url":"URL#6671190" }, { "@score":"1", "@id":"6671191", "info":{"authors":{"author":{"@pid":"g/MichelXGoemans","text":"Michel X. Goemans"}},"title":"Improved Approximation Algorithms for Scheduling with Release Dates.","venue":"SODA","pages":"591-598","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Goemans97","ee":"http://dl.acm.org/citation.cfm?id=314161.314394","url":"https://dblp.org/rec/conf/soda/Goemans97"}, "url":"URL#6671191" }, { "@score":"1", "@id":"6671192", "info":{"authors":{"author":[{"@pid":"67/941","text":"Leslie Ann Goldberg"},{"@pid":"j/MarkJerrum","text":"Mark Jerrum"}]},"title":"Randomly Sampling Molecules.","venue":"SODA","pages":"183-192","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/GoldbergJ97","ee":"http://dl.acm.org/citation.cfm?id=314161.314255","url":"https://dblp.org/rec/conf/soda/GoldbergJ97"}, "url":"URL#6671192" }, { "@score":"1", "@id":"6671193", "info":{"authors":{"author":[{"@pid":"67/941","text":"Leslie Ann Goldberg"},{"@pid":"p/MikePaterson","text":"Mike Paterson"},{"@pid":"s/AravindSrinivasan","text":"Aravind Srinivasan"},{"@pid":"44/2879","text":"Elizabeth Sweedyk"}]},"title":"Better Approximation Guarantees for Job-shop Scheduling.","venue":"SODA","pages":"599-608","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/GoldbergPSS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314395","url":"https://dblp.org/rec/conf/soda/GoldbergPSS97"}, "url":"URL#6671193" }, { "@score":"1", "@id":"6671194", "info":{"authors":{"author":{"@pid":"g/MichaelTGoodrich","text":"Michael T. Goodrich"}},"title":"Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version).","venue":"SODA","pages":"767-776","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Goodrich97","ee":"http://dl.acm.org/citation.cfm?id=314161.314442","url":"https://dblp.org/rec/conf/soda/Goodrich97"}, "url":"URL#6671194" }, { "@score":"1", "@id":"6671195", "info":{"authors":{"author":[{"@pid":"g/MichaelTGoodrich","text":"Michael T. Goodrich"},{"@pid":"81/3567","text":"Mark W. Orletsky"},{"@pid":"21/1384","text":"Kumar Ramaiyer"}]},"title":"Methods for Achieving Fast Query Times in Point Location Data Structures.","venue":"SODA","pages":"757-766","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/GoodrichOR97","ee":"http://dl.acm.org/citation.cfm?id=314161.314438","url":"https://dblp.org/rec/conf/soda/GoodrichOR97"}, "url":"URL#6671195" }, { "@score":"1", "@id":"6671196", "info":{"authors":{"author":[{"@pid":"08/44","text":"David A. Grable"},{"@pid":"53/6558","text":"Alessandro Panconesi"}]},"title":"Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds.","venue":"SODA","pages":"278-285","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/GrableP97","ee":"http://dl.acm.org/citation.cfm?id=314161.314266","url":"https://dblp.org/rec/conf/soda/GrableP97"}, "url":"URL#6671196" }, { "@score":"1", "@id":"6671197", "info":{"authors":{"author":[{"@pid":"26/2898","text":"Stephen Guattery"},{"@pid":"l/FrankThomsonLeighton","text":"Frank Thomson Leighton"},{"@pid":"m/GaryLMiller","text":"Gary L. Miller"}]},"title":"The Path Resistance Method for Bounding lambda2 of a Laplacian.","venue":"SODA","pages":"201-210","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/GuatteryLM97","ee":"http://dl.acm.org/citation.cfm?id=314161.314257","url":"https://dblp.org/rec/conf/soda/GuatteryLM97"}, "url":"URL#6671197" }, { "@score":"1", "@id":"6671198", "info":{"authors":{"author":[{"@pid":"69/1798","text":"Xin He"},{"@pid":"c/ZhiZhongChen","text":"Zhi-Zhong Chen"}]},"title":"Shortest Path in Complete Bipartite Digraph Problem and its Applications.","venue":"SODA","pages":"230-238","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/HeC97","ee":"http://dl.acm.org/citation.cfm?id=314161.314260","url":"https://dblp.org/rec/conf/soda/HeC97"}, "url":"URL#6671198" }, { "@score":"1", "@id":"6671199", "info":{"authors":{"author":[{"@pid":"14/5761-2","text":"Frank Hoffmann 0002"},{"@pid":"94/1785","text":"Christian Icking"},{"@pid":"k/RolfKlein","text":"Rolf Klein"},{"@pid":"k/KlausKriegel","text":"Klaus Kriegel"}]},"title":"A Competitive Strategy for Learning a Polygon.","venue":"SODA","pages":"166-174","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/HoffmannIKK97","ee":"http://dl.acm.org/citation.cfm?id=314161.314253","url":"https://dblp.org/rec/conf/soda/HoffmannIKK97"}, "url":"URL#6671199" }, { "@score":"1", "@id":"6671200", "info":{"authors":{"author":[{"@pid":"i/SandyIrani","text":"Sandy Irani"},{"@pid":"77/6594","text":"Vitus J. Leung"}]},"title":"Probabilistic Analysis for Scheduling with Conflicts.","venue":"SODA","pages":"286-295","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/IraniL97","ee":"http://dl.acm.org/citation.cfm?id=314161.314268","url":"https://dblp.org/rec/conf/soda/IraniL97"}, "url":"URL#6671200" }, { "@score":"1", "@id":"6671201", "info":{"authors":{"author":[{"@pid":"j/TaoJiang-1","text":"Tao Jiang 0001"},{"@pid":"k/RichardMKarp","text":"Richard M. Karp"}]},"title":"Mapping Clones with a Given Ordering or Interleaving (Extended Abstract).","venue":"SODA","pages":"400-409","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/JiangK97","ee":"http://dl.acm.org/citation.cfm?id=314161.314331","url":"https://dblp.org/rec/conf/soda/JiangK97"}, "url":"URL#6671201" }, { "@score":"1", "@id":"6671202", "info":{"authors":{"author":[{"@pid":"k/RaviKannan","text":"Ravi Kannan"},{"@pid":"34/1161","text":"Prasad Tetali"},{"@pid":"v/SantoshVempala","text":"Santosh S. Vempala"}]},"title":"Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract).","venue":"SODA","pages":"193-200","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/KannanTV97","ee":"http://dl.acm.org/citation.cfm?id=314161.314256","url":"https://dblp.org/rec/conf/soda/KannanTV97"}, "url":"URL#6671202" }, { "@score":"1", "@id":"6671203", "info":{"authors":{"author":[{"@pid":"k/MingYangKao","text":"Ming-Yang Kao"},{"@pid":"t/StephenRTate","text":"Stephen R. Tate"}]},"title":"On-Line Difference Maximization.","venue":"SODA","pages":"175-182","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/KaoT97","ee":"http://dl.acm.org/citation.cfm?id=314161.314254","url":"https://dblp.org/rec/conf/soda/KaoT97"}, "url":"URL#6671203" }, { "@score":"1", "@id":"6671204", "info":{"authors":{"author":[{"@pid":"48/3950","text":"Haim Kaplan"},{"@pid":"66/6913","text":"Ron Shamir"},{"@pid":"t/RobertEndreTarjan","text":"Robert Endre Tarjan"}]},"title":"Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals.","venue":"SODA","pages":"344-351","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/KaplanST97","ee":"http://dl.acm.org/citation.cfm?id=314161.314318","url":"https://dblp.org/rec/conf/soda/KaplanST97"}, "url":"URL#6671204" }, { "@score":"1", "@id":"6671205", "info":{"authors":{"author":[{"@pid":"k/DavidRKarger","text":"David R. Karger"},{"@pid":"04/6582","text":"Ray P. Tai"}]},"title":"Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability.","venue":"SODA","pages":"334-343","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/KargerT97","ee":"http://dl.acm.org/citation.cfm?id=314161.314316","url":"https://dblp.org/rec/conf/soda/KargerT97"}, "url":"URL#6671205" }, { "@score":"1", "@id":"6671206", "info":{"authors":{"author":[{"@pid":"09/3267","text":"Paul E. Kearney"},{"@pid":"h/RyanBHayward","text":"Ryan Hayward"},{"@pid":"60/3098","text":"Henk Meijer"}]},"title":"Inferring Evolutionary Trees from Ordinal Data.","venue":"SODA","pages":"418-426","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/KearneyHM97","ee":"http://dl.acm.org/citation.cfm?id=314161.314336","url":"https://dblp.org/rec/conf/soda/KearneyHM97"}, "url":"URL#6671206" }, { "@score":"1", "@id":"6671207", "info":{"authors":{"author":[{"@pid":"80/4876","text":"Guy Kortsarz"},{"@pid":"p/DavidPeleg","text":"David Peleg"}]},"title":"Approximating Shallow-Light Trees (Extended Abstract).","venue":"SODA","pages":"103-110","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/KortsarzP97","ee":"http://dl.acm.org/citation.cfm?id=314161.314191","url":"https://dblp.org/rec/conf/soda/KortsarzP97"}, "url":"URL#6671207" }, { "@score":"1", "@id":"6671208", "info":{"authors":{"author":[{"@pid":"181/2884","text":"Vijay Kumar"},{"@pid":"10/3426","text":"Eric J. Schwabe"}]},"title":"Improved Access to Optimal Bandwidth in Trees.","venue":"SODA","pages":"437-444","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/KumarS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314339","url":"https://dblp.org/rec/conf/soda/KumarS97"}, "url":"URL#6671208" }, { "@score":"1", "@id":"6671209", "info":{"authors":{"author":[{"@pid":"06/1054","text":"Anthony LaMarca"},{"@pid":"l/RELadner","text":"Richard E. Ladner"}]},"title":"The Influence of Caches on the Performance of Sorting.","venue":"SODA","pages":"370-379","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/LaMarcaL97","ee":"http://dl.acm.org/citation.cfm?id=314161.314324","url":"https://dblp.org/rec/conf/soda/LaMarcaL97"}, "url":"URL#6671209" }, { "@score":"1", "@id":"6671210", "info":{"authors":{"author":[{"@pid":"00/213","text":"George Lake"},{"@pid":"51/4723","text":"Thomas Quinn"},{"@pid":"52/6338","text":"Derek C. Richardson"}]},"title":"From Sir Isaac to the Sloan Survey: Calculating the Structure and Chaos Owing to Gravity in the Universe.","venue":"SODA","pages":"1-10","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/LakeQR97","ee":"http://dl.acm.org/citation.cfm?id=314161.314166","url":"https://dblp.org/rec/conf/soda/LakeQR97"}, "url":"URL#6671210" }, { "@score":"1", "@id":"6671211", "info":{"authors":{"author":[{"@pid":"55/673","text":"Christos Levcopoulos"},{"@pid":"10/2957","text":"Drago Krznaric"}]},"title":"A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).","venue":"SODA","pages":"518-527","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/LevcopoulosK97","ee":"http://dl.acm.org/citation.cfm?id=314161.314381","url":"https://dblp.org/rec/conf/soda/LevcopoulosK97"}, "url":"URL#6671211" }, { "@score":"1", "@id":"6671212", "info":{"authors":{"author":[{"@pid":"72/1636","text":"Meena Mahajan"},{"@pid":"77/257","text":"V. Vinay"}]},"title":"A Combinatorial Algorithm for the Determinant.","venue":"SODA","pages":"730-738","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/MahajanV97","ee":"http://dl.acm.org/citation.cfm?id=314161.314429","url":"https://dblp.org/rec/conf/soda/MahajanV97"}, "url":"URL#6671212" }, { "@score":"1", "@id":"6671213", "info":{"authors":{"author":{"@pid":"s/AravindSrinivasan","text":"Aravind Srinivasan"}},"title":"Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.","venue":"SODA","pages":"692-701","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Matrices97","ee":"http://dl.acm.org/citation.cfm?id=314161.314418","url":"https://dblp.org/rec/conf/soda/Matrices97"}, "url":"URL#6671213" }, { "@score":"1", "@id":"6671214", "info":{"authors":{"author":[{"@pid":"41/4249","text":"Ross M. McConnell"},{"@pid":"s/JeremySpinrad","text":"Jeremy P. Spinrad"}]},"title":"Linear-Time Transitive Orientation.","venue":"SODA","pages":"19-25","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/McConnellS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314172","url":"https://dblp.org/rec/conf/soda/McConnellS97"}, "url":"URL#6671214" }, { "@score":"1", "@id":"6671215", "info":{"authors":{"author":[{"@pid":"86/6049","text":"S. Thomas McCormick"},{"@pid":"16/6541","text":"Scott R. Smallwood"},{"@pid":"25/6435","text":"Frits C. R. Spieksma"}]},"title":"Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths.","venue":"SODA","pages":"509-517","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/McCormickSS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314378","url":"https://dblp.org/rec/conf/soda/McCormickSS97"}, "url":"URL#6671215" }, { "@score":"1", "@id":"6671216", "info":{"authors":{"author":[{"@pid":"m/GaryLMiller","text":"Gary L. Miller"},{"@pid":"07/6634","text":"Dafna Talmor"},{"@pid":"t/ShangHuaTeng","text":"Shang-Hua Teng"}]},"title":"Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes.","venue":"SODA","pages":"538-547","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/MillerTT97","ee":"http://dl.acm.org/citation.cfm?id=314161.314385","url":"https://dblp.org/rec/conf/soda/MillerTT97"}, "url":"URL#6671216" }, { "@score":"1", "@id":"6671217", "info":{"authors":{"author":[{"@pid":"m/DavidMMount","text":"David M. Mount"},{"@pid":"50/344","text":"Nathan S. Netanyahu"},{"@pid":"04/5184","text":"Kathleen Romanik"},{"@pid":"60/5198","text":"Ruth Silverman"},{"@pid":"30/4200","text":"Angela Y. Wu"}]},"title":"A Practical Approximation Algorithm for the LMS Line Estimator.","venue":"SODA","pages":"473-482","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/MountNRSW97","ee":"http://dl.acm.org/citation.cfm?id=314161.314349","url":"https://dblp.org/rec/conf/soda/MountNRSW97"}, "url":"URL#6671217" }, { "@score":"1", "@id":"6671218", "info":{"authors":{"author":[{"@pid":"47/6485","text":"Hiroshi Nagamochi"},{"@pid":"34/629","text":"Takashi Shiraki"},{"@pid":"72/3560","text":"Toshihide Ibaraki"}]},"title":"Computing Edge-Connectivity Augmentation Function in Õ(nm) Time.","venue":"SODA","pages":"649-658","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/NagamochiSI97","ee":"http://dl.acm.org/citation.cfm?id=314161.314407","url":"https://dblp.org/rec/conf/soda/NagamochiSI97"}, "url":"URL#6671218" }, { "@score":"1", "@id":"6671219", "info":{"authors":{"author":[{"@pid":"83/620","text":"Eugene Neufeld"},{"@pid":"m/WendyJMyrvold","text":"Wendy J. Myrvold"}]},"title":"Practical Toroidality Testing.","venue":"SODA","pages":"574-580","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/NeufeldM97","ee":"http://dl.acm.org/citation.cfm?id=314161.314392","url":"https://dblp.org/rec/conf/soda/NeufeldM97"}, "url":"URL#6671219" }, { "@score":"1", "@id":"6671220", "info":{"authors":{"author":{"@pid":"r/PRaghavan","text":"Prabhakar Raghavan"}},"title":"Information Retrieval Algorithms: A Survey.","venue":"SODA","pages":"11-18","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Raghavan97","ee":"http://dl.acm.org/citation.cfm?id=314161.314170","url":"https://dblp.org/rec/conf/soda/Raghavan97"}, "url":"URL#6671220" }, { "@score":"1", "@id":"6671221", "info":{"authors":{"author":[{"@pid":"80/898","text":"F. Sibel Salman"},{"@pid":"87/5654","text":"Joseph Cheriyan"},{"@pid":"r/RRavi-1","text":"R. Ravi 0001"},{"@pid":"29/4323","text":"S. Subramanian"}]},"title":"Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem.","venue":"SODA","pages":"619-628","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/SalmanCRS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314397","url":"https://dblp.org/rec/conf/soda/SalmanCRS97"}, "url":"URL#6671221" }, { "@score":"1", "@id":"6671222", "info":{"authors":{"author":[{"@pid":"53/4745","text":"Leonard J. Schulman"},{"@pid":"z/DZuckerman","text":"David Zuckerman"}]},"title":"Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version).","venue":"SODA","pages":"669-674","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/SchulmanZ97","ee":"http://dl.acm.org/citation.cfm?id=314161.314412","url":"https://dblp.org/rec/conf/soda/SchulmanZ97"}, "url":"URL#6671222" }, { "@score":"1", "@id":"6671223", "info":{"authors":{"author":{"@pid":"80/2691","text":"Martin Skutella"}},"title":"Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem.","venue":"SODA","pages":"501-508","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Skutella97","ee":"http://dl.acm.org/citation.cfm?id=314161.314375","url":"https://dblp.org/rec/conf/soda/Skutella97"}, "url":"URL#6671223" }, { "@score":"1", "@id":"6671224", "info":{"authors":{"author":[{"@pid":"07/3601","text":"Chung-Piaw Teo"},{"@pid":"69/704","text":"Jay Sethuraman"}]},"title":"LP Based Approach to Optimal Stable Matchings.","venue":"SODA","pages":"710-719","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/TeoS97","ee":"http://dl.acm.org/citation.cfm?id=314161.314425","url":"https://dblp.org/rec/conf/soda/TeoS97"}, "url":"URL#6671224" }, { "@score":"1", "@id":"6671225", "info":{"authors":{"author":{"@pid":"t/MikkelThorup","text":"Mikkel Thorup"}},"title":"Decremental Dynamic Connectivity.","venue":"SODA","pages":"305-313","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Thorup97","ee":"http://dl.acm.org/citation.cfm?id=314161.314313","url":"https://dblp.org/rec/conf/soda/Thorup97"}, "url":"URL#6671225" }, { "@score":"1", "@id":"6671226", "info":{"authors":{"author":{"@pid":"t/MikkelThorup","text":"Mikkel Thorup"}},"title":"Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations.","venue":"SODA","pages":"352-359","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Thorup97a","ee":"http://dl.acm.org/citation.cfm?id=314161.314319","url":"https://dblp.org/rec/conf/soda/Thorup97a"}, "url":"URL#6671226" }, { "@score":"1", "@id":"6671227", "info":{"authors":{"author":{"@pid":"94/1460","text":"Gordon T. Wilfong"}},"title":"On-line Algorithms for Compressing Planar Curves.","venue":"SODA","pages":"158-165","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Wilfong97","ee":"http://dl.acm.org/citation.cfm?id=314161.314252","url":"https://dblp.org/rec/conf/soda/Wilfong97"}, "url":"URL#6671227" }, { "@score":"1", "@id":"6671228", "info":{"authors":{"author":{"@pid":"w/DavidBruceWilson","text":"David Bruce Wilson"}},"title":"Determinant Algorithms for Random Planar Structures.","venue":"SODA","pages":"258-267","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Wilson97","ee":"http://dl.acm.org/citation.cfm?id=314161.314264","url":"https://dblp.org/rec/conf/soda/Wilson97"}, "url":"URL#6671228" }, { "@score":"1", "@id":"6671229", "info":{"authors":{"author":{"@pid":"24/6547","text":"Yanjun Zhang"}},"title":"The Variance of Two Game Tree Algorithms.","venue":"SODA","pages":"268-277","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Zhang97","ee":"http://dl.acm.org/citation.cfm?id=314161.314265","url":"https://dblp.org/rec/conf/soda/Zhang97"}, "url":"URL#6671229" }, { "@score":"1", "@id":"6671230", "info":{"authors":{"author":{"@pid":"68/5601","text":"Louxin Zhang"}},"title":"Optimal Bounds for Matching Routing on Trees.","venue":"SODA","pages":"445-453","year":"1997","type":"Conference and Workshop Papers","access":"closed","key":"conf/soda/Zhang97a","ee":"http://dl.acm.org/citation.cfm?id=314161.314340","url":"https://dblp.org/rec/conf/soda/Zhang97a"}, "url":"URL#6671230" }, { "@score":"1", "@id":"6674708", "info":{"authors":{"author":{"@pid":"s/MichaelESaks","text":"Michael E. Saks"}},"title":"Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, USA.","venue":"SODA","publisher":"ACM/SIAM","year":"1997","type":"Editorship","key":"conf/soda/1997","ee":"http://dl.acm.org/citation.cfm?id=314161","url":"https://dblp.org/rec/conf/soda/1997"}, "url":"URL#6674708" } ] } } } )