BibTeX records: Lance Fortnow

download as .bib file

@article{DBLP:journals/iandc/FortnowS17,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Robust simulations and significant separations},
  journal   = {Inf. Comput.},
  volume    = {256},
  pages     = {149--159},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.ic.2017.07.002},
  doi       = {10.1016/j.ic.2017.07.002},
  timestamp = {Fri, 06 Oct 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/FortnowS17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Fortnow17,
  author    = {Lance Fortnow},
  title     = {Complexity with Rod},
  booktitle = {Computability and Complexity - Essays Dedicated to Rodney G. Downey
               on the Occasion of His 60th Birthday},
  pages     = {115--121},
  year      = {2017},
  crossref  = {DBLP:conf/birthday/2017downey},
  url       = {https://doi.org/10.1007/978-3-319-50062-1_8},
  doi       = {10.1007/978-3-319-50062-1_8},
  timestamp = {Tue, 23 May 2017 01:06:45 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/birthday/Fortnow17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/FennerF17,
  author    = {Stephen A. Fenner and
               Lance Fortnow},
  title     = {Compression Complexity},
  journal   = {CoRR},
  volume    = {abs/1702.04779},
  year      = {2017},
  url       = {http://arxiv.org/abs/1702.04779},
  archivePrefix = {arXiv},
  eprint    = {1702.04779},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/FennerF17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eatcs/Fortnow16,
  author    = {Lance Fortnow},
  title     = {David Stifler Johnson: {A} Tribute by Lance Fortnow},
  journal   = {Bulletin of the {EATCS}},
  volume    = {119},
  year      = {2016},
  url       = {http://bulletin.eatcs.org/index.php/beatcs/article/view/404/384},
  timestamp = {Fri, 07 Apr 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eatcs/Fortnow16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eatcs/Fortnow16a,
  author    = {Lance Fortnow},
  title     = {The Golden Ticket P, NP, and the Search for the Impossible},
  journal   = {Bulletin of the {EATCS}},
  volume    = {120},
  year      = {2016},
  url       = {http://bulletin.eatcs.org/index.php/beatcs/article/view/447/426},
  timestamp = {Mon, 24 Apr 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eatcs/Fortnow16a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/cloud/LiuFLWX16,
  author    = {Liang Liu and
               Lance Fortnow and
               Jin Li and
               Yating Wang and
               Jun (Jim) Xu},
  title     = {Randomized Algorithms for Dynamic Storage Load-Balancing},
  booktitle = {Proceedings of the Seventh {ACM} Symposium on Cloud Computing, Santa
               Clara, CA, USA, October 5-7, 2016},
  pages     = {210--222},
  year      = {2016},
  crossref  = {DBLP:conf/cloud/2016},
  url       = {http://doi.acm.org/10.1145/2987550.2987572},
  doi       = {10.1145/2987550.2987572},
  timestamp = {Tue, 20 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cloud/LiuFLWX16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowS16,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {New Non-Uniform Lower Bounds for Uniform Classes},
  booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
               June 1, 2016, Tokyo, Japan},
  pages     = {19:1--19:14},
  year      = {2016},
  crossref  = {DBLP:conf/coco/2016},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2016.19},
  doi       = {10.4230/LIPIcs.CCC.2016.19},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowS16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sigmetrics/LiuWFLX16,
  author    = {Liang Liu and
               Yating Wang and
               Lance Fortnow and
               Jin Li and
               Jun (Jim) Xu},
  title     = {Freestyle Dancing: Randomized Algorithms for Dynamic Storage Load-Balancing},
  booktitle = {Proceedings of the 2016 {ACM} {SIGMETRICS} International Conference
               on Measurement and Modeling of Computer Science, Antibes Juan-Les-Pins,
               France, June 14-18, 2016},
  pages     = {381--382},
  year      = {2016},
  crossref  = {DBLP:conf/sigmetrics/2016},
  url       = {http://doi.acm.org/10.1145/2896377.2901481},
  doi       = {10.1145/2896377.2901481},
  timestamp = {Tue, 20 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/sigmetrics/LiuWFLX16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Fortnow15,
  author    = {Lance Fortnow},
  title     = {Nondeterministic Separations},
  booktitle = {Theory and Applications of Models of Computation - 12th Annual Conference,
               {TAMC} 2015, Singapore, May 18-20, 2015, Proceedings},
  pages     = {10--17},
  year      = {2015},
  crossref  = {DBLP:conf/tamc/2015},
  url       = {https://doi.org/10.1007/978-3-319-17142-5_2},
  doi       = {10.1007/978-3-319-17142-5_2},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/tamc/Fortnow15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@incollection{DBLP:series/hhl/FortnowH14,
  author    = {Lance Fortnow and
               Steven Homer},
  title     = {Computational Complexity},
  booktitle = {Computational Logic},
  pages     = {495--521},
  year      = {2014},
  crossref  = {DBLP:series/hhl/9},
  url       = {https://doi.org/10.1016/B978-0-444-51624-4.50011-3},
  doi       = {10.1016/B978-0-444-51624-4.50011-3},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/series/hhl/FortnowH14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FortnowS14,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Hierarchies Against Sublinear Advice},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {171},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/171},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FortnowS14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@book{DBLP:books/daglib/0031093,
  author    = {Lance Fortnow},
  title     = {The Golden Ticket - P, NP, and the Search for the Impossible},
  publisher = {Princeton University Press},
  year      = {2013},
  url       = {http://press.princeton.edu/titles/9937.html},
  isbn      = {978-0-691-15649-1},
  timestamp = {Fri, 30 Aug 2013 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/books/daglib/0031093},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/BatuFRSW13,
  author    = {Tugkan Batu and
               Lance Fortnow and
               Ronitt Rubinfeld and
               Warren D. Smith and
               Patrick White},
  title     = {Testing Closeness of Discrete Distributions},
  journal   = {J. {ACM}},
  volume    = {60},
  number    = {1},
  pages     = {4:1--4:25},
  year      = {2013},
  url       = {http://doi.acm.org/10.1145/2432622.2432626},
  doi       = {10.1145/2432622.2432626},
  timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/BatuFRSW13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/cie/Fortnow13,
  author    = {Lance Fortnow},
  title     = {A Personal View of the {P} versus {NP} Problem},
  booktitle = {The Nature of Computation. Logic, Algorithms, Applications - 9th Conference
               on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013.
               Proceedings},
  pages     = {147--148},
  year      = {2013},
  crossref  = {DBLP:conf/cie/2013},
  url       = {https://doi.org/10.1007/978-3-642-39053-1_17},
  doi       = {10.1007/978-3-642-39053-1_17},
  timestamp = {Fri, 19 May 2017 01:26:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cie/Fortnow13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BuhrmanFHL13,
  author    = {Harry Buhrman and
               Lance Fortnow and
               John M. Hitchcock and
               Bruno Loff},
  title     = {Learning Reductions to Sparse Sets},
  booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
               Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
               Proceedings},
  pages     = {243--253},
  year      = {2013},
  crossref  = {DBLP:conf/mfcs/2013},
  url       = {https://doi.org/10.1007/978-3-642-40313-2_23},
  doi       = {10.1007/978-3-642-40313-2_23},
  timestamp = {Thu, 15 Jun 2017 21:43:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/BuhrmanFHL13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/AntunesFPS12,
  author    = {Luis Filipe Coelho Antunes and
               Lance Fortnow and
               Alexandre Pinto and
               Andre Souto},
  title     = {Low-Depth Witnesses are Easy to Find},
  journal   = {Computational Complexity},
  volume    = {21},
  number    = {3},
  pages     = {479--497},
  year      = {2012},
  url       = {https://doi.org/10.1007/s00037-011-0025-1},
  doi       = {10.1007/s00037-011-0025-1},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/AntunesFPS12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cj/Fortnow12,
  author    = {Lance Fortnow},
  title     = {The Enduring Legacy of the Turing Machine},
  journal   = {Comput. J.},
  volume    = {55},
  number    = {7},
  pages     = {830--831},
  year      = {2012},
  url       = {https://doi.org/10.1093/comjnl/bxs073},
  doi       = {10.1093/comjnl/bxs073},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cj/Fortnow12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/FortnowLM12,
  author    = {Lance Fortnow and
               Jack H. Lutz and
               Elvira Mayordomo},
  title     = {Inseparability and Strong Hypotheses for Disjoint {NP} Pairs},
  journal   = {Theory Comput. Syst.},
  volume    = {51},
  number    = {2},
  pages     = {229--247},
  year      = {2012},
  url       = {https://doi.org/10.1007/s00224-011-9326-7},
  doi       = {10.1007/s00224-011-9326-7},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/FortnowLM12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-1712,
  author    = {Lance Fortnow and
               Rahul Sami},
  title     = {Multi-outcome and Multidimensional Market Scoring Rules},
  journal   = {CoRR},
  volume    = {abs/1202.1712},
  year      = {2012},
  url       = {http://arxiv.org/abs/1202.1712},
  archivePrefix = {arXiv},
  eprint    = {1202.1712},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1202-1712},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iandc/FortnowHPVW11,
  author    = {Lance Fortnow and
               John M. Hitchcock and
               Aduri Pavan and
               N. V. Vinodchandran and
               Fengming Wang},
  title     = {Extracting Kolmogorov complexity with applications to dimension zero-one
               laws},
  journal   = {Inf. Comput.},
  volume    = {209},
  number    = {4},
  pages     = {627--636},
  year      = {2011},
  url       = {https://doi.org/10.1016/j.ic.2010.09.006},
  doi       = {10.1016/j.ic.2010.09.006},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/FortnowHPVW11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iandc/FortnowG11,
  author    = {Lance Fortnow and
               Joshua A. Grochow},
  title     = {Complexity classes of equivalence problems revisited},
  journal   = {Inf. Comput.},
  volume    = {209},
  number    = {4},
  pages     = {748--763},
  year      = {2011},
  url       = {https://doi.org/10.1016/j.ic.2011.01.006},
  doi       = {10.1016/j.ic.2011.01.006},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/FortnowG11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FortnowS11,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Infeasibility of instance compression and succinct PCPs for {NP}},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {77},
  number    = {1},
  pages     = {91--106},
  year      = {2011},
  url       = {https://doi.org/10.1016/j.jcss.2010.06.007},
  doi       = {10.1016/j.jcss.2010.06.007},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/FortnowS11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FortnowS11,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Robust Simulations and Significant Separations},
  booktitle = {Automata, Languages and Programming - 38th International Colloquium,
               {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
               {I}},
  pages     = {569--580},
  year      = {2011},
  crossref  = {DBLP:conf/icalp/2011-1},
  url       = {https://doi.org/10.1007/978-3-642-22006-7_48},
  doi       = {10.1007/978-3-642-22006-7_48},
  timestamp = {Thu, 15 Jun 2017 21:39:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/FortnowS11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/BudinichF11,
  author    = {Michele Budinich and
               Lance Fortnow},
  title     = {Repeated matching pennies with limited randomness},
  booktitle = {Proceedings 12th {ACM} Conference on Electronic Commerce (EC-2011),
               San Jose, CA, USA, June 5-9, 2011},
  pages     = {111--118},
  year      = {2011},
  crossref  = {DBLP:conf/sigecom/2011},
  url       = {http://doi.acm.org/10.1145/1993574.1993592},
  doi       = {10.1145/1993574.1993592},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/BudinichF11},
  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 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1096,
  author    = {Michele Budinich and
               Lance Fortnow},
  title     = {Repeated Matching Pennies with Limited Randomness},
  journal   = {CoRR},
  volume    = {abs/1102.1096},
  year      = {2011},
  url       = {http://arxiv.org/abs/1102.1096},
  archivePrefix = {arXiv},
  eprint    = {1102.1096},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1102-1096},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenDSRPHFG10,
  author    = {Yiling Chen and
               Stanko Dimitrov and
               Rahul Sami and
               Daniel M. Reeves and
               David M. Pennock and
               Robin D. Hanson and
               Lance Fortnow and
               Rica Gonen},
  title     = {Gaming Prediction Markets: Equilibrium Strategies with a Market Maker},
  journal   = {Algorithmica},
  volume    = {58},
  number    = {4},
  pages     = {930--969},
  year      = {2010},
  url       = {https://doi.org/10.1007/s00453-009-9323-2},
  doi       = {10.1007/s00453-009-9323-2},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/algorithmica/ChenDSRPHFG10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanFKRV10,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Michal Kouck{\'{y}} and
               John D. Rogers and
               Nikolai K. Vereshchagin},
  title     = {Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?},
  journal   = {Theory Comput. Syst.},
  volume    = {46},
  number    = {1},
  pages     = {143--156},
  year      = {2010},
  url       = {https://doi.org/10.1007/s00224-008-9160-8},
  doi       = {10.1007/s00224-008-9160-8},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/BuhrmanFKRV10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ubiquity/Fortnow10,
  author    = {Lance Fortnow},
  title     = {Ubiquity symposium 'What is computation?': The enduring legacy of
               the Turing machine},
  journal   = {Ubiquity},
  volume    = {2010},
  number    = {December},
  pages     = {5},
  year      = {2010},
  url       = {http://doi.acm.org/10.1145/1895419.1921573},
  doi       = {10.1145/1895419.1921573},
  timestamp = {Sat, 07 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/ubiquity/Fortnow10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFKL10,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Michal Kouck{\'{y}} and
               Bruno Loff},
  title     = {Derandomizing from Random Strings},
  booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2010, Cambridge, Massachusetts, June 9-12, 2010},
  pages     = {58--63},
  year      = {2010},
  crossref  = {DBLP:conf/coco/2010},
  url       = {https://doi.org/10.1109/CCC.2010.15},
  doi       = {10.1109/CCC.2010.15},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BuhrmanFKL10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FortnowS10,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Bounding Rationality by Discounting Time},
  booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 5-7, 2010. Proceedings},
  pages     = {143--155},
  year      = {2010},
  crossref  = {DBLP:conf/innovations/2010},
  url       = {http://conference.itcs.tsinghua.edu.cn/ICS2010/content/papers/12.html},
  timestamp = {Mon, 27 Sep 2010 12:57:50 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/FortnowS10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FortnowLM10,
  author    = {Lance Fortnow and
               Jack H. Lutz and
               Elvira Mayordomo},
  title     = {Inseparability and Strong Hypotheses for Disjoint {NP} Pairs},
  booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
               {STACS} 2010, March 4-6, 2010, Nancy, France},
  pages     = {395--404},
  year      = {2010},
  crossref  = {DBLP:conf/stacs/2010},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2010.2471},
  doi       = {10.4230/LIPIcs.STACS.2010.2471},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/FortnowLM10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-5397,
  author    = {Tugkan Batu and
               Lance Fortnow and
               Ronitt Rubinfeld and
               Warren D. Smith and
               Patrick White},
  title     = {Testing Closeness of Discrete Distributions},
  journal   = {CoRR},
  volume    = {abs/1009.5397},
  year      = {2010},
  url       = {http://arxiv.org/abs/1009.5397},
  archivePrefix = {arXiv},
  eprint    = {1009.5397},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1009-5397},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-2034,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Robust Simulations and Significant Separations},
  journal   = {CoRR},
  volume    = {abs/1012.2034},
  year      = {2010},
  url       = {http://arxiv.org/abs/1012.2034},
  archivePrefix = {arXiv},
  eprint    = {1012.2034},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1012-2034},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cacm/Fortnow09,
  author    = {Lance Fortnow},
  title     = {Viewpoint - Time for computer science to grow up},
  journal   = {Commun. {ACM}},
  volume    = {52},
  number    = {8},
  pages     = {33--35},
  year      = {2009},
  url       = {http://doi.acm.org/10.1145/1536616.1536631},
  doi       = {10.1145/1536616.1536631},
  timestamp = {Fri, 18 Sep 2009 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cacm/Fortnow09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cacm/Fortnow09a,
  author    = {Lance Fortnow},
  title     = {The status of the {P} versus {NP} problem},
  journal   = {Commun. {ACM}},
  volume    = {52},
  number    = {9},
  pages     = {78--86},
  year      = {2009},
  url       = {http://doi.acm.org/10.1145/1562164.1562186},
  doi       = {10.1145/1562164.1562186},
  timestamp = {Fri, 18 Sep 2009 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cacm/Fortnow09a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FortnowK09,
  author    = {Lance Fortnow and
               Adam R. Klivans},
  title     = {Efficient learning algorithms yield circuit lower bounds},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {75},
  number    = {1},
  pages     = {27--36},
  year      = {2009},
  url       = {https://doi.org/10.1016/j.jcss.2008.07.006},
  doi       = {10.1016/j.jcss.2008.07.006},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/FortnowK09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/AntunesF09,
  author    = {Luis Filipe Coelho Antunes and
               Lance Fortnow},
  title     = {Sophistication Revisited},
  journal   = {Theory Comput. Syst.},
  volume    = {45},
  number    = {1},
  pages     = {150--161},
  year      = {2009},
  url       = {https://doi.org/10.1007/s00224-007-9095-5},
  doi       = {10.1007/s00224-007-9095-5},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/AntunesF09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toc/Fortnow09,
  author    = {Lance Fortnow},
  title     = {A Simple Proof of Toda's Theorem},
  journal   = {Theory of Computing},
  volume    = {5},
  number    = {1},
  pages     = {135--140},
  year      = {2009},
  url       = {https://doi.org/10.4086/toc.2009.v005a007},
  doi       = {10.4086/toc.2009.v005a007},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/toc/Fortnow09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toct/Fortnow09,
  author    = {Lance Fortnow},
  title     = {Editor's Foreword},
  journal   = {{TOCT}},
  volume    = {1},
  number    = {1},
  pages     = {1:1--1:2},
  year      = {2009},
  url       = {http://doi.acm.org/10.1145/1490270.1490271},
  doi       = {10.1145/1490270.1490271},
  timestamp = {Mon, 09 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/toct/Fortnow09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowSW09,
  author    = {Lance Fortnow and
               Rahul Santhanam and
               Ryan Williams},
  title     = {Fixed-Polynomial Size Circuit Bounds},
  booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  pages     = {19--26},
  year      = {2009},
  crossref  = {DBLP:conf/coco/2009},
  url       = {https://doi.org/10.1109/CCC.2009.21},
  doi       = {10.1109/CCC.2009.21},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowSW09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/AntunesF09,
  author    = {Luis Filipe Coelho Antunes and
               Lance Fortnow},
  title     = {Worst-Case Running Times for Average-Case Algorithms},
  booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  pages     = {298--303},
  year      = {2009},
  crossref  = {DBLP:conf/coco/2009},
  url       = {https://doi.org/10.1109/CCC.2009.12},
  doi       = {10.1109/CCC.2009.12},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/AntunesF09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuhrmanFS09,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Rahul Santhanam},
  title     = {Unconditional Lower Bounds against Advice},
  booktitle = {Automata, Languages and Programming, 36th International Colloquium,
               {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
  pages     = {195--209},
  year      = {2009},
  crossref  = {DBLP:conf/icalp/2009-1},
  url       = {https://doi.org/10.1007/978-3-642-02927-1_18},
  doi       = {10.1007/978-3-642-02927-1_18},
  timestamp = {Tue, 23 May 2017 01:08:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/BuhrmanFS09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/tark/DevanurF09,
  author    = {Nikhil R. Devanur and
               Lance Fortnow},
  title     = {A computational theory of awareness and decision making},
  booktitle = {Proceedings of the 12th Conference on Theoretical Aspects of Rationality
               and Knowledge (TARK-2009), Stanford, CA, USA, July 6-8, 2009},
  pages     = {99--107},
  year      = {2009},
  crossref  = {DBLP:conf/tark/2009},
  url       = {http://doi.acm.org/10.1145/1562814.1562830},
  doi       = {10.1145/1562814.1562830},
  timestamp = {Mon, 20 Jul 2009 07:35:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/tark/DevanurF09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/tark/Fortnow09,
  author    = {Lance Fortnow},
  title     = {Program equilibria and discounted computation time},
  booktitle = {Proceedings of the 12th Conference on Theoretical Aspects of Rationality
               and Knowledge (TARK-2009), Stanford, CA, USA, July 6-8, 2009},
  pages     = {128--133},
  year      = {2009},
  crossref  = {DBLP:conf/tark/2009},
  url       = {http://doi.acm.org/10.1145/1562814.1562833},
  doi       = {10.1145/1562814.1562833},
  timestamp = {Mon, 20 Jul 2009 07:35:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/tark/Fortnow09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2009P9421,
  editor    = {Manindra Agrawal and
               Lance Fortnow and
               Thomas Thierauf and
               Christopher Umans},
  title     = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {09421},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year      = {2009},
  url       = {http://drops.dagstuhl.de/portals/09421/},
  timestamp = {Wed, 08 Apr 2015 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2009P9421},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sigecom/2009,
  editor    = {John Chuang and
               Lance Fortnow and
               Pearl Pu},
  title     = {Proceedings 10th {ACM} Conference on Electronic Commerce (EC-2009),
               Stanford, California, USA, July 6--10, 2009},
  publisher = {{ACM}},
  year      = {2009},
  isbn      = {978-1-60558-458-4},
  timestamp = {Mon, 24 Feb 2014 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09,
  author    = {Manindra Agrawal and
               Lance Fortnow and
               Thomas Thierauf and
               Christopher Umans},
  title     = {09421 Abstracts Collection - Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  year      = {2009},
  crossref  = {DBLP:conf/dagstuhl/2009P9421},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2418/},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/AgrawalFTU09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09a,
  author    = {Manindra Agrawal and
               Lance Fortnow and
               Thomas Thierauf and
               Christopher Umans},
  title     = {09421 Executive Summary - Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  year      = {2009},
  crossref  = {DBLP:conf/dagstuhl/2009P9421},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2410/},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/AgrawalFTU09a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanFS09,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Rahul Santhanam},
  title     = {Unconditional Lower Bounds against Advice},
  booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  year      = {2009},
  crossref  = {DBLP:conf/dagstuhl/2009P9421},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2411/},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/BuhrmanFS09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-4775,
  author    = {Lance Fortnow and
               Joshua A. Grochow},
  title     = {Complexity Classes of Equivalence Problems Revisited},
  journal   = {CoRR},
  volume    = {abs/0907.4775},
  year      = {2009},
  url       = {http://arxiv.org/abs/0907.4775},
  archivePrefix = {arXiv},
  eprint    = {0907.4775},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0907-4775},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-3162,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Bounding Rationality by Discounting Time},
  journal   = {CoRR},
  volume    = {abs/0911.3162},
  year      = {2009},
  url       = {http://arxiv.org/abs/0911.3162},
  archivePrefix = {arXiv},
  eprint    = {0911.3162},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0911-3162},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-3162,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Michal Kouck{\'{y}} and
               Bruno Loff},
  title     = {Derandomizing from Random Strings},
  journal   = {CoRR},
  volume    = {abs/0912.3162},
  year      = {2009},
  url       = {http://arxiv.org/abs/0912.3162},
  archivePrefix = {arXiv},
  eprint    = {0912.3162},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0912-3162},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/BuhrmanFS09,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Rahul Santhanam},
  title     = {Unconditional Lower Bounds against Advice},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {64},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/064},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BuhrmanFS09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/FortnowIKU08,
  author    = {Lance Fortnow and
               Russell Impagliazzo and
               Valentine Kabanets and
               Christopher Umans},
  title     = {On the Complexity of Succinct Zero-Sum Games},
  journal   = {Computational Complexity},
  volume    = {17},
  number    = {3},
  pages     = {353--376},
  year      = {2008},
  url       = {https://doi.org/10.1007/s00037-008-0252-2},
  doi       = {10.1007/s00037-008-0252-2},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/FortnowIKU08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FortnowPS08,
  author    = {Lance Fortnow and
               Aduri Pavan and
               Samik Sengupta},
  title     = {Proving {SAT} does not have small circuits with an application to
               the two queries problem},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {74},
  number    = {3},
  pages     = {358--363},
  year      = {2008},
  url       = {https://doi.org/10.1016/j.jcss.2007.06.017},
  doi       = {10.1016/j.jcss.2007.06.017},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/FortnowPS08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanFNR08,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Ilan Newman and
               Hein R{\"{o}}hrig},
  title     = {Quantum Property Testing},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1387--1400},
  year      = {2008},
  url       = {https://doi.org/10.1137/S0097539704442416},
  doi       = {10.1137/S0097539704442416},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/BuhrmanFNR08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigecom/FortnowV08,
  author    = {Lance Fortnow and
               Rakesh V. Vohra},
  title     = {The complexity of forecast testing},
  journal   = {SIGecom Exchanges},
  volume    = {7},
  number    = {3},
  year      = {2008},
  url       = {http://doi.acm.org/10.1145/1486877.1486885},
  doi       = {10.1145/1486877.1486885},
  timestamp = {Tue, 19 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigecom/FortnowV08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/FortnowV08,
  author    = {Lance Fortnow and
               Rakesh Vohra},
  title     = {The complexity of forecast testing: abstract},
  booktitle = {Proceedings 9th {ACM} Conference on Electronic Commerce (EC-2008),
               Chicago, IL, USA, June 8-12, 2008},
  pages     = {139},
  year      = {2008},
  crossref  = {DBLP:conf/sigecom/2008},
  url       = {http://doi.acm.org/10.1145/1386790.1386814},
  doi       = {10.1145/1386790.1386814},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/FortnowV08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/ChenFLPW08,
  author    = {Yiling Chen and
               Lance Fortnow and
               Nicolas S. Lambert and
               David M. Pennock and
               Jennifer Wortman},
  title     = {Complexity of combinatorial market makers},
  booktitle = {Proceedings 9th {ACM} Conference on Electronic Commerce (EC-2008),
               Chicago, IL, USA, June 8-12, 2008},
  pages     = {190--199},
  year      = {2008},
  crossref  = {DBLP:conf/sigecom/2008},
  url       = {http://doi.acm.org/10.1145/1386790.1386822},
  doi       = {10.1145/1386790.1386822},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/ChenFLPW08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FortnowS08,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Infeasibility of instance compression and succinct PCPs for {NP}},
  booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
               Victoria, British Columbia, Canada, May 17-20, 2008},
  pages     = {133--142},
  year      = {2008},
  crossref  = {DBLP:conf/stoc/2008},
  url       = {http://doi.acm.org/10.1145/1374376.1374398},
  doi       = {10.1145/1374376.1374398},
  timestamp = {Sat, 19 Jun 2010 14:44:24 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/FortnowS08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2007P7411,
  editor    = {Manindra Agrawal and
               Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {07411},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
               (IBFI), Schloss Dagstuhl, Germany},
  year      = {2008},
  url       = {http://drops.dagstuhl.de/portals/07411/},
  timestamp = {Wed, 19 Jun 2013 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2007P7411},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sigecom/2008,
  editor    = {Lance Fortnow and
               John Riedl and
               Tuomas Sandholm},
  title     = {Proceedings 9th {ACM} Conference on Electronic Commerce (EC-2008),
               Chicago, IL, USA, June 8-12, 2008},
  publisher = {{ACM}},
  year      = {2008},
  isbn      = {978-1-60558-169-9},
  timestamp = {Mon, 24 Feb 2014 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-1362,
  author    = {Yiling Chen and
               Lance Fortnow and
               Nicolas S. Lambert and
               David M. Pennock and
               Jennifer Wortman},
  title     = {Complexity of Combinatorial Market Makers},
  journal   = {CoRR},
  volume    = {abs/0802.1362},
  year      = {2008},
  url       = {http://arxiv.org/abs/0802.1362},
  archivePrefix = {arXiv},
  eprint    = {0802.1362},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0802-1362},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/DevanurF08,
  author    = {Nikhil R. Devanur and
               Lance Fortnow},
  title     = {A Computational Theory of Awareness and Decision Making},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {15},
  number    = {046},
  year      = {2008},
  url       = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-046/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/DevanurF08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigecom/ChenFNP07,
  author    = {Yiling Chen and
               Lance Fortnow and
               Evdokia Nikolova and
               David M. Pennock},
  title     = {Combinatorial betting},
  journal   = {SIGecom Exchanges},
  volume    = {7},
  number    = {1},
  pages     = {61--64},
  year      = {2007},
  url       = {http://doi.acm.org/10.1145/1345037.1345053},
  doi       = {10.1145/1345037.1345053},
  timestamp = {Thu, 10 Jul 2008 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/sigecom/ChenFNP07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/AntunesFPS07,
  author    = {Luis Antunes and
               Lance Fortnow and
               Alexandre Pinto and
               Andre Souto},
  title     = {Low-Depth Witnesses are Easy to Find},
  booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
               13-16 June 2007, San Diego, California, {USA}},
  pages     = {46--51},
  year      = {2007},
  crossref  = {DBLP:conf/coco/2007},
  url       = {https://doi.org/10.1109/CCC.2007.13},
  doi       = {10.1109/CCC.2007.13},
  timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/AntunesFPS07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/csr/BuhrmanFKRV07,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Michal Kouck{\'{y}} and
               John D. Rogers and
               Nikolai K. Vereshchagin},
  title     = {Inverting Onto Functions and Polynomial Hierarchy},
  booktitle = {Computer Science - Theory and Applications, Second International Symposium
               on Computer Science in Russia, {CSR} 2007, Ekaterinburg, Russia, September
               3-7, 2007, Proceedings},
  pages     = {92--103},
  year      = {2007},
  crossref  = {DBLP:conf/csr/2007},
  url       = {https://doi.org/10.1007/978-3-540-74510-5_12},
  doi       = {10.1007/978-3-540-74510-5_12},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csr/BuhrmanFKRV07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/ChenFNP07,
  author    = {Yiling Chen and
               Lance Fortnow and
               Evdokia Nikolova and
               David M. Pennock},
  title     = {Betting on permutations},
  booktitle = {Proceedings 8th {ACM} Conference on Electronic Commerce (EC-2007),
               San Diego, California, USA, June 11-15, 2007},
  pages     = {326--335},
  year      = {2007},
  crossref  = {DBLP:conf/sigecom/2007},
  url       = {http://doi.acm.org/10.1145/1250910.1250957},
  doi       = {10.1145/1250910.1250957},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/ChenFNP07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/wine/ChenRPHFG07,
  author    = {Yiling Chen and
               Daniel M. Reeves and
               David M. Pennock and
               Robin D. Hanson and
               Lance Fortnow and
               Rica Gonen},
  title     = {Bluffing and Strategic Reticence in Prediction Markets},
  booktitle = {Internet and Network Economics, Third International Workshop, {WINE}
               2007, San Diego, CA, USA, December 12-14, 2007, Proceedings},
  pages     = {70--81},
  year      = {2007},
  crossref  = {DBLP:conf/wine/2007},
  url       = {https://doi.org/10.1007/978-3-540-77105-0_10},
  doi       = {10.1007/978-3-540-77105-0_10},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/wine/ChenRPHFG07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07,
  author    = {Manindra Agrawal and
               Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {07411 Executive Summary -- Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
  year      = {2007},
  crossref  = {DBLP:conf/dagstuhl/2007P7411},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2008/1306},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/AgrawalBFT07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07a,
  author    = {Manindra Agrawal and
               Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {07411 Abstracts Collection -- Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
  year      = {2007},
  crossref  = {DBLP:conf/dagstuhl/2007P7411},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2008/1307},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/AgrawalBFT07a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FortnowS07,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Time Hierarchies: {A} Survey},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {004},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-004/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FortnowS07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FortnowS07a,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Infeasibility of Instance Compression and Succinct PCPs for {NP}},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {096},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-096/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FortnowS07a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/BeigelFG06,
  author    = {Richard Beigel and
               Lance Fortnow and
               William I. Gasarch},
  title     = {A tight lower bound for restricted pir protocols},
  journal   = {Computational Complexity},
  volume    = {15},
  number    = {1},
  pages     = {82--91},
  year      = {2006},
  url       = {https://doi.org/10.1007/s00037-006-0208-3},
  doi       = {10.1007/s00037-006-0208-3},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BeigelFG06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jsyml/BeigelBFFGLMST06,
  author    = {Richard Beigel and
               Harry Buhrman and
               Peter A. Fejer and
               Lance Fortnow and
               Piotr Grabowski and
               Luc Longpr{\'{e}} and
               Andrej Muchnik and
               Frank Stephan and
               Leen Torenvliet},
  title     = {Enumerations of the Kolmogorov function},
  journal   = {J. Symb. Log.},
  volume    = {71},
  number    = {2},
  pages     = {501--528},
  year      = {2006},
  url       = {https://doi.org/10.2178/jsl/1146620156},
  doi       = {10.2178/jsl/1146620156},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jsyml/BeigelBFFGLMST06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/BeigelFS06,
  author    = {Richard Beigel and
               Lance Fortnow and
               Frank Stephan},
  title     = {Infinitely-Often Autoreducible Sets},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {3},
  pages     = {595--608},
  year      = {2006},
  url       = {https://doi.org/10.1137/S0097539704441630},
  doi       = {10.1137/S0097539704441630},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/BeigelFS06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/AntunesFMV06,
  author    = {Luis Antunes and
               Lance Fortnow and
               Dieter van Melkebeek and
               N. V. Vinodchandran},
  title     = {Computational depth: Concept and applications},
  journal   = {Theor. Comput. Sci.},
  volume    = {354},
  number    = {3},
  pages     = {391--404},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.tcs.2005.11.033},
  doi       = {10.1016/j.tcs.2005.11.033},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/AntunesFMV06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toc/FischerF06,
  author    = {Eldar Fischer and
               Lance Fortnow},
  title     = {Tolerant Versus Intolerant Testing for Boolean Properties},
  journal   = {Theory of Computing},
  volume    = {2},
  number    = {9},
  pages     = {173--183},
  year      = {2006},
  url       = {https://doi.org/10.4086/toc.2006.v002a009},
  doi       = {10.4086/toc.2006.v002a009},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/toc/FischerF06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/colt/FortnowK06,
  author    = {Lance Fortnow and
               Adam R. Klivans},
  title     = {Efficient Learning Algorithms Yield Circuit Lower Bounds},
  booktitle = {Learning Theory, 19th Annual Conference on Learning Theory, {COLT}
               2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings},
  pages     = {350--363},
  year      = {2006},
  crossref  = {DBLP:conf/colt/2006},
  url       = {https://doi.org/10.1007/11776420_27},
  doi       = {10.1007/11776420_27},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/colt/FortnowK06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FortnowHPVW06,
  author    = {Lance Fortnow and
               John M. Hitchcock and
               Aduri Pavan and
               N. V. Vinodchandran and
               Fengming Wang},
  title     = {Extracting Kolmogorov Complexity with Applications to Dimension Zero-One
               Laws},
  booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
               {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
  pages     = {335--345},
  year      = {2006},
  crossref  = {DBLP:conf/icalp/2006-1},
  url       = {https://doi.org/10.1007/11786986_30},
  doi       = {10.1007/11786986_30},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/FortnowHPVW06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FortnowO06,
  author    = {Lance Fortnow and
               Mitsunori Ogihara},
  title     = {Very Sparse Leaf Languages},
  booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
               Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
               August 28-September 1, 2006, Proceedings},
  pages     = {375--386},
  year      = {2006},
  crossref  = {DBLP:conf/mfcs/2006},
  url       = {https://doi.org/10.1007/11821069_33},
  doi       = {10.1007/11821069_33},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/FortnowO06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FortnowLV06,
  author    = {Lance Fortnow and
               Troy Lee and
               Nikolai K. Vereshchagin},
  title     = {Kolmogorov Complexity with Error},
  booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
               Science, Marseille, France, February 23-25, 2006, Proceedings},
  pages     = {137--148},
  year      = {2006},
  crossref  = {DBLP:conf/stacs/2006},
  url       = {https://doi.org/10.1007/11672142_10},
  doi       = {10.1007/11672142_10},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/FortnowLV06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FortnowK06,
  author    = {Lance Fortnow and
               Adam R. Klivans},
  title     = {Linear Advice for Randomized Logarithmic Space},
  booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
               Science, Marseille, France, February 23-25, 2006, Proceedings},
  pages     = {469--476},
  year      = {2006},
  crossref  = {DBLP:conf/stacs/2006},
  url       = {https://doi.org/10.1007/11672142_38},
  doi       = {10.1007/11672142_38},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/FortnowK06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/BuhrmanFKRV06,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Michal Kouck{\'{y}} and
               John D. Rogers and
               Nikolai K. Vereshchagin},
  title     = {Inverting onto functions might not be hard},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {024},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-024/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BuhrmanFKRV06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/AntunesFPS06,
  author    = {Luis Antunes and
               Lance Fortnow and
               Alexandre Pinto and
               Andre Souto},
  title     = {Low-Depth Witnesses are Easy to Find},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {125},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-125/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/AntunesFPS06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FortnowV06,
  author    = {Lance Fortnow and
               Rakesh Vohra},
  title     = {The Complexity of Forecast Testing},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {149},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-149/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FortnowV06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FortnowS06,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Fixed-Polynomial Size Circuit Bounds},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {157},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-157/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FortnowS06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dss/FortnowKPW05,
  author    = {Lance Fortnow and
               Joe Kilian and
               David M. Pennock and
               Michael P. Wellman},
  title     = {Betting Boolean-style: a framework for trading in securities based
               on logical formulas},
  journal   = {Decision Support Systems},
  volume    = {39},
  number    = {1},
  pages     = {87--104},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.dss.2004.08.010},
  doi       = {10.1016/j.dss.2004.08.010},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dss/FortnowKPW05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/FortnowLMV05,
  author    = {Lance Fortnow and
               Richard J. Lipton and
               Dieter van Melkebeek and
               Anastasios Viglas},
  title     = {Time-space lower bounds for satisfiability},
  journal   = {J. {ACM}},
  volume    = {52},
  number    = {6},
  pages     = {835--865},
  year      = {2005},
  url       = {http://doi.acm.org/10.1145/1101821.1101822},
  doi       = {10.1145/1101821.1101822},
  timestamp = {Fri, 10 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/FortnowLMV05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FortnowL05,
  author    = {Lance Fortnow and
               Jack H. Lutz},
  title     = {Prediction and dimension},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {70},
  number    = {4},
  pages     = {570--589},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.jcss.2004.10.007},
  doi       = {10.1016/j.jcss.2004.10.007},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/FortnowL05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanFP05,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Aduri Pavan},
  title     = {Some Results on Derandomization},
  journal   = {Theory Comput. Syst.},
  volume    = {38},
  number    = {2},
  pages     = {211--227},
  year      = {2005},
  url       = {https://doi.org/10.1007/s00224-004-1194-y},
  doi       = {10.1007/s00224-004-1194-y},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/BuhrmanFP05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajEFMNRS05,
  author    = {Artur Czumaj and
               Funda Erg{\"{u}}n and
               Lance Fortnow and
               Avner Magen and
               Ilan Newman and
               Ronitt Rubinfeld and
               Christian Sohler},
  title     = {Approximating the Weight of the Euclidean Minimum Spanning Tree in
               Sublinear Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {35},
  number    = {1},
  pages     = {91--109},
  year      = {2005},
  url       = {https://doi.org/10.1137/S0097539703435297},
  doi       = {10.1137/S0097539703435297},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/CzumajEFMNRS05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/FeigenbaumFPS05,
  author    = {Joan Feigenbaum and
               Lance Fortnow and
               David M. Pennock and
               Rahul Sami},
  title     = {Computation in a distributed information market},
  journal   = {Theor. Comput. Sci.},
  volume    = {343},
  number    = {1-2},
  pages     = {114--132},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.tcs.2005.05.010},
  doi       = {10.1016/j.tcs.2005.05.010},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/FeigenbaumFPS05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FischerF05,
  author    = {Eldar Fischer and
               Lance Fortnow},
  title     = {Tolerant Versus Intolerant Testing for Boolean Properties},
  booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
               11-15 June 2005, San Jose, CA, {USA}},
  pages     = {135--140},
  year      = {2005},
  crossref  = {DBLP:conf/coco/2005},
  url       = {https://doi.org/10.1109/CCC.2005.30},
  doi       = {10.1109/CCC.2005.30},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FischerF05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowK05,
  author    = {Lance Fortnow and
               Adam R. Klivans},
  title     = {{NP} with Small Advice},
  booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
               11-15 June 2005, San Jose, CA, {USA}},
  pages     = {228--234},
  year      = {2005},
  crossref  = {DBLP:conf/coco/2005},
  url       = {https://doi.org/10.1109/CCC.2005.15},
  doi       = {10.1109/CCC.2005.15},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowK05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowIKU05,
  author    = {Lance Fortnow and
               Russell Impagliazzo and
               Valentine Kabanets and
               Christopher Umans},
  title     = {On the Complexity of Succinct Zero-Sum Games},
  booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
               11-15 June 2005, San Jose, CA, {USA}},
  pages     = {323--332},
  year      = {2005},
  crossref  = {DBLP:conf/coco/2005},
  url       = {https://doi.org/10.1109/CCC.2005.18},
  doi       = {10.1109/CCC.2005.18},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowIKU05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanFNV05,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Ilan Newman and
               Nikolai K. Vereshchagin},
  title     = {Increasing Kolmogorov Complexity},
  booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
               Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  pages     = {412--421},
  year      = {2005},
  crossref  = {DBLP:conf/stacs/2005},
  url       = {https://doi.org/10.1007/978-3-540-31856-9_34},
  doi       = {10.1007/978-3-540-31856-9_34},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/BuhrmanFNV05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Fortnow05,
  author    = {Lance Fortnow},
  title     = {Beyond {NP:} the work and legacy of Larry Stockmeyer},
  booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
               Baltimore, MD, USA, May 22-24, 2005},
  pages     = {120--127},
  year      = {2005},
  crossref  = {DBLP:conf/stoc/2005},
  url       = {http://doi.acm.org/10.1145/1060590.1060609},
  doi       = {10.1145/1060590.1060609},
  timestamp = {Wed, 15 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/Fortnow05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FortnowST05,
  author    = {Lance Fortnow and
               Rahul Santhanam and
               Luca Trevisan},
  title     = {Hierarchies for semantic classes},
  booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
               Baltimore, MD, USA, May 22-24, 2005},
  pages     = {348--355},
  year      = {2005},
  crossref  = {DBLP:conf/stoc/2005},
  url       = {http://doi.acm.org/10.1145/1060590.1060642},
  doi       = {10.1145/1060590.1060642},
  timestamp = {Wed, 15 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/FortnowST05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2004P4421,
  editor    = {Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {04421},
  publisher = {IBFI, Schloss Dagstuhl, Germany},
  year      = {2005},
  url       = {http://drops.dagstuhl.de/portals/04421/},
  timestamp = {Wed, 19 Jun 2013 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2004P4421},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-042,
  author    = {Lance Fortnow and
               Adam R. Klivans},
  title     = {Linear Advice for Randomized Logarithmic Space},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {042},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-042/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR05-042},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-105,
  author    = {Lance Fortnow and
               John M. Hitchcock and
               Aduri Pavan and
               N. V. Vinodchandran and
               Fengming Wang},
  title     = {Extracting Kolmogorov Complexity with Applications to Dimension Zero-One
               Laws},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {105},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-105/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR05-105},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-144,
  author    = {Lance Fortnow and
               Luis Antunes},
  title     = {Time-Bounded Universal Distributions},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {144},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-144/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR05-144},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/Fortnow04,
  author    = {Lance Fortnow},
  title     = {Review of "Theory of semi-feasible algorithms" by Lane Hemaspaandra
               and Leen Torenvliet. Springer},
  journal   = {{SIGACT} News},
  volume    = {35},
  number    = {2},
  pages     = {16--18},
  year      = {2004},
  url       = {http://doi.acm.org/10.1145/992287.992294},
  doi       = {10.1145/992287.992294},
  timestamp = {Thu, 08 May 2008 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/Fortnow04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FortnowS04,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Hierarchy Theorems for Probabilistic Polynomial Time},
  booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
               October 2004, Rome, Italy, Proceedings},
  pages     = {316--324},
  year      = {2004},
  crossref  = {DBLP:conf/focs/2004},
  url       = {https://doi.org/10.1109/FOCS.2004.33},
  doi       = {10.1109/FOCS.2004.33},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FortnowS04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanFT04,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {04421 Abstracts Collection - Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
  year      = {2004},
  crossref  = {DBLP:conf/dagstuhl/2004P4421},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2005/116},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/BuhrmanFT04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-001,
  author    = {Lance Fortnow and
               Russell Impagliazzo and
               Valentine Kabanets and
               Christopher Umans},
  title     = {On the complexity of succinct zero-sum games},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {001},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-001/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR04-001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-015,
  author    = {Richard Beigel and
               Harry Buhrman and
               Peter A. Fejer and
               Lance Fortnow and
               Piotr Grabowski and
               Luc Longpr{\'{e}} and
               Andrei A. Muchnik and
               Frank Stephan and
               Leen Torenvliet},
  title     = {Enumerations of the Kolmogorov Function},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {015},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-015/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR04-015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-080,
  author    = {Lance Fortnow and
               Troy Lee and
               Nikolai K. Vereshchagin},
  title     = {Kolmogorov Complexity with Error},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {080},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-080/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR04-080},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-081,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Ilan Newman and
               Nikolai K. Vereshchagin},
  title     = {Increasing Kolmogorov Complexity},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {081},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-081/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR04-081},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-098,
  author    = {Lance Fortnow and
               Rahul Santhanam and
               Luca Trevisan},
  title     = {Promise Hierarchies},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {098},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-098/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR04-098},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-103,
  author    = {Lance Fortnow and
               Adam R. Klivans},
  title     = {{NP} with Small Advice},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {103},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-103/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR04-103},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-105,
  author    = {Eldar Fischer and
               Lance Fortnow},
  title     = {Tolerant Versus Intolerant Testing for Boolean Properties},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {105},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-105/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR04-105},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eatcs/FortnowH03,
  author    = {Lance Fortnow and
               Steven Homer},
  title     = {A Short History of Computational Complexity},
  journal   = {Bulletin of the {EATCS}},
  volume    = {80},
  pages     = {95--133},
  year      = {2003},
  timestamp = {Mon, 05 May 2008 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eatcs/FortnowH03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iandc/FennerFKL03,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Stuart A. Kurtz and
               Lide Li},
  title     = {An oracle builder's toolkit},
  journal   = {Inf. Comput.},
  volume    = {182},
  number    = {2},
  pages     = {95--136},
  year      = {2003},
  url       = {https://doi.org/10.1016/S0890-5401(03)00018-X},
  doi       = {10.1016/S0890-5401(03)00018-X},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/FennerFKL03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iandc/FennerFNR03,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Ashish V. Naik and
               John D. Rogers},
  title     = {Inverting onto functions},
  journal   = {Inf. Comput.},
  volume    = {186},
  number    = {1},
  pages     = {90--103},
  year      = {2003},
  url       = {https://doi.org/10.1016/S0890-5401(03)00119-6},
  doi       = {10.1016/S0890-5401(03)00119-6},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/FennerFNR03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/Fortnow03,
  author    = {Lance Fortnow},
  title     = {One complexity theorist's view of quantum computing},
  journal   = {Theor. Comput. Sci.},
  volume    = {292},
  number    = {3},
  pages     = {597--610},
  year      = {2003},
  url       = {https://doi.org/10.1016/S0304-3975(01)00377-2},
  doi       = {10.1016/S0304-3975(01)00377-2},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/Fortnow03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/DowneyF03,
  author    = {Rodney G. Downey and
               Lance Fortnow},
  title     = {Uniformly hard languages},
  journal   = {Theor. Comput. Sci.},
  volume    = {298},
  number    = {2},
  pages     = {303--315},
  year      = {2003},
  url       = {https://doi.org/10.1016/S0304-3975(02)00810-1},
  doi       = {10.1016/S0304-3975(02)00810-1},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/DowneyF03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelF03,
  author    = {Richard Beigel and
               Lance Fortnow},
  title     = {Are Cook and Karp Ever the Same?},
  booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
               2003), 7-10 July 2003, Aarhus, Denmark},
  pages     = {333--336},
  year      = {2003},
  crossref  = {DBLP:conf/coco/2003},
  url       = {https://doi.org/10.1109/CCC.2003.1214431},
  doi       = {10.1109/CCC.2003.1214431},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BeigelF03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowPS03,
  author    = {Lance Fortnow and
               Aduri Pavan and
               Samik Sengupta},
  title     = {Proving {SAT} does not have Small Circuits with an Application to
               the Two},
  booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
               2003), 7-10 July 2003, Aarhus, Denmark},
  pages     = {347},
  year      = {2003},
  crossref  = {DBLP:conf/coco/2003},
  url       = {https://doi.org/10.1109/CCC.2003.1214433},
  doi       = {10.1109/CCC.2003.1214433},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowPS03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fct/AntunesFV03,
  author    = {Luis Antunes and
               Lance Fortnow and
               N. V. Vinodchandran},
  title     = {Using Depth to Capture Average-Case Complexity},
  booktitle = {Fundamentals of Computation Theory, 14th International Symposium,
               {FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
  pages     = {303--310},
  year      = {2003},
  crossref  = {DBLP:conf/fct/2003},
  url       = {https://doi.org/10.1007/978-3-540-45077-1_28},
  doi       = {10.1007/978-3-540-45077-1_28},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fct/AntunesFV03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AntunesF03,
  author    = {Luis Antunes and
               Lance Fortnow},
  title     = {Sophistication Revisited},
  booktitle = {Automata, Languages and Programming, 30th International Colloquium,
               {ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
               Proceedings},
  pages     = {267--277},
  year      = {2003},
  crossref  = {DBLP:conf/icalp/2003},
  url       = {https://doi.org/10.1007/3-540-45061-0_23},
  doi       = {10.1007/3-540-45061-0_23},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/AntunesF03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BeigelFS03,
  author    = {Richard Beigel and
               Lance Fortnow and
               Frank Stephan},
  title     = {Infinitely-Often Autoreducible Sets},
  booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
               2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
  pages     = {98--107},
  year      = {2003},
  crossref  = {DBLP:conf/isaac/2003},
  url       = {https://doi.org/10.1007/978-3-540-24587-2_12},
  doi       = {10.1007/978-3-540-24587-2_12},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/BeigelFS03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/FortnowKPW03,
  author    = {Lance Fortnow and
               Joe Kilian and
               David M. Pennock and
               Michael P. Wellman},
  title     = {Betting boolean-style: a framework for trading in securities based
               on logical formulas},
  booktitle = {Proceedings 4th {ACM} Conference on Electronic Commerce (EC-2003),
               San Diego, California, USA, June 9-12, 2003},
  pages     = {144--155},
  year      = {2003},
  crossref  = {DBLP:conf/sigecom/2003},
  url       = {http://doi.acm.org/10.1145/779928.779946},
  doi       = {10.1145/779928.779946},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/FortnowKPW03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/FeigenbaumFPS03,
  author    = {Joan Feigenbaum and
               Lance Fortnow and
               David M. Pennock and
               Rahul Sami},
  title     = {Computation in a distributed information market},
  booktitle = {Proceedings 4th {ACM} Conference on Electronic Commerce (EC-2003),
               San Diego, California, USA, June 9-12, 2003},
  pages     = {156--165},
  year      = {2003},
  crossref  = {DBLP:conf/sigecom/2003},
  url       = {http://doi.acm.org/10.1145/779928.779947},
  doi       = {10.1145/779928.779947},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/FeigenbaumFPS03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuhrmanFNR03,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Ilan Newman and
               Hein R{\"{o}}hrig},
  title     = {Quantum property testing},
  booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA.}},
  pages     = {480--488},
  year      = {2003},
  crossref  = {DBLP:conf/soda/2003},
  url       = {http://dl.acm.org/citation.cfm?id=644108.644188},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/BuhrmanFNR03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/CzumajEFMNRS03,
  author    = {Artur Czumaj and
               Funda Erg{\"{u}}n and
               Lance Fortnow and
               Avner Magen and
               Ilan Newman and
               Ronitt Rubinfeld and
               Christian Sohler},
  title     = {Sublinear-time approximation of Euclidean minimum spanning tree},
  booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA.}},
  pages     = {813--822},
  year      = {2003},
  crossref  = {DBLP:conf/soda/2003},
  url       = {http://dl.acm.org/citation.cfm?id=644108.644242},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/CzumajEFMNRS03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanFP03,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Aduri Pavan},
  title     = {Some Results on Derandomization},
  booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
               Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
  pages     = {212--222},
  year      = {2003},
  crossref  = {DBLP:conf/stacs/2003},
  url       = {https://doi.org/10.1007/3-540-36494-3_20},
  doi       = {10.1007/3-540-36494-3_20},
  timestamp = {Mon, 29 May 2017 16:53:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/BuhrmanFP03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanCF03,
  author    = {Harry Buhrman and
               Richard Chang and
               Lance Fortnow},
  title     = {One Bit of Advice},
  booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
               Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
  pages     = {547--558},
  year      = {2003},
  crossref  = {DBLP:conf/stacs/2003},
  url       = {https://doi.org/10.1007/3-540-36494-3_48},
  doi       = {10.1007/3-540-36494-3_48},
  timestamp = {Mon, 29 May 2017 16:53:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/BuhrmanCF03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-087,
  author    = {Richard Beigel and
               Lance Fortnow and
               William I. Gasarch},
  title     = {A Nearly Tight Bound for Private Information Retrieval Protocols},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {087},
  year      = {2003},
  url       = {http://eccc.hpi-web.de/eccc-reports/2003/TR03-087/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR03-087},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/FortnowR02,
  author    = {Lance Fortnow and
               John D. Rogers},
  title     = {Separability and one-way functions},
  journal   = {Computational Complexity},
  volume    = {11},
  number    = {3-4},
  pages     = {137--157},
  year      = {2002},
  url       = {https://doi.org/10.1007/s00037-002-0173-4},
  doi       = {10.1007/s00037-002-0173-4},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/FortnowR02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/Fortnow02,
  author    = {Lance Fortnow},
  title     = {The History of Complexity},
  booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
               Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
               2002},
  pages     = {61},
  year      = {2002},
  crossref  = {DBLP:conf/coco/2002},
  url       = {https://doi.org/10.1109/CCC.2002.1004340},
  doi       = {10.1109/CCC.2002.1004340},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/Fortnow02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/colt/FortnowL02,
  author    = {Lance Fortnow and
               Jack H. Lutz},
  title     = {Prediction and Dimension},
  booktitle = {Computational Learning Theory, 15th Annual Conference on Computational
               Learning Theory, {COLT} 2002, Sydney, Australia, July 8-10, 2002,
               Proceedings},
  pages     = {380--395},
  year      = {2002},
  crossref  = {DBLP:conf/colt/2002},
  url       = {https://doi.org/10.1007/3-540-45435-7_26},
  doi       = {10.1007/3-540-45435-7_26},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/colt/FortnowL02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanFFT01,
  author    = {Harry Buhrman and
               Stephen A. Fenner and
               Lance Fortnow and
               Leen Torenvliet},
  title     = {Two oracles that force a big crunch},
  journal   = {Computational Complexity},
  volume    = {10},
  number    = {2},
  pages     = {93--116},
  year      = {2001},
  url       = {https://doi.org/10.1007/s00037-001-8190-2},
  doi       = {10.1007/s00037-001-8190-2},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BuhrmanFFT01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/Fortnow01,
  author    = {Lance Fortnow},
  title     = {Guest Editor's Foreword},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {62},
  number    = {2},
  pages     = {215},
  year      = {2001},
  url       = {https://doi.org/10.1006/jcss.2000.1724},
  doi       = {10.1006/jcss.2000.1724},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/Fortnow01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/FortnowPS01,
  author    = {Lance Fortnow and
               Aduri Pavan and
               Alan L. Selman},
  title     = {Distributionally Hard Languages},
  journal   = {Theory Comput. Syst.},
  volume    = {34},
  number    = {3},
  pages     = {245--261},
  year      = {2001},
  url       = {https://doi.org/10.1007/s00224-001-0003-0},
  doi       = {10.1007/s00224-001-0003-0},
  timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/FortnowPS01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanFL01,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Sophie Laplante},
  title     = {Resource-Bounded Kolmogorov Complexity Revisited},
  journal   = {{SIAM} J. Comput.},
  volume    = {31},
  number    = {3},
  pages     = {887--905},
  year      = {2001},
  url       = {https://doi.org/10.1137/S009753979834388X},
  doi       = {10.1137/S009753979834388X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/BuhrmanFL01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/Fortnow01,
  author    = {Lance Fortnow},
  title     = {Comparing Notions of Full Derandomization},
  booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
               Complexity, Chicago, Illinois, USA, June 18-21, 2001},
  pages     = {28--34},
  year      = {2001},
  crossref  = {DBLP:conf/coco/2001},
  url       = {https://doi.org/10.1109/CCC.2001.933869},
  doi       = {10.1109/CCC.2001.933869},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/Fortnow01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/AntunesFM01,
  author    = {Luis Antunes and
               Lance Fortnow and
               Dieter van Melkebeek},
  title     = {Computational Depth},
  booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
               Complexity, Chicago, Illinois, USA, June 18-21, 2001},
  pages     = {266--273},
  year      = {2001},
  crossref  = {DBLP:conf/coco/2001},
  url       = {https://doi.org/10.1109/CCC.2001.933893},
  doi       = {10.1109/CCC.2001.933893},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/AntunesFM01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/BatuFFKRW01,
  author    = {Tugkan Batu and
               Lance Fortnow and
               Eldar Fischer and
               Ravi Kumar and
               Ronitt Rubinfeld and
               Patrick White},
  title     = {Testing Random Variables for Independence and Identity},
  booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
               14-17 October 2001, Las Vegas, Nevada, {USA}},
  pages     = {442--451},
  year      = {2001},
  crossref  = {DBLP:conf/focs/2001},
  url       = {https://doi.org/10.1109/SFCS.2001.959920},
  doi       = {10.1109/SFCS.2001.959920},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BatuFFKRW01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/recomb/BeigelAKAF01,
  author    = {Richard Beigel and
               Noga Alon and
               Simon Kasif and
               Mehmet Serkan Apaydin and
               Lance Fortnow},
  title     = {An optimal procedure for gap closing in whole genome shotgun sequencing},
  booktitle = {Proceedings of the Fifth Annual International Conference on Computational
               Biology, {RECOMB} 2001, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
               April 22-25, 2001},
  pages     = {22--30},
  year      = {2001},
  crossref  = {DBLP:conf/recomb/2001},
  url       = {http://doi.acm.org/10.1145/369133.369152},
  doi       = {10.1145/369133.369152},
  timestamp = {Thu, 02 Feb 2017 16:14:05 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/recomb/BeigelAKAF01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@incollection{DBLP:books/ws/phaunRS01/Fortnow01,
  author    = {Lance Fortnow},
  title     = {Diagonalization},
  booktitle = {Current Trends in Theoretical Computer Science},
  pages     = {102--114},
  year      = {2001},
  timestamp = {Wed, 15 May 2002 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/books/ws/phaunRS01/Fortnow01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eatcs/Fortnow00,
  author    = {Lance Fortnow},
  title     = {Diagonalization},
  journal   = {Bulletin of the {EATCS}},
  volume    = {71},
  pages     = {102--113},
  year      = {2000},
  timestamp = {Mon, 05 May 2003 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eatcs/Fortnow00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/Fortnow00,
  author    = {Lance Fortnow},
  title     = {Time-Space Tradeoffs for Satisfiability},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {60},
  number    = {2},
  pages     = {337--353},
  year      = {2000},
  url       = {https://doi.org/10.1006/jcss.1999.1671},
  doi       = {10.1006/jcss.1999.1671},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/Fortnow00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanFMT00,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Dieter van Melkebeek and
               Leen Torenvliet},
  title     = {Separating Complexity Classes Using Autoreducibility},
  journal   = {{SIAM} J. Comput.},
  volume    = {29},
  number    = {5},
  pages     = {1497--1520},
  year      = {2000},
  url       = {https://doi.org/10.1137/S0097539798334736},
  doi       = {10.1137/S0097539798334736},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/BuhrmanFMT00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/Fortnow00,
  author    = {Lance Fortnow},
  title     = {One complexity theorist's view of quantum computing},
  journal   = {Electr. Notes Theor. Comput. Sci.},
  volume    = {31},
  pages     = {58--72},
  year      = {2000},
  url       = {https://doi.org/10.1016/S1571-0661(05)80330-5},
  doi       = {10.1016/S1571-0661(05)80330-5},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/Fortnow00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowM00,
  author    = {Lance Fortnow and
               Dieter van Melkebeek},
  title     = {Time-Space Tradeoffs for Nondeterministic Computation},
  booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
               Complexity, Florence, Italy, July 4-7, 2000},
  pages     = {2--13},
  year      = {2000},
  crossref  = {DBLP:conf/coco/2000},
  url       = {https://doi.org/10.1109/CCC.2000.856730},
  doi       = {10.1109/CCC.2000.856730},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowM00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/BatuFRSW00,
  author    = {Tugkan Batu and
               Lance Fortnow and
               Ronitt Rubinfeld and
               Warren D. Smith and
               Patrick White},
  title     = {Testing that distributions are close},
  booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
               12-14 November 2000, Redondo Beach, California, {USA}},
  pages     = {259--269},
  year      = {2000},
  crossref  = {DBLP:conf/focs/2000},
  url       = {https://doi.org/10.1109/SFCS.2000.892113},
  doi       = {10.1109/SFCS.2000.892113},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BatuFRSW00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanFFM00,
  author    = {Harry Buhrman and
               Stephen A. Fenner and
               Lance Fortnow and
               Dieter van Melkebeek},
  title     = {Optimal Proof Systems and Sparse Sets},
  booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
               Science, Lille, France, February 2000, Proceedings},
  pages     = {407--418},
  year      = {2000},
  crossref  = {DBLP:conf/stacs/2000},
  url       = {https://doi.org/10.1007/3-540-46541-3_34},
  doi       = {10.1007/3-540-46541-3_34},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/BuhrmanFFM00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-0003035,
  author    = {Lance Fortnow},
  title     = {One Complexity Theorist's View of Quantum Computing},
  journal   = {CoRR},
  volume    = {quant-ph/0003035},
  year      = {2000},
  url       = {http://arxiv.org/abs/quant-ph/0003035},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/quant-ph-0003035},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-028,
  author    = {Lance Fortnow and
               Dieter van Melkebeek},
  title     = {Time-Space Tradeoffs for Nondeterministic Computation},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {7},
  number    = {28},
  year      = {2000},
  url       = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-028/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR00-028},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/Fortnow99,
  author    = {Lance Fortnow},
  title     = {Relativized Worlds with an Infinite Hierarchy},
  journal   = {Inf. Process. Lett.},
  volume    = {69},
  number    = {6},
  pages     = {309--313},
  year      = {1999},
  url       = {https://doi.org/10.1016/S0020-0190(99)00034-4},
  doi       = {10.1016/S0020-0190(99)00034-4},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/Fortnow99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanF99,
  author    = {Harry Buhrman and
               Lance Fortnow},
  title     = {Two Queries},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {59},
  number    = {2},
  pages     = {182--194},
  year      = {1999},
  url       = {https://doi.org/10.1006/jcss.1999.1647},
  doi       = {10.1006/jcss.1999.1647},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/BuhrmanF99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FortnowR99,
  author    = {Lance Fortnow and
               John D. Rogers},
  title     = {Complexity Limitations on Quantum Computation},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {59},
  number    = {2},
  pages     = {240--252},
  year      = {1999},
  url       = {https://doi.org/10.1006/jcss.1999.1651},
  doi       = {10.1006/jcss.1999.1651},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/FortnowR99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/Fortnow99,
  author    = {Lance Fortnow},
  title     = {Book review: of Bounded Queries in Recursion Theory by William A.
               Gasarch and Georgia A. Martin (Birkhauser. Boston, Basel, Berlin,
               1999)},
  journal   = {{SIGACT} News},
  volume    = {30},
  number    = {3},
  pages     = {13--15},
  year      = {1999},
  url       = {http://doi.acm.org/10.1145/333623.1042132},
  doi       = {10.1145/333623.1042132},
  timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/Fortnow99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FortnowPS99,
  author    = {Lance Fortnow and
               Aduri Pavan and
               Alan L. Selman},
  title     = {Distributionally-Hard Languages},
  booktitle = {Computing and Combinatorics, 5th Annual International Conference,
               {COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings},
  pages     = {184--193},
  year      = {1999},
  crossref  = {DBLP:conf/cocoon/99},
  url       = {https://doi.org/10.1007/3-540-48686-0_18},
  doi       = {10.1007/3-540-48686-0_18},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/FortnowPS99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanF99,
  author    = {Harry Buhrman and
               Lance Fortnow},
  title     = {One-sided Versus Two-sided Error in Probabilistic Computation},
  booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
               Science, Trier, Germany, March 4-6, 1999, Proceedings},
  pages     = {100--109},
  year      = {1999},
  crossref  = {DBLP:conf/stacs/1999},
  url       = {https://doi.org/10.1007/3-540-49116-3_9},
  doi       = {10.1007/3-540-49116-3_9},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/BuhrmanF99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/FeigenbaumFLN98,
  author    = {Joan Feigenbaum and
               Lance Fortnow and
               Sophie Laplante and
               Ashish V. Naik},
  title     = {On Coherence, Random-Self-Reducibility, and Self-Correction},
  journal   = {Computational Complexity},
  volume    = {7},
  number    = {2},
  pages     = {174--191},
  year      = {1998},
  url       = {https://doi.org/10.1007/s000370050009},
  doi       = {10.1007/s000370050009},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/FeigenbaumFLN98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FortnowGLM98,
  author    = {Lance Fortnow and
               Judy Goldsmith and
               Matthew A. Levy and
               Stephen R. Mahaney},
  title     = {L-Printable Sets},
  journal   = {{SIAM} J. Comput.},
  volume    = {28},
  number    = {1},
  pages     = {137--151},
  year      = {1998},
  url       = {https://doi.org/10.1137/S0097539796300441},
  doi       = {10.1137/S0097539796300441},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/FortnowGLM98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/FortnowFGKKSS98,
  author    = {Lance Fortnow and
               Rusins Freivalds and
               William I. Gasarch and
               Martin Kummer and
               Stuart A. Kurtz and
               Carl H. Smith and
               Frank Stephan},
  title     = {On the Relative Sizes of Learnable Sets},
  journal   = {Theor. Comput. Sci.},
  volume    = {197},
  number    = {1-2},
  pages     = {139--156},
  year      = {1998},
  url       = {https://doi.org/10.1016/S0304-3975(97)00175-8},
  doi       = {10.1016/S0304-3975(97)00175-8},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/FortnowFGKKSS98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFT98,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Nonrelativizing Separations},
  booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  pages     = {8--12},
  year      = {1998},
  crossref  = {DBLP:conf/coco/1998},
  url       = {https://doi.org/10.1109/CCC.1998.694585},
  doi       = {10.1109/CCC.1998.694585},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BuhrmanFT98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanF98,
  author    = {Harry Buhrman and
               Lance Fortnow},
  title     = {Two Queries},
  booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  pages     = {13},
  year      = {1998},
  crossref  = {DBLP:conf/coco/1998},
  url       = {https://doi.org/10.1109/CCC.1998.694586},
  doi       = {10.1109/CCC.1998.694586},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BuhrmanF98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowR98,
  author    = {Lance Fortnow and
               John D. Rogers},
  title     = {Complexity Limitations on Quantum Computation},
  booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  pages     = {202--209},
  year      = {1998},
  crossref  = {DBLP:conf/coco/1998},
  url       = {https://doi.org/10.1109/CCC.1998.694606},
  doi       = {10.1109/CCC.1998.694606},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowR98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/DowneyF98,
  author    = {Rodney G. Downey and
               Lance Fortnow},
  title     = {Uniformly Hard Languages},
  booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  pages     = {228},
  year      = {1998},
  crossref  = {DBLP:conf/coco/1998},
  url       = {https://doi.org/10.1109/CCC.1998.694610},
  doi       = {10.1109/CCC.1998.694610},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/DowneyF98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FortnowL98,
  author    = {Lance Fortnow and
               Sophie Laplante},
  title     = {Nearly Optimal Language Compression Using Extractors},
  booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
               Science, Paris, France, February 25-27, 1998, Proceedings},
  pages     = {84--93},
  year      = {1998},
  crossref  = {DBLP:conf/stacs/1998},
  url       = {https://doi.org/10.1007/BFb0028551},
  doi       = {10.1007/BFb0028551},
  timestamp = {Tue, 23 May 2017 11:53:57 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/FortnowL98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeigelBF98,
  author    = {Richard Beigel and
               Harry Buhrman and
               Lance Fortnow},
  title     = {{NP} Might Not Be As Easy As Detecting Unique Solutions},
  booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
               of Computing, Dallas, Texas, USA, May 23-26, 1998},
  pages     = {203--208},
  year      = {1998},
  crossref  = {DBLP:conf/stoc/1998},
  url       = {http://doi.acm.org/10.1145/276698.276737},
  doi       = {10.1145/276698.276737},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BeigelBF98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/tark/FortnowK98,
  author    = {Lance Fortnow and
               Peter G. Kimmel},
  title     = {Beating a Finite Automaton in the Big Match},
  booktitle = {Proceedings of the 7th Conference on Theoretical Aspects of Rationality
               and Knowledge (TARK-98), Evanston, IL, USA, July 22-24, 1998},
  pages     = {225--234},
  year      = {1998},
  crossref  = {DBLP:conf/tark/1998},
  timestamp = {Tue, 05 Mar 2002 12:27:02 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/tark/FortnowK98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9811023,
  author    = {Lance Fortnow and
               John D. Rogers},
  title     = {Complexity limitations on quantum computation},
  journal   = {CoRR},
  volume    = {cs.CC/9811023},
  year      = {1998},
  url       = {http://arxiv.org/abs/cs.CC/9811023},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/cs-CC-9811023},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFT97,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Leen Torenvliet},
  title     = {Six Hypotheses in Search of a Theorem},
  booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
               Complexity, Ulm, Germany, June 24-27, 1997},
  pages     = {2--12},
  year      = {1997},
  crossref  = {DBLP:conf/coco/1997},
  url       = {https://doi.org/10.1109/CCC.1997.612295},
  doi       = {10.1109/CCC.1997.612295},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BuhrmanFT97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/Fortnow97,
  author    = {Lance Fortnow},
  title     = {Nondeterministic Polynomial Time versus Nondeterministic Logarithmic
               Space: Time-Space Tradeoffs for Satisfiability},
  booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
               Complexity, Ulm, Germany, June 24-27, 1997},
  pages     = {52--60},
  year      = {1997},
  crossref  = {DBLP:conf/coco/1997},
  url       = {https://doi.org/10.1109/CCC.1997.612300},
  doi       = {10.1109/CCC.1997.612300},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/Fortnow97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuhrmanFF97,
  author    = {Harry Buhrman and
               Stephen A. Fenner and
               Lance Fortnow},
  title     = {Results on Resource-Bounded Measure},
  booktitle = {Automata, Languages and Programming, 24th International Colloquium,
               ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
  pages     = {188--194},
  year      = {1997},
  crossref  = {DBLP:conf/icalp/1997},
  url       = {https://doi.org/10.1007/3-540-63165-8_176},
  doi       = {10.1007/3-540-63165-8_176},
  timestamp = {Mon, 22 May 2017 17:11:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/BuhrmanFF97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanF97,
  author    = {Harry Buhrman and
               Lance Fortnow},
  title     = {Resource-Bounded Kolmogorov Complexity Revisited},
  booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
               Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
               Proceedings},
  pages     = {105--116},
  year      = {1997},
  crossref  = {DBLP:conf/stacs/1997},
  url       = {https://doi.org/10.1007/BFb0023452},
  doi       = {10.1007/BFb0023452},
  timestamp = {Mon, 22 May 2017 17:11:04 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/BuhrmanF97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FortnowS97,
  author    = {Lance Fortnow and
               Michael Sipser},
  title     = {Retraction of Probabilistic Computation and Linear Time},
  booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
               of Computing, El Paso, Texas, USA, May 4-6, 1997},
  pages     = {750},
  year      = {1997},
  crossref  = {DBLP:conf/stoc/1997},
  url       = {http://doi.acm.org/10.1145/258533.258677},
  doi       = {10.1145/258533.258677},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/FortnowS97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iandc/FortnowR96,
  author    = {Lance Fortnow and
               Nick Reingold},
  title     = {{PP} is Closed Under Truth-Table Reductions},
  journal   = {Inf. Comput.},
  volume    = {124},
  number    = {1},
  pages     = {1--6},
  year      = {1996},
  url       = {https://doi.org/10.1006/inco.1996.0001},
  doi       = {10.1006/inco.1996.0001},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/FortnowR96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iandc/FennerFL96,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Lide Li},
  title     = {Gap-Definability as a Closure Property},
  journal   = {Inf. Comput.},
  volume    = {130},
  number    = {1},
  pages     = {1--17},
  year      = {1996},
  url       = {https://doi.org/10.1006/inco.1996.0080},
  doi       = {10.1006/inco.1996.0080},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/FennerFL96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FortnowY96,
  author    = {Lance Fortnow and
               Tomoyuki Yamakami},
  title     = {Generic Separations},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {52},
  number    = {1},
  pages     = {191--197},
  year      = {1996},
  url       = {https://doi.org/10.1006/jcss.1996.0015},
  doi       = {10.1006/jcss.1996.0015},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/FortnowY96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FennerFK96,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Stuart A. Kurtz},
  title     = {The Isomorphism Conjecture Holds Relative to an Oracle},
  journal   = {{SIAM} J. Comput.},
  volume    = {25},
  number    = {1},
  pages     = {193--206},
  year      = {1996},
  url       = {https://doi.org/10.1137/S0097539793248305},
  doi       = {10.1137/S0097539793248305},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/FennerFK96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/FennerFG96,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               William I. Gasarch},
  title     = {Complexity Theory Newsflash},
  journal   = {{SIGACT} News},
  volume    = {27},
  number    = {3},
  pages     = {126},
  year      = {1996},
  url       = {http://doi.acm.org/10.1145/235666.571629},
  doi       = {10.1145/235666.571629},
  timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/FennerFG96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/FortnowK96,
  author    = {Lance Fortnow and
               Martin Kummer},
  title     = {On Resource-Bounded Instance Complexity},
  journal   = {Theor. Comput. Sci.},
  volume    = {161},
  number    = {1{\&}2},
  pages     = {123--140},
  year      = {1996},
  url       = {https://doi.org/10.1016/0304-3975(95)00097-6},
  doi       = {10.1016/0304-3975(95)00097-6},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/FortnowK96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigenbaumFLN96,
  author    = {Joan Feigenbaum and
               Lance Fortnow and
               Sophie Laplante and
               Ashish V. Naik},
  title     = {On Coherence, Random-self-reducibility, and Self-correction},
  booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  pages     = {59--67},
  year      = {1996},
  crossref  = {DBLP:conf/coco/1996},
  url       = {https://doi.org/10.1109/CCC.1996.507668},
  doi       = {10.1109/CCC.1996.507668},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FeigenbaumFLN96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowGM96,
  author    = {Lance Fortnow and
               Judy Goldsmith and
               Stephen R. Mahaney},
  title     = {L-Printable Sets},
  booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  pages     = {97--106},
  year      = {1996},
  crossref  = {DBLP:conf/coco/1996},
  url       = {https://doi.org/10.1109/CCC.1996.507673},
  doi       = {10.1109/CCC.1996.507673},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowGM96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FennerFNR96,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Ashish V. Naik and
               John D. Rogers},
  title     = {Inverting Onto Functions},
  booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  pages     = {213--222},
  year      = {1996},
  crossref  = {DBLP:conf/coco/1996},
  url       = {https://doi.org/10.1109/CCC.1996.507683},
  doi       = {10.1109/CCC.1996.507683},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FennerFNR96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iandc/FortnowL95,
  author    = {Lance Fortnow and
               Sophie Laplante},
  title     = {Circuit Lower Bounds {\`{a}} la Kolmogorov},
  journal   = {Inf. Comput.},
  volume    = {123},
  number    = {1},
  pages     = {121--126},
  year      = {1995},
  url       = {https://doi.org/10.1006/inco.1995.1161},
  doi       = {10.1006/inco.1995.1161},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/FortnowL95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/BuhrmanFT95,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Leen Torenvliet},
  title     = {Using Autoreducibility to Separate Complexity Classes},
  booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
               Wisconsin, 23-25 October 1995},
  pages     = {520--527},
  year      = {1995},
  crossref  = {DBLP:conf/focs/1995},
  url       = {https://doi.org/10.1109/SFCS.1995.492582},
  doi       = {10.1109/SFCS.1995.492582},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BuhrmanFT95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FortnowFGKKSS95,
  author    = {Lance Fortnow and
               Rusins Freivalds and
               William I. Gasarch and
               Martin Kummer and
               Stuart A. Kurtz and
               Carl H. Smith and
               Frank Stephan},
  title     = {Measure, Category and Learning Theory},
  booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
               ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
  pages     = {558--569},
  year      = {1995},
  crossref  = {DBLP:conf/icalp/1995},
  url       = {https://doi.org/10.1007/3-540-60084-1_105},
  doi       = {10.1007/3-540-60084-1_105},
  timestamp = {Sat, 20 May 2017 15:32:49 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/FortnowFGKKSS95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FortnowK95,
  author    = {Lance Fortnow and
               Martin Kummer},
  title     = {Resource-Bounded Instance Complexity (Extended Abstract)},
  booktitle = {{STACS}},
  pages     = {597--608},
  year      = {1995},
  url       = {https://doi.org/10.1007/3-540-59042-0_108},
  doi       = {10.1007/3-540-59042-0_108},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/FortnowK95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FennerF95,
  author    = {Stephen A. Fenner and
               Lance Fortnow},
  title     = {Beyond P{\^{}}(NP) - {NEXP}},
  booktitle = {{STACS}},
  pages     = {619--627},
  year      = {1995},
  url       = {https://doi.org/10.1007/3-540-59042-0_110},
  doi       = {10.1007/3-540-59042-0_110},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/FennerF95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/apal/FortnowGJKKKPSSS94,
  author    = {Lance Fortnow and
               William I. Gasarch and
               Sanjay Jain and
               Efim B. Kinber and
               Martin Kummer and
               Stuart A. Kurtz and
               Mark Pleszkovich and
               Theodore A. Slaman and
               Robert Solovay and
               Frank Stephan},
  title     = {Extremes in the Degrees of Inferability},
  journal   = {Ann. Pure Appl. Logic},
  volume    = {66},
  number    = {3},
  pages     = {231--276},
  year      = {1994},
  url       = {https://doi.org/10.1016/0168-0072(94)90035-3},
  doi       = {10.1016/0168-0072(94)90035-3},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/apal/FortnowGJKKKPSSS94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/FeigenbaumFLS94,
  author    = {Joan Feigenbaum and
               Lance Fortnow and
               Carsten Lund and
               Daniel A. Spielman},
  title     = {The Power of Adaptiveness and Additional Queries in Random-Self-Reductions},
  journal   = {Computational Complexity},
  volume    = {4},
  pages     = {158--174},
  year      = {1994},
  url       = {https://doi.org/10.1007/BF01202287},
  doi       = {10.1007/BF01202287},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/FeigenbaumFLS94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eatcs/Fortnow94,
  author    = {Lance Fortnow},
  title     = {The Role of Relativization in Complexity Theory},
  journal   = {Bulletin of the {EATCS}},
  volume    = {52},
  pages     = {229--243},
  year      = {1994},
  timestamp = {Wed, 25 Jun 2003 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eatcs/Fortnow94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/FennerFK94,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Stuart A. Kurtz},
  title     = {Gap-Definable Counting Classes},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {48},
  number    = {1},
  pages     = {116--148},
  year      = {1994},
  url       = {https://doi.org/10.1016/S0022-0000(05)80024-8},
  doi       = {10.1016/S0022-0000(05)80024-8},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/FennerFK94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/FortnowKW94,
  author    = {Lance Fortnow and
               Stuart A. Kurtz and
               Duke Whang},
  title     = {The infinite version of an open communication complexity problem is
               independent of the axioms of set theory},
  journal   = {{SIGACT} News},
  volume    = {25},
  number    = {1},
  pages     = {87--89},
  year      = {1994},
  url       = {http://doi.acm.org/10.1145/181773.181778},
  doi       = {10.1145/181773.181778},
  timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/FortnowKW94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/FortnowRS94,
  author    = {Lance Fortnow and
               John Rompel and
               Michael Sipser},
  title     = {On the Power of Multi-Prover Interactive Protocols},
  journal   = {Theor. Comput. Sci.},
  volume    = {134},
  number    = {2},
  pages     = {545--557},
  year      = {1994},
  url       = {https://doi.org/10.1016/0304-3975(94)90251-8},
  doi       = {10.1016/0304-3975(94)90251-8},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/FortnowRS94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowY94,
  author    = {Lance Fortnow and
               Tomoyuki Yamakami},
  title     = {Generic Separations},
  booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
               Amsterdam, The Netherlands, June 28 - July 1, 1994},
  pages     = {139--145},
  year      = {1994},
  crossref  = {DBLP:conf/coco/1994},
  url       = {https://doi.org/10.1109/SCT.1994.315809},
  doi       = {10.1109/SCT.1994.315809},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowY94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Fortnow94,
  author    = {Lance Fortnow},
  title     = {My Favorite Ten Complexity Theorems of the Past Decade},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science,
               14th Conference, Madras, India, December 15-17, 1994, Proceedings},
  pages     = {256--275},
  year      = {1994},
  crossref  = {DBLP:conf/fsttcs/1994},
  url       = {https://doi.org/10.1007/3-540-58715-2_130},
  doi       = {10.1007/3-540-58715-2_130},
  timestamp = {Sat, 20 May 2017 15:32:54 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/Fortnow94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FortnowR94,
  author    = {Lance Fortnow and
               John D. Rogers},
  title     = {Separability and One-Way Functions},
  booktitle = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
               Beijing, P. R. China, August 25-27, 1994, Proceedings},
  pages     = {396--404},
  year      = {1994},
  crossref  = {DBLP:conf/isaac/1994},
  url       = {https://doi.org/10.1007/3-540-58325-4_204},
  doi       = {10.1007/3-540-58325-4_204},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/FortnowR94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FortnowW94,
  author    = {Lance Fortnow and
               Duke Whang},
  title     = {Optimality and domination in repeated games with bounded players},
  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     = {741--749},
  year      = {1994},
  crossref  = {DBLP:conf/stoc/STOC26},
  url       = {http://doi.acm.org/10.1145/195058.195448},
  doi       = {10.1145/195058.195448},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/FortnowW94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR94-021,
  author    = {Lance Fortnow},
  title     = {My Favorite Ten Complexity Theorems of the Past Decade},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {1},
  number    = {21},
  year      = {1994},
  url       = {http://eccc.hpi-web.de/eccc-reports/1994/TR94-021/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR94-021},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/BabaiFNW93,
  author    = {L{\'{a}}szl{\'{o}} Babai and
               Lance Fortnow and
               Noam Nisan and
               Avi Wigderson},
  title     = {{BPP} Has Subexponential Time Simulations Unless {EXPTIME} has Publishable
               Proofs},
  journal   = {Computational Complexity},
  volume    = {3},
  pages     = {307--318},
  year      = {1993},
  url       = {https://doi.org/10.1007/BF01275486},
  doi       = {10.1007/BF01275486},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BabaiFNW93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigenbaumF93,
  author    = {Joan Feigenbaum and
               Lance Fortnow},
  title     = {Random-Self-Reducibility of Complete Sets},
  journal   = {{SIAM} J. Comput.},
  volume    = {22},
  number    = {5},
  pages     = {994--1005},
  year      = {1993},
  url       = {https://doi.org/10.1137/0222061},
  doi       = {10.1137/0222061},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/FeigenbaumF93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/FortnowL93,
  author    = {Lance Fortnow and
               Carsten Lund},
  title     = {Interactive Proof Systems and Alternating Time-Space Complexity},
  journal   = {Theor. Comput. Sci.},
  volume    = {113},
  number    = {1},
  pages     = {55--73},
  year      = {1993},
  url       = {https://doi.org/10.1016/0304-3975(93)90210-K},
  doi       = {10.1016/0304-3975(93)90210-K},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/FortnowL93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FennerFKL93,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Stuart A. Kurtz and
               Lide Li},
  title     = {An Oarcle Builder's Toolkit},
  booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
               San Diego, CA, USA, May 18-21, 1993},
  pages     = {120--131},
  year      = {1993},
  crossref  = {DBLP:conf/coco/1993},
  url       = {https://doi.org/10.1109/SCT.1993.336534},
  doi       = {10.1109/SCT.1993.336534},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FennerFKL93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FennerFL93,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Lide Li},
  title     = {Gap-Definability as a Closure Property},
  booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
               Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
  pages     = {484--493},
  year      = {1993},
  crossref  = {DBLP:conf/stacs/1993},
  url       = {https://doi.org/10.1007/3-540-56503-5_48},
  doi       = {10.1007/3-540-56503-5_48},
  timestamp = {Sat, 20 May 2017 15:32:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/FennerFL93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/BabaiFL92,
  author    = {L{\'{a}}szl{\'{o}} Babai and
               Lance Fortnow and
               Carsten Lund},
  title     = {Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive
               Protocols},
  journal   = {Computational Complexity},
  volume    = {2},
  pages     = {374},
  year      = {1992},
  url       = {https://doi.org/10.1007/BF01200430},
  doi       = {10.1007/BF01200430},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BabaiFL92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/FortnowS92,
  author    = {Lance Fortnow and
               Mario Szegedy},
  title     = {On the Power of Two-Local Random Reductions},
  journal   = {Inf. Process. Lett.},
  volume    = {44},
  number    = {6},
  pages     = {303--306},
  year      = {1992},
  url       = {https://doi.org/10.1016/0020-0190(92)90104-4},
  doi       = {10.1016/0020-0190(92)90104-4},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/FortnowS92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/LundFKN92,
  author    = {Carsten Lund and
               Lance Fortnow and
               Howard J. Karloff and
               Noam Nisan},
  title     = {Algebraic Methods for Interactive Proof Systems},
  journal   = {J. {ACM}},
  volume    = {39},
  number    = {4},
  pages     = {859--868},
  year      = {1992},
  url       = {http://doi.acm.org/10.1145/146585.146605},
  doi       = {10.1145/146585.146605},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/LundFKN92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigenbaumFLS92,
  author    = {Joan Feigenbaum and
               Lance Fortnow and
               Carsten Lund and
               Daniel A. Spielman},
  title     = {The Power of Adaptiveness and Additional Queries in Random-Self-Reductions},
  booktitle = {Proceedings of the Seventh Annual Structure in Complexity Theory Conference,
               Boston, Massachusetts, USA, June 22-25, 1992},
  pages     = {338--346},
  year      = {1992},
  crossref  = {DBLP:conf/coco/1992},
  url       = {https://doi.org/10.1109/SCT.1992.215408},
  doi       = {10.1109/SCT.1992.215408},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FeigenbaumFLS92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/colt/CholakKDKFKGS92,
  author    = {Peter Cholak and
               Efim B. Kinber and
               Rodney G. Downey and
               Martin Kummer and
               Lance Fortnow and
               Stuart A. Kurtz and
               William I. Gasarch and
               Theodore A. Slaman},
  title     = {Degrees of Inferability},
  booktitle = {Proceedings of the Fifth Annual {ACM} Conference on Computational
               Learning Theory, {COLT} 1992, Pittsburgh, PA, USA, July 27-29, 1992.},
  pages     = {180--192},
  year      = {1992},
  crossref  = {DBLP:conf/colt/1992},
  url       = {http://doi.acm.org/10.1145/130385.130406},
  doi       = {10.1145/130385.130406},
  timestamp = {Fri, 23 Dec 2011 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/colt/CholakKDKFKGS92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FennerFK92,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Stuart A. Kurtz},
  title     = {The Isomorphism Conjecture Holds Relative to an Oracle},
  booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
               Pennsylvania, USA, 24-27 October 1992},
  pages     = {30--39},
  year      = {1992},
  crossref  = {DBLP:conf/focs/FOCS33},
  url       = {https://doi.org/10.1109/SFCS.1992.267821},
  doi       = {10.1109/SFCS.1992.267821},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FennerFK92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/BabaiFL91,
  author    = {L{\'{a}}szl{\'{o}} Babai and
               Lance Fortnow and
               Carsten Lund},
  title     = {Non-Deterministic Exponential Time has Two-Prover Interactive Protocols},
  journal   = {Computational Complexity},
  volume    = {1},
  pages     = {3--40},
  year      = {1991},
  url       = {https://doi.org/10.1007/BF01200056},
  doi       = {10.1007/BF01200056},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BabaiFL91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/BabaiF91,
  author    = {L{\'{a}}szl{\'{o}} Babai and
               Lance Fortnow},
  title     = {Arithmetization: {A} New Method in Structural Complexity Theory},
  journal   = {Computational Complexity},
  volume    = {1},
  pages     = {41--66},
  year      = {1991},
  url       = {https://doi.org/10.1007/BF01200057},
  doi       = {10.1007/BF01200057},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BabaiF91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/asiacrypt/FortnowS91,
  author    = {Lance Fortnow and
               Mario Szegedy},
  title     = {On the Power of Two-Local Random Reductions},
  booktitle = {Advances in Cryptology - {ASIACRYPT} '91, International Conference
               on the Theory and Applications of Cryptology, Fujiyoshida, Japan,
               November 11-14, 1991, Proceedings},
  pages     = {346--351},
  year      = {1991},
  crossref  = {DBLP:conf/asiacrypt/1991},
  url       = {https://doi.org/10.1007/3-540-57332-1_29},
  doi       = {10.1007/3-540-57332-1_29},
  timestamp = {Sat, 20 May 2017 15:32:54 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/asiacrypt/FortnowS91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowR91,
  author    = {Lance Fortnow and
               Nick Reingold},
  title     = {{PP} is Closed Under Truth-Table Reductions},
  booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
               Chicago, Illinois, USA, June 30 - July 3, 1991},
  pages     = {13--15},
  year      = {1991},
  crossref  = {DBLP:conf/coco/1991},
  url       = {https://doi.org/10.1109/SCT.1991.160239},
  doi       = {10.1109/SCT.1991.160239},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowR91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FennerFK91,
  author    = {Stephen A. Fenner and
               Lance Fortnow and
               Stuart A. Kurtz},
  title     = {Gap-Definable Counting Classes},
  booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
               Chicago, Illinois, USA, June 30 - July 3, 1991},
  pages     = {30--42},
  year      = {1991},
  crossref  = {DBLP:conf/coco/1991},
  url       = {https://doi.org/10.1109/SCT.1991.160241},
  doi       = {10.1109/SCT.1991.160241},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FennerFK91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigenbaumF91,
  author    = {Joan Feigenbaum and
               Lance Fortnow},
  title     = {On the Random-Self-Reducibility of Complete Sets},
  booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
               Chicago, Illinois, USA, June 30 - July 3, 1991},
  pages     = {124--132},
  year      = {1991},
  crossref  = {DBLP:conf/coco/1991},
  url       = {https://doi.org/10.1109/SCT.1991.160252},
  doi       = {10.1109/SCT.1991.160252},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FeigenbaumF91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FortnowL91,
  author    = {Lance Fortnow and
               Carsten Lund},
  title     = {Interactive Proof Systems and Alternating Time-Space Complexity},
  booktitle = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
               Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
  pages     = {263--274},
  year      = {1991},
  crossref  = {DBLP:conf/stacs/1991},
  url       = {https://doi.org/10.1007/BFb0020804},
  doi       = {10.1007/BFb0020804},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/FortnowL91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BabaiFLS91,
  author    = {L{\'{a}}szl{\'{o}} Babai and
               Lance Fortnow and
               Leonid A. Levin and
               Mario Szegedy},
  title     = {Checking Computations in Polylogarithmic Time},
  booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
               May 5-8, 1991, New Orleans, Louisiana, {USA}},
  pages     = {21--31},
  year      = {1991},
  crossref  = {DBLP:conf/stoc/STOC23},
  url       = {http://doi.acm.org/10.1145/103418.103428},
  doi       = {10.1145/103418.103428},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BabaiFLS91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowRS90,
  author    = {Lance Fortnow and
               John Rompel and
               Michael Sipser},
  title     = {Errata for On the Power of Multi-Prover Interactive Protocols},
  booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference,
               Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July
               8-11, 1990},
  pages     = {318--319},
  year      = {1990},
  crossref  = {DBLP:conf/coco/1990},
  timestamp = {Fri, 13 May 2016 10:39:30 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowRS90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/LundFKN90,
  author    = {Carsten Lund and
               Lance Fortnow and
               Howard J. Karloff and
               Noam Nisan},
  title     = {Algebraic Methods for Interactive Proof Systems},
  booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
               Missouri, USA, October 22-24, 1990, Volume {I}},
  pages     = {2--10},
  year      = {1990},
  crossref  = {DBLP:conf/focs/FOCS31a},
  url       = {https://doi.org/10.1109/FSCS.1990.89518},
  doi       = {10.1109/FSCS.1990.89518},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/LundFKN90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/BabaiFL90,
  author    = {L{\'{a}}szl{\'{o}} Babai and
               Lance Fortnow and
               Carsten Lund},
  title     = {Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols},
  booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
               Missouri, USA, October 22-24, 1990, Volume {I}},
  pages     = {16--25},
  year      = {1990},
  crossref  = {DBLP:conf/focs/FOCS31a},
  url       = {https://doi.org/10.1109/FSCS.1990.89520},
  doi       = {10.1109/FSCS.1990.89520},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BabaiFL90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/BabaiF90,
  author    = {L{\'{a}}szl{\'{o}} Babai and
               Lance Fortnow},
  title     = {A Characterization of {\textbackslash}sharp {P} Arithmetic Straight
               Line Programs},
  booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
               Missouri, USA, October 22-24, 1990, Volume {I}},
  pages     = {26--34},
  year      = {1990},
  crossref  = {DBLP:conf/focs/FOCS31a},
  url       = {https://doi.org/10.1109/FSCS.1990.89521},
  doi       = {10.1109/FSCS.1990.89521},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/BabaiF90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/acr/Fortnow89,
  author    = {Lance Fortnow},
  title     = {The Complexity of Perfect Zero-Knowledge},
  journal   = {Advances in Computing Research},
  volume    = {5},
  pages     = {327--343},
  year      = {1989},
  timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/acr/Fortnow89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FortnowS89,
  author    = {Lance Fortnow and
               Michael Sipser},
  title     = {Probabilistic Computation and Linear Time},
  booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
               May 14-17, 1989, Seattle, Washigton, {USA}},
  pages     = {148--156},
  year      = {1989},
  crossref  = {DBLP:conf/stoc/STOC21},
  url       = {http://doi.acm.org/10.1145/73007.73021},
  doi       = {10.1145/73007.73021},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/FortnowS89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/FortnowS88,
  author    = {Lance Fortnow and
               Michael Sipser},
  title     = {Are There Interactive Protocols for {CO-NP} Languages?},
  journal   = {Inf. Process. Lett.},
  volume    = {28},
  number    = {5},
  pages     = {249--251},
  year      = {1988},
  url       = {https://doi.org/10.1016/0020-0190(88)90199-8},
  doi       = {10.1016/0020-0190(88)90199-8},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/FortnowS88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowRS88,
  author    = {Lance Fortnow and
               John Rompel and
               Michael Sipser},
  title     = {On the power of multi-power interactive protocols},
  booktitle = {Proceedings: Third Annual Structure in Complexity Theory Conference,
               Georgetown University, Washington, D. C., USA, June 14-17, 1988},
  pages     = {156--161},
  year      = {1988},
  crossref  = {DBLP:conf/coco/1988},
  url       = {https://doi.org/10.1109/SCT.1988.5275},
  doi       = {10.1109/SCT.1988.5275},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FortnowRS88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/Fortnow87,
  author    = {Lance Fortnow},
  title     = {The complexity of perfect zero-knowledge},
  booktitle = {Proceedings of the Second Annual Conference on Structure in Complexity
               Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987},
  year      = {1987},
  crossref  = {DBLP:conf/coco/1987},
  timestamp = {Tue, 22 Jan 2013 14:30:11 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/coco/Fortnow87},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Fortnow87,
  author    = {Lance Fortnow},
  title     = {The Complexity of Perfect Zero-Knowledge (Extended Abstract)},
  booktitle = {Proceedings of the 19th Annual {ACM} Symposium on Theory of Computing,
               1987, New York, New York, {USA}},
  pages     = {204--209},
  year      = {1987},
  crossref  = {DBLP:conf/stoc/STOC19},
  url       = {http://doi.acm.org/10.1145/28395.28418},
  doi       = {10.1145/28395.28418},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/Fortnow87},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/birthday/2017downey,
  editor    = {Adam R. Day and
               Michael R. Fellows and
               Noam Greenberg and
               Bakhadyr Khoussainov and
               Alexander G. Melnikov and
               Frances A. Rosamond},
  title     = {Computability and Complexity - Essays Dedicated to Rodney G. Downey
               on the Occasion of His 60th Birthday},
  series    = {Lecture Notes in Computer Science},
  volume    = {10010},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-50062-1},
  doi       = {10.1007/978-3-319-50062-1},
  isbn      = {978-3-319-50061-4},
  timestamp = {Tue, 23 May 2017 01:06:45 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/birthday/2017downey},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cloud/2016,
  editor    = {Marcos K. Aguilera and
               Brian Cooper and
               Yanlei Diao},
  title     = {Proceedings of the Seventh {ACM} Symposium on Cloud Computing, Santa
               Clara, CA, USA, October 5-7, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {http://dl.acm.org/citation.cfm?id=2987550},
  isbn      = {978-1-4503-4525-5},
  timestamp = {Wed, 21 Sep 2016 08:54:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cloud/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2016,
  editor    = {Ran Raz},
  title     = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
               June 1, 2016, Tokyo, Japan},
  series    = {LIPIcs},
  volume    = {50},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-008-8},
  isbn      = {978-3-95977-008-8},
  timestamp = {Thu, 02 Jun 2016 21:24:46 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sigmetrics/2016,
  editor    = {Sara Alouf and
               Alain Jean{-}Marie and
               Nidhi Hegde and
               Alexandre Prouti{\`{e}}re},
  title     = {Proceedings of the 2016 {ACM} {SIGMETRICS} International Conference
               on Measurement and Modeling of Computer Science, Antibes Juan-Les-Pins,
               France, June 14-18, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {http://doi.acm.org/10.1145/2896377},
  doi       = {10.1145/2896377},
  isbn      = {978-1-4503-4266-7},
  timestamp = {Sat, 11 Jun 2016 14:14:23 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/sigmetrics/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/tamc/2015,
  editor    = {Rahul Jain and
               Sanjay Jain and
               Frank Stephan},
  title     = {Theory and Applications of Models of Computation - 12th Annual Conference,
               {TAMC} 2015, Singapore, May 18-20, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9076},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-17142-5},
  doi       = {10.1007/978-3-319-17142-5},
  isbn      = {978-3-319-17141-8},
  timestamp = {Sun, 21 May 2017 00:19:54 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/tamc/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@book{DBLP:series/hhl/9,
  editor    = {J{\"{o}}rg H. Siekmann},
  title     = {Computational Logic},
  series    = {Handbook of the History of Logic},
  volume    = {9},
  publisher = {Elsevier},
  year      = {2014},
  isbn      = {978-0-444-51624-4},
  timestamp = {Mon, 03 Apr 2017 09:18:52 +0200},
  biburl    = {http://dblp.org/rec/bib/series/hhl/9},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cie/2013,
  editor    = {Paola Bonizzoni and
               Vasco Brattka and
               Benedikt L{\"{o}}we},
  title     = {The Nature of Computation. Logic, Algorithms, Applications - 9th Conference
               on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7921},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-39053-1},
  doi       = {10.1007/978-3-642-39053-1},
  isbn      = {978-3-642-39052-4},
  timestamp = {Fri, 19 May 2017 01:26:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cie/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2013,
  editor    = {Krishnendu Chatterjee and
               Jir{\'{\i}} Sgall},
  title     = {Mathematical Foundations of Computer Science 2013 - 38th International
               Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8087},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-40313-2},
  doi       = {10.1007/978-3-642-40313-2},
  isbn      = {978-3-642-40312-5},
  timestamp = {Thu, 15 Jun 2017 21:43:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2013},
  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.org/rec/bib/conf/icalp/2011-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sigecom/2011,
  editor    = {Yoav Shoham and
               Yan Chen and
               Tim Roughgarden},
  title     = {Proceedings 12th {ACM} Conference on Electronic Commerce (EC-2011),
               San Jose, CA, USA, June 5-9, 2011},
  publisher = {{ACM}},
  year      = {2011},
  isbn      = {978-1-4503-0261-6},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2010,
  title     = {Proceedings of the 25th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2010, Cambridge, Massachusetts, June 9-12, 2010},
  publisher = {{IEEE} Computer Society},
  year      = {2010},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5497049},
  isbn      = {978-0-7695-4060-3},
  timestamp = {Fri, 13 May 2016 10:27:12 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/innovations/2010,
  editor    = {Andrew Chi{-}Chih Yao},
  title     = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 5-7, 2010. Proceedings},
  publisher = {Tsinghua University Press},
  year      = {2010},
  isbn      = {978-7-302-21752-7},
  timestamp = {Mon, 27 Sep 2010 12:57:50 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/2010,
  editor    = {Jean{-}Yves Marion and
               Thomas Schwentick},
  title     = {27th International Symposium on Theoretical Aspects of Computer Science,
               {STACS} 2010, March 4-6, 2010, Nancy, France},
  series    = {LIPIcs},
  volume    = {5},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2010},
  isbn      = {978-3-939897-16-3},
  timestamp = {Mon, 12 Apr 2010 09:53:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/2010},
  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/icalp/2009-1,
  editor    = {Susanne Albers and
               Alberto Marchetti{-}Spaccamela and
               Yossi Matias and
               Sotiris E. Nikoletseas and
               Wolfgang Thomas},
  title     = {Automata, Languages and Programming, 36th International Colloquium,
               {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {5555},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-02927-1},
  doi       = {10.1007/978-3-642-02927-1},
  isbn      = {978-3-642-02926-4},
  timestamp = {Tue, 23 May 2017 01:08:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2009-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/tark/2009,
  editor    = {Aviad Heifetz},
  title     = {Proceedings of the 12th Conference on Theoretical Aspects of Rationality
               and Knowledge (TARK-2009), Stanford, CA, USA, July 6-8, 2009},
  year      = {2009},
  timestamp = {Mon, 20 Jul 2009 07:35:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/tark/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2009P9421,
  editor    = {Manindra Agrawal and
               Lance Fortnow and
               Thomas Thierauf and
               Christopher Umans},
  title     = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {09421},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year      = {2009},
  url       = {http://drops.dagstuhl.de/portals/09421/},
  timestamp = {Wed, 08 Apr 2015 19:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2009P9421},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sigecom/2008,
  editor    = {Lance Fortnow and
               John Riedl and
               Tuomas Sandholm},
  title     = {Proceedings 9th {ACM} Conference on Electronic Commerce (EC-2008),
               Chicago, IL, USA, June 8-12, 2008},
  publisher = {{ACM}},
  year      = {2008},
  isbn      = {978-1-60558-169-9},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/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}
}
@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.org/rec/bib/conf/coco/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/csr/2007,
  editor    = {Volker Diekert and
               Mikhail V. Volkov and
               Andrei Voronkov},
  title     = {Computer Science - Theory and Applications, Second International Symposium
               on Computer Science in Russia, {CSR} 2007, Ekaterinburg, Russia, September
               3-7, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4649},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-74510-5},
  doi       = {10.1007/978-3-540-74510-5},
  isbn      = {978-3-540-74509-9},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csr/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sigecom/2007,
  editor    = {Jeffrey K. MacKie{-}Mason and
               David C. Parkes and
               Paul Resnick},
  title     = {Proceedings 8th {ACM} Conference on Electronic Commerce (EC-2007),
               San Diego, California, USA, June 11-15, 2007},
  publisher = {{ACM}},
  year      = {2007},
  isbn      = {978-1-59593-653-0},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/wine/2007,
  editor    = {Xiaotie Deng and
               Fan Chung Graham},
  title     = {Internet and Network Economics, Third International Workshop, {WINE}
               2007, San Diego, CA, USA, December 12-14, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4858},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-77105-0},
  doi       = {10.1007/978-3-540-77105-0},
  isbn      = {978-3-540-77104-3},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/wine/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2007P7411,
  editor    = {Manindra Agrawal and
               Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {07411},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
               (IBFI), Schloss Dagstuhl, Germany},
  year      = {2008},
  url       = {http://drops.dagstuhl.de/portals/07411/},
  timestamp = {Wed, 19 Jun 2013 12:10:46 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2007P7411},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/colt/2006,
  editor    = {G{\'{a}}bor Lugosi and
               Hans Ulrich Simon},
  title     = {Learning Theory, 19th Annual Conference on Learning Theory, {COLT}
               2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4005},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11776420},
  doi       = {10.1007/11776420},
  isbn      = {3-540-35294-5},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/colt/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2006-1,
  editor    = {Michele Bugliesi and
               Bart Preneel and
               Vladimiro Sassone and
               Ingo Wegener},
  title     = {Automata, Languages and Programming, 33rd International Colloquium,
               {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {4051},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11786986},
  doi       = {10.1007/11786986},
  isbn      = {3-540-35904-4},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2006-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2006,
  editor    = {Rastislav Kralovic and
               Pawel Urzyczyn},
  title     = {Mathematical Foundations of Computer Science 2006, 31st International
               Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
               August 28-September 1, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4162},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11821069},
  doi       = {10.1007/11821069},
  isbn      = {3-540-37791-3},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/2006,
  editor    = {Bruno Durand and
               Wolfgang Thomas},
  title     = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
               Science, Marseille, France, February 23-25, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3884},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11672142},
  doi       = {10.1007/11672142},
  isbn      = {978-3-540-32301-3},
  timestamp = {Fri, 26 May 2017 00:48:31 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2005,
  title     = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
               11-15 June 2005, San Jose, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2005},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9851},
  isbn      = {0-7695-2364-1},
  timestamp = {Fri, 13 May 2016 10:29:32 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/2005,
  editor    = {Volker Diekert and
               Bruno Durand},
  title     = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
               Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3404},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/b106485},
  doi       = {10.1007/b106485},
  isbn      = {3-540-24998-2},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/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.org/rec/bib/conf/stoc/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2004,
  title     = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
               October 2004, Rome, Italy, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2004},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9430},
  isbn      = {0-7695-2228-9},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2004P4421,
  editor    = {Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {04421},
  publisher = {IBFI, Schloss Dagstuhl, Germany},
  year      = {2005},
  url       = {http://drops.dagstuhl.de/portals/04421/},
  timestamp = {Wed, 19 Jun 2013 12:20:40 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2004P4421},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2003,
  title     = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
               2003), 7-10 July 2003, Aarhus, Denmark},
  publisher = {{IEEE} Computer Society},
  year      = {2003},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8614},
  isbn      = {0-7695-1879-6},
  timestamp = {Fri, 13 May 2016 10:30:12 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fct/2003,
  editor    = {Andrzej Lingas and
               Bengt J. Nilsson},
  title     = {Fundamentals of Computation Theory, 14th International Symposium,
               {FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2751},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/b11926},
  doi       = {10.1007/b11926},
  isbn      = {3-540-40543-7},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fct/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2003,
  editor    = {Jos C. M. Baeten and
               Jan Karel Lenstra and
               Joachim Parrow and
               Gerhard J. Woeginger},
  title     = {Automata, Languages and Programming, 30th International Colloquium,
               {ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2719},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/3-540-45061-0},
  doi       = {10.1007/3-540-45061-0},
  isbn      = {3-540-40493-7},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/isaac/2003,
  editor    = {Toshihide Ibaraki and
               Naoki Katoh and
               Hirotaka Ono},
  title     = {Algorithms and Computation, 14th International Symposium, {ISAAC}
               2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2906},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/b94771},
  doi       = {10.1007/b94771},
  isbn      = {3-540-20695-7},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sigecom/2003,
  title     = {Proceedings 4th {ACM} Conference on Electronic Commerce (EC-2003),
               San Diego, California, USA, June 9-12, 2003},
  publisher = {{ACM}},
  year      = {2003},
  isbn      = {1-58113-679-X},
  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/sigecom/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2003,
  title     = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2003},
  url       = {http://dl.acm.org/citation.cfm?id=644108},
  isbn      = {0-89871-538-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/2003,
  editor    = {Helmut Alt and
               Michel Habib},
  title     = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
               Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2607},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/3-540-36494-3},
  doi       = {10.1007/3-540-36494-3},
  isbn      = {3-540-00623-0},
  timestamp = {Mon, 29 May 2017 16:53:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/2003},
  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.org/rec/bib/conf/coco/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/colt/2002,
  editor    = {Jyrki Kivinen and
               Robert H. Sloan},
  title     = {Computational Learning Theory, 15th Annual Conference on Computational
               Learning Theory, {COLT} 2002, Sydney, Australia, July 8-10, 2002,
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2375},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45435-7},
  doi       = {10.1007/3-540-45435-7},
  isbn      = {3-540-43836-X},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/colt/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2001,
  title     = {Proceedings of the 16th Annual {IEEE} Conference on Computational
               Complexity, Chicago, Illinois, USA, June 18-21, 2001},
  publisher = {{IEEE} Computer Society},
  year      = {2001},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7429},
  isbn      = {0-7695-1053-1},
  timestamp = {Fri, 13 May 2016 10:30:57 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2001,
  title     = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
               14-17 October 2001, Las Vegas, Nevada, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2001},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7601},
  isbn      = {0-7695-1390-5},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/recomb/2001,
  editor    = {Thomas Lengauer},
  title     = {Proceedings of the Fifth Annual International Conference on Computational
               Biology, {RECOMB} 2001, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
               April 22-25, 2001},
  publisher = {{ACM}},
  year      = {2001},
  url       = {http://doi.acm.org/10.1145/369133},
  doi       = {10.1145/369133},
  isbn      = {1-58113-353-7},
  timestamp = {Thu, 02 Feb 2017 16:14:05 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/recomb/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2000,
  title     = {Proceedings of the 15th Annual {IEEE} Conference on Computational
               Complexity, Florence, Italy, July 4-7, 2000},
  publisher = {{IEEE} Computer Society},
  year      = {2000},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6911},
  isbn      = {0-7695-0674-7},
  timestamp = {Fri, 13 May 2016 10:31:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/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.org/rec/bib/conf/focs/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/2000,
  editor    = {Horst Reichel and
               Sophie Tison},
  title     = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
               Science, Lille, France, February 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1770},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-46541-3},
  doi       = {10.1007/3-540-46541-3},
  isbn      = {3-540-67141-2},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cocoon/99,
  editor    = {Takao Asano and
               Hiroshi Imai and
               D. T. Lee and
               Shin{-}Ichi Nakano and
               Takeshi Tokuyama},
  title     = {Computing and Combinatorics, 5th Annual International Conference,
               {COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1627},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/3-540-48686-0},
  doi       = {10.1007/3-540-48686-0},
  isbn      = {3-540-66200-6},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/1999,
  editor    = {Christoph Meinel and
               Sophie Tison},
  title     = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
               Science, Trier, Germany, March 4-6, 1999, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1563},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/3-540-49116-3},
  doi       = {10.1007/3-540-49116-3},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1998,
  title     = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  publisher = {{IEEE} Computer Society},
  year      = {1998},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5641},
  isbn      = {0-8186-8395-3},
  timestamp = {Fri, 13 May 2016 10:33:02 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/1998,
  editor    = {Michel Morvan and
               Christoph Meinel and
               Daniel Krob},
  title     = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
               Science, Paris, France, February 25-27, 1998, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1373},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/BFb0028542},
  doi       = {10.1007/BFb0028542},
  isbn      = {3-540-64230-7},
  timestamp = {Tue, 23 May 2017 11:53:57 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/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.org/rec/bib/conf/stoc/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/tark/1998,
  editor    = {Itzhak Gilboa},
  title     = {Proceedings of the 7th Conference on Theoretical Aspects of Rationality
               and Knowledge (TARK-98), Evanston, IL, USA, July 22-24, 1998},
  publisher = {Morgan Kaufmann},
  year      = {1998},
  isbn      = {1-55860-563-0},
  timestamp = {Tue, 05 Mar 2002 12:27:02 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/tark/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1997,
  title     = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
               Complexity, Ulm, Germany, June 24-27, 1997},
  publisher = {{IEEE} Computer Society},
  year      = {1997},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4843},
  isbn      = {0-8186-7907-7},
  timestamp = {Fri, 13 May 2016 10:33:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/1997,
  editor    = {Pierpaolo Degano and
               Roberto Gorrieri and
               Alberto Marchetti{-}Spaccamela},
  title     = {Automata, Languages and Programming, 24th International Colloquium,
               ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1256},
  publisher = {Springer},
  year      = {1997},
  url       = {https://doi.org/10.1007/3-540-63165-8},
  doi       = {10.1007/3-540-63165-8},
  isbn      = {3-540-63165-8},
  timestamp = {Mon, 22 May 2017 17:11:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/1997,
  editor    = {R{\"{u}}diger Reischuk and
               Michel Morvan},
  title     = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
               Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1200},
  publisher = {Springer},
  year      = {1997},
  url       = {https://doi.org/10.1007/BFb0023443},
  doi       = {10.1007/BFb0023443},
  isbn      = {3-540-62616-6},
  timestamp = {Mon, 22 May 2017 17:11:04 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/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.org/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.org/rec/bib/conf/coco/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1995,
  title     = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
               Wisconsin, 23-25 October 1995},
  publisher = {{IEEE} Computer Society},
  year      = {1995},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3752},
  isbn      = {0-8186-7183-1},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/1995},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/1995,
  editor    = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
               Ferenc G{\'{e}}cseg},
  title     = {Automata, Languages and Programming, 22nd International Colloquium,
               ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {944},
  publisher = {Springer},
  year      = {1995},
  url       = {https://doi.org/10.1007/3-540-60084-1},
  doi       = {10.1007/3-540-60084-1},
  isbn      = {3-540-60084-1},
  timestamp = {Sat, 20 May 2017 15:32:49 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/1995},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1994,
  title     = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
               Amsterdam, The Netherlands, June 28 - July 1, 1994},
  publisher = {{IEEE} Computer Society},
  year      = {1994},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=967},
  isbn      = {0-8186-5670-0},
  timestamp = {Fri, 13 May 2016 10:38:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/1994,
  editor    = {P. S. Thiagarajan},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               14th Conference, Madras, India, December 15-17, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {880},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-58715-2},
  doi       = {10.1007/3-540-58715-2},
  isbn      = {3-540-58715-2},
  timestamp = {Sat, 20 May 2017 15:32:54 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/isaac/1994,
  editor    = {Ding{-}Zhu Du and
               Xiang{-}Sun Zhang},
  title     = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
               Beijing, P. R. China, August 25-27, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {834},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-58325-4},
  doi       = {10.1007/3-540-58325-4},
  isbn      = {3-540-58325-4},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/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.org/rec/bib/conf/stoc/STOC26},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1993,
  title     = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
               San Diego, CA, USA, May 18-21, 1993},
  publisher = {{IEEE} Computer Society},
  year      = {1993},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=920},
  isbn      = {0-8186-4070-7},
  timestamp = {Fri, 13 May 2016 10:38:29 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/1993,
  editor    = {Patrice Enjalbert and
               Alain Finkel and
               Klaus W. Wagner},
  title     = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
               Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {665},
  publisher = {Springer},
  year      = {1993},
  url       = {https://doi.org/10.1007/3-540-56503-5},
  doi       = {10.1007/3-540-56503-5},
  isbn      = {3-540-56503-5},
  timestamp = {Sat, 20 May 2017 15:32:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1992,
  title     = {Proceedings of the Seventh Annual Structure in Complexity Theory Conference,
               Boston, Massachusetts, USA, June 22-25, 1992},
  publisher = {{IEEE} Computer Society},
  year      = {1992},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=430},
  isbn      = {0-8186-2955-X},
  timestamp = {Fri, 13 May 2016 10:38:51 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1992},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/colt/1992,
  editor    = {David Haussler},
  title     = {Proceedings of the Fifth Annual {ACM} Conference on Computational
               Learning Theory, {COLT} 1992, Pittsburgh, PA, USA, July 27-29, 1992},
  publisher = {{ACM}},
  year      = {1992},
  url       = {http://dl.acm.org/citation.cfm?id=130385},
  isbn      = {0-89791-497-X},
  timestamp = {Mon, 12 Dec 2011 15:03:15 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/colt/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.org/rec/bib/conf/focs/FOCS33},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/asiacrypt/1991,
  editor    = {Hideki Imai and
               Ronald L. Rivest and
               Tsutomu Matsumoto},
  title     = {Advances in Cryptology - {ASIACRYPT} '91, International Conference
               on the Theory and Applications of Cryptology, Fujiyoshida, Japan,
               November 11-14, 1991, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {739},
  publisher = {Springer},
  year      = {1993},
  url       = {https://doi.org/10.1007/3-540-57332-1},
  doi       = {10.1007/3-540-57332-1},
  isbn      = {3-540-57332-1},
  timestamp = {Sat, 20 May 2017 15:32:54 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/asiacrypt/1991},
  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.org/rec/bib/conf/coco/1991},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/1991,
  editor    = {Christian Choffrut and
               Matthias Jantzen},
  title     = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
               Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {480},
  publisher = {Springer},
  year      = {1991},
  url       = {https://doi.org/10.1007/BFb0020782},
  doi       = {10.1007/BFb0020782},
  isbn      = {3-540-53709-0},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/1991},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC23,
  editor    = {Cris Koutsougeras and
               Jeffrey Scott Vitter},
  title     = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
               May 5-8, 1991, New Orleans, Louisiana, {USA}},
  publisher = {{ACM}},
  year      = {1991},
  isbn      = {0-89791-397-3},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC23},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1990,
  title     = {Proceedings: Fifth Annual Structure in Complexity Theory Conference,
               Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July
               8-11, 1990},
  publisher = {{IEEE} Computer Society},
  year      = {1990},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=476},
  isbn      = {0-8186-2072-2},
  timestamp = {Fri, 13 May 2016 10:39:30 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1990},
  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.org/rec/bib/conf/focs/FOCS31a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC21,
  editor    = {David S. Johnson},
  title     = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
               May 14-17, 1989, Seattle, Washigton, {USA}},
  publisher = {{ACM}},
  year      = {1989},
  isbn      = {0-89791-307-8},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC21},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1988,
  title     = {Proceedings: Third Annual Structure in Complexity Theory Conference,
               Georgetown University, Washington, D. C., USA, June 14-17, 1988},
  publisher = {{IEEE} Computer Society},
  year      = {1988},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=209},
  isbn      = {0-8186-0794-7},
  timestamp = {Tue, 22 Jan 2013 14:24:55 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1988},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1987,
  title     = {Proceedings of the Second Annual Conference on Structure in Complexity
               Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987},
  publisher = {{IEEE} Computer Society},
  year      = {1987},
  timestamp = {Tue, 22 Jan 2013 14:30:11 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1987},
  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.org/rec/bib/conf/stoc/STOC19},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier