Fabian Wagner

From MaRDI portal
(Redirected from Person:500987)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Shift-symmetric Horndeski gravity in the asymptotic-safety paradigm
Journal of Cosmology and Astroparticle Physics
2023-03-17Paper
The minimal length is physical
Physics Letters B
2022-10-24Paper
The ensemble Kalman filter for rare event estimation
SIAM/ASA Journal on Uncertainty Quantification
2022-03-10Paper
Error analysis for probabilities of rare events with approximate models
SIAM Journal on Numerical Analysis
2021-07-19Paper
Multilevel sequential importance sampling for rare event estimation
SIAM Journal on Scientific Computing
2020-08-05Paper
Counting the number of perfect matchings in \(K_{5}\)-free graphs
Theory of Computing Systems
2017-01-12Paper
Beating the generator-enumeration bound for \(p\)-group isomorphism
Theoretical Computer Science
2015-10-08Paper
Graph isomorphism is not \(\mathsf{AC}^{0}\)-reducible to group isomorphism
ACM Transactions on Computation Theory
2015-09-24Paper
Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace
Chicago Journal of Theoretical Computer Science
2014-09-24Paper
scientific article; zbMATH DE number 6146491 (Why is no real title available?)2013-03-19Paper
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation
2012-10-11Paper
Restricted space algorithms for isomorphism on bounded treewidth graphs2012-01-23Paper
Graphs of bounded treewidth can be canonized in AC\(^1\)
Computer Science – Theory and Applications
2011-06-17Paper
The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
Theory of Computing Systems
2010-10-06Paper
Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
Fundamentals of Computation Theory
2009-10-20Paper
scientific article; zbMATH DE number 5568412 (Why is no real title available?)2009-06-23Paper
Hardness Results for Tournament Isomorphism and Automorphism
Mathematical Foundations of Computer Science 2007
2008-09-17Paper


Research outcomes over time


This page was built for person: Fabian Wagner