Search the dblp DataBase

Publications of Author

1. Kristoffer Arnsfelt Hansen
   On Modular Counting with Polynomials. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:202-212 [Conf]
   
2. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
   Circuits on Cylinders. [Citation Graph (0, 0)][DBLP]
   FCT, 2003, pp:171-182 [Conf]
   
3. Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen
   Lower Bounds for Circuits with Few Modular and Symmetric Gates. [Citation Graph (0, 0)][DBLP]
   ICALP, 2005, pp:994-1005 [Conf]
   
4. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen
   Some Meet-in-the-Middle Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
   MFCS, 2004, pp:334-345 [Conf]
   
5. Kristoffer Arnsfelt Hansen
   Constant Width Planar Computation Characterizes ACC⁰. [Citation Graph (0, 0)][DBLP]
   STACS, 2004, pp:44-55 [Conf]
   
6. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
   Circuits on cylinders. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:1, pp:62-81 [Journal]
   
7. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
   Circuits on Cylinders [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:066, pp:- [Journal]
   
8. Kristoffer Arnsfelt Hansen
   Constant width planar computation characterizes ACC0 [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:025, pp:- [Journal]
   
9. Kristoffer Arnsfelt Hansen
   Constant Width Planar Computation Characterizes ACC⁰. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2006, v:39, n:1, pp:79-92 [Journal]
   
10. Kristoffer Arnsfelt Hansen
    Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:448-458 [Conf]
    
11. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
    Finding Equilibria in Games of No Chance. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:274-284 [Conf]
    
12. Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
    Dynamic Matchings in Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:406-417 [Conf]
    
13. 
    Deterministic Graphical Games Revisited. [Citation Graph (, )][DBLP]
    
    
14. 
    Exact Threshold Circuits. [Citation Graph (, )][DBLP]
    
    
15. 
    Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size. [Citation Graph (, )][DBLP]
    
    
16. 
    A New Characterization of ACC⁰ and Probabilistic CC⁰. [Citation Graph (, )][DBLP]
    
    
17. 
    Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. [Citation Graph (, )][DBLP]
    
    
18. 
    Hilbert's Thirteenth Problem and Circuit Complexity. [Citation Graph (, )][DBLP]
    
    
19. 
    Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. [Citation Graph (, )][DBLP]
    
    
20. 
    Weights of Exact Threshold Functions. [Citation Graph (, )][DBLP]
    
    
21. 
    Approximability and Parameterized Complexity of Minmax Values. [Citation Graph (, )][DBLP]
    
    
22. 
    A New Characterization of ACC⁰ and Probabilistic CC⁰. [Citation Graph (, )][DBLP]
    
    
23. 
    Simple Recursive Games [Citation Graph (, )][DBLP]
    
    
24. 
    Approximability and parameterized complexity of minmax values [Citation Graph (, )][DBLP]
    
    
25. 
    The complexity of solving reachability games using value and strategy iteration [Citation Graph (, )][DBLP]
    
    
26. 
    Lower Bounds for Circuits with Few Modular Gates using Exponential Sums. [Citation Graph (, )][DBLP]