default search action
Search dblp for Publications
export results for "toc:db/conf/soda/soda2001.bht:"
@inproceedings{DBLP:conf/soda/AbiteboulKM01, author = {Serge Abiteboul and Haim Kaplan and Tova Milo}, editor = {S. Rao Kosaraju}, title = {Compact labeling schemes for ancestor queries}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {547--556}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365529}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/AbiteboulKM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AchlioptasCIM01, author = {Dimitris Achlioptas and Arthur D. Chtcherba and Gabriel Istrate and Cristopher Moore}, editor = {S. Rao Kosaraju}, title = {The phase transition in 1-in-k {SAT} and {NAE} 3-SAT}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {721--722}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365760}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AchlioptasCIM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AgarwalH01, author = {Pankaj K. Agarwal and Sariel Har{-}Peled}, editor = {S. Rao Kosaraju}, title = {Maintaining approximate extent measures of moving points}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {148--157}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365431}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/AgarwalH01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AlonSZ01, author = {Noga Alon and Benny Sudakov and Uri Zwick}, editor = {S. Rao Kosaraju}, title = {Constructing worst case instances for semidefinite programming based approximation algorithms}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {92--100}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365424}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AlonSZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AlstrupHR01, author = {Stephen Alstrup and Thore Husfeldt and Theis Rauhe}, editor = {S. Rao Kosaraju}, title = {A cell probe lower bound for dynamic nearest-neighbor searching}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {779--780}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365778}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AlstrupHR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AlthausDKMNT01, author = {Ernst Althaus and Denys Duchier and Alexander Koller and Kurt Mehlhorn and Joachim Niehren and Sven Thiel}, editor = {S. Rao Kosaraju}, title = {An efficient algorithm for the configuration problem of dominance graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {815--824}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365788}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AlthausDKMNT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AmirCHLP01, author = {Amihood Amir and Richard Cole and Ramesh Hariharan and Moshe Lewenstein and Ely Porat}, editor = {S. Rao Kosaraju}, title = {Overlap matching}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {279--288}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365459}, timestamp = {Thu, 19 Mar 2015 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AmirCHLP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AmirPL01, author = {Amihood Amir and Ely Porat and Moshe Lewenstein}, editor = {S. Rao Kosaraju}, title = {Approximate subset matching with Don't Cares}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {305--306}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365464}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AmirPL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AmitLMR01, author = {Alon Amit and Nathan Linial and Jir{\'{\i}} Matousek and Eyal Rozenman}, editor = {S. Rao Kosaraju}, title = {Random lifts of graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {883--894}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365801}, timestamp = {Thu, 24 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AmitLMR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AndersonT01, author = {Richard J. Anderson and Brian Tjaden}, editor = {S. Rao Kosaraju}, title = {The inverse nearest neighbor problem with astrophysical applications}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {767--768}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365775}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AndersonT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AnderssonT01, author = {Arne Andersson and Mikkel Thorup}, editor = {S. Rao Kosaraju}, title = {Dynamic string searching}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {307--308}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365465}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AnderssonT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ArkinBDFMS01, author = {Esther M. Arkin and Michael A. Bender and Erik D. Demaine and S{\'{a}}ndor P. Fekete and Joseph S. B. Mitchell and Saurabh Sethia}, editor = {S. Rao Kosaraju}, title = {Optimal covering tours with turn costs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {138--147}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365430}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ArkinBDFMS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AryaMM01, author = {Sunil Arya and Theocharis Malamatos and David M. Mount}, editor = {S. Rao Kosaraju}, title = {Entropy-preserving cuttings and space-efficient planar point location}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {256--261}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365456}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AryaMM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AryaMM01a, author = {Sunil Arya and Theocharis Malamatos and David M. Mount}, editor = {S. Rao Kosaraju}, title = {A simple entropy-based algorithm for planar point location}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {262--268}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365457}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AryaMM01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AspnesFFKK01, author = {James Aspnes and David F. Fischer and Michael J. Fischer and Ming{-}Yang Kao and Alok Kumar}, editor = {S. Rao Kosaraju}, title = {Towards understanding the predictability of stock markets from the perspective of computational complexity}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {745--754}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365769}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AspnesFFKK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BaevR01, author = {Ivan D. Baev and Rajmohan Rajaraman}, editor = {S. Rao Kosaraju}, title = {Approximation algorithms for data placement in arbitrary networks}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {661--670}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365560}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BaevR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Bar-NoyL01, author = {Amotz Bar{-}Noy and Richard E. Ladner}, editor = {S. Rao Kosaraju}, title = {Competitive on-line stream merging algorithms for media-on-demand}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {364--373}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365481}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Bar-NoyL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BarbayK01, author = {J{\'{e}}r{\'{e}}my Barbay and Claire Kenyon}, editor = {S. Rao Kosaraju}, title = {On the discrete Bak-Sneppen model of self-organized criticality}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {928--933}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365814}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BarbayK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BenderPSS01, author = {Michael A. Bender and Giridhar Pemmasani and Steven Skiena and Pavel Sumazin}, editor = {S. Rao Kosaraju}, title = {Finding least common ancestors in directed acyclic graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {845--854}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365795}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BenderPSS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BermanDMR01, author = {Piotr Berman and Bhaskar DasGupta and S. Muthukrishnan and Suneeta Ramaswami}, editor = {S. Rao Kosaraju}, title = {Improved approximation algorithms for rectangle tiling and packing}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {427--436}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365496}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/BermanDMR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Bern01, author = {Marshall W. Bern}, editor = {S. Rao Kosaraju}, title = {Computing the depth of a flat}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {700--701}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.374603}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Bern01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Biedl01, author = {Therese Biedl}, editor = {S. Rao Kosaraju}, title = {Linear reductions of maximum matching}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {825--826}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365789}, timestamp = {Tue, 02 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/Biedl01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BorodinOR01, author = {Allan Borodin and Rafail Ostrovsky and Yuval Rabani}, editor = {S. Rao Kosaraju}, title = {Stability preserving transformations: packet routing networks with edge capacities and speeds}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {601--610}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365546}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BorodinOR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BoyanM01, author = {Justin A. Boyan and Michael Mitzenmacher}, editor = {S. Rao Kosaraju}, title = {IMproved results for route planning in stochastic transportation}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {895--902}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365803}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BoyanM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BrehobETW01, author = {Mark Brehob and Richard J. Enbody and Eric Torng and Stephen Wagner}, editor = {S. Rao Kosaraju}, title = {On-line restricted caching}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {374--383}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365482}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BrehobETW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BrodnikCKM01, author = {Andrej Brodnik and Svante Carlsson and Johan Karlsson and J. Ian Munro}, editor = {S. Rao Kosaraju}, title = {Worst case constant time priority queue}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {523--528}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365524}, timestamp = {Tue, 08 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/BrodnikCKM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Brown01, author = {Daniel G. Brown}, editor = {S. Rao Kosaraju}, title = {A probabilistic analysis of a greedy algorithm arising from computational biology}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {206--207}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365445}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Brown01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CalinescuKR01, author = {Gruia C{\u{a}}linescu and Howard J. Karloff and Yuval Rabani}, editor = {S. Rao Kosaraju}, title = {Approximation algorithms for the 0-extension problem}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {8--16}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365413}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/CalinescuKR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CarsonI01, author = {Ted Carson and Russell Impagliazzo}, editor = {S. Rao Kosaraju}, title = {Hill-climbing finds random planted bisections}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {903--909}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365805}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/CarsonI01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CharikarKMN01, author = {Moses Charikar and Samir Khuller and David M. Mount and Giri Narasimhan}, editor = {S. Rao Kosaraju}, title = {Algorithms for facility location problems with outliers}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {642--651}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365555}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/CharikarKMN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChekuriKN01, author = {Chandra Chekuri and Sanjeev Khanna and Joseph Naor}, editor = {S. Rao Kosaraju}, title = {A deterministic algorithm for the cost-distance problem}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {232--233}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365452}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChekuriKN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChekuriKNZ01, author = {Chandra Chekuri and Sanjeev Khanna and Joseph Naor and Leonid Zosin}, editor = {S. Rao Kosaraju}, title = {Approximation algorithms for the metric labeling problem via a new linear programming formulation}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {109--118}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365426}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChekuriKNZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChenDHKS01, author = {Danny Z. Chen and Ovidiu Daescu and John Hershberger and Peter M. Kogge and Jack Snoeyink}, editor = {S. Rao Kosaraju}, title = {Polygonal path approximation with angle constraints}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {342--343}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365476}, timestamp = {Wed, 03 Jan 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChenDHKS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChenX01, author = {Guangting Chen and Guoliang Xue}, editor = {S. Rao Kosaraju}, title = {K-pair delay constrained minimum cost routing in undirected networks}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {230--231}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365450}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChenX01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChengDES01, author = {Ho{-}Lun Cheng and Tamal K. Dey and Herbert Edelsbrunner and John Sullivan}, editor = {S. Rao Kosaraju}, title = {Dynamic skin triangulation}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {47--56}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365418}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChengDES01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChiangLL01, author = {Yi{-}Ting Chiang and Ching{-}Chi Lin and Hsueh{-}I Lu}, editor = {S. Rao Kosaraju}, title = {Orderly spanning trees with applications to graph encoding and graph drawing}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {506--515}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365518}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChiangLL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChinFW01, author = {Francis Y. L. Chin and Stanley P. Y. Fung and Cao An Wang}, editor = {S. Rao Kosaraju}, title = {Approximation for minimum triangulation of convex polyhedra}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {128--137}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365429}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChinFW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChocklerZ01, author = {Hana Chockler and Uri Zwick}, editor = {S. Rao Kosaraju}, title = {Which formulae shrink under random restrictions?}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {702--708}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365755}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChocklerZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChungGL01, author = {Fan R. K. Chung and Ronald L. Graham and Frank Thomson Leighton}, editor = {S. Rao Kosaraju}, title = {Guessing secrets}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {723--726}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365761}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChungGL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ClementiMS01, author = {Andrea E. F. Clementi and Angelo Monti and Riccardo Silvestri}, editor = {S. Rao Kosaraju}, title = {Selective families, superimposed codes, and broadcasting on unknown radio networks}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {709--718}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365756}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ClementiMS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CoffmanL01, author = {Edward G. Coffman Jr. and George S. Lueker}, editor = {S. Rao Kosaraju}, title = {Approximation algorithms for extensible bin packing}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {586--588}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365541}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/CoffmanL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ColeHLP01, author = {Richard Cole and Ramesh Hariharan and Moshe Lewenstein and Ely Porat}, editor = {S. Rao Kosaraju}, title = {A faster implementation of the Goemans-Williamson clustering algorithm}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {17--25}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365414}, timestamp = {Thu, 19 Mar 2015 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ColeHLP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CsirikJK01, author = {J{\'{a}}nos Csirik and David S. Johnson and Claire Kenyon}, editor = {S. Rao Kosaraju}, title = {Better approximation algorithms for bin covering}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {557--566}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365533}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/CsirikJK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CzumajS01, author = {Artur Czumaj and Christian Sohler}, editor = {S. Rao Kosaraju}, title = {Soft kinetic data structures}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {865--872}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365798}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/CzumajS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Damian-IordacheP01, author = {Mirela Damian{-}Iordache and Sriram V. Pemmaraju}, editor = {S. Rao Kosaraju}, title = {Computing optimal alpha-fat and alpha-small decompositions}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {338--339}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365472}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Damian-IordacheP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DemaineL01, author = {Erik D. Demaine and Alejandro L{\'{o}}pez{-}Ortiz}, editor = {S. Rao Kosaraju}, title = {A linear lower bound on index size for text retrieval}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {289--294}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365460}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/DemaineL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DemaineLM01, author = {Erik D. Demaine and Alejandro L{\'{o}}pez{-}Ortiz and J. Ian Munro}, editor = {S. Rao Kosaraju}, title = {On universally easy classes for NP-complete problems}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {910--911}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365806}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/DemaineLM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DodisW01, author = {Yevgeniy Dodis and Peter Winkler}, editor = {S. Rao Kosaraju}, title = {Universal configurations in light-flipping games}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {926--927}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365812}, timestamp = {Mon, 23 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/DodisW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Doerr01, author = {Benjamin Doerr}, editor = {S. Rao Kosaraju}, title = {Lattice approximation and linear discrepency of totally unimodular matrices}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {119--125}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365428}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Doerr01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DujmovicW01, author = {Vida Dujmovic and Sue Whitesides}, editor = {S. Rao Kosaraju}, title = {On validating planar worlds}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {791--792}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365780}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/DujmovicW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DumitrescuM01, author = {Adrian Dumitrescu and Joseph S. B. Mitchell}, editor = {S. Rao Kosaraju}, title = {Approximation algorithms for {TSP} with neighborhoods in the plane}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {38--46}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365417}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/DumitrescuM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DuncanKK01, author = {Christian A. Duncan and Stephen G. Kobourov and V. S. Anil Kumar}, editor = {S. Rao Kosaraju}, title = {Optimal constrained graph exploration}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {807--814}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365786}, timestamp = {Fri, 08 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/DuncanKK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/EfratHGM01, author = {Alon Efrat and Sariel Har{-}Peled and Leonidas J. Guibas and T. M. Murali}, editor = {S. Rao Kosaraju}, title = {Morphing between polylines}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {680--689}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365564}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/EfratHGM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/EfratIV01, author = {Alon Efrat and Piotr Indyk and Suresh Venkatasubramanian}, editor = {S. Rao Kosaraju}, title = {Pattern matching for sets of segments}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {295--304}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365463}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/EfratIV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/EngelsFKR01, author = {Daniel W. Engels and Jon Feldman and David R. Karger and Matthias Ruhl}, editor = {S. Rao Kosaraju}, title = {Parallel processor scheduling with delay constraints}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {577--585}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365538}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/EngelsFKR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Eppstein01, author = {David Eppstein}, editor = {S. Rao Kosaraju}, title = {Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {329--337}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365471}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Eppstein01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/EppsteinM01, author = {David Eppstein and S. Muthukrishnan}, editor = {S. Rao Kosaraju}, title = {Internet packet filter management and rectangle geometry}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {827--835}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365791}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/EppsteinM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/EppsteinW01, author = {David Eppstein and Joseph Wang}, editor = {S. Rao Kosaraju}, title = {Fast approximation of centrality}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {228--229}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365449}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/EppsteinW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ErlebachJS01, author = {Thomas Erlebach and Klaus Jansen and Eike Seidel}, editor = {S. Rao Kosaraju}, title = {Polynomial-time approximation schemes for geometric graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {671--679}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365562}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ErlebachJS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FerraginaM01, author = {Paolo Ferragina and Giovanni Manzini}, editor = {S. Rao Kosaraju}, title = {An experimental study of an opportunistic index}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {269--278}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365458}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/FerraginaM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FiatK01, author = {Amos Fiat and Haim Kaplan}, editor = {S. Rao Kosaraju}, title = {Making data structures confluently persistent}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {537--546}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365528}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/FiatK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Fischer01, author = {Eldar Fischer}, editor = {S. Rao Kosaraju}, title = {Testing graphs for colorable properties}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {873--882}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365800}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Fischer01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FriezeS01, author = {Alan M. Frieze and Gregory B. Sorkin}, editor = {S. Rao Kosaraju}, title = {The probabilistic relationship between the assignment and asymmetric traveling salesman problems}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {652--660}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365557}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/FriezeS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FunkeR01, author = {Stefan Funke and Edgar A. Ramos}, editor = {S. Rao Kosaraju}, title = {Reconstructing a collection of curves with corners and endpoints}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {344--353}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365477}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/FunkeR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GavoillePPR01, author = {Cyril Gavoille and David Peleg and Stephane Perennes and Ran Raz}, editor = {S. Rao Kosaraju}, title = {Distance labeling in graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {210--219}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365447}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/GavoillePPR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoelIV01, author = {Ashish Goel and Piotr Indyk and Kasturi R. Varadarajan}, editor = {S. Rao Kosaraju}, title = {Reductions among high dimensional proximity problems}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {769--778}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365776}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GoelIV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoelMP01, author = {Ashish Goel and Adam Meyerson and Serge A. Plotkin}, editor = {S. Rao Kosaraju}, title = {Approximate majorization and fair online load balancing}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {384--390}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365483}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GoelMP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoelMP01a, author = {Ashish Goel and Adam Meyerson and Serge A. Plotkin}, editor = {S. Rao Kosaraju}, title = {Distributed admission control, scheduling, and routing with stale information}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {611--619}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365547}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GoelMP01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoldbergHW01, author = {Andrew V. Goldberg and Jason D. Hartline and Andrew Wright}, editor = {S. Rao Kosaraju}, title = {Competitive auctions and digital goods}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {735--744}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365768}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GoldbergHW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GuhaMM01, author = {Sudipto Guha and Adam Meyerson and Kamesh Munagala}, editor = {S. Rao Kosaraju}, title = {Improved algorithms for fault tolerant facility location}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {636--641}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365554}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GuhaMM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Gupta01, author = {Anupam Gupta}, editor = {S. Rao Kosaraju}, title = {Steiner points in tree metrics don't (really) help}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {220--227}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365448}, timestamp = {Wed, 18 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/Gupta01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GutwengerMW01, author = {Carsten Gutwenger and Petra Mutzel and Ren{\'{e}} Weiskircher}, editor = {S. Rao Kosaraju}, title = {Inserting an edge into a planar graph}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {246--255}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365455}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GutwengerMW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HallHKSW01, author = {Joseph Hall and Jason D. Hartline and Anna R. Karlin and Jared Saia and John Wilkes}, editor = {S. Rao Kosaraju}, title = {On algorithms for efficient data migration}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {620--629}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365549}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/HallHKSW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HalperinNZ01, author = {Eran Halperin and Ram Nathaniel and Uri Zwick}, editor = {S. Rao Kosaraju}, title = {Coloring k-colorable graphs using smaller palettes}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {319--326}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365468}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/HalperinNZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HalperinZ01, author = {Eran Halperin and Uri Zwick}, editor = {S. Rao Kosaraju}, title = {Combinatorial approximation algorithms for the maximum directed cut problem}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {1--7}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365412}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/HalperinZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Han01, author = {Yijie Han}, editor = {S. Rao Kosaraju}, title = {Improved fast integer sorting in linear space}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {793--796}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365782}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Han01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Har-PeledS01, author = {Sariel Har{-}Peled and Micha Sharir}, editor = {S. Rao Kosaraju}, title = {Online point location in planar arrangements and its applications}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {57--66}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365419}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/Har-PeledS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HershbergerS01, author = {John Hershberger and Subhash Suri}, editor = {S. Rao Kosaraju}, title = {Simplified kinetic connectivity for rectangles and hypercubes}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {158--167}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365440}, timestamp = {Wed, 03 Jan 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/HershbergerS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HuangXC01, author = {Yingping Huang and Jinhui Xu and Danny Z. Chen}, editor = {S. Rao Kosaraju}, title = {Geometric permutations of high dimensional spheres}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {244--245}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365454}, timestamp = {Thu, 11 Aug 2016 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/HuangXC01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Iacono01, author = {John Iacono}, editor = {S. Rao Kosaraju}, title = {Optimal planar point location}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {340--341}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365475}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Iacono01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Iacono01a, author = {John Iacono}, editor = {S. Rao Kosaraju}, title = {Alternatives to splay trees with O(log n) worst-case access times}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {516--522}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365522}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Iacono01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/IstrateMR01, author = {Gabriel Istrate and Madhav V. Marathe and S. S. Ravi}, editor = {S. Rao Kosaraju}, title = {Adversarial models in evolutionary game dynamics}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {719--720}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365757}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/IstrateMR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/JohnWMV01, author = {Katherine St. John and Tandy J. Warnow and Bernard M. E. Moret and Lisa Vawter}, editor = {S. Rao Kosaraju}, title = {Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {196--205}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365908}, timestamp = {Mon, 14 Mar 2016 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/JohnWMV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/JohnsonS01, author = {Julie L. Johnson and Jeremy P. Spinrad}, editor = {S. Rao Kosaraju}, title = {A polynomial time recognition algorithm for probe interval graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {477--486}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365513}, timestamp = {Wed, 01 Apr 2015 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/JohnsonS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KaplanTT01, author = {Haim Kaplan and Robert Endre Tarjan and Kostas Tsioutsiouliklis}, editor = {S. Rao Kosaraju}, title = {Faster kinetic heaps and their use in broadcast scheduling}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {836--844}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365793}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/KaplanTT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KaravelasG01, author = {Menelaos I. Karavelas and Leonidas J. Guibas}, editor = {S. Rao Kosaraju}, title = {Static and kinetic geometric spanners with applications}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {168--176}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365441}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/KaravelasG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KargerS01, author = {David R. Karger and Nathan Srebro}, editor = {S. Rao Kosaraju}, title = {Learning Markov networks: maximum bounded tree-width graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {392--401}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365486}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/KargerS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KesselmanM01, author = {Alexander Kesselman and Yishay Mansour}, editor = {S. Rao Kosaraju}, title = {Loss-bounded analysis for differentiated services}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {591--600}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365544}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/KesselmanM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KleinSK01, author = {Philip N. Klein and Thomas B. Sebastian and Benjamin B. Kimia}, editor = {S. Rao Kosaraju}, title = {Shape matching using edit-distance: an implementation}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {781--790}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365779}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/KleinSK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KoblerR01, author = {Daniel Kobler and Udi Rotics}, editor = {S. Rao Kosaraju}, title = {Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {468--476}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365510}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/KoblerR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KortsarzK01, author = {Guy Kortsarz and Robert Krauthgamer}, editor = {S. Rao Kosaraju}, title = {On approximating the achromatic number}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {309--318}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365466}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/KortsarzK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KrivelevichNS01, author = {Michael Krivelevich and Ram Nathaniel and Benny Sudakov}, editor = {S. Rao Kosaraju}, title = {Approximating coloring and maximum independent sets in 3-uniform hypergraphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {327--328}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365469}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/KrivelevichNS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KumarS01, author = {Ravi Kumar and D. Sivakumar}, editor = {S. Rao Kosaraju}, title = {On polynomial approximation to the shortest lattice vector length}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {126--127}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365427}, timestamp = {Mon, 08 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/KumarS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LaberMP01, author = {Eduardo Sany Laber and Ruy Luiz Milidi{\'{u}} and Artur Alves Pessoa}, editor = {S. Rao Kosaraju}, title = {On binary searching with non-uniform costs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {855--864}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365796}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/LaberMP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LamT01, author = {Tak Wah Lam and Kar{-}Keung To}, editor = {S. Rao Kosaraju}, title = {Performance guarentee for online deadline scheduling in the presence of overload}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {755--764}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365772}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/LamT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LiT01, author = {Xiang{-}Yang Li and Shang{-}Hua Teng}, editor = {S. Rao Kosaraju}, title = {Generating well-shaped Delaunay meshed in 3D}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {28--37}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365416}, timestamp = {Fri, 27 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/LiT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LiY01, author = {Chen Li and Chee{-}Keng Yap}, editor = {S. Rao Kosaraju}, title = {A new constructive root bound for algebraic expressions}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {496--505}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365517}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/LiY01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Liben-Nowell01, author = {David Liben{-}Nowell}, editor = {S. Rao Kosaraju}, title = {Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {177--185}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365442}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Liben-Nowell01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Lu01, author = {Linyuan Lu}, editor = {S. Rao Kosaraju}, title = {The diameter of random massive graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {912--921}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365808}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Lu01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MaheshwariZ01, author = {Anil Maheshwari and Norbert Zeh}, editor = {S. Rao Kosaraju}, title = {I/O-efficient algorithms for graphs of bounded treewidth}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {89--90}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365423}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/MaheshwariZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Makowsky01, author = {Johann A. Makowsky}, editor = {S. Rao Kosaraju}, title = {Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {487--495}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365514}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Makowsky01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MarcoP01, author = {Gianluca De Marco and Andrzej Pelc}, editor = {S. Rao Kosaraju}, title = {Fast distributed graph coloring with O(Delta) colors}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {630--635}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365552}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/MarcoP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Meyer01, author = {Ulrich Meyer}, editor = {S. Rao Kosaraju}, title = {External memory {BFS} on undirected graphs with bounded degree}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {87--88}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365422}, timestamp = {Mon, 14 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/Meyer01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Meyer01a, author = {Ulrich Meyer}, editor = {S. Rao Kosaraju}, title = {Single-source shortest-paths on arbitrary directed graphs in linear average-case time}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {797--806}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365784}, timestamp = {Mon, 14 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/Meyer01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MeyersonMP01, author = {Adam Meyerson and Kamesh Munagala and Serge A. Plotkin}, editor = {S. Rao Kosaraju}, title = {Web caching using access statistics}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {354--363}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365479}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/MeyersonMP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MillerRRSSSS01, author = {Kim Miller and Suneeta Ramaswami and Peter J. Rousseeuw and Joan Antoni Sellar{\`{e}}s and Diane L. Souvaine and Ileana Streinu and Anja Struyf}, editor = {S. Rao Kosaraju}, title = {Fast implementation of depth contours using topological sweep}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {690--699}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365565}, timestamp = {Wed, 07 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/MillerRRSSSS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MishraOP01, author = {Nina Mishra and Daniel Oblinger and Leonard Pitt}, editor = {S. Rao Kosaraju}, title = {Sublinear time approximate clustering}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {439--447}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365499}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/MishraOP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MunroRS01, author = {J. Ian Munro and Venkatesh Raman and Adam J. Storm}, editor = {S. Rao Kosaraju}, title = {Representing dynamic binary trees succinctly}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {529--536}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365526}, timestamp = {Fri, 27 May 2016 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/MunroRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/NaorP01, author = {Moni Naor and Benny Pinkas}, editor = {S. Rao Kosaraju}, title = {Efficient oblivious transfer protocols}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {448--457}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365502}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/NaorP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/NaorR01, author = {Joseph Naor and Yuval Rabani}, editor = {S. Rao Kosaraju}, title = {Tree packing and approximating k-cuts}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {26--27}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365415}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/NaorR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/NaorR01a, author = {Moni Naor and Omer Reingold}, editor = {S. Rao Kosaraju}, title = {Constructing pseudo-random permutations with a prescribed structure}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {458--459}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365505}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/NaorR01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/PanduranganU01, author = {Gopal Pandurangan and Eli Upfal}, editor = {S. Rao Kosaraju}, title = {Can entropy characterize performance of online algorithms?}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {727--734}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365764}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/PanduranganU01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Papadimitriou01, author = {Christos H. Papadimitriou}, editor = {S. Rao Kosaraju}, title = {Game theory, algorithms, and the Internet}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {391}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365485}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Papadimitriou01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Pellegrini01, author = {Marco Pellegrini}, editor = {S. Rao Kosaraju}, title = {Randomizing combinatorial algorithms for linear programming when the dimension is moderately high}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {101--108}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365425}, timestamp = {Thu, 21 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Pellegrini01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Pemmaraju01, author = {Sriram V. Pemmaraju}, editor = {S. Rao Kosaraju}, title = {Equitable colorings extend Chernoff-Hoeffding bounds}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {924--925}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365811}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Pemmaraju01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/RaghavanS01, author = {Vijay Raghavan and Jeremy P. Spinrad}, editor = {S. Rao Kosaraju}, title = {Robust algorithms for restricted domains}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {460--467}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365507}, timestamp = {Sun, 27 Sep 2015 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/RaghavanS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/RautenbachR01, author = {Dieter Rautenbach and Bruce A. Reed}, editor = {S. Rao Kosaraju}, title = {Approximately covering by cycles in planar graphs}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {402--406}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365487}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/RautenbachR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Sanders01, author = {Peter Sanders}, editor = {S. Rao Kosaraju}, title = {Reconciling simplicity and realism in parallel disk models}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {67--76}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365420}, timestamp = {Fri, 06 Jan 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Sanders01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ShahF01, author = {Rahul Shah and Martin Farach{-}Colton}, editor = {S. Rao Kosaraju}, title = {On the midpath tree conjuncture: a counter-example}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {208--209}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365446}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ShahF01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/SkutellaU01, author = {Martin Skutella and Marc Uetz}, editor = {S. Rao Kosaraju}, title = {Scheduling precedence-constrained jobs with stochastic processing times on parallel machines}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {589--590}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365543}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/SkutellaU01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Srinivasan01, author = {Aravind Srinivasan}, editor = {S. Rao Kosaraju}, title = {New approaches to covering and packing problems}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {567--576}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365535}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Srinivasan01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Srinivasan01a, author = {Aravind Srinivasan}, editor = {S. Rao Kosaraju}, title = {Domatic partitions and the Lov{\'{a}}sz local lemma}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {922--923}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365810}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Srinivasan01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Vetta01, author = {Adrian Vetta}, editor = {S. Rao Kosaraju}, title = {Approximating the minimum strongly connected subgraph via a matching lower bound}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {417--426}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365493}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Vetta01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/VitterH01, author = {Jeffrey Scott Vitter and David A. Hutchinson}, editor = {S. Rao Kosaraju}, title = {Distribution sort with randomizing cycle}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {77--86}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365421}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/VitterH01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/WarnowMJ01, author = {Tandy J. Warnow and Bernard M. E. Moret and Katherine St. John}, editor = {S. Rao Kosaraju}, title = {Absolute convergence: true trees from short sequences}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {186--195}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365443}, timestamp = {Mon, 14 Mar 2016 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/WarnowMJ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Woeginger01, author = {Gerhard J. Woeginger}, editor = {S. Rao Kosaraju}, title = {Assigning chain-like tasks to a chain-like network}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {765--766}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365774}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Woeginger01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ZelikovskyM01, author = {Alexander Zelikovsky and Ion I. Mandoiu}, editor = {S. Rao Kosaraju}, title = {Practical approximation algorithms for zero- and bounded-skew trees}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {407--416}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365490}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ZelikovskyM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ZhouS01, author = {Yunhong Zhou and Subhash Suri}, editor = {S. Rao Kosaraju}, title = {Shape sensitive geometric permutations}, booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, pages = {234--243}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411.365453}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ZhouS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/soda/2001, editor = {S. Rao Kosaraju}, title = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}}, publisher = {{ACM/SIAM}}, year = {2001}, url = {http://dl.acm.org/citation.cfm?id=365411}, isbn = {0-89871-490-7}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/2001.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.