Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract). - Holger Hermanns; Markus Lohrey (CONCUR, 1998)

On the Confluence of Trace Rewriting Systems. - Markus Lohrey (FSTTCS, 1998)

NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars. - Markus Lohrey (Acta Cybern., 1998)

Das Konfluenzproblem für Spurersetzungssysteme. - Markus Lohrey (1999)

Complexity Results for Confluence Problems. - Markus Lohrey (MFCS, 1999)

Word Problems and Confluence Problems for Restricted Semi-Thue Systems. - Markus Lohrey (RTA, 2000)

Word Problems for 2-Homogeneous Monoids and Symmetric Logspace. - Markus Lohrey (MFCS, 2001)

On the Parallel Complexity of Tree Automata. - Markus Lohrey (RTA, 2001)

Confluence Problems for Trace Rewriting Systems. - Markus Lohrey (Inf. Comput., 2001)

Safe Realizability of High-Level Message Sequence Charts. - Markus Lohrey (CONCUR, 2002)

On the Theory of One-Step Rewriting in Trace Monoids. - Dietrich Kuske; Markus Lohrey (ICALP, 2002)

A Note on The Existential Theory of Equations in Plain Groups. - Volker Diekert; Markus Lohrey (Int. J. Algebra Comput., 2002)

Automatic Structures of Bounded Degree. - Markus Lohrey (LPAR, 2003)

Decidable Theories of Cayley-Graphs. - Dietrich Kuske; Markus Lohrey (STACS, 2003)

Realizability of high-level message sequence charts: closing the gaps. - Markus Lohrey (Theor. Comput. Sci., 2003)

Computational and logical aspects of infinite monoids. - Markus Lohrey (2003)

Word Problems on Compressed Words. - Markus Lohrey (ICALP, 2004)

Bounded MSC communication. - Markus Lohrey; Anca Muscholl (Inf. Comput., 2004)

Existential and Positive Theories of Equations in Graph Products. - Volker Diekert; Markus Lohrey (Theory Comput. Syst., 2004)

Efficient Memory Representation of XML Documents. - Giorgio Busatto; Markus Lohrey; Sebastian Maneth (DBPL, 2005)

Fixpoint Logics on Hierarchical Structures. - Stefan Göller; Markus Lohrey (FSTTCS, 2005)

Tree Automata and XPath on Compressed Trees. - Markus Lohrey; Sebastian Maneth (CIAA, 2005)

Logical aspects of Cayley-graphs: the group case. - Dietrich Kuske; Markus Lohrey (Ann. Pure Appl. Log., 2005)

Axiomatising divergence. - Markus Lohrey; Pedro R. D'Argenio; Holger Hermanns (Inf. Comput., 2005)

Decidability and complexity in automatic monoids. - Markus Lohrey (Int. J. Found. Comput. Sci., 2005)

Complexity results for prefix grammars. - Markus Lohrey; Holger Petersen 001 (RAIRO Theor. Informatics Appl., 2005)

Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. - Dietrich Kuske; Markus Lohrey (Theory Comput. Syst., 2005)

Infinite State Model-Checking of Propositional Dynamic Logics. - Stefan Göller; Markus Lohrey (CSL, 2006)

First-Order and Counting Theories of omega-Automatic Structures. - Dietrich Kuske; Markus Lohrey (FoSSaCS, 2006)

Theories of HNN-Extensions and Amalgamated Products. - Markus Lohrey; Géraud Sénizergues (ICALP (2), 2006)

Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. - Dietrich Kuske; Markus Lohrey (LICS, 2006)

Partially Commutative Inverse Monoids. - Volker Diekert; Markus Lohrey; Alexander Miller (MFCS, 2006)

Querying and Embedding Compressed Texts. - Yury Lifshits; Markus Lohrey (MFCS, 2006)

Logical Aspects of Cayley-graphs: the Monoid Case. - Dietrich Kuske; Markus Lohrey (Int. J. Algebra Comput., 2006)

Word Problems and Membership Problems on Compressed Words. - Markus Lohrey (SIAM J. Comput., 2006)

The complexity of tree automata and XPath on grammar-compressed trees. - Markus Lohrey; Sebastian Maneth (Theor. Comput. Sci., 2006)

Efficient Computation in Groups Via Compression. - Markus Lohrey; Saul Schleimer (CSR, 2007)

07441 Summary – Algorithmic-Logical Theory of Infinite Structures. - Rod Downey; Bakhadyr Khoussainov; Dietrich Kuske; Markus Lohrey; Moshe Y. Vardi (Algorithmic-Logical Theory of Infinite Structures, 2007)

07441 Abstracts Collection – Algorithmic-Logical Theory of Infinite Structures. - Rod Downey; Bakhadyr Khoussainov; Dietrich Kuske; Markus Lohrey; Moshe Y. Vardi (Algorithmic-Logical Theory of Infinite Structures, 2007)

PDL with Intersection and Converse is 2EXP-complete. - Stefan Göller; Markus Lohrey; Carsten Lutz (Algorithmic-Logical Theory of Infinite Structures, 2007)

Application of verification techniques to inverse monoids. - Markus Lohrey (Algorithmic-Logical Theory of Infinite Structures, 2007)

PDL with Intersection and Converse Is 2 EXP-Complete. - Stefan Göller; Markus Lohrey; Carsten Lutz (FoSSaCS, 2007)

The submonoid and rational subset membership problems for graph groups. - Markus Lohrey; Benjamin Steinberg (LATA, 2007)

Inverse monoids: Decidability and complexity of algebraic questions. - Markus Lohrey; Nicole Ondrusch (Inf. Comput., 2007)

Euler paths and ends in automatic and recursive graphs. - Dietrich Kuske; Markus Lohrey (AFL, 2008)

Compressed membership problems revisited. - Markus Lohrey (AFL, 2008)

08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data. - Stefan Böttcher; Markus Lohrey; Sebastian Maneth; Wojciech Rytter (Structure-Based Compression of Complex Massive Data, 2008)

08261 Executive Summary - Structure-Based Compression of Complex Massive Data. - Stefan Böttcher; Markus Lohrey; Sebastian Maneth; Wojciech Rytter (Structure-Based Compression of Complex Massive Data, 2008)

Hamiltonicity of automatic graphs. - Dietrich Kuske; Markus Lohrey (IFIP TCS, 2008)

Word Equations over Graph Products. - Volker Diekert; Markus Lohrey (Int. J. Algebra Comput., 2008)

Algorithmic Problems on Inverse Monoids over Virtually Free Groups. - Volker Diekert; Nicole Ondrusch; Markus Lohrey (Int. J. Algebra Comput., 2008)

Rational Subsets in HNN-Extensions and Amalgamated Products. - Markus Lohrey; Géraud Sénizergues (Int. J. Algebra Comput., 2008)

Efficient memory representation of XML document trees. - Giorgio Busatto; Markus Lohrey; Sebastian Maneth (Inf. Syst., 2008)

First-order and counting theories of omega-automatic structures. - Dietrich Kuske; Markus Lohrey (J. Symb. Log., 2008)

Parameter Reduction in Grammar-Compressed Trees. - Markus Lohrey; Sebastian Maneth; Manfred Schmidt-Schauß (FoSSaCS, 2009)

PDL with intersection and converse: satisfiability and infinite-state model checking. - Stefan Göller; Markus Lohrey; Carsten Lutz (J. Symb. Log., 2009)

The Isomorphism Problem for omega-Automatic Trees. - Dietrich Kuske; Jiamou Liu; Markus Lohrey (CSL, 2010)

Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups. - Niko Haubold; Markus Lohrey; Christian Mathissen (Developments in Language Theory, 2010)

The Isomorphism Problem on Classes of Automatic Structures. - Dietrich Kuske; Jiamou Liu; Markus Lohrey (LICS, 2010)

Branching-time Model Checking of One-counter Processes. - Stefan Göller; Markus Lohrey (STACS, 2010)

The Isomorphism Problem for omega-Automatic Trees - Dietrich Kuske; Jiamou Liu; Markus Lohrey (CoRR, 2010)

Compressed Membership Problems for Regular Expressions and Hierarchical Automata. - Markus Lohrey (Int. J. Found. Comput. Sci., 2010)

Some natural decision problems in automatic graphs. - Dietrich Kuske; Markus Lohrey (J. Symb. Log., 2010)

Compressed Membership in Automata with Compressed Labels. - Markus Lohrey; Christian Mathissen (CSR, 2011)

Tree Structure Compression with RePair. - Markus Lohrey; Sebastian Maneth; Roy Mennicke (DCC, 2011)

Compressed Word Problems for Inverse Monoids. - Markus Lohrey (MFCS, 2011)

Leaf languages and string compression. - Markus Lohrey (Inf. Comput., 2011)

Automatic structures of bounded degree revisited. - Dietrich Kuske; Markus Lohrey (J. Symb. Log., 2011)

Fixpoint Logics over Hierarchical Structures. - Stefan Göller; Markus Lohrey (Theory Comput. Syst., 2011)

Compressed Word Problems in HNN-extensions and Amalgamated Products. - Niko Haubold; Markus Lohrey (Theory Comput. Syst., 2011)

Tilings and Submonoids of Metabelian Groups. - Markus Lohrey; Benjamin Steinberg (Theory Comput. Syst., 2011)

Tree-Automatic Well-Founded Trees. - Alexander Kartzow; Jiamou Liu; Markus Lohrey (CiE, 2012)

Logspace Computations in Graph Groups and Coxeter Groups. - Volker Diekert; Jonathan Kausch; Markus Lohrey (LATIN, 2012)

Algorithmics on SLP-compressed strings: A survey. - Markus Lohrey (Groups Complex. Cryptol., 2012)

Compressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups. - Niko Haubold; Markus Lohrey; Christian Mathissen (Int. J. Algebra Comput., 2012)

Model-checking hierarchical structures. - Markus Lohrey (J. Comput. Syst. Sci., 2012)

Parameter reduction and automata evaluation for grammar-compressed trees. - Markus Lohrey; Sebastian Maneth; Manfred Schmidt-Schauß (J. Comput. Syst. Sci., 2012)

Satisfiability of CTL* with Constraints. - Claudia Carapelle; Alexander Kartzow; Markus Lohrey (CONCUR, 2013)

XML compression via DAGs. - Markus Lohrey; Sebastian Maneth; Eric Noeth (ICDT, 2013)

Compression of Rewriting Systems for Termination Analysis. - Alexander Bau; Markus Lohrey; Eric Nöth; Johannes Waldmann (RTA, 2013)

The isomorphism problem for ω-automatic trees. - Dietrich Kuske; Jiamou Liu; Markus Lohrey (Ann. Pure Appl. Log., 2013)

XML Compression via DAGs. - Mireille Bousquet-Mélou; Markus Lohrey; Sebastian Maneth; Eric Noeth (CoRR, 2013)

Tree-Automatic Well-Founded Trees - Martin Huschenbett; Alexander Kartzow; Jiamou Liu; Markus Lohrey (Log. Methods Comput. Sci., 2013)

Isomorphism of regular trees and words. - Markus Lohrey; Christian Mathissen (Inf. Comput., 2013)

XML tree structure compression using RePair. - Markus Lohrey; Sebastian Maneth; Roy Mennicke (Inf. Syst., 2013)

Branching-Time Model Checking of One-Counter Processes and Timed Automata. - Stefan Göller; Markus Lohrey (SIAM J. Comput., 2013)

The Compressed Word Problem for Groups. - Markus Lohrey (Springer, 2014)

Constructing Small Tree Grammars and Small Circuits for Formulas. - Danny Hucke; Markus Lohrey; Eric Noeth (FSTTCS, 2014)

On Boolean closed full trios and rational Kripke frames. - Markus Lohrey; Georg Zetzsche (STACS, 2014)

The First-Order Theory of Ground Tree Rewrite Graphs - Stefan Göller; Markus Lohrey (Log. Methods Comput. Sci., 2014)

Evaluating Matrix Circuits. - Daniel König; Markus Lohrey (COCOON, 2015)

Temporal Logics with Local Constraints (Invited Talk). - Claudia Carapelle; Markus Lohrey (CSL, 2015)

