The following pages link to (Q3525697):
Displayed 44 items.
- Code optimization in FORM (Q312006) (← links)
- Improving multivariate Horner schemes with Monte Carlo tree search (Q340058) (← links)
- An extension of lazy abstraction with interpolation for programs with arrays (Q479820) (← links)
- Feynman integral evaluation by a sector decomposition approach (FIESTA) (Q603320) (← links)
- An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type (Q645734) (← links)
- Efficiency issues in the KBMAG procedure (Q649584) (← links)
- Explaining safety violations in real-time systems (Q832041) (← links)
- Optimizing the stack size of recursive functions (Q1749239) (← links)
- A higher-order strategy for eliminating common subexpressions (Q1749242) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- On the complexity of a linear ordering of weighted directed acyclic graphs (Q1980441) (← links)
- Certified abstract cost analysis (Q2044174) (← links)
- From regular expression matching to parsing (Q2089747) (← links)
- Optimizing reversible programs (Q2097435) (← links)
- Distinct fringe subtrees in random trees (Q2105315) (← links)
- Spot the difference: a detailed comparison between B and Event-B (Q2117587) (← links)
- Neural software vulnerability analysis using rich intermediate graph representations of programs (Q2123552) (← links)
- Regular numeral systems for data structures (Q2139186) (← links)
- Automatic synthesis of data-flow analyzers (Q2145353) (← links)
- Correct approximation of IEEE 754 floating-point arithmetic for program verification (Q2152274) (← links)
- Simplification of genetic programs: a literature survey (Q2172617) (← links)
- Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions (Q2186498) (← links)
- Systematic discovery of the grammar of translational inhibition by RNA hairpins (Q2199180) (← links)
- Some observations on LR-like parsing with delayed reduction (Q2380022) (← links)
- Model approach to grammatical evolution: theory and case study (Q2403418) (← links)
- New Developments in Parsing Mizar (Q2907343) (← links)
- GUBS a Language for Synthetic Biology: Specification and Compilation (Q2945531) (← links)
- Extension of Superblock Technique to Hyperblock Using Predicate Hierarchy Graph (Q3058920) (← links)
- (Q5020651) (← links)
- Property-oriented expansion (Q5030184) (← links)
- Generalized dominators for structured programs (Q5030185) (← links)
- From Regular Expression Matching to Parsing (Q5092434) (← links)
- EFFECTIVE TRANSLATION FOR LL(1)-GRAMMAR IN THE EXAMPLE OF A PROGRAMMING LANGUAGE (Q5151074) (← links)
- MINIMIZATION OF CONTEXT-FREE GRAMMARS (Q5151280) (← links)
- Compiling Janus to RSSA (Q5162601) (← links)
- Non-Self-Embedding Grammars and Descriptional Complexity (Q5164870) (← links)
- One-unambiguous regular languages (Q5906297) (← links)
- One-unambiguous regular languages (Q5906893) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Fast matching of regular patterns with synchronizing counting (Q6091207) (← links)
- Distributing and parallelizing non-canonical loops (Q6132484) (← links)
- Optimization of reversible control flow graphs (Q6148107) (← links)
- Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification (Q6160567) (← links)
- (Q6191008) (← links)