Not finding it? Sign in to also search OpenAlex live.
-
Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences2024 Computers & Operations Research article Mathematics Advanced Optimization Algorithms Research Open access
Jens Clausen, Yves Crama, Richard Martin Lusby, Elisabeth Rodríguez-Heck, Stefan Røpke
4citations -
Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access
Darion Haase, Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lutz Klinkenberg, +1 more
1citations -
Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops (Extended Version)2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access
Darion Haase, Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lutz Klinkenberg, +1 more
1citations