Satisfiability of ECTL* with Tree Constraints. - Claudia Carapelle; Shiguang Feng; Alexander Kartzow; Markus Lohrey (CSR, 2015)

Equality Testing of Compressed Strings. - Markus Lohrey (WORDS, 2015)

Grammar-Based Tree Compression. - Markus Lohrey (DLT, 2015)

Compressed Tree Canonization. - Markus Lohrey; Sebastian Maneth; Fabian Peternek (ICALP (2), 2015)

Rational subsets and submonoids of wreath products. - Markus Lohrey; Benjamin Steinberg; Georg Zetzsche (Inf. Comput., 2015)

Rational subsets of unitriangular groups. - Markus Lohrey (Int. J. Algebra Comput., 2015)

XML Compression via Directed Acyclic Graphs. - Mireille Bousquet-Mélou; Markus Lohrey; Sebastian Maneth; Eric Nöth (Theory Comput. Syst., 2015)

The Complexity of Decomposing Modal and First-Order Theories. - Stefan Göller; Jean Christoph Jung; Markus Lohrey (ACM Trans. Comput. Log., 2015)

Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. - Daniel König; Markus Lohrey; Georg Zetzsche (AMS-EMS-SPM Joint Meeting, 2016)

On the Parallel Complexity of Bisimulation on Finite Systems. - Moses Ganardi; Stefan Göller; Markus Lohrey (CSL, 2016)

Traversing Grammar-Compressed Trees with Constant Delay. - Markus Lohrey; Sebastian Maneth; Carl Philipp Reh (DCC, 2016)

Querying Regular Languages over Sliding Windows. - Moses Ganardi; Danny Hucke; Markus Lohrey (FSTTCS, 2016)

The Smallest Grammar Problem Revisited. - Danny Hucke; Markus Lohrey; Carl Philipp Reh (SPIRE, 2016)

Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. - Markus Lohrey; Georg Zetzsche (STACS, 2016)

Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images. - Christoph Haase; Stefan Kiefer; Markus Lohrey (CoRR, 2016)

Computation over Compressed Structured Data (Dagstuhl Seminar 16431). - Philip Bille; Markus Lohrey; Sebastian Maneth; Gonzalo Navarro 001 (Dagstuhl Reports, 2016)

Approximation of smallest linear tree grammar. - Artur Jez; Markus Lohrey (Inf. Comput., 2016)

Satisfiability of ECTL⁎ with constraints. - Claudia Carapelle; Alexander Kartzow; Markus Lohrey (J. Comput. Syst. Sci., 2016)

Compression of Unordered XML Trees. - Markus Lohrey; Sebastian Maneth; Carl Philipp Reh (ICDT, 2017)

Universal tree source coding using grammar-based compression. - Danny Hucke; Markus Lohrey (ISIT, 2017)

Computing quantiles in Markov chains with multi-dimensional costs. - Christoph Haase; Stefan Kiefer; Markus Lohrey (LICS, 2017)

Counting Problems for Parikh Images. - Christoph Haase; Stefan Kiefer; Markus Lohrey (MFCS, 2017)

Circuit Evaluation for Finite Semirings. - Moses Ganardi; Danny Hucke; Daniel König; Markus Lohrey (STACS, 2017)

The Complexity of Knapsack in Graph Groups. - Markus Lohrey; Georg Zetzsche (STACS, 2017)

Querying languages over sliding windows. - Moses Ganardi; Danny Hucke; Markus Lohrey (CoRR, 2017)

Approximation ratio of RePair. - Danny Hucke; Artur Jez; Markus Lohrey (CoRR, 2017)

Optimal top dag compression. - Markus Lohrey; Carl Philipp Reh; Kurt Sieber (CoRR, 2017)

Constructing small tree grammars and small circuits for formulas. - Moses Ganardi; Danny Hucke; Artur Jez; Markus Lohrey; Eric Noeth (J. Comput. Syst. Sci., 2017)

Path Checking for MTL and TPTL over Data Words. - Shiguang Feng; Markus Lohrey; Karin Quaas (Log. Methods Comput. Sci., 2017)

Satisfiability of ECTL∗ with Local Tree Constraints. - Claudia Carapelle; Shiguang Feng; Alexander Kartzow; Markus Lohrey (Theory Comput. Syst., 2017)

Processing Succinct Matrices and Vectors. - Markus Lohrey; Manfred Schmidt-Schauß (Theory Comput. Syst., 2017)

On Boolean Closed Full Trios and Rational Kripke Frames. - Georg Zetzsche; Dietrich Kuske; Markus Lohrey (Theory Comput. Syst., 2017)

Randomized Sliding Window Algorithms for Regular Languages. - Moses Ganardi; Danny Hucke; Markus Lohrey (ICALP, 2018)

Sliding Window Algorithms for Regular Languages. - Moses Ganardi; Danny Hucke; Markus Lohrey (LATA, 2018)

Average Case Analysis of Leaf-Centric Binary Tree Sources. - Louisa Seelbach Benkner; Markus Lohrey (MFCS, 2018)

Sliding Windows over Context-Free Languages. - Moses Ganardi; Artur Jez; Markus Lohrey (MFCS, 2018)

Knapsack in Hyperbolic Groups. - Markus Lohrey (RP, 2018)

Automata Theory on Sliding Windows. - Moses Ganardi; Danny Hucke; Daniel König; Markus Lohrey; Konstantinos Mamouras (STACS, 2018)

Knapsack Problems for Wreath Products. - Moses Ganardi; Daniel König; Markus Lohrey; Georg Zetzsche (STACS, 2018)

Tree Compression Using String Grammars. - Moses Ganardi; Danny Hucke; Markus Lohrey; Eric Noeth (Algorithmica, 2018)

Evaluation of Circuits Over Nilpotent and Polycyclic Groups. - Daniel König; Markus Lohrey (Algorithmica, 2018)

Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees. - Markus Lohrey; Sebastian Maneth; Carl Philipp Reh (Algorithmica, 2018)

Parallel identity testing for skew circuits with big powers and applications. - Daniel König; Markus Lohrey (Int. J. Algebra Comput., 2018)

The Complexity of Bisimulation and Simulation on Finite Systems. - Moses Ganardi; Stefan Göller; Markus Lohrey (Log. Methods Comput. Sci., 2018)

An architecture for online-diagnosis systems supporting compressed communication. - Seungbum Jo; Markus Lohrey; Damian Ludwig; Simon Meckel; Roman Obermaisser; Simon Plasger (Microprocess. Microsystems, 2018)

Knapsack in Graph Groups. - Markus Lohrey; Georg Zetzsche (Theory Comput. Syst., 2018)

Circuits and Expressions over Finite Semirings. - Moses Ganardi; Danny Hucke; Daniel König; Markus Lohrey (ACM Trans. Comput. Theory, 2018)

Derandomization for Sliding Window Algorithms with Strict Correctness. - Moses Ganardi; Danny Hucke; Markus Lohrey (CSR, 2019)

Sliding Window Property Testing for Regular Languages. - Moses Ganardi; Danny Hucke; Markus Lohrey; Tatiana Starikovskaya (ISAAC, 2019)

The Power Word Problem. - Markus Lohrey; Armin Weiß (MFCS, 2019)

Compressed Decision Problems in Hyperbolic Groups. - Derek F. Holt; Markus Lohrey; Saul Schleimer (STACS, 2019)

Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131). - Volker Diekert; Olga Kharlampovich; Markus Lohrey; Alexei G. Myasnikov (Dagstuhl Reports, 2019)

Size-optimal top dag compression. - Markus Lohrey; Carl Philipp Reh; Kurt Sieber (Inf. Process. Lett., 2019)

Universal Tree Source Coding Using Grammar-Based Compression. - Moses Ganardi; Danny Hucke; Markus Lohrey; Louisa Seelbach Benkner (IEEE Trans. Inf. Theory, 2019)

A Universal Tree Balancing Theorem. - Moses Ganardi; Markus Lohrey (ACM Trans. Comput. Theory, 2019)

Balancing Straight-Line Programs for Strings and Trees. - Markus Lohrey (CiE, 2020)

Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. - Laurent Bartholdi; Michael Figelius; Markus Lohrey; Armin Weiß (CCC, 2020)

