Costas Busch
Applied Filters
- Costas Busch
- AuthorRemove filter
People
Colleagues
- Costas Busch (93)
- Gokarna Sharma (36)
- M. Herlihy (17)
- Marios Mavronicolas (16)
- Malik Magdon-Ismail (12)
- Miroslav V Popović (7)
- Srikanta N. Tirthapura (7)
- Supratik Mukhopadhyay (6)
- Hari Krishnan (5)
- Srivathsan Srinivasagopalan (5)
- Dariusz Rafal Kowalski (4)
- Rajgopal Kannan (4)
- Steven R Brandt (4)
- Bogdan S Chlebus (3)
- Jerry Lee Trahan (3)
- Jing Xi (3)
- P Spirakis (3)
- Pavan Poudel (3)
- Ramachandran Vaidyanathan (3)
- Roger P Wattenhofer (3)
Roles
Publication
Journal/Magazine Names
- Theoretical Computer Science (7)
- Algorithmica (4)
- Distributed Computing (4)
- IEEE Transactions on Computers (3)
- ACM SIGPLAN Notices (2)
- Journal of Parallel and Distributed Computing (2)
- SIAM Journal on Computing (2)
- Theory of Computing Systems (2)
- ACM SIGACT News (1)
- ACM Transactions on Autonomous and Adaptive Systems (1)
- Computational Geometry: Theory and Applications (1)
- Digital Signal Processing (1)
- IEEE Transactions on Circuits and Systems for Video Technology (1)
- Information and Computation (1)
- Information Processing Letters (1)
- Journal of the ACM (1)
Proceedings/Book Names
- PODC '94: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing (2)
- SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (2)
- SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (2)
- Algorithms and Complexity (1)
- Blockchain – ICBC 2019 (1)
- EC '18: Proceedings of the 2018 ACM Conference on Economics and Computation (1)
- ICDCN '18: Proceedings of the 19th International Conference on Distributed Computing and Networking (1)
- ISMM '14: Proceedings of the 2014 international symposium on Memory management (1)
- ISMM 2018: Proceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management (1)
- Networked Systems (1)
- PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (1)
- PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (1)
- PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (1)
- PODC '95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing (1)
- PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing (1)
- SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures (1)
- SPAA '99: Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures (1)
- Stabilization, Safety, and Security of Distributed Systems (1)
- Structural Information and Communication Complexity (1)
- Structural Information and Communication Complexity (1)
Publisher
- Springer-Verlag (30)
- Association for Computing Machinery (28)
- IEEE Computer Society (13)
- Elsevier Science Publishers Ltd. (7)
- Academic Press, Inc. (4)
- IEEE Press (4)
- Society for Industrial and Applied Mathematics (3)
- Brown University (1)
- Elsevier North-Holland, Inc. (1)
- Elsevier Science Publishers B. V. (1)
- ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOpen AccessPublished By ACMPublished By ACM
Stable Blockchain Sharding under Adversarial Transaction Generation
- Ramesh Adhikari
School of Computer & Cyber Sciences, Augusta University, Augusta, Georgia, USA
, - Costas Busch
School of Computer & Cyber Sciences, Augusta University, Augusta, Georgia, USA
, - Dariusz R. Kowalski
School of Computer & Cyber Sciences, Augusta University, Augusta, Georgia, USA
SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures•June 2024, pp 451-461• https://doi.org/10.1145/3626183.3659970Sharding is used to improve the scalability and performance of blockchain systems. We investigate the stability of blockchain sharding, where transactions are continuously generated by an adversarial model. The system consists of n processing nodes that ...
- 1Citation
- 296
- Downloads
MetricsTotal Citations1Total Downloads296Last 12 Months296Last 6 weeks68
- Ramesh Adhikari
- research-articleOpen AccessPublished By ACMPublished By ACM
Sparse Spanners with Small Distance and Congestion Stretches
- Costas Busch
School of Computer & Cyber Sciences, Augusta University, Augusta, Georgia, USA
, - Dariusz R. Kowalski
School of Computer & Cyber Sciences, Augusta University, Augusta, Georgia, USA
, - Peter Robinson
School of Computer & Cyber Sciences, Augusta University, Augusta, Georgia, USA
SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures•June 2024, pp 383-393• https://doi.org/10.1145/3626183.3659954Given a graph G, a classical problem in graph theory is the construction of a spanner H -- a sparse subgraph of G that closely approximates the distances between nodes in G. The distance stretch~α of H is the factor of how much the distances in H ...
- 0Citation
- 113
- Downloads
MetricsTotal Citations0Total Downloads113Last 12 Months113Last 6 weeks23
- Costas Busch
- Article
Locally Balanced Allocations Under Strong Byzantine Influence
- Costas Busch
https://ror.org/012mef835School of Computer and Cyber Sciences, Augusta University, Augusta, USA
, - Paweł Garncarek
Institute of Computer Science, University of Wrocław, Wrocław, Poland
, - Dariusz R. Kowalski
https://ror.org/012mef835School of Computer and Cyber Sciences, Augusta University, Augusta, USA
Structural Information and Communication Complexity•May 2024, pp 262-280• https://doi.org/10.1007/978-3-031-60603-8_15AbstractThe Power of Two Choices (PoTC) is a commonly used technique to balance the incoming load (balls) into available resources (bins) – for each coming ball, two bins are selected uniformly at random and the one with smaller number of balls is chosen ...
- 0Citation
MetricsTotal Citations0
- Costas Busch
- research-article
Flexible scheduling of transactional memory on trees
- Costas Busch
Augusta University, Augusta, GA, USA
, - Bogdan S. Chlebus
Augusta University, Augusta, GA, USA
, - Maurice Herlihy
Brown University, Providence, RI, USA
, - Miroslav Popovic
University of Novi Sad, Novi Sad, Serbia
, - Pavan Poudel
ATGWORK, Norcross, GA, USA
, - Gokarna Sharma
Kent State University, Kent, OH, USA
Theoretical Computer Science, Volume 978, Issue C•Nov 2023 • https://doi.org/10.1016/j.tcs.2023.114184AbstractWe study the efficiency of executing transactions in a distributed transactional memory system. The system is modeled as a static network with the topology of a tree. Contrary to previous approaches, we allow the flexibility for both transactions ...
Highlights- Studies transaction scheduling problem on Trees in the dual-flow model.
- Allows flexibility for moving both transactions and objects during execution.
- SINGLE-OBJECT algorithm provides optimal communication cost when all transactions ...
- 0Citation
MetricsTotal Citations0
- Costas Busch
- Article
Stable Scheduling in Transactional Memory
- Costas Busch
Augusta University, Augusta, GA, USA
, - Bogdan S. Chlebus
Augusta University, Augusta, GA, USA
, - Dariusz R. Kowalski
Augusta University, Augusta, GA, USA
, - Pavan Poudel
ATGWORK, Norcross, GA, USA
AbstractWe study computer systems with transactions executed on a set of shared objects. Transactions arrive continually subjects to constrains that are framed as an adversarial model and impose limits on the average rate of transaction generation and the ...
- 0Citation
MetricsTotal Citations0
- Costas Busch
- Article
Lockless Blockchain Sharding with Multiversion Control
- Ramesh Adhikari
Augusta University, 30912, Augusta, GA, USA
, - Costas Busch
Augusta University, 30912, Augusta, GA, USA
Structural Information and Communication Complexity•June 2023, pp 112-131• https://doi.org/10.1007/978-3-031-32733-9_6AbstractSharding is used to address the performance and scalability issues of the blockchain protocols, which divides the overall transaction processing costs among multiple clusters of nodes. Shards require less storage capacity and communication and ...
- 0Citation
MetricsTotal Citations0
- Ramesh Adhikari
- Article
Flexible Scheduling of Transactional Memory on Trees
- Costas Busch
Augusta University, Augusta, GA, USA
, - Bogdan S. Chlebus
Augusta University, Augusta, GA, USA
, - Maurice Herlihy
Brown University, Providence, RI, USA
, - Miroslav Popovic
University of Novi Sad, Novi Sad, Serbia
, - Pavan Poudel
Augusta University, Augusta, GA, USA
, - Gokarna Sharma
Kent State University, Kent, OH, USA
Stabilization, Safety, and Security of Distributed Systems•November 2022, pp 146-163• https://doi.org/10.1007/978-3-031-21017-4_10AbstractWe study the efficiency of executing transactions in a distributed transactional memory system. The system is modeled as a wired network with the topology of a tree. Contrary to previous approaches, we allow the flexibility for both transactions ...
- 0Citation
MetricsTotal Citations0
- Costas Busch
- research-article
Load balanced distributed directories
- Shishir Rai
Department of Computer Science, Kent State University, Kent, OH, USA
, - Gokarna Sharma
Department of Computer Science, Kent State University, Kent, OH, USA
, - Costas Busch
School of Computer and Cyber Sciences, Augusta University, Augusta, GA, USA
, - Maurice Herlihy
Department of Computer Science, Brown University, Providence, RI, USA
Information and Computation, Volume 285, Issue PA•May 2022 • https://doi.org/10.1016/j.ic.2021.104700AbstractWe present LB-Spiral, a novel distributed directory protocol for shared objects, suitable for large-scale distributed shared memory systems. Each shared object has an owner node that can modify its value. The ownership may change by ...
- 1Citation
MetricsTotal Citations1
- Shishir Rai
- research-article
Dynamic scheduling in distributed transactional memory
- Costas Busch
Augusta University, Augusta, GA, USA
, - Maurice Herlihy
Brown University, Providence, RI, USA
, - Miroslav Popovic
University of Novi Sad, Novi Sad, Serbia
, - Gokarna Sharma
Kent State University, Kent, OH, USA
Distributed Computing, Volume 35, Issue 1•Feb 2022, pp 19-36 • https://doi.org/10.1007/s00446-021-00410-wAbstractWe investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the objects it needs, executes once those ...
- 2Citation
MetricsTotal Citations2
- Costas Busch
- keynotePublished By ACMPublished By ACM
Scheduling Problems in Distributed Transactional Memory
- Costas Busch
Augusta University, USA
ECBS 2021: 7th Conference on the Engineering of Computer Based Systems•May 2021, Article No.: 2, pp 1-2• https://doi.org/10.1145/3459960.3461560Transactional memory is a prominent synchronization mechanism for shared memory multiprocessors. Access to critical sections of programs is accomplished with atomic transactions of memory accesses. The transactions are inherently deadlock-free and ...
- 0Citation
- 32
- Downloads
MetricsTotal Citations0Total Downloads32Last 12 Months2
- Costas Busch
- research-articlePublic Access
Fast Scheduling in Distributed Transactional Memory
- Costas Busch
Augusta University, Augusta, GA, USA
, - Maurice Herlihy
Brown University, Providence, RI, USA
, - Miroslav Popovic
University of Novi Sad, Novi Sad, Serbia
, - Gokarna Sharma
Kent State University, Kent, OH, USA
Theory of Computing Systems, Volume 65, Issue 2•Feb 2021, pp 296-322 • https://doi.org/10.1007/s00224-020-10008-7AbstractWe investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the objects it needs, executes once those ...
- 2Citation
MetricsTotal Citations2
- Costas Busch
- research-article
Efficient Recoverable Cryptographic Mosaic Technique by Permutations
- Elaine Y.-N. Sun
Department of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan
, - Hsiao-Chun Wu
School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA, USA
, - Costas Busch
School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA, USA
, - Scott C.-H. Huang
Department of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan
, - Yen-Cheng Kuan
International College of Semiconductor Technology, National Chiao Tung University, Hsinchu, Taiwan
, - Shih Yu Chang
Department of Computer Engineering, San Jose State University, San Jose, CA, USA
IEEE Transactions on Circuits and Systems for Video Technology, Volume 31, Issue 1•Jan. 2021, pp 112-125 • https://doi.org/10.1109/TCSVT.2020.2976050Mosaic is a popular approach to provide privacy of data and image. However, the existing demosaicing techniques cannot accomplish efficient perfect-reconstruction. If the receiver wants to recover the original image, the extra transmission of the original ...
- 1Citation
MetricsTotal Citations1
- Elaine Y.-N. Sun
- research-article
Graph representation of random signal and its application for sparse signal detection
- Kun Yan
National & Local Joint Engineering Research Center of Satellite Navigation Positioning and Location Service, Guilin University of Electronic Technology, Guilin, Guangxi, 541004, China
, - Hsiao-Chun Wu
School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA 70803, USA
, - Costas Busch
School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA 70803, USA
, - Xiangli Zhang
National & Local Joint Engineering Research Center of Satellite Navigation Positioning and Location Service, Guilin University of Electronic Technology, Guilin, Guangxi, 541004, China
AbstractIn this paper, a novel graph-based adequate and concise signal representation paradigm is explored. Amplitudes of a signal can be quantized first. Then the quantization levels and transitions among these levels can be specified as ...
- 1Citation
MetricsTotal Citations1
- Kun Yan
- Article
An Experimental Evaluation of BFT Protocols for Blockchains
- Mohammad M. Jalalzai
Department of Computer Science, Louisiana State University, Baton Rouge, USA
Center for Computation and Technology, Louisiana State University, Baton Rouge, USA
, - Golden Richard
Department of Computer Science, Louisiana State University, Baton Rouge, USA
Center for Computation and Technology, Louisiana State University, Baton Rouge, USA
, - Costas Busch
Department of Computer Science, Louisiana State University, Baton Rouge, USA
AbstractByzantine Fault Tolerant (BFT) protocols have been used in blockchains due to their high performance and fast block acceptance. However, their weakness is a lack of scalability to support a large number of nodes in the network due to message ...
- 0Citation
MetricsTotal Citations0
- Mohammad M. Jalalzai
- Article
CUDA-DTM: Distributed Transactional Memory for GPU Clusters
- Samuel Irving
Louisiana State University, 70803, Baton Rouge, LA, USA
, - Sui Chen
Louisiana State University, 70803, Baton Rouge, LA, USA
, - Lu Peng
Louisiana State University, 70803, Baton Rouge, LA, USA
, - Costas Busch
Louisiana State University, 70803, Baton Rouge, LA, USA
, - Maurice Herlihy
Brown University, 02912, Providence, RI, USA
, - Christopher J. Michael
Louisiana State University, 70803, Baton Rouge, LA, USA
AbstractWe present CUDA-DTM, the first ever Distributed Transactional Memory framework written in CUDA for large scale GPU clusters. Transactional Memory has become an attractive auto-coherence scheme for GPU applications with irregular memory access ...
- 0Citation
MetricsTotal Citations0
- Samuel Irving
- article
Time-communication impossibility results for distributed transactional memory
- Costas Busch
Louisiana State University, Baton Rouge, USA
, - Maurice Herlihy
Brown University, Providence, USA
, - Miroslav Popovic
University of Novi Sad, Novi Sad, Serbia
, - Gokarna Sharma
Kent State University, Kent, USA
Distributed Computing, Volume 31, Issue 6•November 2018, pp 471-487 • https://doi.org/10.1007/s00446-017-0318-yWe consider scheduling problems in the data flow model of distributed transactional memory. Objects shared by transactions move from one network node to another by following network paths. We examine how the objects' transfer in the network affects the ...
- 7Citation
MetricsTotal Citations7
- Costas Busch
- research-articlePublished By ACMPublished By ACM
Distributed garbage collection for general graphs
- Steven R. Brandt
Louisiana State University, USA
, - Hari Krishnan
Louisiana State University, USA
, - Costas Busch
Louisiana State University, USA
, - Gokarna Sharma
Kent State University, USA
ISMM 2018: Proceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management•June 2018, pp 29-44• https://doi.org/10.1145/3210563.3210572We propose a scalable, cycle-collecting, decentralized, reference counting garbage collector with partial tracing. The algorithm is based on the Brownbridge system but uses four different types of references to label edges. Memory usage is O (log n) ...
Also Published in:
ACM SIGPLAN Notices: Volume 53 Issue 5, May 2018- 1Citation
- 195
- Downloads
MetricsTotal Citations1Total Downloads195Last 12 Months13Last 6 weeks1
- Steven R. Brandt
- research-articlePublished By ACMPublished By ACM
Polynomial Time Equilibria in Bottleneck Congestion Games
- Costas Busch
Louisiana State University, Baton Rouge, LA, USA
, - Rajgopal Kannan
US Army Research Lab-West, Los Angeles, CA, USA
EC '18: Proceedings of the 2018 ACM Conference on Economics and Computation•June 2018, pp 393-409• https://doi.org/10.1145/3219166.3219221We consider bottleneck congestion games in an arbitrary graph G where player strategies are flows in G . The player's objective is to select a flow that minimizes the maximum load on any edge, that is, minimize the bottleneck congestion. We consider ...
- 1Citation
- 153
- Downloads
MetricsTotal Citations1Total Downloads153Last 12 Months3Last 6 weeks1- 1
Supplementary Materialp393.mp4
- Costas Busch
- research-article
How to Make Fat Autonomous Robots See all Others Fast?
- Gokarna Sharma
Department of Computer Science, Kent State University, Kent, OH, 44242, USA
, - Costas Busch
Louisiana State University, School of Electrical Engineering and Computer Science, Baton Rouge, LA, 70803, USA
, - Supratik Mukhopadhyay
Louisiana State University, School of Electrical Engineering and Computer Science, Baton Rouge, LA, 70803, USA
2018 IEEE International Conference on Robotics and Automation (ICRA)•May 2018, pp 1-9• https://doi.org/10.1109/ICRA.2018.8460899The coordination problems arising in a team of autonomous mobile robots have received a lot of attention in the distributed robotics community. Along those lines, we study in this paper the problem of coordinating autonomous mobile robots to reposition on ...
- 3Citation
MetricsTotal Citations3
- Gokarna Sharma
- short-paperPublished By ACMPublished By ACM
The Complete Visibility Problem for Fat Robots with Lights
- Gokarna Sharma
Kent State University, Kent, OH
, - Rusul Alsaedi
Kent State University, Kent, OH
, - Costas Busch
Louisiana State University, Baton Rouge, LA
, - Supratik Mukhopadhyay
Louisiana State University, Baton Rouge, LA
ICDCN '18: Proceedings of the 19th International Conference on Distributed Computing and Networking•January 2018, Article No.: 21, pp 1-4• https://doi.org/10.1145/3154273.3154319We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move cycles and communicate with other robots using colored lights (the robots with lights model). We study the fundamental problem of repositioning N ...
- 16Citation
- 132
- Downloads
MetricsTotal Citations16Total Downloads132Last 12 Months5
- Gokarna Sharma
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner