Pages that link to "Item:Q2942771"
From MaRDI portal
The following pages link to Advanced Information Systems Engineering (Q2942771):
Displaying 50 items.
- Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) (Q2942772) (← links)
- Generic Weakest Precondition Semantics from Monads Enriched with Order (Q2942773) (← links)
- Coalgebraic Multigames (Q2942774) (← links)
- How to Kill Epsilons with a Dagger (Q2942775) (← links)
- On Coalgebras with Internal Moves (Q2942776) (← links)
- A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logics (Q2942777) (← links)
- Coalgebraic Simulations and Congruences (Q2942779) (← links)
- Dijkstra Monads in Monadic Computation (Q2942780) (← links)
- Categories of Coalgebras with Monadic Homomorphisms (Q2942781) (← links)
- Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions (Q2942782) (← links)
- Canonical Nondeterministic Automata (Q2942783) (← links)
- Towards Systematic Construction of Temporal Logics for Dynamical Systems via Coalgebra (Q2942784) (← links)
- Algebraic–Coalgebraic Recursion Theory of History-Dependent Dynamical System Models (Q2942785) (← links)
- Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case (Q3190060) (← links)
- About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length (Q3190061) (← links)
- Binary Pictures with Excluded Patterns (Q3190062) (← links)
- 2D Topological Map Isomorphism for Multi-Label Simple Transformation Definition (Q3190063) (← links)
- Isthmus-Based Parallel and Asymmetric 3D Thinning Algorithms (Q3190064) (← links)
- Completions and Simple Homotopy (Q3190065) (← links)
- 2D Subquadratic Separable Distance Transformation for Path-Based Norms (Q3190066) (← links)
- Anti-Aliased Euclidean Distance Transform on 3D Sampling Lattices (Q3190067) (← links)
- Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search (Q3190068) (← links)
- The Minimum Barrier Distance – Stability to Seed Point Position (Q3190069) (← links)
- Efficient Computation of the Outer Hull of a Discrete Path (Q3190071) (← links)
- Voronoi-Based Geometry Estimator for 3D Digital Surfaces (Q3190073) (← links)
- Parameter-Free and Multigrid Convergent Digital Curvature Estimators (Q3190076) (← links)
- Freeman Digitization and Tangent Word Based Estimators (Q3190077) (← links)
- Determination of Length and Width of a Line-Segment by Using a Hough Transform (Q3190078) (← links)
- Stable Shape Comparison of Surfaces via Reeb Graphs (Q3190079) (← links)
- About Multigrid Convergence of Some Length Estimators (Q3190080) (← links)
- Non-additive Bounded Sets of Uniqueness in ℤ n (Q3190081) (← links)
- Back-Projection Filtration Inversion of Discrete Projections (Q3190083) (← links)
- Discrete Tomography Reconstruction Algorithms for Images with a Blocking Component (Q3190084) (← links)
- An Entropic Perturbation Approach to TV-Minimization for Limited-Data Tomography (Q3190087) (← links)
- Fourier Inversion of the Mojette Transform (Q3190088) (← links)
- Uniqueness Regions under Sets of Generic Projections in Discrete Tomography (Q3190089) (← links)
- Adaptive Grid Refinement for Discrete Tomography (Q3190090) (← links)
- Exact Evaluation of Stochastic Watersheds: From Trees to General Graphs (Q3190091) (← links)
- On Making nD Images Well-Composed by a Self-dual Local Interpolation (Q3190092) (← links)
- Implicit Digital Surfaces in Arbitrary Dimensions (Q3190093) (← links)
- Digital Geometry from a Geometric Algebra Perspective (Q3190096) (← links)
- Segmentation of 3D Articulated Components by Slice-Based Vertex-Weighted Reeb Graph (Q3190097) (← links)
- Taylor Optimal Kernel for Derivative Etimation (Q3190098) (← links)
- On Finding Spherical Geodesic Paths and Circles in ℤ3 (Q3190099) (← links)
- Discrete Curve Evolution on Arbitrary Triangulated 3D Mesh (Q3190103) (← links)
- Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults (Q3190146) (← links)
- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs (Q3190147) (← links)
- The Shortest Path Game: Complexity and Algorithms (Q3190149) (← links)
- Online Scheduling of Unit Length Jobs with Commitment and Penalties (Q3190150) (← links)
- The Lazy Matroid Problem (Q3190151) (← links)
