BibTeX records: Uriel Feige

download as .bib file

@article{DBLP:journals/algorithmica/FeigeT17,
  author    = {Uriel Feige and
               Moshe Tennenholtz},
  title     = {Optimization with Uniform Size Queries},
  journal   = {Algorithmica},
  volume    = {78},
  number    = {1},
  pages     = {255--273},
  year      = {2017},
  url       = {https://doi.org/10.1007/s00453-016-0162-7},
  doi       = {10.1007/s00453-016-0162-7},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/algorithmica/FeigeT17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/scheduling/ChrobakFHKLN17,
  author    = {Marek Chrobak and
               Uriel Feige and
               Mohammad Taghi Hajiaghayi and
               Sanjeev Khanna and
               Fei Li and
               Seffi Naor},
  title     = {A greedy approximation algorithm for minimum-gap scheduling},
  journal   = {J. Scheduling},
  volume    = {20},
  number    = {3},
  pages     = {279--292},
  year      = {2017},
  url       = {https://doi.org/10.1007/s10951-016-0492-y},
  doi       = {10.1007/s10951-016-0492-y},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/scheduling/ChrobakFHKLN17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeKT17,
  author    = {Uriel Feige and
               Tomer Koren and
               Moshe Tennenholtz},
  title     = {Chasing Ghosts: Competing with Stateful Policies},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {190--223},
  year      = {2017},
  url       = {https://doi.org/10.1137/14100227X},
  doi       = {10.1137/14100227X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeKT17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/DavidF17,
  author    = {Roee David and
               Uriel Feige},
  title     = {Random Walks with the Minimum Degree Local Rule Have \emph{O}(\emph{N}\({}^{\mbox{2}}\))
               Cover Time},
  booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  pages     = {1839--1848},
  year      = {2017},
  crossref  = {DBLP:conf/soda/2017},
  url       = {https://doi.org/10.1137/1.9781611974782.120},
  doi       = {10.1137/1.9781611974782.120},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/DavidF17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeFT17,
  author    = {Uriel Feige and
               Michal Feldman and
               Inbal Talgam{-}Cohen},
  title     = {Approximate modularity revisited},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {1028--1041},
  year      = {2017},
  crossref  = {DBLP:conf/stoc/2017},
  url       = {http://doi.acm.org/10.1145/3055399.3055476},
  doi       = {10.1145/3055399.3055476},
  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeFT17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/FeigePV17,
  author    = {Uriel Feige and
               Boaz Patt{-}Shamir and
               Shai Vardi},
  title     = {On the Probe Complexity of Local Computation Algorithms},
  journal   = {CoRR},
  volume    = {abs/1703.07734},
  year      = {2017},
  url       = {http://arxiv.org/abs/1703.07734},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/FeigePV17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/FeigeHR16,
  author    = {Uriel Feige and
               Jonathan Hermon and
               Daniel Reichman},
  title     = {On giant components and treewidth in the layers model},
  journal   = {Random Struct. Algorithms},
  volume    = {48},
  number    = {3},
  pages     = {524--545},
  year      = {2016},
  url       = {https://doi.org/10.1002/rsa.20597},
  doi       = {10.1002/rsa.20597},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/FeigeHR16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeFT16,
  author    = {Uriel Feige and
               Michal Feldman and
               Inbal Talgam{-}Cohen},
  title     = {Oblivious Rounding and the Integrality Gap},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
               France},
  pages     = {8:1--8:23},
  year      = {2016},
  crossref  = {DBLP:conf/approx/2016},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.8},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2016.8},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeFT16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DavidF16,
  author    = {Roee David and
               Uriel Feige},
  title     = {On the effect of randomness on planted 3-coloring models},
  booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  pages     = {77--90},
  year      = {2016},
  crossref  = {DBLP:conf/stoc/2016},
  url       = {http://doi.acm.org/10.1145/2897518.2897561},
  doi       = {10.1145/2897518.2897561},
  timestamp = {Fri, 10 Jun 2016 10:30:30 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/DavidF16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/DavidF16,
  author    = {Roee David and
               Uriel Feige},
  title     = {On the effect of randomness on planted 3-coloring models},
  journal   = {CoRR},
  volume    = {abs/1603.05183},
  year      = {2016},
  url       = {http://arxiv.org/abs/1603.05183},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/DavidF16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/DavidF16a,
  author    = {Roee David and
               Uriel Feige},
  title     = {Random walks with the minimum degree local rule have {\textdollar}O(n{\^{}}2){\textdollar}
               cover time},
  journal   = {CoRR},
  volume    = {abs/1604.08326},
  year      = {2016},
  url       = {http://arxiv.org/abs/1604.08326},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/DavidF16a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/BordenaveFM16,
  author    = {Charles Bordenave and
               Uriel Feige and
               Elchanan Mossel},
  title     = {Shotgun Assembly of Random Jigsaw Puzzles},
  journal   = {CoRR},
  volume    = {abs/1605.03086},
  year      = {2016},
  url       = {http://arxiv.org/abs/1605.03086},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/BordenaveFM16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/FeigeFT16,
  author    = {Uriel Feige and
               Michal Feldman and
               Inbal Talgam{-}Cohen},
  title     = {Approximate Modularity Revisited},
  journal   = {CoRR},
  volume    = {abs/1612.02034},
  year      = {2016},
  url       = {http://arxiv.org/abs/1612.02034},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/FeigeFT16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeJ15,
  author    = {Uriel Feige and
               Shlomo Jozeph},
  title     = {Oblivious Algorithms for the Maximum Directed Cut Problem},
  journal   = {Algorithmica},
  volume    = {71},
  number    = {2},
  pages     = {409--428},
  year      = {2015},
  url       = {https://doi.org/10.1007/s00453-013-9806-z},
  doi       = {10.1007/s00453-013-9806-z},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/algorithmica/FeigeJ15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/FeigeR15,
  author    = {Uriel Feige and
               Daniel Reichman},
  title     = {Recoverable values for independent sets},
  journal   = {Random Struct. Algorithms},
  volume    = {46},
  number    = {1},
  pages     = {142--159},
  year      = {2015},
  url       = {https://doi.org/10.1002/rsa.20492},
  doi       = {10.1002/rsa.20492},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/FeigeR15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/aaai/FeigeFIILS15,
  author    = {Uriel Feige and
               Michal Feldman and
               Nicole Immorlica and
               Rani Izsak and
               Brendan Lucier and
               Vasilis Syrgkanis},
  title     = {A Unifying Hierarchy of Valuations with Complements and Substitutes},
  booktitle = {Proceedings of the Twenty-Ninth {AAAI} Conference on Artificial Intelligence,
               January 25-30, 2015, Austin, Texas, {USA.}},
  pages     = {872--878},
  year      = {2015},
  crossref  = {DBLP:conf/aaai/2015},
  url       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9760},
  timestamp = {Sun, 12 Apr 2015 12:16:43 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/aaai/FeigeFIILS15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/colt/FeigeMS15,
  author    = {Uriel Feige and
               Yishay Mansour and
               Robert E. Schapire},
  title     = {Learning and inference in the presence of corrupted inputs},
  booktitle = {Proceedings of The 28th Conference on Learning Theory, {COLT} 2015,
               Paris, France, July 3-6, 2015},
  pages     = {637--657},
  year      = {2015},
  crossref  = {DBLP:conf/colt/2015},
  url       = {http://jmlr.org/proceedings/papers/v40/Feige15.html},
  timestamp = {Tue, 12 Jul 2016 21:51:13 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/colt/FeigeMS15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Feige15,
  author    = {Uriel Feige},
  title     = {Why are Images Smooth?},
  booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
               Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
  pages     = {229--236},
  year      = {2015},
  crossref  = {DBLP:conf/innovations/2015},
  url       = {http://doi.acm.org/10.1145/2688073.2688075},
  doi       = {10.1145/2688073.2688075},
  timestamp = {Sun, 25 Jan 2015 11:29:31 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/innovations/Feige15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FeigeJ15,
  author    = {Uriel Feige and
               Shlomo Jozeph},
  title     = {Separation between Estimation and Approximation},
  booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
               Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
  pages     = {271--276},
  year      = {2015},
  crossref  = {DBLP:conf/innovations/2015},
  url       = {http://doi.acm.org/10.1145/2688073.2688101},
  doi       = {10.1145/2688073.2688101},
  timestamp = {Sun, 25 Jan 2015 11:29:31 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/innovations/FeigeJ15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Coja-OghlanFKR15,
  author    = {Amin Coja{-}Oghlan and
               Uriel Feige and
               Michael Krivelevich and
               Daniel Reichman},
  title     = {Contagious Sets in Expanders},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages     = {1953--1987},
  year      = {2015},
  crossref  = {DBLP:conf/soda/2015},
  url       = {https://doi.org/10.1137/1.9781611973730.131},
  doi       = {10.1137/1.9781611973730.131},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/Coja-OghlanFKR15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/geb/FeigeT14,
  author    = {Uriel Feige and
               Moshe Tennenholtz},
  title     = {On fair division of a homogeneous good},
  journal   = {Games and Economic Behavior},
  volume    = {87},
  pages     = {305--321},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.geb.2014.02.009},
  doi       = {10.1016/j.geb.2014.02.009},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/geb/FeigeT14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalFKMNNS14,
  author    = {Nikhil Bansal and
               Uriel Feige and
               Robert Krauthgamer and
               Konstantin Makarychev and
               Viswanath Nagarajan and
               Joseph Naor and
               Roy Schwartz},
  title     = {Min-Max Graph Partitioning and Small Set Expansion},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {872--904},
  year      = {2014},
  url       = {https://doi.org/10.1137/120873996},
  doi       = {10.1137/120873996},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/BansalFKMNNS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/AfekBFGLS14,
  author    = {Yehuda Afek and
               Yakov Babichenko and
               Uriel Feige and
               Eli Gafni and
               Nati Linial and
               Benny Sudakov},
  title     = {Musical Chairs},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {28},
  number    = {3},
  pages     = {1578--1600},
  year      = {2014},
  url       = {https://doi.org/10.1137/12088478X},
  doi       = {10.1137/12088478X},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamdm/AfekBFGLS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeKT14,
  author    = {Uriel Feige and
               Tomer Koren and
               Moshe Tennenholtz},
  title     = {Chasing Ghosts: Competing with Stateful Policies},
  booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2014, Philadelphia, PA, USA, October 18-21, 2014},
  pages     = {100--109},
  year      = {2014},
  crossref  = {DBLP:conf/focs/2014},
  url       = {https://doi.org/10.1109/FOCS.2014.19},
  doi       = {10.1109/FOCS.2014.19},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeKT14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeigeJ14,
  author    = {Uriel Feige and
               Shlomo Jozeph},
  title     = {Demand Queries with Preprocessing},
  booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
               {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
               {I}},
  pages     = {477--488},
  year      = {2014},
  crossref  = {DBLP:conf/icalp/2014-1},
  url       = {https://doi.org/10.1007/978-3-662-43948-7_40},
  doi       = {10.1007/978-3-662-43948-7_40},
  timestamp = {Tue, 23 May 2017 01:08:20 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/FeigeJ14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FeigeT14,
  author    = {Uriel Feige and
               Moshe Tennenholtz},
  title     = {Invitation games and the price of stability},
  booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
               USA, January 12-14, 2014},
  pages     = {93--102},
  year      = {2014},
  crossref  = {DBLP:conf/innovations/2014},
  url       = {http://doi.acm.org/10.1145/2554797.2554808},
  doi       = {10.1145/2554797.2554808},
  timestamp = {Fri, 14 Feb 2014 17:36:37 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/innovations/FeigeT14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AzarFFT14,
  author    = {Yossi Azar and
               Uriel Feige and
               Michal Feldman and
               Moshe Tennenholtz},
  title     = {Sequential decision making with vector outcomes},
  booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
               USA, January 12-14, 2014},
  pages     = {195--206},
  year      = {2014},
  crossref  = {DBLP:conf/innovations/2014},
  url       = {http://doi.acm.org/10.1145/2554797.2554817},
  doi       = {10.1145/2554797.2554817},
  timestamp = {Fri, 14 Feb 2014 17:36:37 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/innovations/AzarFFT14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FeigeRS14,
  author    = {Uriel Feige and
               R. Ravi and
               Mohit Singh},
  title     = {Short Tours through Large Linear Forests},
  booktitle = {Integer Programming and Combinatorial Optimization - 17th International
               Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
  pages     = {273--284},
  year      = {2014},
  crossref  = {DBLP:conf/ipco/2014},
  url       = {https://doi.org/10.1007/978-3-319-07557-0_23},
  doi       = {10.1007/978-3-319-07557-0_23},
  timestamp = {Mon, 22 May 2017 17:11:54 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ipco/FeigeRS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/FeigeHR14,
  author    = {Uriel Feige and
               Jonathan Hermon and
               Daniel Reichman},
  title     = {On giant components and treewidth in the layers model},
  journal   = {CoRR},
  volume    = {abs/1401.6681},
  year      = {2014},
  url       = {http://arxiv.org/abs/1401.6681},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/FeigeHR14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Feige14,
  author    = {Uriel Feige},
  title     = {On robustly asymmetric graphs},
  journal   = {CoRR},
  volume    = {abs/1402.1047},
  year      = {2014},
  url       = {http://arxiv.org/abs/1402.1047},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/Feige14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Feige14a,
  author    = {Uriel Feige},
  title     = {Why are images smooth?},
  journal   = {CoRR},
  volume    = {abs/1406.5035},
  year      = {2014},
  url       = {http://arxiv.org/abs/1406.5035},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/Feige14a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/FeigeKT14,
  author    = {Uriel Feige and
               Tomer Koren and
               Moshe Tennenholtz},
  title     = {Chasing Ghosts: Competing with Stateful Policies},
  journal   = {CoRR},
  volume    = {abs/1407.7635},
  year      = {2014},
  url       = {http://arxiv.org/abs/1407.7635},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/FeigeKT14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/FeigeFIILS14,
  author    = {Uriel Feige and
               Michal Feldman and
               Nicole Immorlica and
               Rani Izsak and
               Brendan Lucier and
               Vasilis Syrgkanis},
  title     = {A Unifying Hierarchy of Valuations with Complements and Substitutes},
  journal   = {CoRR},
  volume    = {abs/1408.1211},
  year      = {2014},
  url       = {http://arxiv.org/abs/1408.1211},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/FeigeFIILS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Feige14b,
  author    = {Uriel Feige},
  title     = {NP-hardness of hypercube 2-segmentation},
  journal   = {CoRR},
  volume    = {abs/1411.0821},
  year      = {2014},
  url       = {http://arxiv.org/abs/1411.0821},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/Feige14b},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FeigeFIILS14,
  author    = {Uriel Feige and
               Michal Feldman and
               Nicole Immorlica and
               Rani Izsak and
               Brendan Lucier and
               Vasilis Syrgkanis},
  title     = {A Unifying Hierarchy of Valuations with Complements and Substitutes},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {103},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/103},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/FeigeFIILS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FeigeJ14,
  author    = {Uriel Feige and
               Shlomo Jozeph},
  title     = {Separation between Estimation and Approximation},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {110},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/110},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/FeigeJ14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeIMN13,
  author    = {Uriel Feige and
               Nicole Immorlica and
               Vahab S. Mirrokni and
               Hamid Nazerzadeh},
  title     = {{PASS} Approximation: {A} Framework for Analyzing and Designing Heuristics},
  journal   = {Algorithmica},
  volume    = {66},
  number    = {2},
  pages     = {450--478},
  year      = {2013},
  url       = {https://doi.org/10.1007/s00453-012-9646-2},
  doi       = {10.1007/s00453-012-9646-2},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/algorithmica/FeigeIMN13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toc/FeigeMV13,
  author    = {Uriel Feige and
               Elchanan Mossel and
               Dan Vilenchik},
  title     = {Complete Convergence of Message Passing Algorithms for Some Satisfiability
               Problems},
  journal   = {Theory of Computing},
  volume    = {9},
  pages     = {617--651},
  year      = {2013},
  url       = {https://doi.org/10.4086/toc.2013.v009a019},
  doi       = {10.4086/toc.2013.v009a019},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/toc/FeigeMV13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/aaai/FeigeKT13,
  author    = {Uriel Feige and
               Gil Kalai and
               Moshe Tennenholtz},
  title     = {The Cascade Auction - {A} Mechanism for Deterring Collusion in Auctions},
  booktitle = {Proceedings of the Twenty-Seventh {AAAI} Conference on Artificial
               Intelligence, July 14-18, 2013, Bellevue, Washington, {USA.}},
  year      = {2013},
  crossref  = {DBLP:conf/aaai/2013},
  url       = {http://www.aaai.org/ocs/index.php/AAAI/AAAI13/paper/view/6168},
  timestamp = {Tue, 17 Dec 2013 19:26:12 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/aaai/FeigeKT13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/DavidF13,
  author    = {Roee David and
               Uriel Feige},
  title     = {Connectivity of Random High Dimensional Geometric Graphs},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
               International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
               2013. Proceedings},
  pages     = {497--512},
  year      = {2013},
  crossref  = {DBLP:conf/approx/2013},
  url       = {https://doi.org/10.1007/978-3-642-40328-6_35},
  doi       = {10.1007/978-3-642-40328-6_35},
  timestamp = {Tue, 23 May 2017 01:10:59 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/DavidF13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChrobakFHKLN13,
  author    = {Marek Chrobak and
               Uriel Feige and
               Mohammad Taghi Hajiaghayi and
               Sanjeev Khanna and
               Fei Li and
               Seffi Naor},
  title     = {A Greedy Approximation Algorithm for Minimum-Gap Scheduling},
  booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
               Barcelona, Spain, May 22-24, 2013. Proceedings},
  pages     = {97--109},
  year      = {2013},
  crossref  = {DBLP:conf/ciac/2013},
  url       = {https://doi.org/10.1007/978-3-642-38233-8_9},
  doi       = {10.1007/978-3-642-38233-8_9},
  timestamp = {Thu, 15 Jun 2017 21:39:41 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ciac/ChrobakFHKLN13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FeigeI13,
  author    = {Uriel Feige and
               Rani Izsak},
  title     = {Welfare maximization and the supermodular degree},
  booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
               CA, USA, January 9-12, 2013},
  pages     = {247--256},
  year      = {2013},
  crossref  = {DBLP:conf/innovations/2013},
  url       = {http://doi.acm.org/10.1145/2422436.2422466},
  doi       = {10.1145/2422436.2422466},
  timestamp = {Sun, 17 Feb 2013 11:19:02 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/innovations/FeigeI13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/FeigeLT13,
  author    = {Uriel Feige and
               Ron Lavi and
               Moshe Tennenholtz},
  title     = {Competition among asymmetric sellers with fixed supply},
  booktitle = {{ACM} Conference on Electronic Commerce, {EC} '13, Philadelphia, PA,
               USA, June 16-20, 2013},
  pages     = {415--416},
  year      = {2013},
  crossref  = {DBLP:conf/sigecom/2013},
  url       = {http://doi.acm.org/10.1145/2482540.2482572},
  doi       = {10.1145/2482540.2482572},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/sigecom/FeigeLT13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Coja-OghlanFKR13,
  author    = {Amin Coja{-}Oghlan and
               Uriel Feige and
               Michael Krivelevich and
               Daniel Reichman},
  title     = {Contagious Sets in Expanders},
  journal   = {CoRR},
  volume    = {abs/1306.2465},
  year      = {2013},
  url       = {http://arxiv.org/abs/1306.2465},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/Coja-OghlanFKR13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FeigeI13,
  author    = {Uriel Feige and
               Rani Izsak},
  title     = {Welfare Maximization and the Supermodular Degree},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {95},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/095},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/FeigeI13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/AsadpourFS12,
  author    = {Arash Asadpour and
               Uriel Feige and
               Amin Saberi},
  title     = {Santa claus meets hypergraph matchings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {24:1--24:9},
  year      = {2012},
  url       = {http://doi.acm.org/10.1145/2229163.2229168},
  doi       = {10.1145/2229163.2229168},
  timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/talg/AsadpourFS12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/aamas/AzarFTF12,
  author    = {Yossi Azar and
               Uriel Feige and
               Moshe Tennenholtz and
               Michal Feldman},
  title     = {Mastering multi-player games},
  booktitle = {International Conference on Autonomous Agents and Multiagent Systems,
               {AAMAS} 2012, Valencia, Spain, June 4-8, 2012 {(3} Volumes)},
  pages     = {897--904},
  year      = {2012},
  crossref  = {DBLP:conf/atal/2012},
  url       = {http://dl.acm.org/citation.cfm?id=2343825},
  timestamp = {Thu, 19 Mar 2015 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/aamas/AzarFTF12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeigeJ12,
  author    = {Uriel Feige and
               Shlomo Jozeph},
  title     = {Universal Factor Graphs},
  booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
               {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
  pages     = {339--350},
  year      = {2012},
  crossref  = {DBLP:conf/icalp/2012-1},
  url       = {https://doi.org/10.1007/978-3-642-31594-7_29},
  doi       = {10.1007/978-3-642-31594-7_29},
  timestamp = {Sun, 04 Jun 2017 10:07:30 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/FeigeJ12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-6484,
  author    = {Uriel Feige and
               Shlomo Jozeph},
  title     = {Universal Factor Graphs},
  journal   = {CoRR},
  volume    = {abs/1204.6484},
  year      = {2012},
  url       = {http://arxiv.org/abs/1204.6484},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1204-6484},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-0813,
  author    = {Yehuda Afek and
               Yakov Babichenko and
               Uriel Feige and
               Eli Gafni and
               Nati Linial and
               Benny Sudakov},
  title     = {Musical chairs},
  journal   = {CoRR},
  volume    = {abs/1208.0813},
  year      = {2012},
  url       = {http://arxiv.org/abs/1208.0813},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1208-0813},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/DubeyFU11,
  author    = {Chandan K. Dubey and
               Uriel Feige and
               Walter Unger},
  title     = {Hardness results for approximating the bandwidth},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {77},
  number    = {1},
  pages     = {62--90},
  year      = {2011},
  url       = {https://doi.org/10.1016/j.jcss.2010.06.006},
  doi       = {10.1016/j.jcss.2010.06.006},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jcss/DubeyFU11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/AzarFGMR11,
  author    = {Yossi Azar and
               Uriel Feige and
               Iftah Gamzu and
               Thomas Moscibroda and
               Prasad Raghavendra},
  title     = {Buffer Management for Colored Packets with Deadlines},
  journal   = {Theory Comput. Syst.},
  volume    = {49},
  number    = {4},
  pages     = {738--756},
  year      = {2011},
  url       = {https://doi.org/10.1007/s00224-011-9346-3},
  doi       = {10.1007/s00224-011-9346-3},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/mst/AzarFGMR11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeMV11,
  author    = {Uriel Feige and
               Vahab S. Mirrokni and
               Jan Vondr{\'{a}}k},
  title     = {Maximizing Non-monotone Submodular Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {1133--1153},
  year      = {2011},
  url       = {https://doi.org/10.1137/090779346},
  doi       = {10.1137/090779346},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeMV11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/FeigeFV11,
  author    = {Uriel Feige and
               Abraham D. Flaxman and
               Dan Vilenchik},
  title     = {On the Diameter of the Set of Satisfying Assignments in Random Satisfiable
               \emph{k}-CNF Formulas},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {25},
  number    = {2},
  pages     = {736--749},
  year      = {2011},
  url       = {https://doi.org/10.1137/090749323},
  doi       = {10.1137/090749323},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamdm/FeigeFV11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalFKMNNS11,
  author    = {Nikhil Bansal and
               Uriel Feige and
               Robert Krauthgamer and
               Konstantin Makarychev and
               Viswanath Nagarajan and
               Joseph Naor and
               Roy Schwartz},
  title     = {Min-max Graph Partitioning and Small Set Expansion},
  booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
               2011, Palm Springs, CA, USA, October 22-25, 2011},
  pages     = {17--26},
  year      = {2011},
  crossref  = {DBLP:conf/focs/2011},
  url       = {https://doi.org/10.1109/FOCS.2011.79},
  doi       = {10.1109/FOCS.2011.79},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/BansalFKMNNS11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeigeR11,
  author    = {Uriel Feige and
               Daniel Reichman},
  title     = {Recoverable Values for Independent Sets},
  booktitle = {Automata, Languages and Programming - 38th International Colloquium,
               {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
               {I}},
  pages     = {486--497},
  year      = {2011},
  crossref  = {DBLP:conf/icalp/2011-1},
  url       = {https://doi.org/10.1007/978-3-642-22006-7_41},
  doi       = {10.1007/978-3-642-22006-7_41},
  timestamp = {Thu, 15 Jun 2017 21:39:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/FeigeR11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeT11,
  author    = {Uriel Feige and
               Moshe Tennenholtz},
  title     = {Mechanism design with uncertain inputs: (to err is human, to forgive
               divine)},
  booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
               2011, San Jose, CA, USA, 6-8 June 2011},
  pages     = {549--558},
  year      = {2011},
  crossref  = {DBLP:conf/stoc/2011},
  url       = {http://doi.acm.org/10.1145/1993636.1993709},
  doi       = {10.1145/1993636.1993709},
  timestamp = {Tue, 22 May 2012 21:36:56 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeT11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/wads/DevanurF11,
  author    = {Nikhil R. Devanur and
               Uriel Feige},
  title     = {An O(n log n) Algorithm for a Load Balancing Problem on Paths},
  booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
               2011, New York, NY, USA, August 15-17, 2011. Proceedings},
  pages     = {326--337},
  year      = {2011},
  crossref  = {DBLP:conf/wads/2011},
  url       = {https://doi.org/10.1007/978-3-642-22300-6_28},
  doi       = {10.1007/978-3-642-22300-6_28},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/wads/DevanurF11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AfekBFGLS11,
  author    = {Yehuda Afek and
               Yakov Babichenko and
               Uriel Feige and
               Eli Gafni and
               Nati Linial and
               Benny Sudakov},
  title     = {Oblivious Collaboration},
  booktitle = {Distributed Computing - 25th International Symposium, {DISC} 2011,
               Rome, Italy, September 20-22, 2011. Proceedings},
  pages     = {489--504},
  year      = {2011},
  crossref  = {DBLP:conf/wdag/2011},
  url       = {https://doi.org/10.1007/978-3-642-24100-0_45},
  doi       = {10.1007/978-3-642-24100-0_45},
  timestamp = {Fri, 19 May 2017 01:25:17 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/wdag/AfekBFGLS11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-2520,
  author    = {Uriel Feige and
               Moshe Tennenholtz},
  title     = {Mechanism design with uncertain inputs (to err is human, to forgive
               divine)},
  journal   = {CoRR},
  volume    = {abs/1103.2520},
  year      = {2011},
  url       = {http://arxiv.org/abs/1103.2520},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1103-2520},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-5609,
  author    = {Uriel Feige and
               Daniel Reichman},
  title     = {Recoverable Values for Independent Sets},
  journal   = {CoRR},
  volume    = {abs/1103.5609},
  year      = {2011},
  url       = {http://arxiv.org/abs/1103.5609},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1103-5609},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-2065,
  author    = {Yehuda Afek and
               Yakov Babichenko and
               Uriel Feige and
               Eli Gafni and
               Nati Linial and
               Benny Sudakov},
  title     = {Oblivious Collaboration},
  journal   = {CoRR},
  volume    = {abs/1106.2065},
  year      = {2011},
  url       = {http://arxiv.org/abs/1106.2065},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1106-2065},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-4319,
  author    = {Nikhil Bansal and
               Uriel Feige and
               Robert Krauthgamer and
               Konstantin Makarychev and
               Viswanath Nagarajan and
               Joseph Naor and
               Roy Schwartz},
  title     = {Min-Max Graph Partitioning and Small Set Expansion},
  journal   = {CoRR},
  volume    = {abs/1110.4319},
  year      = {2011},
  url       = {http://arxiv.org/abs/1110.4319},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1110-4319},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/DyerFFK11,
  author    = {Martin E. Dyer and
               Uriel Feige and
               Alan M. Frieze and
               Marek Karpinski},
  title     = {Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl
               Seminar 11241)},
  journal   = {Dagstuhl Reports},
  volume    = {1},
  number    = {6},
  pages     = {24--53},
  year      = {2011},
  url       = {https://doi.org/10.4230/DagRep.1.6.24},
  doi       = {10.4230/DagRep.1.6.24},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/dagstuhl-reports/DyerFFK11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarFG10,
  author    = {Yossi Azar and
               Uriel Feige and
               Daniel Glasner},
  title     = {A Preemptive Algorithm for Maximizing Disjoint Paths on Trees},
  journal   = {Algorithmica},
  volume    = {57},
  number    = {3},
  pages     = {517--537},
  year      = {2010},
  url       = {https://doi.org/10.1007/s00453-009-9305-4},
  doi       = {10.1007/s00453-009-9305-4},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/algorithmica/AzarFG10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jgt/FeigeK10,
  author    = {Uriel Feige and
               Shimon Kogan},
  title     = {Balanced coloring of bipartite graphs},
  journal   = {Journal of Graph Theory},
  volume    = {64},
  number    = {4},
  pages     = {277--291},
  year      = {2010},
  url       = {https://doi.org/10.1002/jgt.20456},
  doi       = {10.1002/jgt.20456},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jgt/FeigeK10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/Feige10,
  author    = {Uriel Feige},
  title     = {On Optimal Strategies for a Hat Game on Graphs},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {24},
  number    = {3},
  pages     = {782--791},
  year      = {2010},
  url       = {https://doi.org/10.1137/090778791},
  doi       = {10.1137/090778791},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamdm/Feige10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toc/FeigeV10,
  author    = {Uriel Feige and
               Jan Vondr{\'{a}}k},
  title     = {The Submodular Welfare Problem with Demand Queries},
  journal   = {Theory of Computing},
  volume    = {6},
  number    = {1},
  pages     = {247--290},
  year      = {2010},
  url       = {https://doi.org/10.4086/toc.2010.v006a011},
  doi       = {10.4086/toc.2010.v006a011},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/toc/FeigeV10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sagt/FeigeT10,
  author    = {Uriel Feige and
               Inbal Talgam{-}Cohen},
  title     = {A Direct Reduction from \emph{k}-Player to 2-Player Approximate Nash
               Equilibrium},
  booktitle = {Algorithmic Game Theory - Third International Symposium, {SAGT} 2010,
               Athens, Greece, October 18-20, 2010. Proceedings},
  pages     = {138--149},
  year      = {2010},
  crossref  = {DBLP:conf/sagt/2010},
  url       = {https://doi.org/10.1007/978-3-642-16170-4_13},
  doi       = {10.1007/978-3-642-16170-4_13},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/sagt/FeigeT10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sagt/FeigeT10a,
  author    = {Uriel Feige and
               Moshe Tennenholtz},
  title     = {Responsive Lotteries},
  booktitle = {Algorithmic Game Theory - Third International Symposium, {SAGT} 2010,
               Athens, Greece, October 18-20, 2010. Proceedings},
  pages     = {150--161},
  year      = {2010},
  crossref  = {DBLP:conf/sagt/2010},
  url       = {https://doi.org/10.1007/978-3-642-16170-4_14},
  doi       = {10.1007/978-3-642-16170-4_14},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/sagt/FeigeT10a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhaskaraCCFV10,
  author    = {Aditya Bhaskara and
               Moses Charikar and
               Eden Chlamtac and
               Uriel Feige and
               Aravindan Vijayaraghavan},
  title     = {Detecting high log-densities: an \emph{O}(\emph{n}\({}^{\mbox{1/4}}\))
               approximation for densest \emph{k}-subgraph},
  booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  pages     = {201--210},
  year      = {2010},
  crossref  = {DBLP:conf/stoc/2010},
  url       = {http://doi.acm.org/10.1145/1806689.1806718},
  doi       = {10.1145/1806689.1806718},
  timestamp = {Fri, 12 Oct 2012 12:16:22 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/BhaskaraCCFV10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-2891,
  author    = {Aditya Bhaskara and
               Moses Charikar and
               Eden Chlamtac and
               Uriel Feige and
               Aravindan Vijayaraghavan},
  title     = {Detecting High Log-Densities -- an O(n{\^{}}1/4) Approximation for
               Densest k-Subgraph},
  journal   = {CoRR},
  volume    = {abs/1001.2891},
  year      = {2010},
  url       = {http://arxiv.org/abs/1001.2891},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1001-2891},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-3886,
  author    = {Uriel Feige and
               Inbal Talgam{-}Cohen},
  title     = {A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium},
  journal   = {CoRR},
  volume    = {abs/1007.3886},
  year      = {2010},
  url       = {http://arxiv.org/abs/1007.3886},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1007-3886},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-0406,
  author    = {Uriel Feige and
               Shlomo Jozeph},
  title     = {Oblivious Algorithms for the Maximum Directed Cut Problem},
  journal   = {CoRR},
  volume    = {abs/1010.0406},
  year      = {2010},
  url       = {http://arxiv.org/abs/1010.0406},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1010-0406},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeT09,
  author    = {Uriel Feige and
               Kunal Talwar},
  title     = {Approximating the Bandwidth of Caterpillars},
  journal   = {Algorithmica},
  volume    = {55},
  number    = {1},
  pages     = {190--204},
  year      = {2009},
  url       = {https://doi.org/10.1007/s00453-007-9002-0},
  doi       = {10.1007/s00453-007-9002-0},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/algorithmica/FeigeT09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/Feige09,
  author    = {Uriel Feige},
  title     = {On Maximizing Welfare When Utility Functions Are Subadditive},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {122--142},
  year      = {2009},
  url       = {https://doi.org/10.1137/070680977},
  doi       = {10.1137/070680977},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/Feige09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeIMN09,
  author    = {Uriel Feige and
               Nicole Immorlica and
               Vahab S. Mirrokni and
               Hamid Nazerzadeh},
  title     = {{PASS} Approximation},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
               International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
               2009. Proceedings},
  pages     = {111--124},
  year      = {2009},
  crossref  = {DBLP:conf/approx/2009},
  url       = {https://doi.org/10.1007/978-3-642-03685-9_9},
  doi       = {10.1007/978-3-642-03685-9_9},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeIMN09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonF09,
  author    = {Noga Alon and
               Uriel Feige},
  title     = {On the power of two, three and four probes},
  booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages     = {346--354},
  year      = {2009},
  crossref  = {DBLP:conf/soda/2009},
  url       = {http://dl.acm.org/citation.cfm?id=1496770.1496809},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/AlonF09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Coja-OghlanFFKV09,
  author    = {Amin Coja{-}Oghlan and
               Uriel Feige and
               Alan M. Frieze and
               Michael Krivelevich and
               Dan Vilenchik},
  title     = {On smoothed \emph{k}-CNF formulas and the Walksat algorithm},
  booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages     = {451--460},
  year      = {2009},
  crossref  = {DBLP:conf/soda/2009},
  url       = {http://dl.acm.org/citation.cfm?id=1496770.1496820},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/Coja-OghlanFFKV09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AzarFGMR09,
  author    = {Yossi Azar and
               Uriel Feige and
               Iftah Gamzu and
               Thomas Moscibroda and
               Prasad Raghavendra},
  title     = {Buffer management for colored packets with deadlines},
  booktitle = {{SPAA} 2009: Proceedings of the 21st Annual {ACM} Symposium on Parallelism
               in Algorithms and Architectures, Calgary, Alberta, Canada, August
               11-13, 2009},
  pages     = {319--327},
  year      = {2009},
  crossref  = {DBLP:conf/spaa/2009},
  url       = {http://doi.acm.org/10.1145/1583991.1584068},
  doi       = {10.1145/1583991.1584068},
  timestamp = {Thu, 23 Jun 2011 21:55:08 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/spaa/AzarFGMR09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-3631,
  author    = {Reid Andersen and
               Uriel Feige},
  title     = {Interchanging distance and capacity in probabilistic mappings},
  journal   = {CoRR},
  volume    = {abs/0907.3631},
  year      = {2009},
  url       = {http://arxiv.org/abs/0907.3631},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-0907-3631},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-2005,
  author    = {Uriel Feige and
               Ofer Zeitouni},
  title     = {Deterministic approximation for the cover time of trees},
  journal   = {CoRR},
  volume    = {abs/0909.2005},
  year      = {2009},
  url       = {http://arxiv.org/abs/0909.2005},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-0909-2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-5094,
  author    = {Uriel Feige},
  title     = {Faster FAST(Feedback Arc Set in Tournaments)},
  journal   = {CoRR},
  volume    = {abs/0911.5094},
  year      = {2009},
  url       = {http://arxiv.org/abs/0911.5094},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-0911-5094},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeHL08,
  author    = {Uriel Feige and
               MohammadTaghi Hajiaghayi and
               James R. Lee},
  title     = {Improved Approximation Algorithms for Minimum Weight Vertex Separators},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {629--657},
  year      = {2008},
  url       = {https://doi.org/10.1137/05064299X},
  doi       = {10.1137/05064299X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeHL08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/DemaineFHS08,
  author    = {Erik D. Demaine and
               Uriel Feige and
               MohammadTaghi Hajiaghayi and
               Mohammad R. Salavatipour},
  title     = {Combination Can Be Hard: Approximability of the Unique Coverage Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1464--1483},
  year      = {2008},
  url       = {https://doi.org/10.1137/060656048},
  doi       = {10.1137/060656048},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/DemaineFHS08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/FeigeO08,
  author    = {Uriel Feige and
               Eran Ofek},
  title     = {Finding a Maximum Independent Set in a Sparse Random Graph},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {22},
  number    = {2},
  pages     = {693--718},
  year      = {2008},
  url       = {https://doi.org/10.1137/060661090},
  doi       = {10.1137/060661090},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamdm/FeigeO08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/AsadpourFS08,
  author    = {Arash Asadpour and
               Uriel Feige and
               Amin Saberi},
  title     = {Santa Claus Meets Hypergraph Matchings},
  booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
               and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
               International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
               2008. Proceedings},
  pages     = {10--20},
  year      = {2008},
  crossref  = {DBLP:conf/approx/2008},
  url       = {https://doi.org/10.1007/978-3-540-85363-3_2},
  doi       = {10.1007/978-3-540-85363-3_2},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/AsadpourFS08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/esa/FeigeS08,
  author    = {Uriel Feige and
               Mohit Singh},
  title     = {Edge Coloring and Decompositions of Weighted Graphs},
  booktitle = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe,
               Germany, September 15-17, 2008. Proceedings},
  pages     = {405--416},
  year      = {2008},
  crossref  = {DBLP:conf/esa/2008},
  url       = {https://doi.org/10.1007/978-3-540-87744-8_34},
  doi       = {10.1007/978-3-540-87744-8_34},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/esa/FeigeS08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Feige08,
  author    = {Uriel Feige},
  title     = {On Estimation Algorithms vs Approximation Algorithms},
  booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
               Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
               Bangalore, India},
  pages     = {357--363},
  year      = {2008},
  crossref  = {DBLP:conf/fsttcs/2008},
  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1767},
  doi       = {10.4230/LIPIcs.FSTTCS.2008.1767},
  timestamp = {Wed, 24 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/fsttcs/Feige08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Feige08,
  author    = {Uriel Feige},
  title     = {On allocations that maximize fairness},
  booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
               2008},
  pages     = {287--293},
  year      = {2008},
  crossref  = {DBLP:conf/soda/2008},
  url       = {http://dl.acm.org/citation.cfm?id=1347082.1347114},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/Feige08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarFG08,
  author    = {Yossi Azar and
               Uriel Feige and
               Daniel Glasner},
  title     = {A Preemptive Algorithm for Maximizing Disjoint Paths on Trees},
  booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
               Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
  pages     = {319--330},
  year      = {2008},
  crossref  = {DBLP:conf/swat/2008},
  url       = {https://doi.org/10.1007/978-3-540-69903-3_29},
  doi       = {10.1007/978-3-540-69903-3_29},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/swat/AzarFG08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/www/FeigeIMN08,
  author    = {Uriel Feige and
               Nicole Immorlica and
               Vahab S. Mirrokni and
               Hamid Nazerzadeh},
  title     = {A combinatorial allocation mechanism with penalties for banner advertising},
  booktitle = {Proceedings of the 17th International Conference on World Wide Web,
               {WWW} 2008, Beijing, China, April 21-25, 2008},
  pages     = {169--178},
  year      = {2008},
  crossref  = {DBLP:conf/www/2008},
  url       = {http://doi.acm.org/10.1145/1367497.1367521},
  doi       = {10.1145/1367497.1367521},
  timestamp = {Fri, 14 Dec 2012 07:52:21 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/www/FeigeIMN08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/www/AndersenBCFFKMT08,
  author    = {Reid Andersen and
               Christian Borgs and
               Jennifer T. Chayes and
               Uriel Feige and
               Abraham D. Flaxman and
               Adam Kalai and
               Vahab S. Mirrokni and
               Moshe Tennenholtz},
  title     = {Trust-based recommendation systems: an axiomatic approach},
  booktitle = {Proceedings of the 17th International Conference on World Wide Web,
               {WWW} 2008, Beijing, China, April 21-25, 2008},
  pages     = {199--208},
  year      = {2008},
  crossref  = {DBLP:conf/www/2008},
  url       = {http://doi.acm.org/10.1145/1367497.1367525},
  doi       = {10.1145/1367497.1367525},
  timestamp = {Fri, 14 Dec 2012 07:52:21 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/www/AndersenBCFFKMT08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/FeigeL07,
  author    = {Uriel Feige and
               James R. Lee},
  title     = {An improved approximation ratio for the minimum linear arrangement
               problem},
  journal   = {Inf. Process. Lett.},
  volume    = {101},
  number    = {1},
  pages     = {26--29},
  year      = {2007},
  url       = {https://doi.org/10.1016/j.ipl.2006.07.009},
  doi       = {10.1016/j.ipl.2006.07.009},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/ipl/FeigeL07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toc/FeigeO07,
  author    = {Uriel Feige and
               Eran Ofek},
  title     = {Easily refutable subformulas of large random 3CNF formulas},
  journal   = {Theory of Computing},
  volume    = {3},
  number    = {1},
  pages     = {25--43},
  year      = {2007},
  url       = {https://doi.org/10.4086/toc.2007.v003a002},
  doi       = {10.4086/toc.2007.v003a002},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/toc/FeigeO07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeS07,
  author    = {Uriel Feige and
               Mohit Singh},
  title     = {Improved Approximation Ratios for Traveling Salesperson Tours and
               Paths in Directed Graphs},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
               International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
               20-22, 2007, Proceedings},
  pages     = {104--118},
  year      = {2007},
  crossref  = {DBLP:conf/approx/2007},
  url       = {https://doi.org/10.1007/978-3-540-74208-1_8},
  doi       = {10.1007/978-3-540-74208-1_8},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeS07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigeKO07,
  author    = {Uriel Feige and
               Guy Kindler and
               Ryan O'Donnell},
  title     = {Understanding Parallel Repetition Requires Understanding Foams},
  booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
               13-16 June 2007, San Diego, California, {USA}},
  pages     = {179--192},
  year      = {2007},
  crossref  = {DBLP:conf/coco/2007},
  url       = {https://doi.org/10.1109/CCC.2007.39},
  doi       = {10.1109/CCC.2007.39},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/FeigeKO07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/Feige07,
  author    = {Uriel Feige},
  title     = {Refuting Smoothed 3CNF Formulas},
  booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
  pages     = {407--417},
  year      = {2007},
  crossref  = {DBLP:conf/focs/2007},
  url       = {https://doi.org/10.1109/FOCS.2007.59},
  doi       = {10.1109/FOCS.2007.59},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/Feige07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeMV07,
  author    = {Uriel Feige and
               Vahab S. Mirrokni and
               Jan Vondr{\'{a}}k},
  title     = {Maximizing Non-Monotone Submodular Functions},
  booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
  pages     = {461--471},
  year      = {2007},
  crossref  = {DBLP:conf/focs/2007},
  url       = {https://doi.org/10.1109/FOCS.2007.29},
  doi       = {10.1109/FOCS.2007.29},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeMV07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FeigeJMM07,
  author    = {Uriel Feige and
               Kamal Jain and
               Mohammad Mahdian and
               Vahab S. Mirrokni},
  title     = {Robust Combinatorial Optimization with Exponential Scenarios},
  booktitle = {Integer Programming and Combinatorial Optimization, 12th International
               {IPCO} Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings},
  pages     = {439--453},
  year      = {2007},
  crossref  = {DBLP:conf/ipco/2007},
  url       = {https://doi.org/10.1007/978-3-540-72792-7_33},
  doi       = {10.1007/978-3-540-72792-7_33},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ipco/FeigeJMM07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2007,
  editor    = {David S. Johnson and
               Uriel Feige},
  title     = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
               San Diego, California, USA, June 11-13, 2007},
  publisher = {{ACM}},
  year      = {2007},
  isbn      = {978-1-59593-631-8},
  timestamp = {Wed, 13 Jun 2007 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FeigeKO07,
  author    = {Uriel Feige and
               Guy Kindler and
               Ryan O'Donnell},
  title     = {Understanding Parallel Repetition Requires Understanding Foams},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {043},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-043/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/FeigeKO07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/FeigeR06,
  author    = {Uriel Feige and
               Daniel Reichman},
  title     = {On the hardness of approximating Max-Satisfy},
  journal   = {Inf. Process. Lett.},
  volume    = {97},
  number    = {1},
  pages     = {31--35},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.ipl.2005.08.012},
  doi       = {10.1016/j.ipl.2005.08.012},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/ipl/FeigeR06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/FeigeL06,
  author    = {Uriel Feige and
               Michael Langberg},
  title     = {The RPR\({}^{\mbox{2}}\) rounding technique for semidefinite programs},
  journal   = {J. Algorithms},
  volume    = {60},
  number    = {1},
  pages     = {1--23},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.jalgor.2004.11.003},
  doi       = {10.1016/j.jalgor.2004.11.003},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jal/FeigeL06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/Feige06,
  author    = {Uriel Feige},
  title     = {On Sums of Independent Random Variables with Unbounded Variance and
               Estimating the Average Degree in a Graph},
  journal   = {{SIAM} J. Comput.},
  volume    = {35},
  number    = {4},
  pages     = {964--984},
  year      = {2006},
  url       = {https://doi.org/10.1137/S0097539704447304},
  doi       = {10.1137/S0097539704447304},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/Feige06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamrev/KrauthgamerF06,
  author    = {Robert Krauthgamer and
               Uriel Feige},
  title     = {A Polylogarithmic Approximation of the Minimum Bisection},
  journal   = {{SIAM} Review},
  volume    = {48},
  number    = {1},
  pages     = {99--130},
  year      = {2006},
  url       = {https://doi.org/10.1137/050640904},
  doi       = {10.1137/050640904},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamrev/KrauthgamerF06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeMV06,
  author    = {Uriel Feige and
               Elchanan Mossel and
               Dan Vilenchik},
  title     = {Complete Convergence of Message Passing Algorithms for Some Satisfiability
               Problems},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 9th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
               Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
               Spain, August 28-30 2006, Proceedings},
  pages     = {339--350},
  year      = {2006},
  crossref  = {DBLP:conf/approx/2006},
  url       = {https://doi.org/10.1007/11830924_32},
  doi       = {10.1007/11830924_32},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeMV06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeKO06,
  author    = {Uriel Feige and
               Jeong Han Kim and
               Eran Ofek},
  title     = {Witnesses for non-satisfiability of dense random 3CNF formulas},
  booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
  pages     = {497--508},
  year      = {2006},
  crossref  = {DBLP:conf/focs/2006},
  url       = {https://doi.org/10.1109/FOCS.2006.78},
  doi       = {10.1109/FOCS.2006.78},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeKO06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeV06,
  author    = {Uriel Feige and
               Jan Vondr{\'{a}}k},
  title     = {Approximation algorithms for allocation problems: Improving the factor
               of 1 - 1/e},
  booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
  pages     = {667--676},
  year      = {2006},
  crossref  = {DBLP:conf/focs/2006},
  url       = {https://doi.org/10.1109/FOCS.2006.14},
  doi       = {10.1109/FOCS.2006.14},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeV06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/DemaineHFS06,
  author    = {Erik D. Demaine and
               Mohammad Taghi Hajiaghayi and
               Uriel Feige and
               Mohammad R. Salavatipour},
  title     = {Combination can be hard: approximability of the unique coverage problem},
  booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages     = {162--171},
  year      = {2006},
  crossref  = {DBLP:conf/soda/2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557.1109577},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/DemaineHFS06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feige06,
  author    = {Uriel Feige},
  title     = {On maximizing welfare when utility functions are subadditive},
  booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
               Seattle, WA, USA, May 21-23, 2006},
  pages     = {41--50},
  year      = {2006},
  crossref  = {DBLP:conf/stoc/2006},
  url       = {http://doi.acm.org/10.1145/1132516.1132523},
  doi       = {10.1145/1132516.1132523},
  timestamp = {Thu, 28 Sep 2006 09:38:26 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/Feige06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeM06,
  author    = {Uriel Feige and
               Mohammad Mahdian},
  title     = {Finding small balanced separators},
  booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
               Seattle, WA, USA, May 21-23, 2006},
  pages     = {375--384},
  year      = {2006},
  crossref  = {DBLP:conf/stoc/2006},
  url       = {http://doi.acm.org/10.1145/1132516.1132573},
  doi       = {10.1145/1132516.1132573},
  timestamp = {Thu, 28 Sep 2006 09:38:26 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeM06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0603084,
  author    = {Uriel Feige and
               Eran Ofek},
  title     = {Random 3CNF formulas elude the Lovasz theta function},
  journal   = {CoRR},
  volume    = {abs/cs/0603084},
  year      = {2006},
  url       = {http://arxiv.org/abs/cs/0603084},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-cs-0603084},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/OfekF06,
  author    = {Eran Ofek and
               Uriel Feige},
  title     = {Random 3CNF formulas elude the Lovasz theta function},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {043},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-043/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/OfekF06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ploscb/FrumkinWKFS05,
  author    = {Dan Frumkin and
               Adam Wasserstrom and
               Shai Kaplan and
               Uriel Feige and
               Ehud Y. Shapiro},
  title     = {Genomic Variability within an Organism Exposes Its Cell Lineage Tree},
  journal   = {PLoS Computational Biology},
  volume    = {1},
  number    = {6},
  year      = {2005},
  url       = {https://doi.org/10.1371/journal.pcbi.0010050},
  doi       = {10.1371/journal.pcbi.0010050},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/ploscb/FrumkinWKFS05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/FeigeO05,
  author    = {Uriel Feige and
               Eran Ofek},
  title     = {Spectral techniques applied to sparse random graphs},
  journal   = {Random Struct. Algorithms},
  volume    = {27},
  number    = {2},
  pages     = {251--275},
  year      = {2005},
  url       = {https://doi.org/10.1002/rsa.20089},
  doi       = {10.1002/rsa.20089},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/FeigeO05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/ChlamtacF05,
  author    = {Eden Chlamtac and
               Uriel Feige},
  title     = {Improved approximation of the minimum cover time},
  journal   = {Theor. Comput. Sci.},
  volume    = {341},
  number    = {1-3},
  pages     = {22--38},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.tcs.2005.03.042},
  doi       = {10.1016/j.tcs.2005.03.042},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/tcs/ChlamtacF05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeT05,
  author    = {Uriel Feige and
               Kunal Talwar},
  title     = {Approximating the Bandwidth of Caterpillars},
  booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
               and Techniques, 8th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
               on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
               August 22-24, 2005, Proceedings},
  pages     = {62--73},
  year      = {2005},
  crossref  = {DBLP:conf/approx/2005},
  url       = {https://doi.org/10.1007/11538462_6},
  doi       = {10.1007/11538462_6},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeT05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeO05,
  author    = {Uriel Feige and
               Eran Ofek},
  title     = {Finding a Maximum Independent Set in a Sparse Random Graph},
  booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
               and Techniques, 8th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
               on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
               August 22-24, 2005, Proceedings},
  pages     = {282--293},
  year      = {2005},
  crossref  = {DBLP:conf/approx/2005},
  url       = {https://doi.org/10.1007/11538462_24},
  doi       = {10.1007/11538462_24},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeO05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Feige05,
  author    = {Uriel Feige},
  title     = {Rigorous analysis of heuristics for NP-hard problems},
  booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  pages     = {927},
  year      = {2005},
  crossref  = {DBLP:conf/soda/2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432.1070564},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/Feige05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeHL05,
  author    = {Uriel Feige and
               Mohammad Taghi Hajiaghayi and
               James R. Lee},
  title     = {Improved approximation algorithms for minimum-weight vertex separators},
  booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
               Baltimore, MD, USA, May 22-24, 2005},
  pages     = {563--572},
  year      = {2005},
  crossref  = {DBLP:conf/stoc/2005},
  url       = {http://doi.acm.org/10.1145/1060590.1060674},
  doi       = {10.1145/1060590.1060674},
  timestamp = {Wed, 15 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeHL05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/wine/FeigeFHK05,
  author    = {Uriel Feige and
               Abraham Flaxman and
               Jason D. Hartline and
               Robert D. Kleinberg},
  title     = {On the Competitive Ratio of the Random Sampling Auction},
  booktitle = {Internet and Network Economics, First International Workshop, {WINE}
               2005, Hong Kong, China, December 15-17, 2005, Proceedings},
  pages     = {878--886},
  year      = {2005},
  crossref  = {DBLP:conf/wine/2005},
  url       = {https://doi.org/10.1007/11600930_89},
  doi       = {10.1007/11600930_89},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/wine/FeigeFHK05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-050,
  author    = {Uriel Feige and
               Eran Ofek},
  title     = {Finding a Maximum Independent Set in a Sparse Random Graph},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {050},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-050/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/ECCC-TR05-050},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeLT04,
  author    = {Uriel Feige and
               L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
               Prasad Tetali},
  title     = {Approximating Min Sum Set Cover},
  journal   = {Algorithmica},
  volume    = {40},
  number    = {4},
  pages     = {219--234},
  year      = {2004},
  url       = {https://doi.org/10.1007/s00453-004-1110-5},
  doi       = {10.1007/s00453-004-1110-5},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/algorithmica/FeigeLT04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FeigeM04,
  author    = {Uriel Feige and
               Daniele Micciancio},
  title     = {The inapproximability of lattice and coding problems with preprocessing},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {69},
  number    = {1},
  pages     = {45--67},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.jcss.2004.01.002},
  doi       = {10.1016/j.jcss.2004.01.002},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jcss/FeigeM04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeLS04,
  author    = {Uriel Feige and
               Michael Langberg and
               Gideon Schechtman},
  title     = {Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers},
  journal   = {{SIAM} J. Comput.},
  volume    = {33},
  number    = {6},
  pages     = {1338--1368},
  year      = {2004},
  url       = {https://doi.org/10.1137/S0097539703431391},
  doi       = {10.1137/S0097539703431391},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeLS04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/Feige04,
  author    = {Uriel Feige},
  title     = {Approximating Maximum Clique by Removing Subgraphs},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {18},
  number    = {2},
  pages     = {219--225},
  year      = {2004},
  url       = {https://doi.org/10.1137/S089548010240415X},
  doi       = {10.1137/S089548010240415X},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamdm/Feige04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeR04,
  author    = {Uriel Feige and
               Daniel Reichman},
  title     = {On Systems of Linear Equations with Two Variables per Equation},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
               and Techniques, 7th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
               Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
               MA, USA, August 22-24, 2004, Proceedings},
  pages     = {117--127},
  year      = {2004},
  crossref  = {DBLP:conf/approx/2004},
  url       = {https://doi.org/10.1007/978-3-540-27821-4_11},
  doi       = {10.1007/978-3-540-27821-4_11},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeR04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeigeO04,
  author    = {Uriel Feige and
               Eran Ofek},
  title     = {Easily Refutable Subformulas of Large Random 3CNF Formulas},
  booktitle = {Automata, Languages and Programming: 31st International Colloquium,
               {ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
  pages     = {519--530},
  year      = {2004},
  crossref  = {DBLP:conf/icalp/2004},
  url       = {https://doi.org/10.1007/978-3-540-27836-8_45},
  doi       = {10.1007/978-3-540-27836-8_45},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/FeigeO04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feige04,
  author    = {Uriel Feige},
  title     = {On sums of independent random variables with unbounded variance, and
               estimating the average degree in a graph},
  booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
               Chicago, IL, USA, June 13-16, 2004},
  pages     = {594--603},
  year      = {2004},
  crossref  = {DBLP:conf/stoc/2004},
  url       = {http://doi.acm.org/10.1145/1007352.1007443},
  doi       = {10.1145/1007352.1007443},
  timestamp = {Wed, 15 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/Feige04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-119,
  author    = {Uriel Feige and
               Daniel Reichman},
  title     = {On The Hardness of Approximating Max-Satisfy},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {119},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-119/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/ECCC-TR04-119},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dam/FeigeKN03,
  author    = {Uriel Feige and
               Robert Krauthgamer and
               Kobbi Nissim},
  title     = {On Cutting a Few Vertices from a Graph},
  journal   = {Discrete Applied Mathematics},
  volume    = {127},
  number    = {3},
  pages     = {643--649},
  year      = {2003},
  url       = {https://doi.org/10.1016/S0166-218X(02)00394-3},
  doi       = {10.1016/S0166-218X(02)00394-3},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/dam/FeigeKN03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/FeigeY03,
  author    = {Uriel Feige and
               Orly Yahalom},
  title     = {On the complexity of finding balanced oneway cuts},
  journal   = {Inf. Process. Lett.},
  volume    = {87},
  number    = {1},
  pages     = {1--5},
  year      = {2003},
  url       = {https://doi.org/10.1016/S0020-0190(03)00251-5},
  doi       = {10.1016/S0020-0190(03)00251-5},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/ipl/FeigeY03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/FeigeR03,
  author    = {Uriel Feige and
               Yuri Rabinovich},
  title     = {Deterministic approximation of the cover time},
  journal   = {Random Struct. Algorithms},
  volume    = {23},
  number    = {1},
  pages     = {1--22},
  year      = {2003},
  url       = {https://doi.org/10.1002/rsa.10083},
  doi       = {10.1002/rsa.10083},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/FeigeR03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeK03,
  author    = {Uriel Feige and
               Robert Krauthgamer},
  title     = {The Probable Value of the Lov{\'{a}}sz--Schrijver Relaxations
               for Maximum Independent Set},
  journal   = {{SIAM} J. Comput.},
  volume    = {32},
  number    = {2},
  pages     = {345--370},
  year      = {2003},
  url       = {https://doi.org/10.1137/S009753970240118X},
  doi       = {10.1137/S009753970240118X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeK03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0304039,
  author    = {Uriel Feige},
  title     = {Approximation thresholds for combinatorial optimization problems},
  journal   = {CoRR},
  volume    = {cs.CC/0304039},
  year      = {2003},
  url       = {http://arxiv.org/abs/cs.CC/0304039},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/cs-CC-0304039},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorica/FeigeS02,
  author    = {Uriel Feige and
               Christian Scheideler},
  title     = {Improved Bounds for Acyclic Job Shop Scheduling},
  journal   = {Combinatorica},
  volume    = {22},
  number    = {3},
  pages     = {361--399},
  year      = {2002},
  url       = {https://doi.org/10.1007/s004930200018},
  doi       = {10.1007/s004930200018},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/combinatorica/FeigeS02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorica/FeigeV02,
  author    = {Uriel Feige and
               Oleg Verbitsky},
  title     = {Error Reduction by Parallel Repetition - {A} Negative Result},
  journal   = {Combinatorica},
  volume    = {22},
  number    = {4},
  pages     = {461--478},
  year      = {2002},
  url       = {https://doi.org/10.1007/s00493-002-0001-0},
  doi       = {10.1007/s00493-002-0001-0},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/combinatorica/FeigeV02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/FeigeKL02,
  author    = {Uriel Feige and
               Marek Karpinski and
               Michael Langberg},
  title     = {Improved approximation of Max-Cut on graphs of bounded degree},
  journal   = {J. Algorithms},
  volume    = {43},
  number    = {2},
  pages     = {201--219},
  year      = {2002},
  url       = {https://doi.org/10.1016/S0196-6774(02)00005-6},
  doi       = {10.1016/S0196-6774(02)00005-6},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jal/FeigeKL02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/FeigeS02,
  author    = {Uriel Feige and
               Gideon Schechtman},
  title     = {On the optimality of the random hyperplane rounding technique for
               {MAX} {CUT}},
  journal   = {Random Struct. Algorithms},
  volume    = {20},
  number    = {3},
  pages     = {403--440},
  year      = {2002},
  url       = {https://doi.org/10.1002/rsa.10036},
  doi       = {10.1002/rsa.10036},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/FeigeS02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeK02,
  author    = {Uriel Feige and
               Robert Krauthgamer},
  title     = {A Polylogarithmic Approximation of the Minimum Bisection},
  journal   = {{SIAM} J. Comput.},
  volume    = {31},
  number    = {4},
  pages     = {1090--1118},
  year      = {2002},
  url       = {https://doi.org/10.1137/S0097539701387660},
  doi       = {10.1137/S0097539701387660},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeK02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeHKS02,
  author    = {Uriel Feige and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Guy Kortsarz and
               Aravind Srinivasan},
  title     = {Approximating the Domatic Number},
  journal   = {{SIAM} J. Comput.},
  volume    = {32},
  number    = {1},
  pages     = {172--195},
  year      = {2002},
  url       = {https://doi.org/10.1137/S0097539700380754},
  doi       = {10.1137/S0097539700380754},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeHKS02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/FeigeR02,
  author    = {Uriel Feige and
               Giora Rayzman},
  title     = {On the drift of short schedules},
  journal   = {Theor. Comput. Sci.},
  volume    = {289},
  number    = {1},
  pages     = {473--484},
  year      = {2002},
  url       = {https://doi.org/10.1016/S0304-3975(01)00326-7},
  doi       = {10.1016/S0304-3975(01)00326-7},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/tcs/FeigeR02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeLT02,
  author    = {Uriel Feige and
               L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
               Prasad Tetali},
  title     = {Approximating Min-sum Set Cover},
  booktitle = {Approximation Algorithms for Combinatorial Optimization, 5th International
               Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
  pages     = {94--107},
  year      = {2002},
  crossref  = {DBLP:conf/approx/2002},
  url       = {https://doi.org/10.1007/3-540-45753-4_10},
  doi       = {10.1007/3-540-45753-4_10},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeLT02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeOW02,
  author    = {Uriel Feige and
               Eran Ofek and
               Udi Wieder},
  title     = {Approximating Maximum Edge Coloring in Multigraphs},
  booktitle = {Approximation Algorithms for Combinatorial Optimization, 5th International
               Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
  pages     = {108--121},
  year      = {2002},
  crossref  = {DBLP:conf/approx/2002},
  url       = {https://doi.org/10.1007/3-540-45753-4_11},
  doi       = {10.1007/3-540-45753-4_11},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeOW02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/Feige02,
  author    = {Uriel Feige},
  title     = {Relations between Average Case Complexity and Approximation Complexity},
  booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
               Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
               2002},
  pages     = {5},
  year      = {2002},
  crossref  = {DBLP:conf/coco/2002},
  url       = {http://doi.ieeecomputersociety.org/10.1109/CCC.2002.10006},
  doi       = {10.1109/CCC.2002.10006},
  timestamp = {Fri, 13 May 2016 10:30:36 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/Feige02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigeM02,
  author    = {Uriel Feige and
               Daniele Micciancio},
  title     = {The Inapproximability of Lattice and Coding Problems with Preprocessing},
  booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
               Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
               2002},
  pages     = {44--52},
  year      = {2002},
  crossref  = {DBLP:conf/coco/2002},
  url       = {https://doi.org/10.1109/CCC.2002.1004338},
  doi       = {10.1109/CCC.2002.1004338},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/FeigeM02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeLS02,
  author    = {Uriel Feige and
               Michael Langberg and
               Gideon Schechtman},
  title     = {Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers},
  booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
               November 2002, Vancouver, BC, Canada, Proceedings},
  pages     = {283--292},
  year      = {2002},
  crossref  = {DBLP:conf/focs/2002},
  url       = {https://doi.org/10.1109/SFCS.2002.1181951},
  doi       = {10.1109/SFCS.2002.1181951},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeLS02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feige02,
  author    = {Uriel Feige},
  title     = {Relations between average case complexity and approximation complexity},
  booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
               May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
  pages     = {534--543},
  year      = {2002},
  crossref  = {DBLP:conf/stoc/2002},
  url       = {http://doi.acm.org/10.1145/509907.509985},
  doi       = {10.1145/509907.509985},
  timestamp = {Thu, 16 Feb 2012 12:04:12 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/Feige02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigePK01,
  author    = {Uriel Feige and
               Guy Kortsarz and
               David Peleg},
  title     = {The Dense \emph{k}-Subgraph Problem},
  journal   = {Algorithmica},
  volume    = {29},
  number    = {3},
  pages     = {410--421},
  year      = {2001},
  url       = {https://doi.org/10.1007/s004530010050},
  doi       = {10.1007/s004530010050},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/algorithmica/FeigePK01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/FeigeKL01,
  author    = {Uriel Feige and
               Marek Karpinski and
               Michael Langberg},
  title     = {A note on approximating Max-Bisection on regular graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {79},
  number    = {4},
  pages     = {181--188},
  year      = {2001},
  url       = {https://doi.org/10.1016/S0020-0190(00)00189-7},
  doi       = {10.1016/S0020-0190(00)00189-7},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/ipl/FeigeKL01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/FeigeL01,
  author    = {Uriel Feige and
               Michael Langberg},
  title     = {Approximation Algorithms for Maximization Problems Arising in Graph
               Partitioning},
  journal   = {J. Algorithms},
  volume    = {41},
  number    = {2},
  pages     = {174--211},
  year      = {2001},
  url       = {https://doi.org/10.1006/jagm.2001.1183},
  doi       = {10.1006/jagm.2001.1183},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jal/FeigeL01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FeigeK01,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {Heuristics for Semirandom Graph Problems},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {63},
  number    = {4},
  pages     = {639--671},
  year      = {2001},
  url       = {https://doi.org/10.1006/jcss.2001.1773},
  doi       = {10.1006/jcss.2001.1773},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jcss/FeigeK01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeigeL01,
  author    = {Uriel Feige and
               Michael Langberg},
  title     = {The RPR\({}^{\mbox{2}}\) Rounding Technique for Semidefinite Programs},
  booktitle = {Automata, Languages and Programming, 28th International Colloquium,
               {ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
  pages     = {213--224},
  year      = {2001},
  crossref  = {DBLP:conf/icalp/2001},
  url       = {https://doi.org/10.1007/3-540-48224-5_18},
  doi       = {10.1007/3-540-48224-5_18},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/FeigeL01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeS01,
  author    = {Uriel Feige and
               Gideon Schechtman},
  title     = {On the integrality ratio of semidefinite relaxations of {MAX} {CUT}},
  booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
               July 6-8, 2001, Heraklion, Crete, Greece},
  pages     = {433--442},
  year      = {2001},
  crossref  = {DBLP:conf/stoc/2001},
  url       = {http://doi.acm.org/10.1145/380752.380837},
  doi       = {10.1145/380752.380837},
  timestamp = {Thu, 16 Feb 2012 12:04:51 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeS01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dc/FeigeK00,
  author    = {Uriel Feige and
               Robert Krauthgamer},
  title     = {Networks on Which Hot-Potato Routing Does Not Livelock},
  journal   = {Distributed Computing},
  volume    = {13},
  number    = {1},
  pages     = {53--58},
  year      = {2000},
  url       = {https://doi.org/10.1007/s004460050005},
  doi       = {10.1007/s004460050005},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/dc/FeigeK00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/FeigeK00,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {Finding {OR} in a noisy broadcast network},
  journal   = {Inf. Process. Lett.},
  volume    = {73},
  number    = {1-2},
  pages     = {69--75},
  year      = {2000},
  url       = {https://doi.org/10.1016/S0020-0190(00)00002-8},
  doi       = {10.1016/S0020-0190(00)00002-8},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/ipl/FeigeK00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/Feige00,
  author    = {Uriel Feige},
  title     = {Approximating the Bandwidth via Volume Respecting Embeddings},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {60},
  number    = {3},
  pages     = {510--539},
  year      = {2000},
  url       = {https://doi.org/10.1006/jcss.1999.1682},
  doi       = {10.1006/jcss.1999.1682},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jcss/Feige00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/FeigeK00,
  author    = {Uriel Feige and
               Robert Krauthgamer},
  title     = {Finding and certifying a large hidden clique in a semirandom graph},
  journal   = {Random Struct. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {195--208},
  year      = {2000},
  url       = {https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A},
  doi       = {10.1002/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/FeigeK00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeK00,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {Two-Prover Protocols - Low Error at Affordable Rates},
  journal   = {{SIAM} J. Comput.},
  volume    = {30},
  number    = {1},
  pages     = {324--346},
  year      = {2000},
  url       = {https://doi.org/10.1137/S0097539797325375},
  doi       = {10.1137/S0097539797325375},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeK00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/AumannBF00,
  author    = {Yonatan Aumann and
               Judit Bar{-}Ilan and
               Uriel Feige},
  title     = {On the cost of recomputing: Tight bounds on pebbling with faults},
  journal   = {Theor. Comput. Sci.},
  volume    = {233},
  number    = {1-2},
  pages     = {247--261},
  year      = {2000},
  url       = {https://doi.org/10.1016/S0304-3975(98)00085-1},
  doi       = {10.1016/S0304-3975(98)00085-1},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/tcs/AumannBF00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeLN00,
  author    = {Uriel Feige and
               Michael Langberg and
               Kobbi Nissim},
  title     = {On the hardness of approximating \emph{N P} witnesses},
  booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
               Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
               5-8, 2000, Proceedings},
  pages     = {120--131},
  year      = {2000},
  crossref  = {DBLP:conf/approx/2000},
  url       = {https://doi.org/10.1007/3-540-44436-X_13},
  doi       = {10.1007/3-540-44436-X_13},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeLN00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeK00,
  author    = {Uriel Feige and
               Robert Krauthgamer},
  title     = {A polylogarithmic approximation of the minimum bisection},
  booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
               12-14 November 2000, Redondo Beach, California, {USA}},
  pages     = {105--115},
  year      = {2000},
  crossref  = {DBLP:conf/focs/2000},
  url       = {https://doi.org/10.1109/SFCS.2000.892070},
  doi       = {10.1109/SFCS.2000.892070},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeK00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/BroderF00,
  author    = {Andrei Z. Broder and
               Uriel Feige},
  title     = {Min-Wise versus linear independence (extended abstract)},
  booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 9-11, 2000, San Francisco, CA, {USA.}},
  pages     = {147--154},
  year      = {2000},
  crossref  = {DBLP:conf/soda/2000},
  url       = {http://dl.acm.org/citation.cfm?id=338219.338246},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/BroderF00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeHK00,
  author    = {Uriel Feige and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Guy Kortsarz},
  title     = {Approximating the domatic number},
  booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
               of Computing, May 21-23, 2000, Portland, OR, {USA}},
  pages     = {134--143},
  year      = {2000},
  crossref  = {DBLP:conf/stoc/2000},
  url       = {http://doi.acm.org/10.1145/335305.335321},
  doi       = {10.1145/335305.335321},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeHK00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeKN00,
  author    = {Uriel Feige and
               Robert Krauthgamer and
               Kobbi Nissim},
  title     = {Approximating the minimum bisection size (extended abstract)},
  booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
               of Computing, May 21-23, 2000, Portland, OR, {USA}},
  pages     = {530--536},
  year      = {2000},
  crossref  = {DBLP:conf/stoc/2000},
  url       = {http://doi.acm.org/10.1145/335305.335370},
  doi       = {10.1145/335305.335370},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeKN00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/swat/Feige00,
  author    = {Uriel Feige},
  title     = {Coping with the NP-Hardness of the Graph Bandwidth Problem},
  booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
               Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
  pages     = {10--19},
  year      = {2000},
  crossref  = {DBLP:conf/swat/2000},
  url       = {https://doi.org/10.1007/3-540-44985-X_2},
  doi       = {10.1007/3-540-44985-X_2},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/swat/Feige00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-021,
  author    = {Uriel Feige and
               Marek Karpinski and
               Michael Langberg},
  title     = {Improved Approximation of {MAX-CUT} on Graphs of Bounded Degree},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {7},
  number    = {21},
  year      = {2000},
  url       = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-021/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/ECCC-TR00-021},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-043,
  author    = {Uriel Feige and
               Marek Karpinski and
               Michael Langberg},
  title     = {A Note on Approximating {MAX-BISECTION} on Regular Graphs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {7},
  number    = {43},
  year      = {2000},
  url       = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-043/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/ECCC-TR00-043},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeLS99,
  author    = {Uriel Feige and
               Dror Lapidot and
               Adi Shamir},
  title     = {Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions},
  journal   = {{SIAM} J. Comput.},
  volume    = {29},
  number    = {1},
  pages     = {1--28},
  year      = {1999},
  url       = {https://doi.org/10.1137/S0097539792230010},
  doi       = {10.1137/S0097539792230010},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeLS99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/Feige99,
  author    = {Uriel Feige},
  title     = {Noncryptographic Selection Protocols},
  booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
               17-18 October, 1999, New York, NY, {USA}},
  pages     = {142--153},
  year      = {1999},
  crossref  = {DBLP:conf/focs/1999},
  url       = {https://doi.org/10.1109/SFFCS.1999.814586},
  doi       = {10.1109/SFFCS.1999.814586},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/Feige99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/random/Feige99,
  author    = {Uriel Feige},
  title     = {Randomized Rounding for Semidefinite Programs-Variations on the {MAX}
               {CUT} Example},
  booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
               Third International Workshop on Randomization and Approximation Techniques
               in Computer Science, and Second International Workshop on Approximation
               Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
               Berkeley, CA, USA, August 8-11, 1999, Proceedings},
  pages     = {189--196},
  year      = {1999},
  crossref  = {DBLP:conf/random/1999},
  url       = {https://doi.org/10.1007/978-3-540-48413-4_20},
  doi       = {10.1007/978-3-540-48413-4_20},
  timestamp = {Wed, 24 May 2017 15:40:45 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/random/Feige99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feige99,
  author    = {Uriel Feige},
  title     = {Nonmonotonic Phenomena in Packet Routing},
  booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages     = {583--591},
  year      = {1999},
  crossref  = {DBLP:conf/stoc/1999},
  url       = {http://doi.acm.org/10.1145/301250.301409},
  doi       = {10.1145/301250.301409},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/Feige99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/Feige98,
  author    = {Uriel Feige},
  title     = {A Threshold of ln \emph{n} for Approximating Set Cover},
  journal   = {J. {ACM}},
  volume    = {45},
  number    = {4},
  pages     = {634--652},
  year      = {1998},
  url       = {http://doi.acm.org/10.1145/285055.285059},
  doi       = {10.1145/285055.285059},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jacm/Feige98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FeigeK98,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {Zero Knowledge and the Chromatic Number},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {57},
  number    = {2},
  pages     = {187--199},
  year      = {1998},
  url       = {https://doi.org/10.1006/jcss.1998.1587},
  doi       = {10.1006/jcss.1998.1587},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jcss/FeigeK98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeK98,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {Heuristics for Finding Large Independent Sets, with Applications to
               Coloring Semi-Random Graphs},
  booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
               November 8-11, 1998, Palo Alto, California, {USA}},
  pages     = {674--683},
  year      = {1998},
  crossref  = {DBLP:conf/focs/1998},
  url       = {https://doi.org/10.1109/SFCS.1998.743518},
  doi       = {10.1109/SFCS.1998.743518},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeK98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feige98,
  author    = {Uriel Feige},
  title     = {Approximating the Bandwidth via Volume Respecting Embeddings (Extended
               Abstract)},
  booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
               of Computing, Dallas, Texas, USA, May 23-26, 1998},
  pages     = {90--99},
  year      = {1998},
  crossref  = {DBLP:conf/stoc/1998},
  url       = {http://doi.acm.org/10.1145/276698.276716},
  doi       = {10.1145/276698.276716},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/Feige98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeS98,
  author    = {Uriel Feige and
               Christian Scheideler},
  title     = {Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)},
  booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
               of Computing, Dallas, Texas, USA, May 23-26, 1998},
  pages     = {624--633},
  year      = {1998},
  crossref  = {DBLP:conf/stoc/1998},
  url       = {http://doi.acm.org/10.1145/276698.276878},
  doi       = {10.1145/276698.276878},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeS98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/FeigeL97,
  author    = {Uriel Feige and
               Carsten Lund},
  title     = {On the Hardness of Computing the Permanent of Random Matrices},
  journal   = {Computational Complexity},
  volume    = {6},
  number    = {2},
  pages     = {101--132},
  year      = {1997},
  url       = {https://doi.org/10.1007/BF01262928},
  doi       = {10.1007/BF01262928},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/cc/FeigeL97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/Feige97,
  author    = {Uriel Feige},
  title     = {Collecting Coupons on Trees, and the Cover Time of Random Walks},
  journal   = {Computational Complexity},
  volume    = {6},
  number    = {4},
  pages     = {341--356},
  year      = {1997},
  url       = {https://doi.org/10.1007/BF01270386},
  doi       = {10.1007/BF01270386},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/cc/Feige97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cjtcs/FeigeK97,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {On Limited versus Polynomial Nondeterminism},
  journal   = {Chicago J. Theor. Comput. Sci.},
  volume    = {1997},
  year      = {1997},
  url       = {http://cjtcs.cs.uchicago.edu/articles/1997/1/contents.html},
  timestamp = {Thu, 08 Jul 2004 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/cjtcs/FeigeK97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorica/Feige97,
  author    = {Uriel Feige},
  title     = {Randomized Graph Products, Chromatic Numbers, and the Lov{\'{a}}sz
               vartheta-Funktion},
  journal   = {Combinatorica},
  volume    = {17},
  number    = {1},
  pages     = {79--90},
  year      = {1997},
  url       = {https://doi.org/10.1007/BF01196133},
  doi       = {10.1007/BF01196133},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/combinatorica/Feige97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/Feige97,
  author    = {Uriel Feige},
  title     = {A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {54},
  number    = {2},
  pages     = {305--316},
  year      = {1997},
  url       = {https://doi.org/10.1006/jcss.1997.1471},
  doi       = {10.1006/jcss.1997.1471},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jcss/Feige97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FeigeR97,
  author    = {Uriel Feige and
               Giora Rayzman},
  title     = {On the Drift of Short Schedules},
  booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
               Italy, March 12-14, 1997, Proceedings},
  pages     = {74--85},
  year      = {1997},
  crossref  = {DBLP:conf/ciac/1997},
  url       = {https://doi.org/10.1007/3-540-62592-5_62},
  doi       = {10.1007/3-540-62592-5_62},
  timestamp = {Mon, 22 May 2017 17:11:16 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ciac/FeigeR97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/istcs/FeigeK97,
  author    = {Uriel Feige and
               Robert Krauthgamer},
  title     = {Stereoscopic families of permutations, and their applications},
  booktitle = {Fifth Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings},
  pages     = {85--95},
  year      = {1997},
  crossref  = {DBLP:conf/istcs/1997},
  url       = {https://doi.org/10.1109/ISTCS.1997.595160},
  doi       = {10.1109/ISTCS.1997.595160},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/istcs/FeigeK97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeK97,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {Making Games Short (Extended Abstract)},
  booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
               of Computing, El Paso, Texas, USA, May 4-6, 1997},
  pages     = {506--516},
  year      = {1997},
  crossref  = {DBLP:conf/stoc/1997},
  url       = {http://doi.acm.org/10.1145/258533.258644},
  doi       = {10.1145/258533.258644},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeK97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/FeigeGLSS96,
  author    = {Uriel Feige and
               Shafi Goldwasser and
               L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
               Shmuel Safra and
               Mario Szegedy},
  title     = {Interactive Proofs and the Hardness of Approximating Cliques},
  journal   = {J. {ACM}},
  volume    = {43},
  number    = {2},
  pages     = {268--292},
  year      = {1996},
  url       = {http://doi.acm.org/10.1145/226643.226652},
  doi       = {10.1145/226643.226652},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jacm/FeigeGLSS96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/BarnesF96,
  author    = {Greg Barnes and
               Uriel Feige},
  title     = {Short Random Walks on Graphs},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {9},
  number    = {1},
  pages     = {19--28},
  year      = {1996},
  url       = {https://doi.org/10.1137/S0895480194264988},
  doi       = {10.1137/S0895480194264988},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamdm/BarnesF96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/CoppersmithFS96,
  author    = {Don Coppersmith and
               Uriel Feige and
               James B. Shearer},
  title     = {Random Walks on Regular and Irregular Graphs},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {9},
  number    = {2},
  pages     = {301--308},
  year      = {1996},
  url       = {https://doi.org/10.1137/S0895480193260595},
  doi       = {10.1137/S0895480193260595},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamdm/CoppersmithFS96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/Feige96,
  author    = {Uriel Feige},
  title     = {A Fast Randomized {LOGSPACE} Algorithm for Graph Connectivity},
  journal   = {Theor. Comput. Sci.},
  volume    = {169},
  number    = {2},
  pages     = {147--160},
  year      = {1996},
  url       = {https://doi.org/10.1016/S0304-3975(96)00118-1},
  doi       = {10.1016/S0304-3975(96)00118-1},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/tcs/Feige96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigeV96,
  author    = {Uriel Feige and
               Oleg Verbitsky},
  title     = {Error Reduction by Parallel Repetition - a Negative Result},
  booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  pages     = {70--76},
  year      = {1996},
  crossref  = {DBLP:conf/coco/1996},
  url       = {https://doi.org/10.1109/CCC.1996.507669},
  doi       = {10.1109/CCC.1996.507669},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/FeigeV96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigeK96,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {Zero Knowledge and the Chromatic Number},
  booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  pages     = {278--287},
  year      = {1996},
  crossref  = {DBLP:conf/coco/1996},
  url       = {https://doi.org/10.1109/CCC.1996.507690},
  doi       = {10.1109/CCC.1996.507690},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/FeigeK96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/istcs/FeigeR96,
  author    = {Uriel Feige and
               Yuri Rabinovich},
  title     = {Deterministic Approximation of the Cover Time},
  booktitle = {Fourth Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1996, Jerusalem, Israel, June 10-12, 1996, Proceedings},
  pages     = {208--218},
  year      = {1996},
  crossref  = {DBLP:conf/istcs/1996},
  timestamp = {Tue, 31 May 2016 15:27:26 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/istcs/FeigeR96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feige96,
  author    = {Uriel Feige},
  title     = {A Threshold of ln \emph{n} for Approximating Set Cover (Preliminary
               Version)},
  booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
               of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
  pages     = {314--318},
  year      = {1996},
  crossref  = {DBLP:conf/stoc/1996},
  url       = {http://doi.acm.org/10.1145/237814.237977},
  doi       = {10.1145/237814.237977},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/Feige96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CanettiFGN96,
  author    = {Ran Canetti and
               Uriel Feige and
               Oded Goldreich and
               Moni Naor},
  title     = {Adaptively Secure Multi-Party Computation},
  booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
               of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
  pages     = {639--648},
  year      = {1996},
  crossref  = {DBLP:conf/stoc/1996},
  url       = {http://doi.acm.org/10.1145/237814.238015},
  doi       = {10.1145/237814.238015},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/CanettiFGN96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/AlonFWZ95,
  author    = {Noga Alon and
               Uriel Feige and
               Avi Wigderson and
               David Zuckerman},
  title     = {Derandomized Graph Products},
  journal   = {Computational Complexity},
  volume    = {5},
  number    = {1},
  pages     = {60--75},
  year      = {1995},
  url       = {https://doi.org/10.1007/BF01277956},
  doi       = {10.1007/BF01277956},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/cc/AlonFWZ95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/Feige95,
  author    = {Uriel Feige},
  title     = {A Tight Upper Bound on the Cover Time for Random Walks on Graphs},
  journal   = {Random Struct. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {51--54},
  year      = {1995},
  url       = {https://doi.org/10.1002/rsa.3240060106},
  doi       = {10.1002/rsa.3240060106},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/Feige95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/Feige95a,
  author    = {Uriel Feige},
  title     = {A Tight Lower Bound on the Cover Time for Random Walks on Graphs},
  journal   = {Random Struct. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {433--438},
  year      = {1995},
  url       = {https://doi.org/10.1002/rsa.3240060406},
  doi       = {10.1002/rsa.3240060406},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/Feige95a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/istcs/Feige95,
  author    = {Uriel Feige},
  title     = {Observations on Hot Potato Routing},
  booktitle = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
  pages     = {30--39},
  year      = {1995},
  crossref  = {DBLP:conf/istcs/1995},
  url       = {https://doi.org/10.1109/ISTCS.1995.377049},
  doi       = {10.1109/ISTCS.1995.377049},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/istcs/Feige95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/istcs/FeigeG95,
  author    = {Uriel Feige and
               Michel X. Goemans},
  title     = {Aproximating the Value of Two Prover Proof Systems, With Applications
               to {MAX} 2SAT and {MAX} {DICUT}},
  booktitle = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
  pages     = {182--189},
  year      = {1995},
  crossref  = {DBLP:conf/istcs/1995},
  url       = {https://doi.org/10.1109/ISTCS.1995.377033},
  doi       = {10.1109/ISTCS.1995.377033},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/istcs/FeigeG95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/istcs/BellareFK95,
  author    = {Mihir Bellare and
               Uriel Feige and
               Joe Kilian},
  title     = {On the Role of Shared Randomness in Two Prover Proof Systems},
  booktitle = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
  pages     = {199--208},
  year      = {1995},
  crossref  = {DBLP:conf/istcs/1995},
  url       = {https://doi.org/10.1109/ISTCS.1995.377031},
  doi       = {10.1109/ISTCS.1995.377031},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/istcs/BellareFK95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeK95,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {Impossibility results for recycling random bits in two-prover proof
               systems},
  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
               of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
  pages     = {457--468},
  year      = {1995},
  crossref  = {DBLP:conf/stoc/STOC27},
  url       = {http://doi.acm.org/10.1145/225058.225183},
  doi       = {10.1145/225058.225183},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeK95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feige95,
  author    = {Uriel Feige},
  title     = {Randomized graph products, chromatic numbers, and Lovasz theta-function},
  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
               of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
  pages     = {635--640},
  year      = {1995},
  crossref  = {DBLP:conf/stoc/STOC27},
  url       = {http://doi.acm.org/10.1145/225058.225281},
  doi       = {10.1145/225058.225281},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/Feige95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeRPU94,
  author    = {Uriel Feige and
               Prabhakar Raghavan and
               David Peleg and
               Eli Upfal},
  title     = {Computing with Noisy Information},
  journal   = {{SIAM} J. Comput.},
  volume    = {23},
  number    = {5},
  pages     = {1001--1018},
  year      = {1994},
  url       = {https://doi.org/10.1137/S0097539791195877},
  doi       = {10.1137/S0097539791195877},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeRPU94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AumannBF94,
  author    = {Yonatan Aumann and
               Judit Bar{-}Ilan and
               Uriel Feige},
  title     = {On the Cost of Recomputing: Tight Bounds on Pebbling with Faults},
  booktitle = {Automata, Languages and Programming, 21st International Colloquium,
               ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
  pages     = {47--58},
  year      = {1994},
  crossref  = {DBLP:conf/icalp/1994},
  url       = {https://doi.org/10.1007/3-540-58201-0_57},
  doi       = {10.1007/3-540-58201-0_57},
  timestamp = {Thu, 21 Sep 2017 12:05:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/AumannBF94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Feige94,
  author    = {Uriel Feige},
  title     = {A Fast Randomized {LOGSPACE} Algorithm for Graph Connectivity},
  booktitle = {Automata, Languages and Programming, 21st International Colloquium,
               ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
  pages     = {499--507},
  year      = {1994},
  crossref  = {DBLP:conf/icalp/1994},
  url       = {https://doi.org/10.1007/3-540-58201-0_93},
  doi       = {10.1007/3-540-58201-0_93},
  timestamp = {Thu, 21 Sep 2017 12:05:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/Feige94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeK94,
  author    = {Uriel Feige and
               Joe Kilian},
  title     = {Two prover protocols: low error at affordable rates},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
               Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
               Canada},
  pages     = {172--183},
  year      = {1994},
  crossref  = {DBLP:conf/stoc/STOC26},
  url       = {http://doi.acm.org/10.1145/195058.195128},
  doi       = {10.1145/195058.195128},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeK94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeKN94,
  author    = {Uriel Feige and
               Joe Kilian and
               Moni Naor},
  title     = {A minimal model for secure computation (extended abstract)},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
               Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
               Canada},
  pages     = {554--563},
  year      = {1994},
  crossref  = {DBLP:conf/stoc/STOC26},
  url       = {http://doi.acm.org/10.1145/195058.195408},
  doi       = {10.1145/195058.195408},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeKN94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/crypto/AumannF93,
  author    = {Yonatan Aumann and
               Uriel Feige},
  title     = {On Message Proof Systems with Known Space Verifiers},
  booktitle = {Advances in Cryptology - {CRYPTO} '93, 13th Annual International Cryptology
               Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings},
  pages     = {85--99},
  year      = {1993},
  crossref  = {DBLP:conf/crypto/1993},
  url       = {https://doi.org/10.1007/3-540-48329-2_8},
  doi       = {10.1007/3-540-48329-2_8},
  timestamp = {Sat, 20 May 2017 15:32:52 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/crypto/AumannF93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/Feige93,
  author    = {Uriel Feige},
  title     = {A Randomized Time-Space Tradeoff of {\textbackslash}tildeO(m{\textbackslash}tildeR)
               for {USTCON}},
  booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
               California, USA, 3-5 November 1993},
  pages     = {238--246},
  year      = {1993},
  crossref  = {DBLP:conf/focs/FOCS34},
  url       = {https://doi.org/10.1109/SFCS.1993.366863},
  doi       = {10.1109/SFCS.1993.366863},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/Feige93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarnesF93,
  author    = {Greg Barnes and
               Uriel Feige},
  title     = {Short random walks on graphs},
  booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
               Computing, May 16-18, 1993, San Diego, CA, {USA}},
  pages     = {728--737},
  year      = {1993},
  crossref  = {DBLP:conf/stoc/STOC25},
  url       = {http://doi.acm.org/10.1145/167088.167275},
  doi       = {10.1145/167088.167275},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/BarnesF93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/Feige92,
  author    = {Uriel Feige},
  title     = {On the Complexity of Finite Random Functions},
  journal   = {Inf. Process. Lett.},
  volume    = {44},
  number    = {6},
  pages     = {295--296},
  year      = {1992},
  url       = {https://doi.org/10.1016/0020-0190(92)90102-2},
  doi       = {10.1016/0020-0190(92)90102-2},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/ipl/Feige92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FeigeS92,
  author    = {Uriel Feige and
               Adi Shamir},
  title     = {Multi-Oracle Interactive Protocols with Constant Space Verifiers},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {44},
  number    = {2},
  pages     = {259--271},
  year      = {1992},
  url       = {https://doi.org/10.1016/0022-0000(92)90021-A},
  doi       = {10.1016/0022-0000(92)90021-A},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jcss/FeigeS92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/crypto/DworkFKNS92,
  author    = {Cynthia Dwork and
               Uriel Feige and
               Joe Kilian and
               Moni Naor and
               Shmuel Safra},
  title     = {Low Communication 2-Prover Zero-Knowledge Proofs for {NP}},
  booktitle = {Advances in Cryptology - {CRYPTO} '92, 12th Annual International Cryptology
               Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings},
  pages     = {215--227},
  year      = {1992},
  crossref  = {DBLP:conf/crypto/1992},
  url       = {https://doi.org/10.1007/3-540-48071-4_15},
  doi       = {10.1007/3-540-48071-4_15},
  timestamp = {Sat, 20 May 2017 15:32:52 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/crypto/DworkFKNS92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeR92,
  author    = {Uriel Feige and
               Prabhakar Raghavan},
  title     = {Exact Analysis of Hot-Potato Routing (Extended Abstract)},
  booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
               Pennsylvania, USA, 24-27 October 1992},
  pages     = {553--562},
  year      = {1992},
  crossref  = {DBLP:conf/focs/FOCS33},
  url       = {https://doi.org/10.1109/SFCS.1992.267796},
  doi       = {10.1109/SFCS.1992.267796},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeR92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeL92,
  author    = {Uriel Feige and
               Carsten Lund},
  title     = {On the Hardness of Computing the Permanent of Random Matrices (Extended
               Abstract)},
  booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
               May 4-6, 1992, Victoria, British Columbia, Canada},
  pages     = {643--654},
  year      = {1992},
  crossref  = {DBLP:conf/stoc/STOC24},
  url       = {http://doi.acm.org/10.1145/129712.129775},
  doi       = {10.1145/129712.129775},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeL92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeL92a,
  author    = {Uriel Feige and
               L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
  title     = {Two-Prover One-Round Proof Systems: Their Power and Their Problems
               (Extended Abstract)},
  booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
               May 4-6, 1992, Victoria, British Columbia, Canada},
  pages     = {733--744},
  year      = {1992},
  crossref  = {DBLP:conf/stoc/STOC24},
  url       = {http://doi.acm.org/10.1145/129712.129783},
  doi       = {10.1145/129712.129783},
  timestamp = {Thu, 20 Oct 2011 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeL92a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/Feige91,
  author    = {Uriel Feige},
  title     = {On the Success Probability of the Two Provers in One-Round Proof Systems},
  booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
               Chicago, Illinois, USA, June 30 - July 3, 1991},
  pages     = {116--123},
  year      = {1991},
  crossref  = {DBLP:conf/coco/1991},
  url       = {https://doi.org/10.1109/SCT.1991.160251},
  doi       = {10.1109/SCT.1991.160251},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/Feige91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeGLSS91,
  author    = {Uriel Feige and
               Shafi Goldwasser and
               L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
               Shmuel Safra and
               Mario Szegedy},
  title     = {Approximating Clique is Almost NP-Complete (Preliminary Version)},
  booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
               Puerto Rico, 1-4 October 1991},
  pages     = {2--12},
  year      = {1991},
  crossref  = {DBLP:conf/focs/FOCS32},
  url       = {https://doi.org/10.1109/SFCS.1991.185341},
  doi       = {10.1109/SFCS.1991.185341},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeGLSS91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/FeigePRU90,
  author    = {Uriel Feige and
               David Peleg and
               Prabhakar Raghavan and
               Eli Upfal},
  title     = {Randomized Broadcast in Networks},
  journal   = {Random Struct. Algorithms},
  volume    = {1},
  number    = {4},
  pages     = {447--460},
  year      = {1990},
  url       = {https://doi.org/10.1002/rsa.3240010406},
  doi       = {10.1002/rsa.3240010406},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/FeigePRU90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeLS90,
  author    = {Uriel Feige and
               Dror Lapidot and
               Adi Shamir},
  title     = {Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random
               String (Extended Abstract)},
  booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
               Missouri, USA, October 22-24, 1990, Volume {I}},
  pages     = {308--317},
  year      = {1990},
  crossref  = {DBLP:conf/focs/FOCS31a},
  url       = {https://doi.org/10.1109/FSCS.1990.89549},
  doi       = {10.1109/FSCS.1990.89549},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FeigeLS90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sigal/FeigePRU90,
  author    = {Uriel Feige and
               David Peleg and
               Prabhakar Raghavan and
               Eli Upfal},
  title     = {Randomized Broadcast in Networks},
  booktitle = {Algorithms, International Symposium {SIGAL} '90, Tokyo, Japan, August
               16-18, 1990, Proceedings},
  pages     = {128--137},
  year      = {1990},
  crossref  = {DBLP:conf/sigal/1990},
  url       = {https://doi.org/10.1007/3-540-52921-7_62},
  doi       = {10.1007/3-540-52921-7_62},
  timestamp = {Fri, 19 May 2017 13:10:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/sigal/FeigePRU90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigePRU90,
  author    = {Uriel Feige and
               David Peleg and
               Prabhakar Raghavan and
               Eli Upfal},
  title     = {Computing with Unreliable Information (Preliminary Version)},
  booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing,
               May 13-17, 1990, Baltimore, Maryland, {USA}},
  pages     = {128--137},
  year      = {1990},
  crossref  = {DBLP:conf/stoc/STOC22},
  url       = {http://doi.acm.org/10.1145/100216.100230},
  doi       = {10.1145/100216.100230},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigePRU90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeS90,
  author    = {Uriel Feige and
               Adi Shamir},
  title     = {Witness Indistinguishable and Witness Hiding Protocols},
  booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing,
               May 13-17, 1990, Baltimore, Maryland, {USA}},
  pages     = {416--426},
  year      = {1990},
  crossref  = {DBLP:conf/stoc/STOC22},
  url       = {http://doi.acm.org/10.1145/100216.100272},
  doi       = {10.1145/100216.100272},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeS90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigeS89,
  author    = {Uriel Feige and
               Adi Shamir},
  title     = {Multi-Oracle Interactive Protocols with Space Bounded Verifiers},
  booktitle = {Proceedings: Fourth Annual Structure in Complexity Theory Conference,
               University of Oregon, Eugene, Oregon, USA, June 19-22, 1989},
  pages     = {158--164},
  year      = {1989},
  crossref  = {DBLP:conf/coco/1989},
  url       = {https://doi.org/10.1109/SCT.1989.41822},
  doi       = {10.1109/SCT.1989.41822},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/FeigeS89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/crypto/FeigeS89,
  author    = {Uriel Feige and
               Adi Shamir},
  title     = {Zero Knowledge Proofs of Knowledge in Two Rounds},
  booktitle = {Advances in Cryptology - {CRYPTO} '89, 9th Annual International Cryptology
               Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings},
  pages     = {526--544},
  year      = {1989},
  crossref  = {DBLP:conf/crypto/1989},
  url       = {https://doi.org/10.1007/0-387-34805-0_46},
  doi       = {10.1007/0-387-34805-0_46},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/crypto/FeigeS89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/FeigeS89,
  author    = {Uriel Feige and
               Adi Shamir},
  title     = {On Expected Polynomial Time Simulation of Zero Knowledge Protocols},
  booktitle = {Distributed Computing And Cryptography, Proceedings of a {DIMACS}
               Workshop, Princeton, New Jersey, USA, October 4-6, 1989},
  pages     = {155--160},
  year      = {1989},
  crossref  = {DBLP:conf/dimacs/dimacs2},
  timestamp = {Wed, 13 Jan 2016 17:47:42 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/dimacs/FeigeS89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/joc/FeigeFS88,
  author    = {Uriel Feige and
               Amos Fiat and
               Adi Shamir},
  title     = {Zero-Knowledge Proofs of Identity},
  journal   = {J. Cryptology},
  volume    = {1},
  number    = {2},
  pages     = {77--94},
  year      = {1988},
  url       = {https://doi.org/10.1007/BF02351717},
  doi       = {10.1007/BF02351717},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/joc/FeigeFS88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/crypto/FeigeST88,
  author    = {Uriel Feige and
               Adi Shamir and
               Moshe Tennenholtz},
  title     = {The Noisy Oracle Problem},
  booktitle = {Advances in Cryptology - {CRYPTO} '88, 8th Annual International Cryptology
               Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings},
  pages     = {284--296},
  year      = {1988},
  crossref  = {DBLP:conf/crypto/1988},
  url       = {https://doi.org/10.1007/0-387-34799-2_22},
  doi       = {10.1007/0-387-34799-2_22},
  timestamp = {Fri, 19 May 2017 13:10:47 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/crypto/FeigeST88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeFS87,
  author    = {Uriel Feige and
               Amos Fiat and
               Adi Shamir},
  title     = {Zero Knowledge Proofs of Identity},
  booktitle = {Proceedings of the 19th Annual {ACM} Symposium on Theory of Computing,
               1987, New York, New York, {USA}},
  pages     = {210--217},
  year      = {1987},
  crossref  = {DBLP:conf/stoc/STOC19},
  url       = {http://doi.acm.org/10.1145/28395.28419},
  doi       = {10.1145/28395.28419},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/FeigeFS87},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2017,
  editor    = {Philip N. Klein},
  title     = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  publisher = {{SIAM}},
  year      = {2017},
  url       = {https://doi.org/10.1137/1.9781611974782},
  doi       = {10.1137/1.9781611974782},
  isbn      = {978-1-61197-478-2},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2017,
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {http://doi.acm.org/10.1145/3055399},
  doi       = {10.1145/3055399},
  isbn      = {978-1-4503-4528-6},
  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2016,
  editor    = {Klaus Jansen and
               Claire Mathieu and
               Jos{\'{e}} D. P. Rolim and
               Chris Umans},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
               France},
  series    = {LIPIcs},
  volume    = {60},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-018-7},
  isbn      = {978-3-95977-018-7},
  timestamp = {Wed, 14 Sep 2016 16:02:46 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2016,
  editor    = {Daniel Wichs and
               Yishay Mansour},
  title     = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {http://dl.acm.org/citation.cfm?id=2897518},
  isbn      = {978-1-4503-4132-5},
  timestamp = {Fri, 10 Jun 2016 10:30:30 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/aaai/2015,
  editor    = {Blai Bonet and
               Sven Koenig},
  title     = {Proceedings of the Twenty-Ninth {AAAI} Conference on Artificial Intelligence,
               January 25-30, 2015, Austin, Texas, {USA}},
  publisher = {{AAAI} Press},
  year      = {2015},
  url       = {http://www.aaai.org/Library/AAAI/aaai15contents.php},
  isbn      = {978-1-57735-698-1},
  timestamp = {Sun, 12 Apr 2015 12:16:43 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/aaai/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/colt/2015,
  editor    = {Peter Gr{\"{u}}nwald and
               Elad Hazan and
               Satyen Kale},
  title     = {Proceedings of The 28th Conference on Learning Theory, {COLT} 2015,
               Paris, France, July 3-6, 2015},
  series    = {{JMLR} Workshop and Conference Proceedings},
  volume    = {40},
  publisher = {JMLR.org},
  year      = {2015},
  url       = {http://jmlr.org/proceedings/papers/v40/},
  timestamp = {Tue, 12 Jul 2016 21:51:13 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/colt/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/innovations/2015,
  editor    = {Tim Roughgarden},
  title     = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
               Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
  publisher = {{ACM}},
  year      = {2015},
  url       = {http://dl.acm.org/citation.cfm?id=2688073},
  isbn      = {978-1-4503-3333-7},
  timestamp = {Sun, 25 Jan 2015 11:29:31 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/innovations/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2015,
  editor    = {Piotr Indyk},
  title     = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  publisher = {{SIAM}},
  year      = {2015},
  url       = {https://doi.org/10.1137/1.9781611973730},
  doi       = {10.1137/1.9781611973730},
  isbn      = {978-1-61197-374-7},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2014,
  title     = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2014, Philadelphia, PA, USA, October 18-21, 2014},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6975722},
  isbn      = {978-1-4799-6517-5},
  timestamp = {Thu, 23 Jun 2016 15:53:28 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/2014},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2014-1,
  editor    = {Javier Esparza and
               Pierre Fraigniaud and
               Thore Husfeldt and
               Elias Koutsoupias},
  title     = {Automata, Languages, and Programming - 41st International Colloquium,
               {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8572},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-662-43948-7},
  doi       = {10.1007/978-3-662-43948-7},
  isbn      = {978-3-662-43947-0},
  timestamp = {Tue, 23 May 2017 01:08:20 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/2014-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/innovations/2014,
  editor    = {Moni Naor},
  title     = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
               USA, January 12-14, 2014},
  publisher = {{ACM}},
  year      = {2014},
  url       = {http://dl.acm.org/citation.cfm?id=2554797},
  isbn      = {978-1-4503-2698-8},
  timestamp = {Fri, 14 Feb 2014 17:36:37 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/innovations/2014},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/2014,
  editor    = {Jon Lee and
               Jens Vygen},
  title     = {Integer Programming and Combinatorial Optimization - 17th International
               Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8494},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-319-07557-0},
  doi       = {10.1007/978-3-319-07557-0},
  isbn      = {978-3-319-07556-3},
  timestamp = {Mon, 22 May 2017 17:11:54 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ipco/2014},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/aaai/2013,
  editor    = {Marie desJardins and
               Michael L. Littman},
  title     = {Proceedings of the Twenty-Seventh {AAAI} Conference on Artificial
               Intelligence, July 14-18, 2013, Bellevue, Washington, {USA}},
  publisher = {{AAAI} Press},
  year      = {2013},
  url       = {http://www.aaai.org/Library/AAAI/aaai13contents.php},
  isbn      = {978-1-57735-615-8},
  timestamp = {Tue, 17 Dec 2013 19:26:12 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/aaai/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2013,
  editor    = {Prasad Raghavendra and
               Sofya Raskhodnikova and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
               International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
               2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8096},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-40328-6},
  doi       = {10.1007/978-3-642-40328-6},
  isbn      = {978-3-642-40327-9},
  timestamp = {Tue, 23 May 2017 01:10:59 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ciac/2013,
  editor    = {Paul G. Spirakis and
               Maria J. Serna},
  title     = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
               Barcelona, Spain, May 22-24, 2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7878},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-38233-8},
  doi       = {10.1007/978-3-642-38233-8},
  isbn      = {978-3-642-38232-1},
  timestamp = {Thu, 15 Jun 2017 21:39:41 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ciac/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/innovations/2013,
  editor    = {Robert D. Kleinberg},
  title     = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
               CA, USA, January 9-12, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2422436},
  isbn      = {978-1-4503-1859-4},
  timestamp = {Sun, 17 Feb 2013 11:19:02 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/innovations/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sigecom/2013,
  editor    = {Michael Kearns and
               R. Preston McAfee and
               {\'{E}}va Tardos},
  title     = {{ACM} Conference on Electronic Commerce, {EC} '13, Philadelphia, PA,
               USA, June 16-20, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2492002},
  isbn      = {978-1-4503-1962-1},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/sigecom/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/atal/2012,
  editor    = {Wiebe van der Hoek and
               Lin Padgham and
               Vincent Conitzer and
               Michael Winikoff},
  title     = {International Conference on Autonomous Agents and Multiagent Systems,
               {AAMAS} 2012, Valencia, Spain, June 4-8, 2012 {(3} Volumes)},
  publisher = {{IFAAMAS}},
  year      = {2012},
  url       = {http://dl.acm.org/citation.cfm?id=2343576},
  timestamp = {Sun, 09 Sep 2012 12:23:32 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/atal/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2012-1,
  editor    = {Artur Czumaj and
               Kurt Mehlhorn and
               Andrew M. Pitts and
               Roger Wattenhofer},
  title     = {Automata, Languages, and Programming - 39th International Colloquium,
               {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {7391},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-31594-7},
  doi       = {10.1007/978-3-642-31594-7},
  isbn      = {978-3-642-31593-0},
  timestamp = {Sun, 04 Jun 2017 10:07:30 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/2012-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2011,
  editor    = {Rafail Ostrovsky},
  title     = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
               2011, Palm Springs, CA, USA, October 22-25, 2011},
  publisher = {{IEEE} Computer Society},
  year      = {2011},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120},
  isbn      = {978-1-4577-1843-4},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2011-1,
  editor    = {Luca Aceto and
               Monika Henzinger and
               Jir{\'{\i}} Sgall},
  title     = {Automata, Languages and Programming - 38th International Colloquium,
               {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6755},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-22006-7},
  doi       = {10.1007/978-3-642-22006-7},
  isbn      = {978-3-642-22005-0},
  timestamp = {Thu, 15 Jun 2017 21:39:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/2011-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2011,
  editor    = {Lance Fortnow and
               Salil P. Vadhan},
  title     = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
               2011, San Jose, CA, USA, 6-8 June 2011},
  publisher = {{ACM}},
  year      = {2011},
  isbn      = {978-1-4503-0691-1},
  timestamp = {Tue, 22 May 2012 21:36:56 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/wads/2011,
  editor    = {Frank Dehne and
               John Iacono and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {Algorithms and Data Structures - 12th International Symposium, {WADS}
               2011, New York, NY, USA, August 15-17, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6844},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-22300-6},
  doi       = {10.1007/978-3-642-22300-6},
  isbn      = {978-3-642-22299-3},
  timestamp = {Sun, 21 May 2017 00:16:59 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/wads/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/wdag/2011,
  editor    = {David Peleg},
  title     = {Distributed Computing - 25th International Symposium, {DISC} 2011,
               Rome, Italy, September 20-22, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6950},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-24100-0},
  doi       = {10.1007/978-3-642-24100-0},
  isbn      = {978-3-642-24099-7},
  timestamp = {Fri, 19 May 2017 01:25:17 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/wdag/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sagt/2010,
  editor    = {Spyros C. Kontogiannis and
               Elias Koutsoupias and
               Paul G. Spirakis},
  title     = {Algorithmic Game Theory - Third International Symposium, {SAGT} 2010,
               Athens, Greece, October 18-20, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6386},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-16170-4},
  doi       = {10.1007/978-3-642-16170-4},
  isbn      = {978-3-642-16169-8},
  timestamp = {Sun, 21 May 2017 00:17:27 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/sagt/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2010,
  editor    = {Leonard J. Schulman},
  title     = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  publisher = {{ACM}},
  year      = {2010},
  isbn      = {978-1-4503-0050-6},
  timestamp = {Fri, 12 Oct 2012 12:16:22 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2009,
  editor    = {Irit Dinur and
               Klaus Jansen and
               Joseph Naor and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
               International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
               2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5687},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-03685-9},
  doi       = {10.1007/978-3-642-03685-9},
  isbn      = {978-3-642-03684-2},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2009,
  editor    = {Claire Mathieu},
  title     = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  publisher = {{SIAM}},
  year      = {2009},
  url       = {https://doi.org/10.1137/1.9781611973068},
  doi       = {10.1137/1.9781611973068},
  isbn      = {978-0-89871-680-1},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/spaa/2009,
  editor    = {Friedhelm Meyer auf der Heide and
               Michael A. Bender},
  title     = {{SPAA} 2009: Proceedings of the 21st Annual {ACM} Symposium on Parallelism
               in Algorithms and Architectures, Calgary, Alberta, Canada, August
               11-13, 2009},
  publisher = {{ACM}},
  year      = {2009},
  isbn      = {978-1-60558-606-9},
  timestamp = {Thu, 23 Jun 2011 21:55:08 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/spaa/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2008,
  editor    = {Ashish Goel and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Ronitt Rubinfeld},
  title     = {Approximation, Randomization and Combinatorial Optimization. Algorithms
               and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
               International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
               2008. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5171},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-85363-3},
  doi       = {10.1007/978-3-540-85363-3},
  isbn      = {978-3-540-85362-6},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/esa/2008,
  editor    = {Dan Halperin and
               Kurt Mehlhorn},
  title     = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe,
               Germany, September 15-17, 2008. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5193},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-87744-8},
  doi       = {10.1007/978-3-540-87744-8},
  isbn      = {978-3-540-87743-1},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/esa/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2008,
  editor    = {Ramesh Hariharan and
               Madhavan Mukund and
               V. Vinay},
  title     = {{IARCS} Annual Conference on Foundations of Software Technology and
               Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
               Bangalore, India},
  series    = {LIPIcs},
  volume    = {2},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2008},
  timestamp = {Wed, 20 Jan 2010 11:15:40 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/fsttcs/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2008,
  editor    = {Shang{-}Hua Teng},
  title     = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
               2008},
  publisher = {{SIAM}},
  year      = {2008},
  url       = {http://dl.acm.org/citation.cfm?id=1347082},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/swat/2008,
  editor    = {Joachim Gudmundsson},
  title     = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
               Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5124},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-69903-3},
  doi       = {10.1007/978-3-540-69903-3},
  isbn      = {978-3-540-69900-2},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/swat/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/www/2008,
  editor    = {Jinpeng Huai and
               Robin Chen and
               Hsiao{-}Wuen Hon and
               Yunhao Liu and
               Wei{-}Ying Ma and
               Andrew Tomkins and
               Xiaodong Zhang},
  title     = {Proceedings of the 17th International Conference on World Wide Web,
               {WWW} 2008, Beijing, China, April 21-25, 2008},
  publisher = {{ACM}},
  year      = {2008},
  isbn      = {978-1-60558-085-2},
  timestamp = {Fri, 14 Dec 2012 07:52:21 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/www/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2007,
  editor    = {Moses Charikar and
               Klaus Jansen and
               Omer Reingold and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
               International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
               20-22, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4627},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-74208-1},
  doi       = {10.1007/978-3-540-74208-1},
  isbn      = {978-3-540-74207-4},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2007,
  title     = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
               13-16 June 2007, San Diego, California, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2007},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4262736},
  isbn      = {0-7695-2780-9},
  timestamp = {Fri, 13 May 2016 10:28:33 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2007,
  title     = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2007},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4389466},
  isbn      = {978-0-7695-3010-9},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/2007,
  editor    = {Matteo Fischetti and
               David P. Williamson},
  title     = {Integer Programming and Combinatorial Optimization, 12th International
               {IPCO} Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4513},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-72792-7},
  doi       = {10.1007/978-3-540-72792-7},
  isbn      = {978-3-540-72791-0},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ipco/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2006,
  editor    = {Josep D{\'{\i}}az and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Uri Zwick},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 9th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
               Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
               Spain, August 28-30 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4110},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11830924},
  doi       = {10.1007/11830924},
  isbn      = {3-540-38044-2},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2006,
  title     = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2006},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4031329},
  isbn      = {0-7695-2720-5},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2006,
  title     = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  publisher = {{ACM} Press},
  year      = {2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557},
  isbn      = {0-89871-605-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2006,
  editor    = {Jon M. Kleinberg},
  title     = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
               Seattle, WA, USA, May 21-23, 2006},
  publisher = {{ACM}},
  year      = {2006},
  isbn      = {1-59593-134-1},
  timestamp = {Thu, 28 Sep 2006 09:38:26 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2005,
  editor    = {Chandra Chekuri and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Luca Trevisan},
  title     = {Approximation, Randomization and Combinatorial Optimization, Algorithms
               and Techniques, 8th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
               on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
               August 22-24, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3624},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11538462},
  doi       = {10.1007/11538462},
  isbn      = {3-540-28239-4},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2005,
  title     = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  publisher = {{SIAM}},
  year      = {2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432},
  isbn      = {0-89871-585-7},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2005,
  editor    = {Harold N. Gabow and
               Ronald Fagin},
  title     = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
               Baltimore, MD, USA, May 22-24, 2005},
  publisher = {{ACM}},
  year      = {2005},
  isbn      = {1-58113-960-8},
  timestamp = {Tue, 12 Jul 2005 13:48:39 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/wine/2005,
  editor    = {Xiaotie Deng and
               Yinyu Ye},
  title     = {Internet and Network Economics, First International Workshop, {WINE}
               2005, Hong Kong, China, December 15-17, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3828},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11600930},
  doi       = {10.1007/11600930},
  isbn      = {3-540-30900-4},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/wine/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2004,
  editor    = {Klaus Jansen and
               Sanjeev Khanna and
               Jos{\'{e}} D. P. Rolim and
               Dana Ron},
  title     = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
               and Techniques, 7th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
               Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
               MA, USA, August 22-24, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3122},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b99805},
  doi       = {10.1007/b99805},
  isbn      = {3-540-22894-2},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2004,
  editor    = {Josep D{\'{\i}}az and
               Juhani Karhum{\"{a}}ki and
               Arto Lepist{\"{o}} and
               Donald Sannella},
  title     = {Automata, Languages and Programming: 31st International Colloquium,
               {ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3142},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b99859},
  doi       = {10.1007/b99859},
  isbn      = {3-540-22849-7},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2004,
  editor    = {L{\'{a}}szl{\'{o}} Babai},
  title     = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
               Chicago, IL, USA, June 13-16, 2004},
  publisher = {{ACM}},
  year      = {2004},
  isbn      = {1-58113-852-0},
  timestamp = {Fri, 03 Sep 2004 08:58:11 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2002,
  editor    = {Klaus Jansen and
               Stefano Leonardi and
               Vijay V. Vazirani},
  title     = {Approximation Algorithms for Combinatorial Optimization, 5th International
               Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2462},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45753-4},
  doi       = {10.1007/3-540-45753-4},
  isbn      = {3-540-44186-7},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2002,
  title     = {Proceedings of the 17th Annual {IEEE} Conference on Computational
               Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
               2002},
  publisher = {{IEEE} Computer Society},
  year      = {2002},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7872},
  isbn      = {0-7695-1468-5},
  timestamp = {Fri, 13 May 2016 10:30:36 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2002,
  title     = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
               November 2002, Vancouver, BC, Canada, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2002},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8411},
  isbn      = {0-7695-1822-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2002,
  editor    = {John H. Reif},
  title     = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
               May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
  publisher = {{ACM}},
  year      = {2002},
  isbn      = {1-58113-495-9},
  timestamp = {Thu, 16 Feb 2012 12:04:12 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2001,
  editor    = {Fernando Orejas and
               Paul G. Spirakis and
               Jan van Leeuwen},
  title     = {Automata, Languages and Programming, 28th International Colloquium,
               {ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2076},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-48224-5},
  doi       = {10.1007/3-540-48224-5},
  isbn      = {3-540-42287-0},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2001,
  editor    = {Jeffrey Scott Vitter and
               Paul G. Spirakis and
               Mihalis Yannakakis},
  title     = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
               July 6-8, 2001, Heraklion, Crete, Greece},
  publisher = {{ACM}},
  year      = {2001},
  isbn      = {1-58113-349-9},
  timestamp = {Thu, 16 Feb 2012 12:04:51 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2000,
  editor    = {Klaus Jansen and
               Samir Khuller},
  title     = {Approximation Algorithms for Combinatorial Optimization, Third International
               Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
               5-8, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1913},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-44436-X},
  doi       = {10.1007/3-540-44436-X},
  isbn      = {3-540-67996-0},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2000,
  title     = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
               12-14 November 2000, Redondo Beach, California, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2000},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7164},
  isbn      = {0-7695-0850-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2000,
  editor    = {David B. Shmoys},
  title     = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2000},
  url       = {http://dl.acm.org/citation.cfm?id=338219},
  isbn      = {0-89871-453-2},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2000,
  editor    = {F. Frances Yao and
               Eugene M. Luks},
  title     = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
               of Computing, May 21-23, 2000, Portland, OR, {USA}},
  publisher = {{ACM}},
  year      = {2000},
  isbn      = {1-58113-184-4},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/swat/2000,
  editor    = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title     = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
               Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1851},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-44985-X},
  doi       = {10.1007/3-540-44985-X},
  isbn      = {3-540-67690-2},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/swat/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1999,
  title     = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
               17-18 October, 1999, New York, NY, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {1999},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6604},
  isbn      = {0-7695-0409-4},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/random/1999,
  editor    = {Dorit S. Hochbaum and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Alistair Sinclair},
  title     = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
               Third International Workshop on Randomization and Approximation Techniques
               in Computer Science, and Second International Workshop on Approximation
               Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
               Berkeley, CA, USA, August 8-11, 1999, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1671},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/b72324},
  doi       = {10.1007/b72324},
  isbn      = {3-540-66329-0},
  timestamp = {Wed, 24 May 2017 15:40:45 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/random/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/1999,
  editor    = {Jeffrey Scott Vitter and
               Lawrence L. Larmore and
               Frank Thomson Leighton},
  title     = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  publisher = {{ACM}},
  year      = {1999},
  isbn      = {1-58113-067-8},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1998,
  title     = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
               November 8-11, 1998, Palo Alto, California, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {1998},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5965},
  isbn      = {0-8186-9172-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/1998,
  editor    = {Jeffrey Scott Vitter},
  title     = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
               of Computing, Dallas, Texas, USA, May 23-26, 1998},
  publisher = {{ACM}},
  year      = {1998},
  isbn      = {0-89791-962-9},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ciac/1997,
  editor    = {Gian Carlo Bongiovanni and
               Daniel P. Bovet and
               Giuseppe Di Battista},
  title     = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
               Italy, March 12-14, 1997, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1203},
  publisher = {Springer},
  year      = {1997},
  url       = {https://doi.org/10.1007/3-540-62592-5},
  doi       = {10.1007/3-540-62592-5},
  isbn      = {3-540-62592-5},
  timestamp = {Mon, 22 May 2017 17:11:16 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ciac/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/istcs/1997,
  title     = {Fifth Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {1997},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4625},
  isbn      = {0-8186-8037-7},
  timestamp = {Tue, 31 May 2016 15:27:26 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/istcs/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/1997,
  editor    = {Frank Thomson Leighton and
               Peter W. Shor},
  title     = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
               of Computing, El Paso, Texas, USA, May 4-6, 1997},
  publisher = {{ACM}},
  year      = {1997},
  isbn      = {0-89791-888-6},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1996,
  editor    = {Steven Homer and
               Jin{-}Yi Cai},
  title     = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3765},
  isbn      = {0-8186-7386-9},
  timestamp = {Fri, 13 May 2016 10:34:12 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/istcs/1996,
  title     = {Fourth Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1996, Jerusalem, Israel, June 10-12, 1996, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  isbn      = {0-8186-7610-8},
  timestamp = {Tue, 31 May 2016 15:27:26 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/istcs/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/1996,
  editor    = {Gary L. Miller},
  title     = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
               of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
  publisher = {{ACM}},
  year      = {1996},
  isbn      = {0-89791-785-5},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/istcs/1995,
  title     = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {1995},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3021},
  isbn      = {0-8186-6915-2},
  timestamp = {Tue, 31 May 2016 15:27:26 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/istcs/1995},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC27,
  editor    = {Frank Thomson Leighton and
               Allan Borodin},
  title     = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
               of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
  publisher = {{ACM}},
  year      = {1995},
  isbn      = {0-89791-718-9},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/STOC27},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/1994,
  editor    = {Serge Abiteboul and
               Eli Shamir},
  title     = {Automata, Languages and Programming, 21st International Colloquium,
               ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {820},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-58201-0},
  doi       = {10.1007/3-540-58201-0},
  isbn      = {3-540-58201-0},
  timestamp = {Thu, 21 Sep 2017 12:05:21 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icalp/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC26,
  editor    = {Frank Thomson Leighton and
               Michael T. Goodrich},
  title     = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
               Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
               Canada},
  publisher = {{ACM}},
  year      = {1994},
  isbn      = {0-89791-663-8},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/STOC26},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/crypto/1993,
  editor    = {Douglas R. Stinson},
  title     = {Advances in Cryptology - {CRYPTO} '93, 13th Annual International Cryptology
               Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {773},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-48329-2},
  doi       = {10.1007/3-540-48329-2},
  isbn      = {3-540-57766-1},
  timestamp = {Sat, 20 May 2017 15:32:52 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/crypto/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS34,
  title     = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
               California, USA, 3-5 November 1993},
  publisher = {{IEEE} Computer Society},
  year      = {1993},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=2962},
  isbn      = {0-8186-4370-6},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FOCS34},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC25,
  editor    = {S. Rao Kosaraju and
               David S. Johnson and
               Alok Aggarwal},
  title     = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
               Computing, May 16-18, 1993, San Diego, CA, {USA}},
  publisher = {{ACM}},
  year      = {1993},
  isbn      = {0-89791-591-7},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/STOC25},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/crypto/1992,
  editor    = {Ernest F. Brickell},
  title     = {Advances in Cryptology - {CRYPTO} '92, 12th Annual International Cryptology
               Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {740},
  publisher = {Springer},
  year      = {1993},
  url       = {https://doi.org/10.1007/3-540-48071-4},
  doi       = {10.1007/3-540-48071-4},
  isbn      = {3-540-57340-2},
  timestamp = {Sat, 20 May 2017 15:32:52 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/crypto/1992},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS33,
  title     = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
               Pennsylvania, USA, 24-27 October 1992},
  publisher = {{IEEE} Computer Society},
  year      = {1992},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=424},
  isbn      = {0-8186-2900-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FOCS33},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC24,
  editor    = {S. Rao Kosaraju and
               Mike Fellows and
               Avi Wigderson and
               John A. Ellis},
  title     = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
               May 4-6, 1992, Victoria, British Columbia, Canada},
  publisher = {{ACM}},
  year      = {1992},
  isbn      = {0-89791-511-9},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/STOC24},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1991,
  title     = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
               Chicago, Illinois, USA, June 30 - July 3, 1991},
  publisher = {{IEEE} Computer Society},
  year      = {1991},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=364},
  isbn      = {0-8186-2255-5},
  timestamp = {Fri, 13 May 2016 10:39:09 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/1991},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS32,
  title     = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
               Puerto Rico, 1-4 October 1991},
  publisher = {{IEEE} Computer Society},
  year      = {1991},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=379},
  isbn      = {0-8186-2445-0},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FOCS32},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS31a,
  title     = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
               Missouri, USA, October 22-24, 1990, Volume {I}},
  publisher = {{IEEE} Computer Society},
  year      = {1990},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=310},
  isbn      = {0-8186-2082-X},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/FOCS31a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sigal/1990,
  editor    = {Tetsuo Asano and
               Toshihide Ibaraki and
               Hiroshi Imai and
               Takao Nishizeki},
  title     = {Algorithms, International Symposium {SIGAL} '90, Tokyo, Japan, August
               16-18, 1990, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {450},
  publisher = {Springer},
  year      = {1990},
  url       = {https://doi.org/10.1007/3-540-52921-7},
  doi       = {10.1007/3-540-52921-7},
  isbn      = {3-540-52921-7},
  timestamp = {Fri, 19 May 2017 13:10:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/sigal/1990},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC22,
  editor    = {Harriet Ortiz},
  title     = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing,
               May 13-17, 1990, Baltimore, Maryland, {USA}},
  publisher = {{ACM}},
  year      = {1990},
  isbn      = {0-89791-361-2},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/STOC22},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1989,
  title     = {Proceedings: Fourth Annual Structure in Complexity Theory Conference,
               University of Oregon, Eugene, Oregon, USA, June 19-22, 1989},
  publisher = {{IEEE} Computer Society},
  year      = {1989},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=250},
  isbn      = {0-8186-1958-9},
  timestamp = {Fri, 13 May 2016 10:39:40 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/coco/1989},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/crypto/1989,
  editor    = {Gilles Brassard},
  title     = {Advances in Cryptology - {CRYPTO} '89, 9th Annual International Cryptology
               Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {435},
  publisher = {Springer},
  year      = {1990},
  url       = {https://doi.org/10.1007/0-387-34805-0},
  doi       = {10.1007/0-387-34805-0},
  isbn      = {3-540-97317-6},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/crypto/1989},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs2,
  editor    = {Joan Feigenbaum and
               Michael Merritt},
  title     = {Distributed Computing And Cryptography, Proceedings of a {DIMACS}
               Workshop, Princeton, New Jersey, USA, October 4-6, 1989},
  series    = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume    = {2},
  publisher = {{DIMACS/AMS}},
  year      = {1991},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol02.html},
  timestamp = {Wed, 13 Jan 2016 17:47:42 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/dimacs/dimacs2},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/crypto/1988,
  editor    = {Shafi Goldwasser},
  title     = {Advances in Cryptology - {CRYPTO} '88, 8th Annual International Cryptology
               Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {403},
  publisher = {Springer},
  year      = {1990},
  url       = {https://doi.org/10.1007/0-387-34799-2},
  doi       = {10.1007/0-387-34799-2},
  isbn      = {3-540-97196-3},
  timestamp = {Fri, 19 May 2017 13:10:47 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/crypto/1988},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC19,
  editor    = {Alfred V. Aho},
  title     = {Proceedings of the 19th Annual {ACM} Symposium on Theory of Computing,
               1987, New York, New York, {USA}},
  publisher = {{ACM}},
  year      = {1987},
  isbn      = {0-89791-221-7},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/STOC19},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier