Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Kristoffer Arnsfelt Hansen
@article{DBLP:journals/mp/CaragiannisFFHT24,
author = {Ioannis Caragiannis and
Aris Filos{-}Ratsikas and
S{\o}ren Kristoffer Stiil Frederiksen and
Kristoffer Arnsfelt Hansen and
Zihan Tan},
title = {Truthful facility assignment with resource augmentation: an exact
analysis of serial dictatorship},
journal = {Math. Program.},
volume = {203},
number = {1},
pages = {901--930},
year = {2024},
url = {https://doi.org/10.1007/s10107-022-01902-8},
doi = {10.1007/S10107-022-01902-8},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/CaragiannisFFHT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/CaragiannisHR24,
author = {Ioannis Caragiannis and
Kristoffer Arnsfelt Hansen and
Nidhi Rathi},
editor = {Mehdi Dastani and
Jaime Sim{\~{a}}o Sichman and
Natasha Alechina and
Virginia Dignum},
title = {On the Complexity of Pareto-Optimal and Envy-Free Lotteries},
booktitle = {Proceedings of the 23rd International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2024, Auckland, New Zealand, May 6-10,
2024},
pages = {244--252},
publisher = {{ACM}},
year = {2024},
url = {https://dl.acm.org/doi/10.5555/3635637.3662872},
doi = {10.5555/3635637.3662872},
timestamp = {Fri, 03 May 2024 14:27:55 +0200},
biburl = {https://dblp.org/rec/conf/atal/CaragiannisHR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HansenIN23,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Abraham Neyman},
title = {The Big Match with a Clock and a Bit of Memory},
journal = {Math. Oper. Res.},
volume = {48},
number = {1},
pages = {419--432},
year = {2023},
url = {https://doi.org/10.1287/moor.2022.1267},
doi = {10.1287/MOOR.2022.1267},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/HansenIN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BiloHM23,
author = {Vittorio Bil{\`{o}} and
Kristoffer Arnsfelt Hansen and
Marios Mavronicolas},
editor = {Argyrios Deligkas and
Aris Filos{-}Ratsikas},
title = {Computational Complexity of Decision Problems About Nash Equilibria
in Win-Lose Multi-player Games},
booktitle = {Algorithmic Game Theory - 16th International Symposium, {SAGT} 2023,
Egham, UK, September 4-7, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14238},
pages = {40--57},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43254-5\_3},
doi = {10.1007/978-3-031-43254-5\_3},
timestamp = {Sun, 24 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/BiloHM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-12605,
author = {Ioannis Caragiannis and
Kristoffer Arnsfelt Hansen and
Nidhi Rathi},
title = {On the complexity of Pareto-optimal and envy-free lotteries},
journal = {CoRR},
volume = {abs/2307.12605},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.12605},
doi = {10.48550/ARXIV.2307.12605},
eprinttype = {arXiv},
eprint = {2307.12605},
timestamp = {Tue, 01 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-12605.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-01237,
author = {Aris Filos{-}Ratsikas and
Kristoffer Arnsfelt Hansen and
Kasper H{\o}gh and
Alexandros Hollender},
title = {PPAD-membership for Problems with Exact Rational Solutions: {A} General
Approach via Convex Optimization},
journal = {CoRR},
volume = {abs/2312.01237},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.01237},
doi = {10.48550/ARXIV.2312.01237},
eprinttype = {arXiv},
eprint = {2312.01237},
timestamp = {Fri, 08 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-01237.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BerthelsenH22,
author = {Marie Louisa T{\o}lb{\o}ll Berthelsen and
Kristoffer Arnsfelt Hansen},
title = {On the Computational Complexity of Decision Problems About Multi-player
Nash Equilibria},
journal = {Theory Comput. Syst.},
volume = {66},
number = {3},
pages = {519--545},
year = {2022},
url = {https://doi.org/10.1007/s00224-022-10080-1},
doi = {10.1007/S00224-022-10080-1},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BerthelsenH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wine/2022,
editor = {Kristoffer Arnsfelt Hansen and
Tracy Xiao Liu and
Azarakhsh Malekian},
title = {Web and Internet Economics - 18th International Conference, {WINE}
2022, Troy, NY, USA, December 12-15, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13778},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22832-2},
doi = {10.1007/978-3-031-22832-2},
isbn = {978-3-031-22831-5},
timestamp = {Fri, 23 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-07407,
author = {Manon Blanc and
Kristoffer Arnsfelt Hansen},
title = {Computational Complexity of Multi-Player Evolutionarily Stable Strategies},
journal = {CoRR},
volume = {abs/2203.07407},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.07407},
doi = {10.48550/ARXIV.2203.07407},
eprinttype = {arXiv},
eprint = {2203.07407},
timestamp = {Mon, 28 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-07407.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geb/HansenIN21,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Abraham Neyman},
title = {Absorbing games with a clock and two bits of memory},
journal = {Games Econ. Behav.},
volume = {128},
pages = {213--230},
year = {2021},
url = {https://doi.org/10.1016/j.geb.2021.04.008},
doi = {10.1016/J.GEB.2021.04.008},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/geb/HansenIN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BlancH21,
author = {Manon Blanc and
Kristoffer Arnsfelt Hansen},
editor = {Rahul Santhanam and
Daniil Musatov},
title = {Computational Complexity of Multi-player Evolutionarily Stable Strategies},
booktitle = {Computer Science - Theory and Applications - 16th International Computer
Science Symposium in Russia, {CSR} 2021, Sochi, Russia, June 28 -
July 2, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12730},
pages = {1--17},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79416-3\_1},
doi = {10.1007/978-3-030-79416-3\_1},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/BlancH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HansenL21,
author = {Kristoffer Arnsfelt Hansen and
Troels Bjerre Lund},
editor = {Evripidis Bampis and
Aris Pagourtzis},
title = {Computational Complexity of Computing a Quasi-Proper Equilibrium},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium,
{FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12867},
pages = {259--271},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86593-1\_18},
doi = {10.1007/978-3-030-86593-1\_18},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/HansenL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Filos-RatsikasH21,
author = {Aris Filos{-}Ratsikas and
Kristoffer Arnsfelt Hansen and
Kasper H{\o}gh and
Alexandros Hollender},
title = {FIXP-membership via Convex Optimization: Games, Cakes, and Markets},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {827--838},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00085},
doi = {10.1109/FOCS52979.2021.00085},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Filos-RatsikasH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BatziouHH21,
author = {Eleni Batziou and
Kristoffer Arnsfelt Hansen and
Kasper H{\o}gh},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {24:1--24:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.24},
doi = {10.4230/LIPICS.ICALP.2021.24},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BatziouHH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sagt/2021,
editor = {Ioannis Caragiannis and
Kristoffer Arnsfelt Hansen},
title = {Algorithmic Game Theory - 14th International Symposium, {SAGT} 2021,
Aarhus, Denmark, September 21-24, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12885},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-85947-3},
doi = {10.1007/978-3-030-85947-3},
isbn = {978-3-030-85946-6},
timestamp = {Wed, 15 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-04452,
author = {Eleni Batziou and
Kristoffer Arnsfelt Hansen and
Kasper H{\o}gh},
title = {Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem},
journal = {CoRR},
volume = {abs/2103.04452},
year = {2021},
url = {https://arxiv.org/abs/2103.04452},
eprinttype = {arXiv},
eprint = {2103.04452},
timestamp = {Mon, 15 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-04452.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-04300,
author = {Kristoffer Arnsfelt Hansen and
Troels Bjerre Lund},
title = {Computational Complexity of Computing a Quasi-Proper Equilibrium},
journal = {CoRR},
volume = {abs/2107.04300},
year = {2021},
url = {https://arxiv.org/abs/2107.04300},
eprinttype = {arXiv},
eprint = {2107.04300},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-04300.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-06878,
author = {Aris Filos{-}Ratsikas and
Kristoffer Arnsfelt Hansen and
Kasper H{\o}gh and
Alexandros Hollender},
title = {FIXP-membership via Convex Optimization: Games, Cakes, and Markets},
journal = {CoRR},
volume = {abs/2111.06878},
year = {2021},
url = {https://arxiv.org/abs/2111.06878},
eprinttype = {arXiv},
eprint = {2111.06878},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-06878.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HansenS20,
author = {Kristoffer Arnsfelt Hansen and
Steffan Christ S{\o}lvsten},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {{\(\exists\)}{\(\mathbb{R}\)}-Completeness of Stationary Nash Equilibria
in Perfect Information Stochastic Games},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {45:1--45:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.45},
doi = {10.4230/LIPICS.MFCS.2020.45},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/HansenS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-05196,
author = {Marie Louisa T{\o}lb{\o}ll Berthelsen and
Kristoffer Arnsfelt Hansen},
title = {On the Computational Complexity of Decision Problems about Multi-Player
Nash Equilibria},
journal = {CoRR},
volume = {abs/2001.05196},
year = {2020},
url = {https://arxiv.org/abs/2001.05196},
eprinttype = {arXiv},
eprint = {2001.05196},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-05196.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-08314,
author = {Kristoffer Arnsfelt Hansen and
Steffan Christ S{\o}lvsten},
title = {Existential Theory of the Reals Completeness of Stationary Nash Equilibria
in Perfect Information Stochastic Games},
journal = {CoRR},
volume = {abs/2006.08314},
year = {2020},
url = {https://arxiv.org/abs/2006.08314},
eprinttype = {arXiv},
eprint = {2006.08314},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-08314.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Hansen19,
author = {Kristoffer Arnsfelt Hansen},
title = {The Real Computational Complexity of Minmax Value and Equilibrium
Refinements in Multi-player Games},
journal = {Theory Comput. Syst.},
volume = {63},
number = {7},
pages = {1554--1571},
year = {2019},
url = {https://doi.org/10.1007/s00224-018-9887-9},
doi = {10.1007/S00224-018-9887-9},
timestamp = {Wed, 21 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Hansen19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BerthelsenH19,
author = {Marie Louisa T{\o}lb{\o}ll Berthelsen and
Kristoffer Arnsfelt Hansen},
editor = {Dimitris Fotakis and
Evangelos Markakis},
title = {On the Computational Complexity of Decision Problems About Multi-player
Nash Equilibria},
booktitle = {Algorithmic Game Theory - 12th International Symposium, {SAGT} 2019,
Athens, Greece, September 30 - October 3, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11801},
pages = {153--167},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30473-7\_11},
doi = {10.1007/978-3-030-30473-7\_11},
timestamp = {Thu, 24 Mar 2022 11:08:57 +0100},
biburl = {https://dblp.org/rec/conf/sagt/BerthelsenH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-1903-11935,
author = {Kristoffer Arnsfelt Hansen and
Mikhail A. Raskin},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Jean{-}Fran{\c{c}}ois Raskin},
title = {A Stay-in-a-Set Game without a Stationary Equilibrium},
booktitle = {Proceedings Tenth International Symposium on Games, Automata, Logics,
and Formal Verification, GandALF 2019, Bordeaux, France, 2-3rd September
2019},
series = {{EPTCS}},
volume = {305},
pages = {83--90},
year = {2019},
url = {https://doi.org/10.4204/EPTCS.305.6},
doi = {10.4204/EPTCS.305.6},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-11935.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DanHJ0Z18,
author = {Chen Dan and
Kristoffer Arnsfelt Hansen and
He Jiang and
Liwei Wang and
Yuchen Zhou},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {Low Rank Approximation of Binary Matrices: Column Subset Selection
and Generalizations},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {41:1--41:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.41},
doi = {10.4230/LIPICS.MFCS.2018.41},
timestamp = {Mon, 07 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DanHJ0Z18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/HansenL18,
author = {Kristoffer Arnsfelt Hansen and
Troels Bjerre Lund},
editor = {{\'{E}}va Tardos and
Edith Elkind and
Rakesh Vohra},
title = {Computational Complexity of Proper Equilibrium},
booktitle = {Proceedings of the 2018 {ACM} Conference on Economics and Computation,
Ithaca, NY, USA, June 18-22, 2018},
pages = {113--130},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3219166.3219199},
doi = {10.1145/3219166.3219199},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/HansenL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/HansenIN18,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Abraham Neyman},
editor = {{\'{E}}va Tardos and
Edith Elkind and
Rakesh Vohra},
title = {The Big Match with a Clock and a Bit of Memory},
booktitle = {Proceedings of the 2018 {ACM} Conference on Economics and Computation,
Ithaca, NY, USA, June 18-22, 2018},
pages = {149--150},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3219166.3219198},
doi = {10.1145/3219166.3219198},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/HansenIN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/BosanskyBHLM17,
author = {Branislav Bosansk{\'{y}} and
Simina Br{\^{a}}nzei and
Kristoffer Arnsfelt Hansen and
Troels Bjerre Lund and
Peter Bro Miltersen},
title = {Computation of Stackelberg Equilibria of Finite Sequential Games},
journal = {{ACM} Trans. Economics and Comput.},
volume = {5},
number = {4},
pages = {23:1--23:24},
year = {2017},
url = {https://doi.org/10.1145/3133242},
doi = {10.1145/3133242},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/BosanskyBHLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChatterjeeHI17,
author = {Krishnendu Chatterjee and
Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Strategy Complexity of Concurrent Safety Games},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {55:1--55:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.55},
doi = {10.4230/LIPICS.MFCS.2017.55},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ChatterjeeHI17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/Hansen17,
author = {Kristoffer Arnsfelt Hansen},
editor = {Vittorio Bil{\`{o}} and
Michele Flammini},
title = {The Real Computational Complexity of Minmax Value and Equilibrium
Refinements in Multi-player Games},
booktitle = {Algorithmic Game Theory - 10th International Symposium, {SAGT} 2017,
L'Aquila, Italy, September 12-14, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10504},
pages = {119--130},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66700-3\_10},
doi = {10.1007/978-3-319-66700-3\_10},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/Hansen17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/HansenIK16,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Michal Kouck{\'{y}}},
editor = {Martin Gairing and
Rahul Savani},
title = {The Big Match in Small Space - (Extended Abstract)},
booktitle = {Algorithmic Game Theory - 9th International Symposium, {SAGT} 2016,
Liverpool, UK, September 19-21, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9928},
pages = {64--76},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53354-3\_6},
doi = {10.1007/978-3-662-53354-3\_6},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/HansenIK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/CaragiannisFFHT16,
author = {Ioannis Caragiannis and
Aris Filos{-}Ratsikas and
S{\o}ren Kristoffer Stiil Frederiksen and
Kristoffer Arnsfelt Hansen and
Zihan Tan},
editor = {Yang Cai and
Adrian Vetta},
title = {Truthful Facility Assignment with Resource Augmentation: An Exact
Analysis of Serial Dictatorship},
booktitle = {Web and Internet Economics - 12th International Conference, {WINE}
2016, Montreal, Canada, December 11-14, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10123},
pages = {236--250},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-54110-4\_17},
doi = {10.1007/978-3-662-54110-4\_17},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/CaragiannisFFHT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CaragiannisFFHT16,
author = {Ioannis Caragiannis and
Aris Filos{-}Ratsikas and
S{\o}ren Kristoffer Stiil Frederiksen and
Kristoffer Arnsfelt Hansen and
Zihan Tan},
title = {Truthful Facility Assignment with Resource Augmentation: An Exact
Analysis of Serial Dictatorship},
journal = {CoRR},
volume = {abs/1602.08023},
year = {2016},
url = {http://arxiv.org/abs/1602.08023},
eprinttype = {arXiv},
eprint = {1602.08023},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CaragiannisFFHT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HansenIK16,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Michal Kouck{\'{y}}},
title = {The Big Match in Small Space},
journal = {CoRR},
volume = {abs/1604.07634},
year = {2016},
url = {http://arxiv.org/abs/1604.07634},
eprinttype = {arXiv},
eprint = {1604.07634},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HansenIK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HansenP15,
author = {Kristoffer Arnsfelt Hansen and
Vladimir V. Podolskii},
title = {Polynomial threshold functions and Boolean threshold circuits},
journal = {Inf. Comput.},
volume = {240},
pages = {56--73},
year = {2015},
url = {https://doi.org/10.1016/j.ic.2014.09.008},
doi = {10.1016/J.IC.2014.09.008},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/HansenP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BosanskyBHMS15,
author = {Branislav Bosansk{\'{y}} and
Simina Br{\^{a}}nzei and
Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
editor = {Evangelos Markakis and
Guido Sch{\"{a}}fer},
title = {Computation of Stackelberg Equilibria of Finite Sequential Games},
booktitle = {Web and Internet Economics - 11th International Conference, {WINE}
2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9470},
pages = {201--215},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48995-6\_15},
doi = {10.1007/978-3-662-48995-6\_15},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/BosanskyBHMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChatterjeeHI15,
author = {Krishnendu Chatterjee and
Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen},
title = {Strategy Complexity of Concurrent Stochastic Games with Safety and
Reachability Objectives},
journal = {CoRR},
volume = {abs/1506.02434},
year = {2015},
url = {http://arxiv.org/abs/1506.02434},
eprinttype = {arXiv},
eprint = {1506.02434},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChatterjeeHI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BosanskyBHMS15,
author = {Branislav Bosansk{\'{y}} and
Simina Br{\^{a}}nzei and
Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
title = {Computation of Stackelberg Equilibria of Finite Sequential Games},
journal = {CoRR},
volume = {abs/1507.07677},
year = {2015},
url = {http://arxiv.org/abs/1507.07677},
eprinttype = {arXiv},
eprint = {1507.07677},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BosanskyBHMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DanHJWZ15,
author = {Chen Dan and
Kristoffer Arnsfelt Hansen and
He Jiang and
Liwei Wang and
Yuchen Zhou},
title = {On Low Rank Approximation of Binary Matrices},
journal = {CoRR},
volume = {abs/1511.01699},
year = {2015},
url = {http://arxiv.org/abs/1511.01699},
eprinttype = {arXiv},
eprint = {1511.01699},
timestamp = {Mon, 07 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DanHJWZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HansenIM14,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Peter Bro Miltersen},
title = {The Complexity of Solving Reachability Games Using Value and Strategy
Iteration},
journal = {Theory Comput. Syst.},
volume = {55},
number = {2},
pages = {380--403},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9524-6},
doi = {10.1007/S00224-013-9524-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/HansenIM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChattopadhyayGHT14,
author = {Arkadev Chattopadhyay and
Ricard Gavald{\`{a}} and
Kristoffer Arnsfelt Hansen and
Denis Th{\'{e}}rien},
title = {Learning Read-Constant Polynomials of Constant Degree Modulo Composites},
journal = {Theory Comput. Syst.},
volume = {55},
number = {2},
pages = {404--420},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9488-6},
doi = {10.1007/S00224-013-9488-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ChattopadhyayGHT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HansenKSST14,
author = {Kristoffer Arnsfelt Hansen and
Balagopal Komarath and
Jayalal Sarma and
Sven Skyum and
Navid Talebanfard},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {336--347},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_29},
doi = {10.1007/978-3-662-44465-8\_29},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HansenKSST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/EtessamiHMS14,
author = {Kousha Etessami and
Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
editor = {Ron Lavi},
title = {The Complexity of Approximating a Trembling Hand Perfect Equilibrium
of a Multi-player Game in Strategic Form},
booktitle = {Algorithmic Game Theory - 7th International Symposium, {SAGT} 2014,
Haifa, Israel, September 30 - October 2, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8768},
pages = {231--243},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44803-8\_20},
doi = {10.1007/978-3-662-44803-8\_20},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/EtessamiHMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EtessamiHMS14,
author = {Kousha Etessami and
Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
title = {The complexity of approximating a trembling hand perfect equilibrium
of a multi-player game in strategic form},
journal = {CoRR},
volume = {abs/1408.1017},
year = {2014},
url = {http://arxiv.org/abs/1408.1017},
eprinttype = {arXiv},
eprint = {1408.1017},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EtessamiHMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HansenIPT13,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Vladimir V. Podolskii and
Elias P. Tsigaridas},
title = {Patience of matrix games},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2440--2459},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.008},
doi = {10.1016/J.DAM.2013.05.008},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HansenIPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GalHKPV13,
author = {Anna G{\'{a}}l and
Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}} and
Pavel Pudl{\'{a}}k and
Emanuele Viola},
title = {Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth
Circuits With Arbitrary Gates},
journal = {{IEEE} Trans. Inf. Theory},
volume = {59},
number = {10},
pages = {6611--6627},
year = {2013},
url = {https://doi.org/10.1109/TIT.2013.2270275},
doi = {10.1109/TIT.2013.2270275},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GalHKPV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HansenP13,
author = {Kristoffer Arnsfelt Hansen and
Vladimir V. Podolskii},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Polynomial Threshold Functions and Boolean Threshold Circuits},
booktitle = {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},
pages = {516--527},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_46},
doi = {10.1007/978-3-642-40313-2\_46},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HansenP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HansenP13,
author = {Kristoffer Arnsfelt Hansen and
Vladimir V. Podolskii},
title = {Polynomial threshold functions and Boolean threshold circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-021}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/021},
eprinttype = {ECCC},
eprint = {TR13-021},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HansenP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/AnderssonHMS12,
author = {Daniel Andersson and
Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
title = {Deterministic Graphical Games Revisited},
journal = {J. Log. Comput.},
volume = {22},
number = {2},
pages = {165--178},
year = {2012},
url = {https://doi.org/10.1093/logcom/exq001},
doi = {10.1093/LOGCOM/EXQ001},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/AnderssonHMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/EickmeyerHV12,
author = {Kord Eickmeyer and
Kristoffer Arnsfelt Hansen and
Elad Verbin},
editor = {Maria J. Serna},
title = {Approximating the Minmax Value of Three-Player Games within a Constant
is as Hard as Detecting Planted Cliques},
booktitle = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012,
Barcelona, Spain, October 22-23, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7615},
pages = {96--107},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33996-7\_9},
doi = {10.1007/978-3-642-33996-7\_9},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/EickmeyerHV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalHKPV12,
author = {Anna G{\'{a}}l and
Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}} and
Pavel Pudl{\'{a}}k and
Emanuele Viola},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Tight bounds on computing error-correcting codes by bounded-depth
circuits with arbitrary gates},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {479--494},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214023},
doi = {10.1145/2213977.2214023},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalHKPV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-3898,
author = {Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}} and
Niels Lauritzen and
Peter Bro Miltersen and
Elias P. Tsigaridas},
title = {Exact Algorithms for Solving Stochastic Games},
journal = {CoRR},
volume = {abs/1202.3898},
year = {2012},
url = {http://arxiv.org/abs/1202.3898},
eprinttype = {arXiv},
eprint = {1202.3898},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-3898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-1751,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Vladimir V. Podolskii and
Elias P. Tsigaridas},
title = {Patience of Matrix Games},
journal = {CoRR},
volume = {abs/1206.1751},
year = {2012},
url = {http://arxiv.org/abs/1206.1751},
eprinttype = {arXiv},
eprint = {1206.1751},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-1751.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/EickmeyerHV12,
author = {Kord Eickmeyer and
Kristoffer Arnsfelt Hansen and
Elad Verbin},
title = {Approximating the minmax value of 3-player games within a constant
is as hard as detecting planted cliques},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-025}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/025},
eprinttype = {ECCC},
eprint = {TR12-025},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/EickmeyerHV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/ChattopadhyayGHT11,
author = {Arkadev Chattopadhyay and
Ricard Gavald{\`{a}} and
Kristoffer Arnsfelt Hansen and
Denis Th{\'{e}}rien},
editor = {Alexander S. Kulikov and
Nikolay K. Vereshchagin},
title = {Learning Read-Constant Polynomials of Constant Degree Modulo Composites},
booktitle = {Computer Science - Theory and Applications - 6th International Computer
Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June
14-18, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6651},
pages = {29--42},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20712-9\_3},
doi = {10.1007/978-3-642-20712-9\_3},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/ChattopadhyayGHT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/HansenIM11,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Peter Bro Miltersen},
editor = {Alexander S. Kulikov and
Nikolay K. Vereshchagin},
title = {The Complexity of Solving Reachability Games Using Value and Strategy
Iteration},
booktitle = {Computer Science - Theory and Applications - 6th International Computer
Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June
14-18, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6651},
pages = {77--90},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20712-9\_7},
doi = {10.1007/978-3-642-20712-9\_7},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csr/HansenIM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HansenKLMT11,
author = {Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}} and
Niels Lauritzen and
Peter Bro Miltersen and
Elias P. Tsigaridas},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Exact algorithms for solving stochastic games: extended abstract},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {205--214},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993665},
doi = {10.1145/1993636.1993665},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HansenKLMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GalHKPV11,
author = {Anna G{\'{a}}l and
Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}} and
Pavel Pudl{\'{a}}k and
Emanuele Viola},
title = {Tight bounds on computing error-correcting codes by bounded-depth
circuits with arbitrary gates},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-150}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/150},
eprinttype = {ECCC},
eprint = {TR11-150},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GalHKPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HansenK10,
author = {Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}}},
title = {A New Characterization of ACC\({}^{\mbox{0}}\) and Probabilistic CC\({}^{\mbox{0}}\)},
journal = {Comput. Complex.},
volume = {19},
number = {2},
pages = {211--234},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0287-z},
doi = {10.1007/S00037-010-0287-Z},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/HansenK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HansenP10,
author = {Kristoffer Arnsfelt Hansen and
Vladimir V. Podolskii},
title = {Exact Threshold Circuits},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {270--279},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.33},
doi = {10.1109/CCC.2010.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HansenP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BabaiHPS10,
author = {L{\'{a}}szl{\'{o}} Babai and
Kristoffer Arnsfelt Hansen and
Vladimir V. Podolskii and
Xiaoming Sun},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Weights of Exact Threshold Functions},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {66--77},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_8},
doi = {10.1007/978-3-642-15155-2\_8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BabaiHPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/HansenMS10,
author = {Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
editor = {Spyros C. Kontogiannis and
Elias Koutsoupias and
Paul G. Spirakis},
title = {The Computational Complexity of Trembling Hand Perfection and Other
Equilibrium Refinements},
booktitle = {Algorithmic Game Theory - Third International Symposium, {SAGT} 2010,
Athens, Greece, October 18-20, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6386},
pages = {198--209},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16170-4\_18},
doi = {10.1007/978-3-642-16170-4\_18},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/HansenMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1812,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Peter Bro Miltersen},
title = {The complexity of solving reachability games using value and strategy
iteration},
journal = {CoRR},
volume = {abs/1007.1812},
year = {2010},
url = {http://arxiv.org/abs/1007.1812},
eprinttype = {arXiv},
eprint = {1007.1812},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-1812.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HansenK09,
author = {Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}}},
title = {A New Characterization of ACC\({}^{\mbox{0}}\) and Probabilistic CC\({}^{\mbox{0}}\)},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {27--34},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.15},
doi = {10.1109/CCC.2009.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HansenK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Hansen09,
author = {Kristoffer Arnsfelt Hansen},
editor = {Anna E. Frid and
Andrey Morozov and
Andrey Rybalchenko and
Klaus W. Wagner},
title = {Depth Reduction for Circuits with a Single Layer of Modular Counting
Gates},
booktitle = {Computer Science - Theory and Applications, Fourth International Computer
Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
18-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5675},
pages = {117--128},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03351-3\_13},
doi = {10.1007/978-3-642-03351-3\_13},
timestamp = {Mon, 01 Mar 2021 13:46:21 +0100},
biburl = {https://dblp.org/rec/conf/csr/Hansen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HansenLM09,
author = {Kristoffer Arnsfelt Hansen and
Oded Lachish and
Peter Bro Miltersen},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Hilbert's Thirteenth Problem and Circuit Complexity},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {153--162},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_17},
doi = {10.1007/978-3-642-10631-6\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HansenLM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/HansenKM09,
author = {Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}} and
Peter Bro Miltersen},
title = {Winning Concurrent Reachability Games Requires Doubly-Exponential
Patience},
booktitle = {Proceedings of the 24th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2009, 11-14 August 2009, Los Angeles, CA, {USA}},
pages = {332--341},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/LICS.2009.44},
doi = {10.1109/LICS.2009.44},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/HansenKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/AnderssonHMS08,
author = {Daniel Andersson and
Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
editor = {Arnold Beckmann and
Costas Dimitracopoulos and
Benedikt L{\"{o}}we},
title = {Deterministic Graphical Games Revisited},
booktitle = {Logic and Theory of Algorithms, 4th Conference on Computability in
Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5028},
pages = {1--10},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69407-6\_1},
doi = {10.1007/978-3-540-69407-6\_1},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/AnderssonHMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hansen08,
author = {Kristoffer Arnsfelt Hansen},
title = {Constant Width Planar Branching Programs Characterize ACC{\^{}}0 in
Quasipolynomial Size},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {92--99},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.30},
doi = {10.1109/CCC.2008.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hansen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/HansenHMS08,
author = {Kristoffer Arnsfelt Hansen and
Thomas Dueholm Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
editor = {Christos H. Papadimitriou and
Shuzhong Zhang},
title = {Approximability and Parameterized Complexity of Minmax Values},
booktitle = {Internet and Network Economics, 4th International Workshop, {WINE}
2008, Shanghai, China, December 17-20, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5385},
pages = {684--695},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92185-1\_74},
doi = {10.1007/978-3-540-92185-1\_74},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/HansenHMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Hansen08,
author = {Kristoffer Arnsfelt Hansen},
editor = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
title = {Depth Reduction for Circuits with a Single Layer of Modular Counting
Gates},
booktitle = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08381},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1782/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Hansen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-4344,
author = {Kristoffer Arnsfelt Hansen and
Thomas Dueholm Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
title = {Approximability and parameterized complexity of minmax values},
journal = {CoRR},
volume = {abs/0806.4344},
year = {2008},
url = {http://arxiv.org/abs/0806.4344},
eprinttype = {arXiv},
eprint = {0806.4344},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-4344.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HansenMS07,
author = {Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
editor = {Guohui Lin},
title = {Finding Equilibria in Games of No Chance},
booktitle = {Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4598},
pages = {274--284},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73545-8\_28},
doi = {10.1007/978-3-540-73545-8\_28},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HansenMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Hansen07,
author = {Kristoffer Arnsfelt Hansen},
editor = {Guohui Lin},
title = {Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold
Gates},
booktitle = {Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4598},
pages = {448--458},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73545-8\_44},
doi = {10.1007/978-3-540-73545-8\_44},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Hansen07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BrodalGHK07,
author = {Gerth St{\o}lting Brodal and
Loukas Georgiadis and
Kristoffer Arnsfelt Hansen and
Irit Katriel},
editor = {Ludek Kucera and
Anton{\'{\i}}n Kucera},
title = {Dynamic Matchings in Convex Bipartite Graphs},
booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International
Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
August 26-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4708},
pages = {406--417},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74456-6\_37},
doi = {10.1007/978-3-540-74456-6\_37},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BrodalGHK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-1055,
author = {Daniel Andersson and
Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
title = {Simple Recursive Games},
journal = {CoRR},
volume = {abs/0711.1055},
year = {2007},
url = {http://arxiv.org/abs/0711.1055},
eprinttype = {arXiv},
eprint = {0711.1055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-1055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HansenMV06,
author = {Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
V. Vinay},
title = {Circuits on cylinders},
journal = {Comput. Complex.},
volume = {15},
number = {1},
pages = {62--81},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0207-4},
doi = {10.1007/S00037-006-0207-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HansenMV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Hansen06,
author = {Kristoffer Arnsfelt Hansen},
title = {Constant Width Planar Computation Characterizes ACC\({}^{\mbox{0}}\)},
journal = {Theory Comput. Syst.},
volume = {39},
number = {1},
pages = {79--92},
year = {2006},
url = {https://doi.org/10.1007/s00224-005-1258-7},
doi = {10.1007/S00224-005-1258-7},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Hansen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hansen06,
author = {Kristoffer Arnsfelt Hansen},
title = {On Modular Counting with Polynomials},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {202--212},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.29},
doi = {10.1109/CCC.2006.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hansen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hansen06,
author = {Kristoffer Arnsfelt Hansen},
title = {Lower Bounds for Circuits with Few Modular Gates using Exponential
Sums},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-079}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-079/index.html},
eprinttype = {ECCC},
eprint = {TR06-079},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hansen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChattopadhyayH05,
author = {Arkadev Chattopadhyay and
Kristoffer Arnsfelt Hansen},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Lower Bounds for Circuits with Few Modular and Symmetric Gates},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {994--1005},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_80},
doi = {10.1007/11523468\_80},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChattopadhyayH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HansenM04,
author = {Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {Some Meet-in-the-Middle Circuit Lower Bounds},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {334--345},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_24},
doi = {10.1007/978-3-540-28629-5\_24},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HansenM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Hansen04,
author = {Kristoffer Arnsfelt Hansen},
editor = {Volker Diekert and
Michel Habib},
title = {Constant Width Planar Computation Characterizes ACC\({}^{\mbox{0}}\)},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {44--55},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_5},
doi = {10.1007/978-3-540-24749-4\_5},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Hansen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HansenMV03,
author = {Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
V. Vinay},
editor = {Andrzej Lingas and
Bengt J. Nilsson},
title = {Circuits on Cylinders},
booktitle = {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},
pages = {171--182},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45077-1\_17},
doi = {10.1007/978-3-540-45077-1\_17},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/HansenMV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-025,
author = {Kristoffer Arnsfelt Hansen},
title = {Constant width planar computation characterizes {ACC0}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-025}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-025/index.html},
eprinttype = {ECCC},
eprint = {TR03-025},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-066,
author = {Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
V. Vinay},
title = {Circuits on Cylinders},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-066}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-066/index.html},
eprinttype = {ECCC},
eprint = {TR02-066},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-066.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-05-08 23:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
