Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Concurrency (computer science)

Known as: Concurrency, Concurrency theory, Concurrent system 
In computer science, concurrency is the decomposability property of a program, algorithm, or problem into order-independent or partially-ordered… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Deep Neural Networks (DNNs) are becoming an important tool in modern computing applications. Accelerating their training is a… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Review
2018
Review
2018
Background: Intimate partner violence (IPV) and HIV are important and interconnected public health concerns. While it is… Expand
Is this relevant?
Review
2017
Review
2017
The Benders decomposition algorithm has been successfully applied to a wide range of difficult optimization problems. This paper… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Abstract Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a general framework for unifying a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A concurrent object is a data object shared by concurrent processes. Linearizability is a correctness condition for concurrent… Expand
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
  • Robin Milner
  • PHI Series in computer science
  • 1989
  • Corpus ID: 36788371
Foreword. 1. Modelling Communication. 2. Basic Definitions. 3. Equational laws and Their Application. 4. Strong Bisimulation and… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Groupware systems are computer-based systems that support two or more users engaged in a common task, and that provide an… Expand
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot… Expand
  • table 1
Is this relevant?
Highly Cited
1981
Highly Cited
1981
  • David S. Park
  • Theoretical Computer Science
  • 1981
  • Corpus ID: 206841958
The paper is concerned with ways in which fair concurrency can be modeled using notations for omega-regular languages - languages… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In… Expand
Is this relevant?