BibTeX records: Rajsekar Manokaran

download as .bib file

@article{DBLP:journals/corr/DalmauKM16,
  author    = {V{\'{\i}}ctor Dalmau and
               Andrei A. Krokhin and
               Rajsekar Manokaran},
  title     = {Towards a Characterization of Constant-Factor Approximable Finite-Valued
               CSPs},
  journal   = {CoRR},
  volume    = {abs/1610.01019},
  year      = {2016},
  url       = {http://arxiv.org/abs/1610.01019},
  archivePrefix = {arXiv},
  eprint    = {1610.01019},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/DalmauKM16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toc/AustrinMW15,
  author    = {Per Austrin and
               Rajsekar Manokaran and
               Cenny Wenner},
  title     = {On the NP-Hardness of Approximating Ordering-Constraint Satisfaction
               Problems},
  journal   = {Theory of Computing},
  volume    = {11},
  pages     = {257--283},
  year      = {2015},
  url       = {https://doi.org/10.4086/toc.2015.v011a010},
  doi       = {10.4086/toc.2015.v011a010},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/toc/AustrinMW15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/HastadHMOW15,
  author    = {Johan H{\aa}stad and
               Sangxia Huang and
               Rajsekar Manokaran and
               Ryan O'Donnell and
               John Wright},
  title     = {Improved NP-Inapproximability for 2-Variable Linear Equations},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
               NJ, {USA}},
  pages     = {341--360},
  year      = {2015},
  crossref  = {DBLP:conf/approx/2015},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.341},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2015.341},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/HastadHMOW15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/DalmauKM15,
  author    = {V{\'{\i}}ctor Dalmau and
               Andrei A. Krokhin and
               Rajsekar Manokaran},
  title     = {Towards a Characterization of Constant-Factor Approximable Min CSPs},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages     = {847--857},
  year      = {2015},
  crossref  = {DBLP:conf/soda/2015},
  url       = {https://doi.org/10.1137/1.9781611973730.58},
  doi       = {10.1137/1.9781611973730.58},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/DalmauKM15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/MakarychevMS14,
  author    = {Konstantin Makarychev and
               Rajsekar Manokaran and
               Maxim Sviridenko},
  title     = {Maximum Quadratic Assignment Problem: Reduction from Maximum Label
               Cover and LP-based Approximation Algorithm},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {4},
  pages     = {18:1--18:18},
  year      = {2014},
  url       = {http://doi.acm.org/10.1145/2629672},
  doi       = {10.1145/2629672},
  timestamp = {Wed, 09 Mar 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/talg/MakarychevMS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/MakarychevMS14,
  author    = {Konstantin Makarychev and
               Rajsekar Manokaran and
               Maxim Sviridenko},
  title     = {Maximum Quadratic Assignment Problem: Reduction from Maximum Label
               Cover and LP-based Approximation Algorithm},
  journal   = {CoRR},
  volume    = {abs/1403.7721},
  year      = {2014},
  url       = {http://arxiv.org/abs/1403.7721},
  archivePrefix = {arXiv},
  eprint    = {1403.7721},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/MakarychevMS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/AustrinMW13,
  author    = {Per Austrin and
               Rajsekar Manokaran and
               Cenny Wenner},
  title     = {On the NP-Hardness of Approximating Ordering Constraint Satisfaction
               Problems},
  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     = {26--41},
  year      = {2013},
  crossref  = {DBLP:conf/approx/2013},
  url       = {https://doi.org/10.1007/978-3-642-40328-6_3},
  doi       = {10.1007/978-3-642-40328-6_3},
  timestamp = {Tue, 23 May 2017 01:10:59 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/AustrinMW13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/AustrinMW13,
  author    = {Per Austrin and
               Rajsekar Manokaran and
               Cenny Wenner},
  title     = {On the NP-Hardness of Approximating Ordering Constraint Satisfaction
               Problems},
  journal   = {CoRR},
  volume    = {abs/1307.5090},
  year      = {2013},
  url       = {http://arxiv.org/abs/1307.5090},
  archivePrefix = {arXiv},
  eprint    = {1307.5090},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/AustrinMW13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/AroraBMS12,
  author    = {Sanjeev Arora and
               Arnab Bhattacharyya and
               Rajsekar Manokaran and
               Sushant Sachdeva},
  title     = {Testing Permanent Oracles - Revisited},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
               International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
               15-17, 2012. Proceedings},
  pages     = {362--373},
  year      = {2012},
  crossref  = {DBLP:conf/approx/2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0_31},
  doi       = {10.1007/978-3-642-32512-0_31},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/AroraBMS12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BhaskaraCMV12,
  author    = {Aditya Bhaskara and
               Moses Charikar and
               Rajsekar Manokaran and
               Aravindan Vijayaraghavan},
  title     = {On Quadratic Programming with a Ratio Objective},
  booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
               {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
  pages     = {109--120},
  year      = {2012},
  crossref  = {DBLP:conf/icalp/2012-1},
  url       = {https://doi.org/10.1007/978-3-642-31594-7_10},
  doi       = {10.1007/978-3-642-31594-7_10},
  timestamp = {Sun, 04 Jun 2017 10:07:30 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/BhaskaraCMV12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4783,
  author    = {Sanjeev Arora and
               Arnab Bhattacharyya and
               Rajsekar Manokaran and
               Sushant Sachdeva},
  title     = {Testing Permanent Oracles -- Revisited},
  journal   = {CoRR},
  volume    = {abs/1207.4783},
  year      = {2012},
  url       = {http://arxiv.org/abs/1207.4783},
  archivePrefix = {arXiv},
  eprint    = {1207.4783},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1207-4783},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/AroraBMS12,
  author    = {Sanjeev Arora and
               Arnab Bhattacharyya and
               Rajsekar Manokaran and
               Sushant Sachdeva},
  title     = {Testing Permanent Oracles - Revisited},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {94},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/094},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/AroraBMS12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiHMRC11,
  author    = {Venkatesan Guruswami and
               Johan H{\aa}stad and
               Rajsekar Manokaran and
               Prasad Raghavendra and
               Moses Charikar},
  title     = {Beating the Random Ordering Is Hard: Every Ordering {CSP} Is Approximation
               Resistant},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {878--914},
  year      = {2011},
  url       = {https://doi.org/10.1137/090756144},
  doi       = {10.1137/090756144},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GuruswamiHMRC11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/KumarMTV11,
  author    = {Amit Kumar and
               Rajsekar Manokaran and
               Madhur Tulsiani and
               Nisheeth K. Vishnoi},
  title     = {On LP-Based Approximability for Strict CSPs},
  booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
               2011},
  pages     = {1560--1573},
  year      = {2011},
  crossref  = {DBLP:conf/soda/2011},
  url       = {https://doi.org/10.1137/1.9781611973082.121},
  doi       = {10.1137/1.9781611973082.121},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/KumarMTV11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-1710,
  author    = {Aditya Bhaskara and
               Moses Charikar and
               Rajsekar Manokaran and
               Aravindan Vijayaraghavan},
  title     = {On Quadratic Programming with a Ratio Objective},
  journal   = {CoRR},
  volume    = {abs/1101.1710},
  year      = {2011},
  url       = {http://arxiv.org/abs/1101.1710},
  archivePrefix = {arXiv},
  eprint    = {1101.1710},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1101-1710},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiHMRC11,
  author    = {Venkatesan Guruswami and
               Johan H{\aa}stad and
               Rajsekar Manokaran and
               Prasad Raghavendra and
               Moses Charikar},
  title     = {Beating the Random Ordering is Hard: Every ordering {CSP} is approximation
               resistant},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {27},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/027},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GuruswamiHMRC11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MakarychevMS10,
  author    = {Konstantin Makarychev and
               Rajsekar Manokaran and
               Maxim Sviridenko},
  title     = {Maximum Quadratic Assignment Problem: Reduction from Maximum Label
               Cover and LP-Based Approximation Algorithm},
  booktitle = {Automata, Languages and Programming, 37th International Colloquium,
               {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
               {I}},
  pages     = {594--604},
  year      = {2010},
  crossref  = {DBLP:conf/icalp/2010-1},
  url       = {https://doi.org/10.1007/978-3-642-14165-2_50},
  doi       = {10.1007/978-3-642-14165-2_50},
  timestamp = {Sun, 04 Jun 2017 10:07:29 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/MakarychevMS10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/CharikarGM09,
  author    = {Moses Charikar and
               Venkatesan Guruswami and
               Rajsekar Manokaran},
  title     = {Every Permutation {CSP} of arity 3 is Approximation Resistant},
  booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  pages     = {62--73},
  year      = {2009},
  crossref  = {DBLP:conf/coco/2009},
  url       = {https://doi.org/10.1109/CCC.2009.29},
  doi       = {10.1109/CCC.2009.29},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/CharikarGM09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-1776,
  author    = {Amit Kumar and
               Rajsekar Manokaran and
               Madhur Tulsiani and
               Nisheeth K. Vishnoi},
  title     = {On the Optimality of a Class of LP-based Algorithms},
  journal   = {CoRR},
  volume    = {abs/0912.1776},
  year      = {2009},
  url       = {http://arxiv.org/abs/0912.1776},
  archivePrefix = {arXiv},
  eprint    = {0912.1776},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0912-1776},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/KumarMTV09,
  author    = {Amit Kumar and
               Rajsekar Manokaran and
               Madhur Tulsiani and
               Nisheeth K. Vishnoi},
  title     = {On the Optimality of a Class of LP-based Algorithms},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {124},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/124},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/KumarMTV09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiMR08,
  author    = {Venkatesan Guruswami and
               Rajsekar Manokaran and
               Prasad Raghavendra},
  title     = {Beating the Random Ordering is Hard: Inapproximability of Maximum
               Acyclic Subgraph},
  booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  pages     = {573--582},
  year      = {2008},
  crossref  = {DBLP:conf/focs/2008},
  url       = {https://doi.org/10.1109/FOCS.2008.51},
  doi       = {10.1109/FOCS.2008.51},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GuruswamiMR08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ManokaranNRS08,
  author    = {Rajsekar Manokaran and
               Joseph Naor and
               Prasad Raghavendra and
               Roy Schwartz},
  title     = {Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric
               labeling},
  booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
               Victoria, British Columbia, Canada, May 17-20, 2008},
  pages     = {11--20},
  year      = {2008},
  crossref  = {DBLP:conf/stoc/2008},
  url       = {http://doi.acm.org/10.1145/1374376.1374379},
  doi       = {10.1145/1374376.1374379},
  timestamp = {Sat, 19 Jun 2010 14:44:24 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/ManokaranNRS08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2015,
  editor    = {Naveen Garg and
               Klaus Jansen and
               Anup Rao and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
               NJ, {USA}},
  series    = {LIPIcs},
  volume    = {40},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2015},
  url       = {http://www.dagstuhl.de/dagpub/978-3-939897-89-7},
  isbn      = {978-3-939897-89-7},
  timestamp = {Wed, 19 Aug 2015 14:11:56 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/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.org/rec/bib/conf/soda/2015},
  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.org/rec/bib/conf/approx/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2012,
  editor    = {Anupam Gupta and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Rocco A. Servedio},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
               International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
               15-17, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7408},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0},
  doi       = {10.1007/978-3-642-32512-0},
  isbn      = {978-3-642-32511-3},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/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.org/rec/bib/conf/icalp/2012-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2011,
  editor    = {Dana Randall},
  title     = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
               2011},
  publisher = {{SIAM}},
  year      = {2011},
  url       = {https://doi.org/10.1137/1.9781611973082},
  doi       = {10.1137/1.9781611973082},
  isbn      = {978-0-89871-993-2},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2010-1,
  editor    = {Samson Abramsky and
               Cyril Gavoille and
               Claude Kirchner and
               Friedhelm Meyer auf der Heide and
               Paul G. Spirakis},
  title     = {Automata, Languages and Programming, 37th International Colloquium,
               {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6198},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14165-2},
  doi       = {10.1007/978-3-642-14165-2},
  isbn      = {978-3-642-14164-5},
  timestamp = {Sun, 04 Jun 2017 10:07:29 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2010-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2009,
  title     = {Proceedings of the 24th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  publisher = {{IEEE} Computer Society},
  year      = {2009},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5231175},
  isbn      = {978-0-7695-3717-7},
  timestamp = {Fri, 13 May 2016 10:27:38 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2008,
  title     = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2008},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4690923},
  isbn      = {978-0-7695-3436-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2008,
  editor    = {Cynthia Dwork},
  title     = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
               Victoria, British Columbia, Canada, May 17-20, 2008},
  publisher = {{ACM}},
  year      = {2008},
  isbn      = {978-1-60558-047-0},
  timestamp = {Sat, 19 Jun 2010 14:44:24 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier