The SCEAS System
| |||||||

## Search the dblp DataBase
Kristoffer Arnsfelt Hansen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kristoffer Arnsfelt Hansen
**On Modular Counting with Polynomials.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:202-212 [Conf] - Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
**Circuits on Cylinders.**[Citation Graph (0, 0)][DBLP] FCT, 2003, pp:171-182 [Conf] - 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] - 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] - Kristoffer Arnsfelt Hansen
**Constant Width Planar Computation Characterizes ACC**[Citation Graph (0, 0)][DBLP]^{0}. STACS, 2004, pp:44-55 [Conf] - 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] - 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] - 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] - Kristoffer Arnsfelt Hansen
**Constant Width Planar Computation Characterizes ACC**[Citation Graph (0, 0)][DBLP]^{0}. Theory Comput. Syst., 2006, v:39, n:1, pp:79-92 [Journal] - 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] - 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] - 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] **Deterministic Graphical Games Revisited.**[Citation Graph (, )][DBLP]**Exact Threshold Circuits.**[Citation Graph (, )][DBLP]**Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size.**[Citation Graph (, )][DBLP]**A New Characterization of ACC**[Citation Graph (, )][DBLP]^{0}and Probabilistic CC^{0}.**Depth Reduction for Circuits with a Single Layer of Modular Counting Gates.**[Citation Graph (, )][DBLP]**Hilbert's Thirteenth Problem and Circuit Complexity.**[Citation Graph (, )][DBLP]**Winning Concurrent Reachability Games Requires Doubly-Exponential Patience.**[Citation Graph (, )][DBLP]**Weights of Exact Threshold Functions.**[Citation Graph (, )][DBLP]**Approximability and Parameterized Complexity of Minmax Values.**[Citation Graph (, )][DBLP]**A New Characterization of ACC**[Citation Graph (, )][DBLP]^{0}and Probabilistic CC^{0}.**Simple Recursive Games**[Citation Graph (, )][DBLP]**Approximability and parameterized complexity of minmax values**[Citation Graph (, )][DBLP]**The complexity of solving reachability games using value and strategy iteration**[Citation Graph (, )][DBLP]**Lower Bounds for Circuits with Few Modular Gates using Exponential Sums.**[Citation Graph (, )][DBLP]
Search in 0.020secs, Finished in 0.020secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |