Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,190,170 papers from all fields of science
Search
Sign In
Create Free Account
Huang's algorithm
Huang's algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Shing-Tsaan Huang in 1989 in the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Algorithm
Dijkstra–Scholten algorithm
List of algorithms
Termination analysis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Ribozyme Evolution in an RNA-Mineral World
M. Popović
,
J. D. Stephenson
,
Palmer S. Fliss
,
T. Bristow
,
M. Ditzler
2017
Corpus ID: 22411148
Mineral surfaces can support several processes that likely play a role in the origin of life including the concentration…
Expand
2010
2010
The complete proof on the optimal ordering policy under cash discount and trade credit
Kun-Jen Chung
International Journal of Systems Science
2010
Corpus ID: 26923386
Huang ((2005), ‘Buyer's Optimal Ordering Policy and Payment Policy under Supplier Credit’, International Journal of Systems…
Expand
2010
2010
Erwartungskonformität als Gestaltungsmerkmal im Web
A. Auinger
,
Anna Maria Aistleithner
i-com
2010
Corpus ID: 38646116
Zusammenfassung Die benutzungsfreundliche Gestaltung von Webseiten trägt einen wesentlichen Teil zum Erfolg von Online-Auftritten…
Expand
2001
2001
On the Eeffect of Dhyana on the Humorous Style in Huang Tingjian's Poems
Y. Qiu
2001
Corpus ID: 192380925
The close relationship between Dhyana, Humor and poetry is well embodied in Huang Tingjian's poems. By taking advantage of…
Expand
1991
1991
A one-way array algorithm for matroid scheduling
Matthias F. Stallmann
ACM Symposium on Parallelism in Algorithms and…
1991
Corpus ID: 9662582
The greedy algorithm is a standard paradigm for solving matroid optimization problems on sequential computers. This paper…
Expand
1991
1991
A note on optimal multiway split trees
Lung-Tien Liu
,
Gen-Huey Chen
,
Yue-Li Wang
BIT
1991
Corpus ID: 5585370
Split trees are suitable data structures for storing records with different access frequencies. Under assumption that the access…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE