Computer science today. Recent trends and developments

DOI10.1007/BFb0015232zbMath0875.00060OpenAlexW2475549902MaRDI QIDQ1902700

No author found.

Publication date: 22 November 1995

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0015232

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Related Items

I-serializability: generalized correctness for transaction-based environments, Formal justification of underspecification for S5, Complete axiomatization and decidability of alternating-time temporal logic, Improved edge-coloring with three colors, An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units, A closer look at constraints as processes, Topological categories, quantaloids and Isbell adjunctions, Edge coloring: a natural model for sports scheduling, Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI, ST-structures, Linking information reconciliation and privacy amplification, A concurrent lambda calculus with futures, A (restricted) quantifier elimination for security protocols, Languages of higher-dimensional automata, Truth versus information in logic programming, Minimum multiplicity edge coloring via orientation, Interactive foundations of computing, The bulk-synchronous parallel random access machine, Design for AJACS, yet another Java constraint programming framework1 1The authors would like to thank the anonymous referees for their constructive review of an earlier version of this article. Universidade de Évora, CENTRIA and FundaçLãTo da CiêCncia e Tecnologia (under contract PRAXIS P/EEI/10191/98 “OAR”) are acknowledged for their support of the work described herein., A completeness proof for a regular predicate logic with undefined truth value, 1-optimality of static BSP computations: Scheduling independent chains as a case study., Model checking open systems with alternating projection temporal logic, Chu connections and back diagonals between \(\mathcal{Q}\)-distributors, On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch, An investigation into two bin packing problems with ordering and orientation implications, Global constraints for round robin tournament scheduling., Linear approximation of simple objects, A survey of constraint-based programming paradigms, Some points in formal topology., Expressing the operations of quantum computing in multiparticle geometric algebra., The BG distributed simulation algorithm, Hundreds of impossibility results for distributed computing, An algorithm to find maximum area polygons circumscribed about a convex polygon, Budget-bounded model-checking pushdown systems, Knowledge-based proof planning, Structural equivalence and ET0L grammars, Generalizations of 1-deterministic regular languages, Experiments with the “Oregon Trail Knapsack Problem”, Methods for multi-objective optimization: an analysis, 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, A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system, Algebraic methods in the congested clique, Attribute grammars for unranked trees as a query language for structured documents, Subthreshold-seeking local search, Enumerated BSP Automata, Algebraic nets with flexible arcs, On Establishing and Fixing a Parallel Session Attack in a Security Protocol, Data meaning and knowledge discovery: semantical aspects of information systems, Evaluating ASP and commercial solvers on the CSPLib, Reversible space equals deterministic space, Optimization, block designs and no free lunch theorems, Teleportation as a quantum computation., Computing an irregularity strength of selected graphs, Quantified computation tree logic, A freeness and sharing analysis of logic programs based on a pre-interpretation