Search results
From MaRDI portal
- deduction and model checking into tableaux and algorithms for converse-PDL. 2003-01-14 Paper Rewriting of regular expressions and regular path queries 2002-09-12...10 bytes (19 words) - 16:23, 10 December 2023
- 2017-09-22 Paper Infinite-state invariant checking with IC3 and predicate abstraction 2017-07-26 Paper Satisfiability checking and symbolic computation 2017-06-21...10 bytes (17 words) - 10:34, 11 December 2023
- voting rules 2014-10-27 Paper SAT and Hybrid Models of the Car Sequencing Problem 2014-05-27 Paper Buffered Resource Constraint: Algorithms and Complexity...10 bytes (17 words) - 09:08, 9 December 2023
- mardi4nfdi.de/entity/Q3624016 2009-04-28 Paper Dynamic Path Reduction for Software Model Checking 2009-02-24 Paper Reveal: A Formal Verification Tool for...10 bytes (18 words) - 06:55, 13 December 2023
- Paper Exact methods for solving the elementary shortest and longest path problems 2017-03-03 Paper Derivative-Free Optimization: Lifting Single-Objective...10 bytes (16 words) - 22:30, 11 December 2023
- compression 2015-12-07 Paper A sieve algorithm for the shortest lattice vector problem 2015-02-27 Paper Oblivious RAMs without cryptogrpahic assumptions 2014-08-13...10 bytes (17 words) - 17:50, 12 December 2023
- Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path 2018-11-26 Paper Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation...10 bytes (17 words) - 05:05, 9 December 2023
- Paper The Bicycle Network Improvement Problem 2021-07-09 Paper Nutmeg: a MIP and CP hybrid solver using branch-and-check 2021-02-08 Paper Communication-Constrained...10 bytes (18 words) - 01:06, 10 December 2023
- Deciding the word problem for ground identities with commutative and extensional symbols 2022-11-09 Paper Deciding the word problem for ground and strongly...10 bytes (17 words) - 17:54, 11 December 2023
- de/entity/Q5743382 2019-05-10 Paper The minimum feasible tileset problem 2019-03-11 Paper Fast Hamiltonicity Checking Via Bases of Perfect Matchings 2018-12-06 Paper Point...10 bytes (16 words) - 14:05, 7 October 2023
- Simpler Self-reduction Algorithm for Matroid Path-Width 2018-06-25 Paper A New Perspective on FO Model Checking of Dense Graph Classes 2018-04-23 Paper https://portal...10 bytes (17 words) - 16:33, 8 December 2023
- 2007-09-11 Paper Multi-objective Model Checking of Markov Decision Processes 2007-09-03 Paper Adaptive Model Checking 2007-02-15 Paper Automata, Languages...10 bytes (17 words) - 23:51, 11 December 2023
- Paper On the Parikh Membership Problem for FAs, PDAs, and CMs 2014-03-31 Paper An NP-complete number-theoretic problem 2014-03-14 Paper HOW TO SYNCHRONIZE...10 bytes (19 words) - 19:26, 9 December 2023
- Paper https://portal.mardi4nfdi.de/entity/Q5144662 2021-01-19 Paper Model-Checking on Ordered Structures 2020-09-11 Paper https://portal.mardi4nfdi.de/entity/Q5198063...10 bytes (20 words) - 02:07, 11 December 2023
- Unknown Component Problem 2012-02-02 Paper https://portal.mardi4nfdi.de/entity/Q3081633 2011-03-09 Paper A hybrid feedback for a benchmark problem of idle speed...10 bytes (21 words) - 14:16, 28 January 2024
- systems with polynomial confluence problems 2017-07-12 Paper The HOM Problem is EXPTIME-Complete 2017-05-16 Paper The HOM Problem is EXPTIME-Complete 2016-08-16...10 bytes (16 words) - 11:32, 7 October 2023
- rewards 2018-12-06 Paper Model Checking Probabilistic Systems 2018-07-20 Paper Trade-off analysis meets probabilistic model checking 2018-04-23 Paper Weight monitoring...10 bytes (17 words) - 01:51, 9 December 2023
- Convexity of the free boundary for an axially symmetric rotational cavity flow problem 2023-03-23 Paper Order-fairness for Byzantine consensus 2022-12-07 Paper...10 bytes (16 words) - 15:55, 7 December 2023
- routing problems 2023-07-11 Paper An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem 2022-06-28 Paper Branch-and-check approaches...10 bytes (17 words) - 10:44, 11 December 2023
- a Hamiltonian path 2018-09-06 Paper Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path 2017-04-04 Paper Finding Paths in Grids with...10 bytes (16 words) - 17:59, 24 September 2023