The Complexity of Knapsack Problems in Wreath Products. - Michael Figelius; Moses Ganardi; Markus Lohrey; Georg Zetzsche (ICALP, 2020)

Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. - Markus Lohrey; Georg Zetzsche (MFCS, 2020)

A Comparison of Empirical Tree Entropies. - Danny Hucke; Markus Lohrey; Louisa Seelbach Benkner (SPIRE, 2020)

Combined compression of multiple correlated data streams for online-diagnosis systems. - Simon Meckel; Markus Lohrey; Seungbum Jo; Roman Obermaisser; Simon Plasger (Microprocess. Microsystems, 2020)

Grammar-Based Compression of Unranked Trees. - Adrià Gascón; Markus Lohrey; Sebastian Maneth; Carl Philipp Reh; Kurt Sieber (Theory Comput. Syst., 2020)

Compression Techniques in Group Theory. - Markus Lohrey (CiE, 2021)

Balancing Straight-line Programs. - Moses Ganardi; Artur Jez; Markus Lohrey (J. ACM, 2021)

Largest common prefix of a regular tree language. - Markus Lohrey; Sebastian Maneth (J. Comput. Syst. Sci., 2021)

Derandomization for Sliding Window Algorithms with Strict Correctness∗. - Moses Ganardi; Danny Hucke; Markus Lohrey (Theory Comput. Syst., 2021)

The Smallest Grammar Problem Revisited. - Hideo Bannai; Momoko Hirayama; Danny Hucke; Shunsuke Inenaga; Artur Jez; Markus Lohrey; Carl Philipp Reh (IEEE Trans. Inf. Theory, 2021)

Entropy Bounds for Grammar-Based Tree Compressors. - Danny Hucke; Markus Lohrey; Louisa Seelbach Benkner (IEEE Trans. Inf. Theory, 2021)

Low-Latency Sliding Window Algorithms for Formal Languages. - Moses Ganardi; Louis Jachiet; Markus Lohrey; Thomas Schwentick (FSTTCS, 2022)

Exponent Equations in HNN-extensions. - Michael Figelius; Markus Lohrey (ISSAC, 2022)

Streaming Word Problems. - Markus Lohrey; Lukas Lück (MFCS, 2022)

Membership Problems in Finite Groups. - Markus Lohrey; Andreas Rosowski; Georg Zetzsche (MFCS, 2022)

Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. - Laurent Bartholdi; Michael Figelius; Markus Lohrey; Armin Weiß (ACM Trans. Comput. Theory, 2022)

On the Complexity of Diameter and Related Problems in Permutation Groups. - Markus Lohrey; Andreas Rosowski (ICALP, 2023)

Knapsack and the power word problem in solvable Baumslag-Solitar groups. - Moses Ganardi; Markus Lohrey; Georg Zetzsche (Int. J. Algebra Comput., 2023)

Complexity of word problems for HNN-extensions. - Markus Lohrey (J. Comput. Syst. Sci., 2023)

Membership Problems in Infinite Groups. - Markus Lohrey (CiE, 2024)

Streaming in Graph Products. - Markus Lohrey; Julio Xochitemol (MFCS, 2024)

Enumeration for MSO-Queries on Compressed Trees. - Markus Lohrey; Markus L. Schmid (Proc. ACM Manag. Data, 2024)

The Power Word Problem in Graph Products. - Markus Lohrey; Florian Stober; Armin Weiß (Theory Comput. Syst., 2024)

Subgroup Membership in GL(2,Z). - Markus Lohrey (Theory Comput. Syst., 2024)

Finding Cycle Types in Permutation Groups with Few Generators. - Markus Lohrey; Andreas Rosowski (COCOON (2), 2025)

FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree. - Markus Lohrey; Sebastian Maneth; Markus L. Schmid (MFCS, 2025)

Regular Languages in the Sliding Window Model. - Moses Ganardi; Danny Hucke; Markus Lohrey; Konstantinos Mamouras; Tatiana Starikovskaya (TheoretiCS, 2025)

Streaming algorithms for products of probabilities. - Markus Lohrey; Leon Rische; Louisa Seelbach Benkner; Julio Xochitemol (CoRR, 2025)