Sebastian Krinninger
Computational Theory and Mathematics · 2015
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 5 citations into it
Whom Sebastian Krinninger trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Sebastian Krinninger's perspective
Ordered by how strongly the researchers Sebastian Krinninger trusts endorse each paper. Same corpus, a different order for every researcher.
- Gaussian elimination is not optimal
- Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems (IEEE Annual Symposium on Foundations of Computer Science)
- Structured Matrices and Polynomials: Unified Superfast Algorithms
- Multiplying matrices faster than coppersmith-winograd (Symposium on the Theory of Computing)
- Improved bound for complexity of matrix multiplication (Proceedings of the Royal Society of Edinburgh. Section A Mathematics)
- Warping indexes with envelope transforms for query by humming (ACM SIGMOD Conference)
- Multiple Sequence Alignment (Theory and Mathematical Methods for Bioinformatics)
- Matrix multiplication via arithmetic progressions
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (JACM)
- Fundamentals of speech recognition