Computer science today. Recent trends and developments
From MaRDI portal
The articles of this volume will be reviewed individually within the Lecture Notes in Computer Science Database.
Cited in
(64)- Evaluating ASP and commercial solvers on the CSPLib
- Optimization, block designs and no free lunch theorems
- Interactive foundations of computing
- The bulk-synchronous parallel random access machine
- Linking information reconciliation and privacy amplification
- 1-optimality of static BSP computations: Scheduling independent chains as a case study.
- Global constraints for round robin tournament scheduling.
- Some points in formal topology.
- Reversible space equals deterministic space
- Teleportation as a quantum computation.
- Quantified computation tree logic
- Minimum multiplicity edge coloring via orientation
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- An overlapped two-way method for solving tridiagonal linear systems in a BSP computer
- Decidability of infinite-state timed CCP processes and first-order LTL
- Attribute grammars for unranked trees as a query language for structured documents
- Expressing the operations of quantum computing in multiparticle geometric algebra.
- Knowledge-based proof planning
- An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units
- Data meaning and knowledge discovery: semantical aspects of information systems
- Complete axiomatization and decidability of alternating-time temporal logic
- Model checking open systems with alternating projection temporal logic
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch
- Subthreshold-seeking local search
- Topological categories, quantaloids and Isbell adjunctions
- Experiments with the ``Oregon Trail knapsack problem
- I-serializability: generalized correctness for transaction-based environments
- Formal justification of underspecification for S5
- Truth versus information in logic programming
- Edge coloring: a natural model for sports scheduling
- ST-structures
- Computing an irregularity strength of selected graphs
- On Establishing and Fixing a Parallel Session Attack in a Security Protocol
- An investigation into two bin packing problems with ordering and orientation implications
- A survey of constraint-based programming paradigms
- Enumerated BSP Automata
- Budget-bounded model-checking pushdown systems
- Design for AJACS, yet another Java constraint programming framework
- A freeness and sharing analysis of logic programs based on a pre-interpretation
- Languages of higher-dimensional automata
- Methods for multi-objective optimization: an analysis
- The BG distributed simulation algorithm
- Hundreds of impossibility results for distributed computing
- Linear approximation of simple objects
- Algebraic nets with flexible arcs
- A completeness proof for a regular predicate logic with undefined truth value
- A compositional partial order semantics for Petri net components
- Flexibility in Algebraic Nets
- ESTL: A Temporal Logic for Events and States
- Parallel machine models: how they are and where are they going
- Consequence relations and data science: from Galois mappings to data interpretation
- Myhill-Nerode theorem for higher-dimensional automata
- A Nivat theorem for weighted alternating automata over commutative semirings
- Structural equivalence and ET0L grammars
- A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
- Reasoning about incompletely defined programs
- A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
- Improved edge-coloring with three colors
- A closer look at constraints as processes
- Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
- A concurrent lambda calculus with futures
- A (restricted) quantifier elimination for security protocols
- Chu connections and back diagonals between \(\mathcal{Q}\)-distributors
- Generalizations of 1-deterministic regular languages
This page was built for publication: Computer science today. Recent trends and developments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902700)
