Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,782,490 papers from all fields of science
Search
Sign In
Create Free Account
Concurrent algorithm
In computer science, a concurrent algorithm is one that can be executed concurrently. Most standard computer algorithms are sequential algorithms…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
9 relations
Computer science
Concurrency (computer science)
Concurrency control
Distributed algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
A Scalable, Correct Time-Stamped Stack
Mike Dodds
,
Andreas Haas
,
C. Kirsch
POPL
2015
Corpus ID: 15464571
Concurrent data-structures, such as stacks, queues, and deques, often implicitly enforce a total order over elements in their…
Expand
2013
2013
Fast and scalable rendezvousing
Y. Afek
,
Michael Hakimi
,
Adam Morrison
Distributed Computing
2013
Corpus ID: 8348756
In an asymmetric rendezvous system, such as an unfair synchronous queue or an elimination array, threads of two types, consumers…
Expand
Highly Cited
2013
Highly Cited
2013
Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration
E. Contal
,
David Buffoni
,
Alexandre Robicquet
,
N. Vayatis
ECML/PKDD
2013
Corpus ID: 11436930
In this paper, we consider the challenge of maximizing an unknown function f for which evaluations are noisy and are acquired…
Expand
2012
2012
An Approach for the Blockmodeling in Multi-Relational Networks
A. Harrer
,
A. Schmidt
IEEE/ACM International Conference on Advances in…
2012
Corpus ID: 14011218
In this paper we introduce a direct approach for Block modeling in multi-relational networks inspired by the Pajek-Approach. In…
Expand
Highly Cited
2010
Highly Cited
2010
Abstraction for concurrent objects
Ivana Filipovic
,
P. O'Hearn
,
N. Rinetzky
,
Hongseok Yang
Theor. Comput. Sci.
2010
Corpus ID: 2561376
Highly Cited
2005
Highly Cited
2005
On interprocess communication
L. Lamport
Distributed Computing
2005
Corpus ID: 6111535
Interprocess communication is studied without assuming any lower-level communication primitives. Three classes of communication…
Expand
Highly Cited
2003
Highly Cited
2003
The Early Search for Tractable Ways of Reasoning about Programs
Cliff B. Jones
IEEE Ann. Hist. Comput.
2003
Corpus ID: 9236653
This article traces the history - up to around 1990 - of research on reasoning about programs. The main focus is on sequential…
Expand
1998
1998
Selection of the optimal prototype subset for 1-NN classification
U. Lipowezky
Pattern Recognit. Lett.
1998
Corpus ID: 19038688
1993
1993
Concurrent garbage collection of persistent heaps
S. Nettles
,
J. O'Toole
,
D. Gifford
1993
Corpus ID: 6713626
We describe the first concurrent compacting garbage collector for a persistent heap. Client threads read and write the heap in…
Expand
Highly Cited
1983
Highly Cited
1983
Termination of Probabilistic Concurrent Program
S. Hart
,
M. Sharir
,
A. Pnueli
TOPL
1983
Corpus ID: 263241
The asynchronous execution behavior of several concurrent processes, which may use randomization, is studied. Viewing each…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE