Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Andreas Göbel

Research Group Algorithm Engineering
Hasso Plattner Institute

Office: A-1.6
Tel.: +49 331 5509-424
E-Mail: Andreas.Goebel(at)hpi.de

Research Interests

  • Randomness and Computation
  • Computational Complexity
  • Counting Complexity

Publications

[ 2017 ] [ 2016 ] [ 2015 ] [ 2014 ] [ 2009 ]

2017 [ to top ]

  • Bampas, Evangelos; Göbel, Andreas-Nikolas; Pagourtzis, Aris; Tentes, Aris On the connection between interval size functions and path counting. Computational Complexity 2017: 421-467
     
  • Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie Ann; Lapinskas, John; Richerby, David Amplifiers for the Moran Process. Journal of the ACM 2017: 5:1-5:90
     
  • thesis_Goebel.pdf
    Göbel, Andreas Counting, Modular Counting and Graph Homomorphisms. 2017
     

2016 [ to top ]

  • a12-gobel.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Square-Free Graphs, Modulo 2. Transactions on Computation Theory 2016: 12:1-12:29
     
  • LIPIcs-ICALP-2016-62.pdf
    Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie-Ann; Lapinskas, John; Richerby, David Amplifiers for the Moran Process. International Colloquium on Automata, Languages and Programming (ICALP) 2016: 62:1-62:13
     

2015 [ to top ]

  • Partitions.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki Counting List Matrix Partitions of Graphs. SIAM Journal on Computing 2015: 1089-1118
     
  • CountingHomomorphismsToSquare-FreeGraphsModulo2.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Square-Free Graphs, Modulo 2. International Colloquium on Automata, Languages, and Programming (ICALP) 2015: 642-653
     

2014 [ to top ]

  • Counting+Homomorphisms+to+Cactus+Graphs+Modulo+2.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Cactus Graphs Modulo 2. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 350-361
     
  • CountingListMatrixPartitionsOfGraphs.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki Counting List Matrix Partitions of Graphs. Conference on Computational Complexity (CCC) 2014: 56-65
     
  • TheComplexityOfCountingHomomorphismsToCactusGraphsModulo2.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David The complexity of counting homomorphisms to cactus graphs modulo 2. Transactions on Computation Theory 2014: 17:1-17:29
     

2009 [ to top ]

  • OnTheConnectionBetweenIntervalSizeFunctionsAndPathCounting.pdf
    Bampas, Evangelos; Göbel, Andreas-Nikolas; Pagourtzis, Aris; Tentes, Aris On the Connection between Interval Size Functions and Path Counting. Theory and Applications of Models of Computation (TAMC) 2009: 108-117
     

Teaching

Randomized Algorithms, Summer 2017