English
Català
Čeština
Deutsch
Español
Français
Gàidhlig
Italiano
Latviešu
Magyar
Nederlands
Polski
Português
Português do Brasil
Suomi
Svenska
Türkçe
Қазақ
বাংলা
हिंदी
Ελληνικά
Yкраї́нська
Log In
Email address
Password
Log in
or
Log in with ORCID
New user? Click here to register.
Have you forgotten your password?
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
English
Català
Čeština
Deutsch
Español
Français
Gàidhlig
Italiano
Latviešu
Magyar
Nederlands
Polski
Português
Português do Brasil
Suomi
Svenska
Türkçe
Қазақ
বাংলা
हिंदी
Ελληνικά
Yкраї́нська
Log In
Email address
Password
Log in
or
Log in with ORCID
New user? Click here to register.
Have you forgotten your password?
Home
Indian Institute of Technology Madras
Publication14
A STATIC-TREE-BASED ALGORITHM FOR THE ANY ONE FROM ANY SUBSET OF A SET OF CRITICAL SECTIONS PROBLEM IN DISTRIBUTED COMPUTING SYSTEMS
Details
Export
Statistics
Options
Show all metadata (technical view)
A STATIC-TREE-BASED ALGORITHM FOR THE ANY ONE FROM ANY SUBSET OF A SET OF CRITICAL SECTIONS PROBLEM IN DISTRIBUTED COMPUTING SYSTEMS
Date Issued
1994
Author(s)
SATYANARAYANAN, R
MUTHUKRISHNAN, CR
DOI
10.1109/TENCON.1994.369336