default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 265 matches
- 2024
- Duncan Adamson
, Pamela Fleischmann, Annika Huch:
Rollercoasters with Plateaus. RP 2024: 73-87 - Ezio Bartocci:
Quantifying Uncertainty in Probabilistic Loops Without Sampling: A Fully Automated Approach. RP 2024: 3-8 - Andrea Benso, Flavio D'Alessandro, Paolo Papi:
Quantum Automata and Languages of Finite Index. RP 2024: 88-103 - Raphaël Berthon, Joost-Pieter Katoen, Tobias Winkler:
Markov Decision Processes with Sure Parity and Multiple Reachability Objectives. RP 2024: 203-220 - Florian Bruse, Martin Lange:
Computing All Minimal Ways to Reach a Context-Free Language. RP 2024: 38-53 - Johanne Cohen, Emmanuel Goutierre, Hayg Guler, Fatios Kapotos, Sida-Bastien Li, Michèle Sebag, Bowen Zhu:
Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution. RP 2024: 221-237 - Pierre Ganty, Nicolas Manini, Francesco Ranzato:
Computing Reachable Simulations on Transition Systems. RP 2024: 21-37 - Mika Hirvensalo, Akitoshi Kawamura, Igor Potapov, Takao Yuyama:
Reachability in Linear Recurrence Automata. RP 2024: 167-183 - Misaki Kojima, Naoki Nishida:
On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems Under Process Fairness. RP 2024: 54-70 - Antonín Kucera:
The Satisfiability and Validity Problems for Probabilistic CTL. RP 2024: 9-18 - Nikhil Pimpalkhare, Zachary Kincaid:
Semi-linear VASR for Over-Approximate Semi-linear Transition System Reachability. RP 2024: 154-166 - Gwendal Priser, Elena Vanneaux, Goran Frehse:
Robust Deterministic Abstractions for Supervising Discrete-Time Continuous Systems. RP 2024: 187-202 - Andrew Ryzhikov:
On Shortest Products for Nonnegative Matrix Mortality. RP 2024: 104-119 - Tristan Stérin, Damien Woods:
Hardness of Busy Beaver Value BB(15). RP 2024: 120-137 - Olga Tveretina:
On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps. RP 2024: 141-153 - Laura Kovács, Ana Sokolova:
Reachability Problems - 18th International Conference, RP 2024, Vienna, Austria, September 25-27, 2024, Proceedings. Lecture Notes in Computer Science 15050, Springer 2024, ISBN 978-3-031-72620-0 [contents] - 2023
- David Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse:
Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. RP 2023: 183-198 - Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin:
On the Identity and Group Problems for Complex Heisenberg Matrices. RP 2023: 42-55 - Stijn Bellis, Joachim Denil, Ramesh Krishnamurthy, Tim Leys, Guillermo A. Pérez, Ritam Raha:
A Framework for the Competitive Analysis of Model Predictive Controllers. RP 2023: 141-154 - Thomas Brihaye, Véronique Bruyère, Gaspard Reghem:
Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete. RP 2023: 70-84 - Thomas Brihaye, Aline Goeminne:
Multi-weighted Reachability Games. RP 2023: 85-97 - Alberto Casagrande, Carla Piazza:
Adaptive Directions for Bernstein-Based Polynomial Set Evolution. RP 2023: 113-126 - Angelo Ferrando, Giorgio Delzanno:
HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification. RP 2023: 171-182 - Alain Finkel, Serge Haddad, Lina Ye:
Introducing Divergence for Infinite Probabilistic Models. RP 2023: 127-140 - Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft:
Matching Patterns with Variables Under Simon's Congruence. RP 2023: 155-170 - Cinzia Di Giusto, Davide Ferré, Étienne Lozes, Nicolas Nisse:
Weakly Synchronous Systems with Three Machines Are Turing Powerful. RP 2023: 28-41 - Bruno Martin:
Randomness Quality and Trade-Offs for CA Random String Generators. RP 2023: 3-12 - Eike Neumann:
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions. RP 2023: 98-112 - Honglu Sun, Maxime Folschette, Morgan Magnin:
Reachability Analysis of a Class of Hybrid Gene Regulatory Networks. RP 2023: 56-69 - Adrian Wurm:
Complexity of Reachability Problems in Neural Networks. RP 2023: 15-27
skipping 235 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-11-25 21:51 CET from data curated 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:
