default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Bruse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Florian Bruse, Martin Lange:
Model checking timed recursive CTL. Inf. Comput. 298: 105168 (2024)- [j6]Florian Bruse, Maurice Herwig, Martin Lange:
Weights of formal languages based on geometric series with an application to automatic grading. Theor. Comput. Sci. 983: 114295 (2024) - [c20]Marco Sälzer
, Eric Alsmann, Florian Bruse, Martin Lange:
Verifying and Interpreting Neural Networks Using Finite Automata. DLT 2024: 266-281 - [c19]Florian Bruse, Martin Lange:
Computing All Minimal Ways to Reach a Context-Free Language. RP 2024: 38-53 - [c18]Eric Alsmann, Florian Bruse:
Real-Time Higher-Order Recursion Schemes. TIME 2024: 16:1-16:20 - 2023
- [j5]Florian Bruse, Martin Lange:
The tail-recursive fragment of timed recursive CTL. Inf. Comput. 294: 105084 (2023) - [c17]Florian Bruse, Martin Lange, Sören Möller:
Formal Reasoning About Influence in Natural Sciences Experiments. CADE 2023: 153-169 - [c16]Florian Bruse, Marit Kastaun, Martin Lange, Sören Möller:
The Calculus of Temporal Influence. TIME 2023: 10:1-10:19 - [e1]Alexander Artikis, Florian Bruse, Luke Hunsberger:
30th International Symposium on Temporal Representation and Reasoning, TIME 2023, September 25-26, 2023, NCSR Demokritos, Athens, Greece. LIPIcs 278, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-298-3 [contents] - 2022
- [j4]Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer:
Local higher-order fixpoint iteration. Inf. Comput. 289(Part): 104963 (2022) - [c15]Florian Bruse, Martin Lange, Étienne Lozes:
The Tail-Recursive Fragment of Timed Recursive CTL. TIME 2022: 5:1-5:16 - [c14]Florian Bruse, Maurice Herwig, Martin Lange:
A Similarity Measure for Formal Languages Based on Convergent Geometric Series. CIAA 2022: 80-92 - [c13]Florian Bruse, David Kronenberger, Martin Lange:
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes. GandALF 2022: 17-33 - [i2]Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange:
Verifying And Interpreting Neural Networks using Finite Automata. CoRR abs/2211.01022 (2022) - 2021
- [j3]Florian Bruse, Martin Lange, Étienne Lozes:
The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic. Fundam. Informaticae 178(1-2): 1-30 (2021) - [j2]Florian Bruse, Martin Lange:
Temporal logic with recursion. Inf. Comput. 281: 104804 (2021) - [c12]Florian Bruse, Martin Lange:
A Decidable Non-Regular Modal Fixpoint Logic. CONCUR 2021: 23:1-23:18 - [c11]Florian Bruse, Marco Sälzer, Martin Lange:
Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. MFCS 2021: 24:1-24:19 - [c10]Florian Bruse, Martin Lange:
Model Checking Timed Recursive CTL. TIME 2021: 12:1-12:14 - [c9]Eric Alsmann, Florian Bruse, Martin Lange:
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics. EXPRESS/SOS 2021: 10-26 - 2020
- [b1]Florian Bruse:
Extremal fixpoints for higher-order modal logic. University of Kassel, Germany, 2020 - [c8]Florian Bruse, Martin Lange:
Temporal Logic with Recursion. TIME 2020: 6:1-6:14 - [c7]Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer:
Local Higher-Order Fixpoint Iteration. GandALF 2020: 97-113
2010 – 2019
- 2017
- [c6]Naoki Kobayashi, Étienne Lozes, Florian Bruse:
On the relationship between higher-order recursion schemes and higher-order fixpoint logic. POPL 2017: 246-259 - [c5]Florian Bruse, Martin Lange, Étienne Lozes:
Space-Efficient Fragments of Higher-Order Fixpoint Logic. RP 2017: 26-41 - 2016
- [c4]Florian Bruse:
Alternation Is Strict For Higher-Order Modal Fixpoint Logic. GandALF 2016: 105-119 - [c3]Florian Bruse, Daniel Kernberger, Martin Lange:
A Canonical Model Construction for Iteration-Free PDL with Intersection. GandALF 2016: 120-134 - 2015
- [j1]Florian Bruse, Oliver Friedmann, Martin Lange:
On guarded transformation in the modal μ-calculus. Log. J. IGPL 23(2): 194-216 (2015) - 2014
- [c2]Florian Bruse:
Alternating Parity Krivine Automata. MFCS (1) 2014: 111-122 - [c1]Florian Bruse, Michael Falk, Martin Lange:
The Fixpoint-Iteration Algorithm for Parity Games. GandALF 2014: 116-130 - 2013
- [i1]Florian Bruse, Oliver Friedmann, Martin Lange:
Guarded Transformation for the Modal mu-Calculus. CoRR abs/1305.0648 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
