A SEPARATOR THEOREM FOR HYPERGRAPHS AND A CSP-SAT ALGORITHM.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:17)2021
- By:
- Publication type:
- Article
Works matching IS 18605974 AND DT 2021 AND VI 17 AND IP 4
Results: 26
1
2
STASHING AND PARALLELIZATION PENTAGONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:20)2021
- By:
- Publication type:
- Article
3
PARAMETRICITY FOR PRIMITIVE NESTED TYPES AND GADTS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:23)2021
- By:
- Publication type:
- Article
4
TIME-FLUID FIELD-BASED COORDINATION THROUGH PROGRAMMABLE DISTRIBUTED SCHEDULERS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:13)2021
- By:
- Publication type:
- Article
5
A NEW OPERATIONAL REPRESENTATION OF DEPENDENCIES IN EVENT STRUCTURES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:16)2021
- By:
- Publication type:
- Article
6
A PROBABILISTIC HIGHER-ORDER FIXPOINT LOGIC.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:15)2021
- By:
- Publication type:
- Article
7
A theory of transaction parallelism in blockchains.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:10)2021
- By:
- Publication type:
- Article
8
ADAPTIVE NON-LINEAR PATTERN MATCHING AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:21)2021
- By:
- Publication type:
- Article
9
EFFICIENT FULL HIGHER-ORDER UNIFICATION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:18)2021
- By:
- Publication type:
- Article
10
TIGHT POLYNOMIAL BOUNDS FOR LOOP PROGRAMS IN POLYNOMIAL SPACE.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:7)2021
- By:
- Publication type:
- Article
11
QUADRATIC WORD EQUATIONS WITH LENGTH CONSTRAINTS, COUNTER SYSTEMS, AND PRESBURGER ARITHMETIC WITH DIVISIBILITY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:4)2021
- By:
- Publication type:
- Article
12
EXPRESSIVE LOGICS FOR COINDUCTIVE PREDICATES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:19)2021
- By:
- Publication type:
- Article
13
PROBABILISTIC TIMED AUTOMATA WITH ONE CLOCK AND INITIALISED CLOCK-DEPENDENT PROBABILITIES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:6)2021
- By:
- Publication type:
- Article
14
FOUNDATIONS OF REGULAR COINDUCTION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:2)2021
- By:
- Publication type:
- Article
15
INTERNAL PARAMETRICITY FOR CUBICAL TYPE THEORY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:5)2021
- By:
- Publication type:
- Article
16
ON SUPERGRAPHS SATISFYING CMSO PROPERTIES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:14)2021
- By:
- Publication type:
- Article
17
CONTROLLING A RANDOM POPULATION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:12)2021
- By:
- Publication type:
- Article
18
DYNAMIC COMPLEXITY OF PARITY EXISTS QUERIES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:9)2021
- By:
- Publication type:
- Article
19
ARCHITECTURES IN PARAMETRIC COMPONENT-BASED SYSTEMS: QUALITATIVE AND QUANTITATIVE MODELLING.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:26)2021
- By:
- Publication type:
- Article
20
AN APPLICATION OF PARALLEL CUT ELIMINATION IN MULTIPLICATIVE LINEAR LOGIC TO THE TAYLOR EXPANSION OF PROOF NETS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:22)2021
- By:
- Publication type:
- Article
21
A COALGEBRAIC TAKE ON REGULAR AND ω-REGULAR BEHAVIOURS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:24)2021
- By:
- Publication type:
- Article
22
DAGGER LINEAR LOGIC FOR CATEGORICAL QUANTUM MECHANICS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:8)2021
- By:
- Publication type:
- Article
23
EXTENSIONAL AND INTENSIONAL MODELS FOR BOUNDED AND UNBOUNDED NONDETERMINISM.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:11)2021
- By:
- Publication type:
- Article
24
CAUSAL CONSISTENCY FOR REVERSIBLE MULTIPARTY PROTOCOLS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:1)2021
- By:
- Publication type:
- Article
25
ON HIGHER-ORDER PROBABILISTIC SUBRECURSION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:25)2021
- By:
- Publication type:
- Article
26
MODAL FUNCTIONAL (\DIALECTICA") INTERPRETATION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 4, p. 1, doi. 10.46298/LMCS-17(4:3)2021
- By:
- Publication type:
- Article