Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Hansen, Kristoffer Arnsfelt"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning read-constant polynomials of constant degree modulo composites
Arkadev Chattopadhyay
,
Ricard Gavaldà
,
Kristoffer Arnsfelt Hansen
,
Denis Thérien
Theory of Computing Systems
55
(2), 2014, pp. 404-420
The complexity of solving reachability games using value and strategy iteration
Kristoffer Arnsfelt Hansen
,
Rasmus Ibsen-Jensen
,
Peter Bro Miltrsen
Theory of Computing Systems
55
(2), 2014, pp. 380-403
Polynomial threshold functions and Boolean threshold circuits
Kristoffer Arnsfelt Hansen
,
Vladimir V. Podolskii
Lecture Notes in Computer Science
8087
, 2013, pp. 516-527
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
Anna Gál
,
Kristoffer Arnsfelt Hansen
,
Michal Koucký
,
Pavel Pudlák
,
Emanuele Viola
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 479-494
Exact algorithms for solving stochastic games
Kristoffer Arnsfelt Hansen
,
Michal Koucký
,
Niels Lauritzen
,
Peter Bro Miltersen
,
Elias P. Tsigaridas
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 205-214
Weights of exact threshold functions
László Babai
,
Kristoffer Arnsfelt Hansen
,
Vladimir V. Podolskii
,
Xiaoming Sun
Lecture Notes in Computer Science
6281
, 2010, pp. 66-77
Hilbert's thirteenth problem and circuit complexity
Kristoffer Arnsfelt Hansen
,
Oded Lachish
,
Peter Bro Miltersen
Lecture Notes in Computer Science
5878
, 2009, pp. 153-162
Dynamic matchings in convex bipartite graphs
Gerth Stlting Brodal
,
Loukas Georgiadis
,
Kristoffer Arnsfelt Hansen
,
Irit Katriel
Lecture Notes in Computer Science
4708
, 2007, pp. 406-417
Finding equilibria in games of no chance
Kristoffer Arnsfelt Hansen
,
Peter Bro Miltersen
,
Troels Bjerre Srensen
Lecture Notes in Computer Science
4598
, 2007, pp. 274-284
Computing symmetric Boolean functions by circuits with few exact threshold gates
Kristoffer Arnsfelt Hansen
Lecture Notes in Computer Science
4598
, 2007, pp. 448-458
Constant width planar computation characterizes ACC
^0
Kristoffer Arnsfelt Hansen
Theory of Computing Systems
39
(1), 2006, pp. 79-92
Lower bounds for circuits with few modular and symmetric gates
Arkadev Chattopadhyay
,
Kristoffer Arnsfelt Hansen
Lecture Notes in Computer Science
3580
, 2005, pp. 994-1005
Some meet-in-the-middle circuit lower bounds
Kristoffer Arnsfelt Hansen
,
Peter Bro Miltersen
Lecture Notes in Computer Science
3153
, 2004, pp. 334-345