Search dblp for Publications

export results for "toc:db/conf/fotfs/fotfs2001.bht:"

 download as .bib file

@proceedings{DBLP:conf/fotfs/2001,
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5},
  doi          = {10.1007/978-1-4020-2776-5},
  isbn         = {978-1-4020-2775-8},
  timestamp    = {Fri, 29 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/2001.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Ambainis01,
  author       = {Andris Ambainis},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Quantum query algorithms and lower bounds},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {15--32},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_2},
  doi          = {10.1007/978-1-4020-2776-5\_2},
  timestamp    = {Fri, 29 May 2020 16:39:30 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Ambainis01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Blaser01,
  author       = {Markus Bl{\"{a}}ser},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Algebras of minimal rank: overview and recent developments},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {33--46},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_3},
  doi          = {10.1007/978-1-4020-2776-5\_3},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Blaser01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Brendle01,
  author       = {J{\"{o}}rg Brendle},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Recent developments in iterated forcing theory},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {47--60},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_4},
  doi          = {10.1007/978-1-4020-2776-5\_4},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Brendle01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Camara01,
  author       = {Elvira Mayordomo C{\'{a}}mara},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Effective Hausdorff dimension},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {171--186},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_10},
  doi          = {10.1007/978-1-4020-2776-5\_10},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Camara01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Camerlo01,
  author       = {Riccardo Camerlo},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Classification problems in algebra and topology},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {61--75},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_5},
  doi          = {10.1007/978-1-4020-2776-5\_5},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Camerlo01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Engebretsen01,
  author       = {Lars Engebretsen},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Using easy optimization problems to solve hard ones},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {77--93},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_6},
  doi          = {10.1007/978-1-4020-2776-5\_6},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Engebretsen01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/GeschkeQ01,
  author       = {Stefan Geschke and
                  Sandra Quickert},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {On Sacks forcing and the Sacks property},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {95--139},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_7},
  doi          = {10.1007/978-1-4020-2776-5\_7},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/GeschkeQ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Hamkins01,
  author       = {Joel David Hamkins},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Supertask computation},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {141--158},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_8},
  doi          = {10.1007/978-1-4020-2776-5\_8},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Hamkins01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/KoepkeE01,
  author       = {Peter Koepke and
                  Marc van Eijmeren},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {A refinement of Jensen's constructible hierarchy},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {159--169},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_9},
  doi          = {10.1007/978-1-4020-2776-5\_9},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/KoepkeE01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Lowe01,
  author       = {Benedikt L{\"{o}}we},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Complexity hierarchies derived from reduction functions},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {1--14},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_1},
  doi          = {10.1007/978-1-4020-2776-5\_1},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Lowe01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Mikulas01,
  author       = {Szabolcs Mikul{\'{a}}s},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Axiomatizability of algebras of binary relations},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {187--205},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_11},
  doi          = {10.1007/978-1-4020-2776-5\_11},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Mikulas01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Schindler01,
  author       = {Ralf Schindler},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Forcing axioms and projective sets of reals},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {207--222},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_12},
  doi          = {10.1007/978-1-4020-2776-5\_12},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Schindler01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Welch01,
  author       = {Philip D. Welch},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Post's and other problems of supertasks of higher type},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {223--237},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_13},
  doi          = {10.1007/978-1-4020-2776-5\_13},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Welch01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.