From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “linear complexity” 740

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Fabian Meyer, Jürgen Giesl

7

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

1

citations
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

0

citations
Subcarrier Grouping with Linear Time-Domain Compensation for Low-Complexity Millimeter Wave OFDM Multiuser Systems
2021 IEEE Vehicular Technology Conference conference-paper Engineering PAPR reduction in OFDM

Zekai Liang, Gerd Ascheid

0

citations
Design optimization of multi-energy systems using mixed-integer linear programming: Which model complexity and level of detail is sufficient?
2021 Energy Conversion and Management article Engineering Integrated Energy Systems Optimization

Marco Wirtz, Dirk Müller

100

citations
A multi-vector interface quasi-Newton method with linear complexity for partitioned fluid–structure interaction
2020 Computer Methods in Applied Mechanics and Engineering article Engineering Advanced Numerical Methods in Computational Mathematics Open access

Thomas Spenke, Norbert Hosters, Marek Behr

32

citations
Quantum Computational Complexity of Matrix Functions
2024 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Santiago Cifuentes, Samson Wang, Thais de Lima Silva, Mario Berta, Leandro Aolita

0

citations
Quantum Computational Complexity of Matrix Functions
2026 PRX Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Santiago Cifuentes, Samson Wang, Thais de Lima Silva, Mario Berta, Leandro Aolita

0

citations
Convergence of Entropy-Regularized Natural Policy Gradient with Linear Function Approximation
2024 SIAM Journal on Optimization article Computer Science Reinforcement Learning in Robotics Open access

Semih Çaycı, Niao He, R. Srikant

10

citations
An Analysis of the Decidability and Complexity of Numeric Additive Planning
2024 Proceedings of the International Conference on Automated Planning and Scheduling conference-paper Computer Science AI-based Problem Solving and Planning Open access

Hayyan Helal, Gerhard Lakemeyer

1

citations
Constructive Recognition of Special Linear Groups
2024 arXiv (Cornell University) preprint Mathematics Finite Group Theory Research Open access

Max Horn, Alice Niemeyer, Cheryl E. Praeger, Daniel Rademacher

0

citations
Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
2024 PRX Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Samson Wang, Sam McArdle, Mario Berta

20

citations
Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
2023 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Samson Wang, Sam McArdle, Mario Berta

2

citations
First-Order Model-Checking in Random Graphs and Complex Networks
2020 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
First-Order Model-Checking in Random Graphs and Complex Networks
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
Complex Bounded Operators in Isabelle/HOL
2025 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Dominique Unruh, José Manuel Rodríguez Caballero

0

citations
Cylindrical algebraic decomposition based methods in satisfiability modulo non-linear real arithmetic
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Polynomial and algebraic computation Open access

0

citations
A Flexible Framework for Expectation Maximization-Based MIMO System Identification for Time-Variant Linear Acoustic Systems
2023 IEEE Open Journal of Signal Processing article Computer Science Speech and Audio Processing Open access

Tobias Kabzinski, Peter Jax

3

citations
Convergence guarantees for forward gradient descent in the linear regression model
2024 Journal of Statistical Planning and Inference article Computer Science Stochastic Gradient Optimization Techniques Open access

Thijs Bos, Johannes Schmidt-Hieber

0

citations
Structural risk minimization for quantum linear classifiers
2023 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Casper Gyurik, van Dyon Vreumingen, Vedran Dunjko

34

citations
Bipartite $q$-Kneser graphs and two-generated irreducible linear groups
2023 arXiv (Cornell University) preprint Mathematics Finite Group Theory Research Open access

S. P. Glasby, Alice C. Niemeyer, Cheryl E. Praeger

0

citations
The Advice Complexity of Delayed F-Node-Deletion Problems and of Disconnected Delayed H-Edge-Deletion Problems
2024 SSRN Electronic Journal preprint Computer Science Advanced Graph Theory Research Open access

Niklas Berndt, Henri Lotze

0

citations
Haplotype reconstruction for genetically complex regions with ambiguous genotype calls: Illustration by the KIR gene region
2023 Genetic Epidemiology article Biochemistry, Genetics and Molecular Biology Genetic Associations and Epidemiology Open access

Lars L. J. van der Burg, Liesbeth C. de Wreede, Henning Baldauf, Jürgen Sauter, Johannes Schetelig, Hein Putter, +1 more

4

citations
An integral equation formulation of the N-body dielectric spheres problem. Part II: complexity analysis
2020 ESAIM Mathematical Modelling and Numerical Analysis article Physics and Astronomy Electromagnetic Scattering and Analysis Open access

Bérenger Bramas, Muhammad Hassan, Benjamin Stamm

7

citations
Definable decompositions for graphs of bounded linear cliquewidth
2021 Logical Methods in Computer Science article Computer Science Advanced Graph Theory Research Open access

Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk

7

citations