Stefan Neumann, MSc

 

Faculty of Computer Science
University of Vienna
Room 6.23
Waehringerstrasse 29/6.32
1090 Wien-Vienna, Austria

email: stefan.neumann@univie.ac.at 
phone +43-1-4277-78341
web: personal homepage

Teaching: course directory

 

Supervisor:
Monika Henzinger

MSc (Computer Science)

Research area in the program
Combinatorial Optimization

Keywords

  • dynamic graph algorithms
  • conditional lower bounds
  • cell-probe lower bounds
  • data mining

Research Interests

My research interests are centered around the analysis of dynamic graph algorithms. For these problems I am particularly interested in deriving lower bounds (both conditional and unconditional) and upper bounds (fully dynamic algorithms and dynamic algorithms with only a small number of updates). Besides that, I also like data mining.

Scientific CV

Since 2016, PhD student at University of Vienna
2013-2015, MSc in Computer Science at Max Planck Institute of Computer Science and Saarland University
2010-2013, BSc in Mathematics at University of Jena

[ Download CV ]

Publications

Showing entries 0 - 6 out of 6

Neumann, S 2018, Bipartite Stochastic Block Models with Tiny Clusters. in Thirty-second Conference on Neural Information Processing Systems (NIPS).


Henzinger, M, Lincoln, A, Neumann, S & Vassilevska Williams, V 2017, Conditional Hardness for Sensitivity Problems. in CH Papadimitrou (ed.), 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)., 26. DOI: 10.4230/LIPIcs.ITCS.2017.26


Neumann, S & Miettinen, P 2017, Reductions for Frequency-Based Data Mining Problems. in 2017 IEEE 17th International Conference on Data Mining (ICDM).


Neumann, S, Gemulla, R & Miettinen, P 2016, What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank. in 2016 IEEE 16th International Conference on Data Mining (ICDM): 12-15 Dec. 2016. IEEE Xplore, pp. 380-389, IEEE International Conference on Data Mining 2016, Barcelona, Spain, 12/12/16. DOI: 10.1109/ICDM.2016.0049


Neumann, S & Wiese, A 2016, This House Proves That Debating Is Harder Than Soccer. in Eighth International Conference on Fun with Algorithms (FUN 2016). Leibniz International Proceedings in Informatics (LIPIcs), pp. 25:1-25:14. DOI: 10.4230/LIPIcs.FUN.2016.25


Showing entries 0 - 6 out of 6