Pages that link to "Item:Q1902700"
From MaRDI portal
The following pages link to Computer science today. Recent trends and developments (Q1902700):
Displayed 27 items.
- Structural equivalence and ET0L grammars (Q671426) (← links)
- A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system (Q702669) (← links)
- Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI (Q858297) (← links)
- A concurrent lambda calculus with futures (Q860851) (← links)
- A (restricted) quantifier elimination for security protocols (Q860909) (← links)
- Generalizations of 1-deterministic regular languages (Q948081) (← links)
- Interactive foundations of computing (Q1127523) (← links)
- The bulk-synchronous parallel random access machine (Q1128714) (← links)
- Linking information reconciliation and privacy amplification (Q1363071) (← links)
- 1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163) (← links)
- Global constraints for round robin tournament scheduling. (Q1417492) (← links)
- Some points in formal topology. (Q1427787) (← links)
- Reversible space equals deterministic space (Q1567403) (← links)
- Teleportation as a quantum computation. (Q1586918) (← links)
- Quantified computation tree logic (Q1603537) (← links)
- An overlapped two-way method for solving tridiagonal linear systems in a BSP computer (Q1763313) (← links)
- Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) (← links)
- Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
- Expressing the operations of quantum computing in multiparticle geometric algebra. (Q1966621) (← links)
- Knowledge-based proof planning (Q1978469) (← links)
- Complete axiomatization and decidability of alternating-time temporal logic (Q2368988) (← links)
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch (Q2427178) (← links)
- Subthreshold-seeking local search (Q2503338) (← links)
- Experiments with the “Oregon Trail Knapsack Problem” (Q2741262) (← links)
- Computing an irregularity strength of selected graphs (Q3439427) (← links)
- On Establishing and Fixing a Parallel Session Attack in a Security Protocol (Q3613472) (← links)
- Algebraic nets with flexible arcs (Q5958125) (← links)