The following pages link to Alberto Policriti (Q626877):
Displaying 50 items.
- Hybrid dynamics of stochastic \(\pi \)-calculus (Q626878) (← links)
- LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
- Is hyper-extensionality preservable under deletions of graph elements? (Q737091) (← links)
- Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability (Q810494) (← links)
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (Q843992) (← links)
- Modeling biological systems in stochastic concurrent constraint programming (Q941672) (← links)
- Hybrid dynamics of stochastic programs (Q969181) (← links)
- Inclusion dynamics hybrid automata (Q999262) (← links)
- Complementation in the lattice of equivalence relations (Q1126181) (← links)
- \(T\)-resolution: Refinements and model elimination (Q1284706) (← links)
- Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case (Q1290508) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- (Q1431341) (redirect page) (← links)
- From bisimulation to simulation: Coarsest partition problems (Q1431342) (← links)
- Modal deduction in second-order logic and set theory. II (Q1577355) (← links)
- Alternative translation techniques for propositional and first-order modal logics (Q1610677) (← links)
- A randomized numerical aligner (rNA) (Q1757842) (← links)
- The automation of syllogistic. II: Optimization and complexity issues (Q1813824) (← links)
- Decidability results for metric and layered temporal logics (Q1815429) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Three-variable statements of set-pairing (Q1885036) (← links)
- A set-theoretic translation method for polymodal logics (Q1904398) (← links)
- \(T\)-theorem proving. I (Q1914165) (← links)
- Counting extensional acyclic digraphs (Q1944136) (← links)
- Adding the power-set to description logics (Q1989328) (← links)
- Wheeler languages (Q2051845) (← links)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
- Extending \(\mathcal{ALC}\) with the power-set construct (Q2296722) (← links)
- Symbolic graphs: Linear solutions to connectivity related problems (Q2471809) (← links)
- Ordering regular languages and automata: complexity (Q2686107) (← links)
- (Q2721208) (← links)
- (Q2740887) (← links)
- Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform (Q2799209) (← links)
- (Hybrid) automata and (stochastic) programs * The hybrid automata lattice of a stochastic program (Q2843996) (← links)
- Well-quasi-ordering hereditarily finite sets (Q2855754) (← links)
- Stochastic Concurrent Constraint Programming and Differential Equations (Q2870282) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability (Q2915897) (← links)
- Markov chain algorithms for generating sets uniformly at random (Q2925425) (← links)
- Hashing and Indexing: Succinct DataStructures and Smoothed Analysis (Q2942624) (← links)
- Set-syllogistics meet combinatorics (Q2971068) (← links)
- (Q3002402) (← links)
- Well-Quasi-Ordering Hereditarily Finite Sets (Q3004603) (← links)
- Extending Kamp's Theorem to Model Time Granularity (Q3146305) (← links)
- (Q3172128) (← links)
- Mapping Sets and Hypersets into Numbers (Q3187011) (← links)
- Banishing Ultrafilters from Our Consciousness (Q3305324) (← links)
- Rank and simulation: the well-founded case (Q3458888) (← links)
- Note on "The Logically Simplest Form of the Infinity Axiom" (Q3469099) (← links)
- (Q3489978) (← links)
- A Randomized Numerical Aligner (rNA) (Q3564890) (← links)
