![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/conf/random/random2003.bht:"
@inproceedings{DBLP:conf/random/AlonKKLR03, author = {Noga Alon and Tali Kaufman and Michael Krivelevich and Simon Litsyn and Dana Ron}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Testing Low-Degree Polynomials over {GF(2(}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {188--199}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_17}, doi = {10.1007/978-3-540-45198-3\_17}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/random/AlonKKLR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/BarakSW03, author = {Boaz Barak and Ronen Shaltiel and Avi Wigderson}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Computational Analogues of Entropy}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {200--215}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_18}, doi = {10.1007/978-3-540-45198-3\_18}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/BarakSW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/Ben-SassonGS03, author = {Eli Ben{-}Sasson and Oded Goldreich and Madhu Sudan}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Bounds on 2-Query Codeword Testing}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {216--227}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_19}, doi = {10.1007/978-3-540-45198-3\_19}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/Ben-SassonGS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/Coja-Oghlan03, author = {Amin Coja{-}Oghlan}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {The Lov{\'{a}}sz Number of Random Graphs}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {228--239}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_20}, doi = {10.1007/978-3-540-45198-3\_20}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/Coja-Oghlan03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/CzumajRS03, author = {Artur Czumaj and Chris Riley and Christian Scheideler}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Perfectly Balanced Allocation}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {240--251}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_21}, doi = {10.1007/978-3-540-45198-3\_21}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/CzumajRS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/DemaineI03, author = {Erik D. Demaine and Nicole Immorlica}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Correlation Clustering with Partial Information}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {1--13}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_1}, doi = {10.1007/978-3-540-45198-3\_1}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/DemaineI03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/DodisO03, author = {Yevgeniy Dodis and Roberto Oliveira}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {On Extracting Private Randomness over a Public Channel}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {252--263}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_22}, doi = {10.1007/978-3-540-45198-3\_22}, timestamp = {Thu, 22 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/random/DodisO03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/DrakeH03, author = {Doratha E. Drake and Stefan Hougardy}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Improved Linear Time Approximation Algorithms for Weighted Matchings}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {14--23}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_2}, doi = {10.1007/978-3-540-45198-3\_2}, timestamp = {Fri, 22 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/random/DrakeH03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/EvenGKRS03, author = {Guy Even and Naveen Garg and Jochen K{\"{o}}nemann and R. Ravi and Amitabh Sinha}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Covering Graphs Using Trees and Stars}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {24--35}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_3}, doi = {10.1007/978-3-540-45198-3\_3}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/EvenGKRS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/FakcharoenpholT03, author = {Jittat Fakcharoenphol and Kunal Talwar}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {36--46}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_4}, doi = {10.1007/978-3-540-45198-3\_4}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/FakcharoenpholT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/FlaxmanFF03, author = {Abraham Flaxman and Alan M. Frieze and Trevor I. Fenner}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {High Degree Vertices and Eigenvalues in the Preferential Attachment Graph}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {264--274}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_23}, doi = {10.1007/978-3-540-45198-3\_23}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/FlaxmanFF03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/FriezeM03, author = {Alan M. Frieze and Michael Molloy}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {275--289}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_24}, doi = {10.1007/978-3-540-45198-3\_24}, timestamp = {Thu, 24 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/random/FriezeM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/GandhiKSW03, author = {Rajiv Gandhi and Samir Khuller and Aravind Srinivasan and Nan Wang}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Approximation Algorithms for Channel Allocation Problems in Broadcast Networks}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {47--58}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_5}, doi = {10.1007/978-3-540-45198-3\_5}, timestamp = {Tue, 07 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/random/GandhiKSW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/GerhardtW03, author = {Heath Gerhardt and John Watrous}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Continuous-Time Quantum Walks on the Symmetric Group}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {290--301}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_25}, doi = {10.1007/978-3-540-45198-3\_25}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/GerhardtW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/GortzW03, author = {Inge Li G{\o}rtz and Anthony Wirth}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Asymmetry in k-Center Variants}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {59--70}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_6}, doi = {10.1007/978-3-540-45198-3\_6}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/GortzW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/HalevyK03, author = {Shirley Halevy and Eyal Kushilevitz}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Distribution-Free Property Testing}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {302--317}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_26}, doi = {10.1007/978-3-540-45198-3\_26}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/HalevyK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/HallLS03, author = {Alexander Hall and Katharina Langkau and Martin Skutella}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {An {FPTAS} for Quickest Multicommodity Flows with Inflow-Dependent Transit Times}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {71--82}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_7}, doi = {10.1007/978-3-540-45198-3\_7}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/HallLS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/HazanSS03, author = {Elad Hazan and Shmuel Safra and Oded Schwartz}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {On the Complexity of Approximating k-Dimensional Matching}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {83--97}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_8}, doi = {10.1007/978-3-540-45198-3\_8}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/HazanSS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/JainMS03, author = {Kamal Jain and Mohammad Mahdian and Amin Saberi}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Approximating Market Equilibria}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {98--108}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_9}, doi = {10.1007/978-3-540-45198-3\_9}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/JainMS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/KaibelR03, author = {Volker Kaibel and Anja Remshagen}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {On the Graph-Density of Random 0/1-Polytopes}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {318--328}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_27}, doi = {10.1007/978-3-540-45198-3\_27}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/KaibelR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/KarpK03, author = {Richard M. Karp and Claire Kenyon}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {329--340}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_28}, doi = {10.1007/978-3-540-45198-3\_28}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/KarpK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/KaufmanKR03, author = {Tali Kaufman and Michael Krivelevich and Dana Ron}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Tight Bounds for Testing Bipartiteness in General Graphs}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {341--353}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_29}, doi = {10.1007/978-3-540-45198-3\_29}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/KaufmanKR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/Kempe03, author = {Julia Kempe}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Discrete Quantum Walks Hit Exponentially Faster}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {354--369}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_30}, doi = {10.1007/978-3-540-45198-3\_30}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/Kempe03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/KonemannLS03, author = {Jochen K{\"{o}}nemann and Asaf Levin and Amitabh Sinha}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {109--121}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_10}, doi = {10.1007/978-3-540-45198-3\_10}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/KonemannLS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/Koutis03, author = {Ioannis Koutis}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {On the Hardness of Approximate Multivariate Integration}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {122--128}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_11}, doi = {10.1007/978-3-540-45198-3\_11}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/Koutis03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/MahdianYZ03, author = {Mohammad Mahdian and Yingyu Ye and Jiawei Zhang}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {129--140}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_12}, doi = {10.1007/978-3-540-45198-3\_12}, timestamp = {Fri, 13 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/random/MahdianYZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/Nutov03, author = {Zeev Nutov}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Approximating Rooted Connectivity Augmentation Problems}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {141--152}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_13}, doi = {10.1007/978-3-540-45198-3\_13}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/Nutov03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/Raskhodnikova03, author = {Sofya Raskhodnikova}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Approximate Testing of Visual Properties}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {370--381}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_31}, doi = {10.1007/978-3-540-45198-3\_31}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/Raskhodnikova03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/ScottS03, author = {Alex D. Scott and Gregory B. Sorkin}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Faster Algorithms for {MAX} {CUT} and {MAX} CSP, with Polynomial Expected Time for Sparse Instances}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {382--395}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_32}, doi = {10.1007/978-3-540-45198-3\_32}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/ScottS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/SethuramanT03, author = {Jay Sethuraman and Chung{-}Piaw Teo}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Effective Routing and Scheduling in Adversarial Queueing Networks}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {153--164}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_14}, doi = {10.1007/978-3-540-45198-3\_14}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/SethuramanT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/ShachnaiT03, author = {Hadas Shachnai and Tami Tamir}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {165--177}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_15}, doi = {10.1007/978-3-540-45198-3\_15}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/ShachnaiT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/TaruiIT03, author = {Jun Tarui and Toshiya Itoh and Yoshinori Takei}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {396--408}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_33}, doi = {10.1007/978-3-540-45198-3\_33}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/TaruiIT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/YeZ03, author = {Yingyu Ye and Jiawei Zhang}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {An Improved Algorithm for Approximating the Radii of Point Sets}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {178--187}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_16}, doi = {10.1007/978-3-540-45198-3\_16}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/YeZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/random/2003, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/b11961}, doi = {10.1007/B11961}, isbn = {3-540-40770-7}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/2003.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.