Yuichi Sudo

Applied Filters

Yuichi Sudo
AuthorRemove filter

Clear all

People

Colleagues

Yuichi Sudo (21)
Toshimitsu Masuzawa (16)
Hirotsugu Kakugawa (11)
Fukuhito Ooshita (7)
Junya Nakamura (7)
Masahiro Shibata (5)
Yonghwan Kim (4)
Taisuke Izumi (3)
Ajoy Kumar Datta (2)
Daisuke Yokota (2)
Lawrence Louis Larmore (2)
Rongcheng Dong (2)
Yukiko Yamauchi (2)
Daisuke Baba (1)
Kohei Shimoyama (1)
Rikuo Nakai (1)
Sayaka Kamei (1)
Soichiro Imoto (1)
Syohei Maruyama (1)
Takahiro Shintaku (1)

Publication

Journal/Magazine Names

Theoretical Computer Science (4)
Information and Computation (2)

Proceedings/Book Names

Stabilization, Safety, and Security of Distributed Systems (3)
Stabilization, Safety, and Security of Distributed Systems (3)
Structural Information and Communication Complexity (2)
ICDCN '17: Proceedings of the 18th International Conference on Distributed Computing and Networking (1)
PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (1)
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (1)
SIROCCO'09: Proceedings of the 16th international conference on Structural Information and Communication Complexity (1)
Stabilization, Safety, and Security of Distributed Systems (1)
Structural Information and Communication Complexity (1)
WRAS '10: Proceedings of the Third International Workshop on Reliability, Availability, and Security (1)

Publisher

Springer-Verlag (11)
Association for Computing Machinery (4)
Elsevier Science Publishers Ltd. (4)
Academic Press, Inc. (2)

Publication Date

Upon changing this filter the page will automatically refresh

Past 5 years
Past 2 years
Past year

Export Citations

Select Citation format

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

Publications

21 Results for: Author: Yuichi SudoEdit SearchSave SearchFailed to save your search, try again laterSearch has been saved (My Saved Searches)

Save this search

Please login to be able to save your searches and receive alerts for new content matching your search criteria.

Searched The ACM Guide to Computing Literature (3,790,159 records)|Limit your search to The ACM Full-Text Collection (766,444 records)

Results

Showing 1 - 20of21 Results

Filters

Select All

Export Citations Save to Binder

Save to Binder

Create a New Binder

Name

per page:

Sort by: Latest

Recency
Earliest
Most Downloaded
Most Cited

research-article
Self-stabilizing 2-minimal dominating set algorithms based on loop composition
- Syohei Maruyama
  Fujitsu Ltd., Kanagawa 211-8588, Japan
  ,
- Yuichi Sudo
  Hosei University, Tokyo 184-8584, Japan
  ,
- Sayaka Kamei
  Graduate School of Advanced Science and Engineering, Hiroshima University, Hiroshima 739-8521, Japan
  ,
- Hirotsugu Kakugawa
  Ryukoku University, Shiga 520-2194, Japan
Theoretical Computer Science, Volume 983, Issue C•Feb 2024 • https://doi.org/10.1016/j.tcs.2023.114314
Abstract
Given a graph G = ( V , E ), a 2-minimal dominating set (2-MDS) of G is a minimal dominating set D ⊆ V such that D ∖ { p i , p j } ∪ { p z } is not a dominating set for any nodes p i , p j ∈ D (p i ≠ p j) and p z ∉ D. We propose two silent self-...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Open Access
Published By ACM
Published By ACM
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
- Daisuke Yokota
  Osaka University, Suita, Osaka, Japan
  ,
- Yuichi Sudo
  Hosei University, Koganei, Tokyo, Japan
  ,
- Fukuhito Ooshita
  Fukui University of Technology, Fukui, Fukui, Japan
  ,
- Toshimitsu Masuzawa
  Osaka University, Suita, Osaka, Japan
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing•June 2023, pp 2-12• https://doi.org/10.1145/3583668.3594586

We propose a self-stabilizing leader election (SS-LE) protocol on ring networks in the population protocol model. Given a rough knowledge ψ = ⌈log n⌉ + O(1) on the population size n, the proposed protocol lets the population reach a safe configuration ...
0Citation
216
Downloads
Metrics
Total Citations0
Total Downloads216
Last 12 Months157
Last 6 weeks27
Export Citations
Save to Binder
View online with eReader
PDF
research-article
Atomic cross-chain swaps with improved space, time and local time complexities
- Soichiro Imoto
  1-1, Yamadaoka, Suita, Osaka, Osaka University, Japan
  ,
- Yuichi Sudo
  3-7-2, Kajino-cho, Koganei, Tokyo, Hosei University, Japan
  ,
- Hirotsugu Kakugawa
  1-5, Setaoecho, Otsu, Shiga, Ryukoku University, Japan
  ,
- Toshimitsu Masuzawa
  1-1, Yamadaoka, Suita, Osaka, Osaka University, Japan
Information and Computation, Volume 292, Issue C•Jun 2023 • https://doi.org/10.1016/j.ic.2023.105039
Abstract
An effective atomic cross-chain swap protocol is introduced by Herlihy [Herlihy, 2018] as a distributed coordination protocol in order to exchange assets across multiple blockchains among multiple untrusted parties. The atomic cross-chain swap ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Loosely-stabilizing maximal independent set algorithms with unreliable communications
- Rongcheng Dong
  Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan
  ,
- Yuichi Sudo
  Graduate School of Computer and Information Sciences, Hosei University, 3-7-2 Kajino-cho, Koganei-shi, Tokyo, 184-8585, Japan
  ,
- Taisuke Izumi
  Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan
  ,
- Toshimitsu Masuzawa
  Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan
Theoretical Computer Science, Volume 937, Issue C•Nov 2022, pp 69-84 • https://doi.org/10.1016/j.tcs.2022.09.031
Abstract
Self-stabilization is a promising paradigm for designing highly adaptive distributed systems. However, it cannot be realized when the communication between processes is unreliable with some constant probability. To circumvent such ...
Highlights

Self-stabilization solutions are precluded for most of non-trivial problems in probabilistic error models.
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles
- Kohei Shimoyama
  Osaka University, Osaka, Japan
  ,
- Yuichi Sudo
  Hosei University, Tokyo, Japan
  ,
- Hirotsugu Kakugawa
  Ryukoku University, Kyoto, Shiga, Japan
  ,
- Toshimitsu Masuzawa
  Osaka University, Osaka, Japan
Stabilization, Safety, and Security of Distributed Systems•November 2022, pp 19-34• https://doi.org/10.1007/978-3-031-21017-4_2
Abstract
This paper considers perpetual exploration of anonymous cactus graphs with distinguishable cycles by a single mobile agent under the restriction that nodes have no storage (e.g., whiteboards or token places). A cactus with distinguishable cycles ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Almost uniform deployment of mobile agents in dynamic rings
- Masahiro Shibata
  Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology, 680-4 Kawazu, Iizuka, Fukuoka 820-8502, Japan
  ,
- Yuichi Sudo
  Graduate School of Computer and Information Sciences, Hosei University, 3-7-2 Kajino-cho, Koganei-shi, Tokyo, 184-8584, Japan
  ,
- Junya Nakamura
  Information and Media Center, Toyohashi University of Technology, 1-1 Hibarigaoka, Tempaku-cho, Toyohashi, Aichi, 441-8580, Japan
  ,
- Yonghwan Kim
  Graduate School of Computer Science and Engineering, Nagoya Institute of Technology, Gokiso-cho, Showa-ku, Nagoya, Aichi, 466-8555, Japan
Information and Computation, Volume 289, Issue PA•Nov 2022 • https://doi.org/10.1016/j.ic.2022.104949
Abstract
In this paper, we consider the almost uniform deployment problem of mobile agents in dynamic rings, which requires all agents other than one agent to spread uniformly in the ring. In this paper, we consider this problem in 1-interval ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Partial Gathering of Mobile Agents in Dynamic Rings
- Masahiro Shibata
  Kyushu Institute of Technology, Kitakyushu, Fukuoka, Japan
  ,
- Yuichi Sudo
  Hosei University, Chiyoda, Tokyo, Japan
  ,
- Junya Nakamura
  Toyohashi University of Technology, Toyohashi, Aichi, Japan
  ,
- Yonghwan Kim
  Nagoya Institute of Technology, Nagoya, Aichi, Japan
Stabilization, Safety, and Security of Distributed Systems•November 2021, pp 440-455• https://doi.org/10.1007/978-3-030-91081-5_29
Abstract
In this paper, we consider the partial gathering problem of mobile agents in synchronous dynamic bidirectional rings. The partial gathering problem is a generalization of the (well-investigated) total gathering problem, which requires that all k ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Rikuo Nakai
  Graduate School of Science and Engineering, Hosei University, Koganei City, Japan
  ,
- Yuichi Sudo
  Faculty of Computer and Information Sciences, Hosei University, Koganei City, Japan
  ,
- Koichi Wada
  Faculty of Science and Engineering, Hosei University, Koganei City, Japan
Stabilization, Safety, and Security of Distributed Systems•November 2021, pp 410-424• https://doi.org/10.1007/978-3-030-91081-5_27
Abstract
We consider a Gathering problem for n autonomous mobile robots with persistent memory called light in an asynchronous scheduler (ASYNC). Gathering is well known to be impossible when robots have no lights in basic standard models if the system is ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications
- Rongcheng Dong
  Osaka University, Osaka, Japan
  ,
- Yuichi Sudo
  Hosei University, Tokyo, Japan
  ,
- Taisuke Izumi
  Osaka University, Osaka, Japan
  ,
- Toshimitsu Masuzawa
  Osaka University, Osaka, Japan
Stabilization, Safety, and Security of Distributed Systems•November 2021, pp 335-349• https://doi.org/10.1007/978-3-030-91081-5_22
Abstract
Self-stabilization is a promising paradigm to design highly adaptive distributed systems. However, it cannot be realized when the communication between processes is unreliable with some constant probability. To circumvent such impossibility, this ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols
- Daisuke Yokota
  Osaka University, Suita, Japan
  ,
- Yuichi Sudo
  Osaka University, Suita, Japan
  ,
- Toshimitsu Masuzawa
  Osaka University, Suita, Japan
Stabilization, Safety, and Security of Distributed Systems•November 2020, pp 301-316• https://doi.org/10.1007/978-3-030-64348-5_24
Abstract
We propose a self-stabilizing leader election protocol on directed rings in the model of population protocols. Given an upper bound N on the population size n, the proposed protocol elects a unique leader within O(nN) expected steps starting from ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Article
Efficient Dispersion of Mobile Agents without Global Knowledge
- Takahiro Shintaku
  Osaka University, Suita, Japan
  ,
- Yuichi Sudo
  Osaka University, Suita, Japan
  ,
- Hirotsugu Kakugawa
  Ryukoku University, Kyoto, Japan
  ,
- Toshimitsu Masuzawa
  Osaka University, Suita, Japan
Stabilization, Safety, and Security of Distributed Systems•November 2020, pp 280-294• https://doi.org/10.1007/978-3-030-64348-5_22
Abstract
We consider the dispersion problem for mobile agents. Initially, k agents are located at arbitrary nodes in an undirected graph. Agents can migrate from node to node via an edge in the graph synchronously. Our goal is to let the k agents be ...
5Citation
Metrics
Total Citations5
Export Citations
Save to Binder
Article
Uniform Deployment of Mobile Agents in Dynamic Rings
- Masahiro Shibata
  Kyushu Institute of Technology, Fukuoka, Japan
  ,
- Yuichi Sudo
  Osaka University, Osaka, Japan
  ,
- Junya Nakamura
  Toyohashi University of Technology, Aichi, Japan
  ,
- Yonghwan Kim
  Nagoya Institute of Technology, Aichi, Japan
Stabilization, Safety, and Security of Distributed Systems•November 2020, pp 248-263• https://doi.org/10.1007/978-3-030-64348-5_20
Abstract
In this paper, we consider the uniform deployment problem of mobile agents in synchronous dynamic bidirectional rings, which requires agents to spread uniformly in the ring. So far, uniform deployment has been considered in static graphs. In this ... $^{}$ $^{}$
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Article
The Power of Global Knowledge on Self-stabilizing Population Protocols
- Yuichi Sudo
  Osaka University, Osaka, Japan
  ,
- Masahiro Shibata
  Kyushu Institute of Technology, Fukuoka, Japan
  ,
- Junya Nakamura
  Toyohashi University of Technology, Aichi, Japan
  ,
- Yonghwan Kim
  Nagoya Institute of Technology, Aichi, Japan
  ,
- Toshimitsu Masuzawa
  Osaka University, Osaka, Japan
Structural Information and Communication Complexity•June 2020, pp 237-254• https://doi.org/10.1007/978-3-030-54921-3_14
Abstract
In the population protocol model, many problems cannot be solved in a self-stabilizing way. However, global knowledge, such as the number of nodes in a network, sometimes allow us to design a self-stabilizing protocol for such problems. In this ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Loosely-stabilizing leader election with polylogarithmic convergence time
- Yuichi Sudo
  Graduate School of Information Science and Technology, Osaka University, Japan
  ,
- Fukuhito Ooshita
  Graduate School of Science and Technology, Nara Institute of Science and Technology, Japan
  ,
- Hirotsugu Kakugawa
  Faculty of Science and Technology, Ryukoku University, Japan
  ,
- Toshimitsu Masuzawa
  Graduate School of Information Science and Technology, Osaka University, Japan
  ,
- Ajoy K. Datta
  Department of Computer Science, University of Nevada, Las Vegas, USA
  ,
- Lawrence L. Larmore
  Department of Computer Science, University of Nevada, Las Vegas, USA
Theoretical Computer Science, Volume 806, Issue C•Feb 2020, pp 617-631 • https://doi.org/10.1016/j.tcs.2019.09.034
Abstract
A loosely-stabilizing leader election protocol with polylogarithmic convergence time in the population protocol model is presented in this paper. In the population protocol model, which is a common abstract model of mobile sensor ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
abstract
Public Access
Published By ACM
Published By ACM
Logarithmic Expected-Time Leader Election in Population Protocol Model
- Yuichi Sudo
  Osaka University, Suita, Japan
  ,
- Fukuhito Ooshita
  Nara Institute of Science and Technology, Ikoma, Japan
  ,
- Taisuke Izumi
  Nagoya Institute of Technology, Nagoya, Japan
  ,
- Hirotsugu Kakugawa
  Ryukoku University, Otsu, Japan
  ,
- Toshimitsu Masuzawa
  Osaka University, Suita, Japan
PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing•July 2019, pp 60-62• https://doi.org/10.1145/3293611.3331585

In this paper, we present a leader election protocol in the population protocol model that stabilizes within O(log n) parallel time in expectation with O(log n) states per agent, where n is the number of agents. Given a rough knowledge m of the ...
7Citation
348
Downloads
Metrics
Total Citations7
Total Downloads348
Last 12 Months51
Last 6 weeks17
Export Citations
Save to Binder
View online with eReader
PDF
Article
A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault
- Koki Inoue
  Osaka University, Suita, Japan
  ,
- Yuichi Sudo
  Osaka University, Suita, Japan
  ,
- Hirotsugu Kakugawa
  Ryukoku University, Kyoto, Japan
  ,
- Toshimitsu Masuzawa
  Osaka University, Suita, Japan
Structural Information and Communication Complexity•July 2019, pp 353-356• https://doi.org/10.1007/978-3-030-24922-9_28
Abstract
Self-stabilization [2] is a promising paradigm for designing distributed systems that are highly-tolerant of transient faults and adaptive to topology changes, since it guarantees that a system can recover its intended behavior even when its ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings
- Masahiro Shibata
  Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology, Iizuka, Japan
  ,
- Norikazu Kawata
  Graduate School of Information Science and Technology, Osaka University, Suita, Japan
  ,
- Yuichi Sudo
  Graduate School of Information Science and Technology, Osaka University, Suita, Japan
  ,
- Fukuhito Ooshita
  Graduate School of Science and Technology, NAIST, Ikoma, Japan
  ,
- Hirotsugu Kakugawa
  Faculty of Science and Technology, Ryukoku University, Ootsu, Japan
  ,
- Toshimitsu Masuzawa
  Graduate School of Information Science and Technology, Osaka University, Suita, Japan
Structural Information and Communication Complexity•July 2019, pp 277-292• https://doi.org/10.1007/978-3-030-24922-9_19
Abstract
In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings. This problem requires that, for a given positive integer g, all the agents terminate in a configuration such that at least g agents or ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
A Self-Stabilizing Minimal k-Grouping Algorithm
- Ajoy K. Datta
  University of Nevada, Las, Vegas
  ,
- Laurence L. Larmore
  University of Nevada, Las, Vegas
  ,
- Toshimitsu Masuzawa
  Osaka University
  ,
- Yuichi Sudo
  Osaka University
ICDCN '17: Proceedings of the 18th International Conference on Distributed Computing and Networking•January 2017, Article No.: 3, pp 1-10• https://doi.org/10.1145/3007748.3007772

We consider the minimal k-grouping problem: given a graph G = (V, E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent self-stabilizing ...
5Citation
102
Downloads
Metrics
Total Citations5
Total Downloads102
Export Citations
Save to Binder
Get Access
article
Loosely-stabilizing leader election in a population protocol model
- Yuichi Sudo
  Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan
  ,
- Junya Nakamura
  Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan
  ,
- Yukiko Yamauchi
  Graduate School of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka 819-0395, Japan
  ,
- Fukuhito Ooshita
  Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan
  ,
- Hirotsugu Kakugawa
  Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan
  ,
- Toshimitsu Masuzawa
  Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan
Theoretical Computer Science, Volume 444•July, 2012, pp 100-112 • https://doi.org/10.1016/j.tcs.2012.01.007

A self-stabilizing protocol guarantees that starting from any arbitrary initial configuration, a system eventually comes to satisfy its specification and keeps the specification forever. Although self-stabilizing protocols show excellent fault-tolerance ...
9Citation
Metrics
Total Citations9
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
An agent exploration in unknown undirected graphs with whiteboards
- Yuichi Sudo
  Osaka University
  ,
- Daisuke Baba
  Osaka University
  ,
- Junya Nakamura
  Osaka University
  ,
- Fukuhito Ooshita
  Osaka University
  ,
- Hirotsugu Kakugawa
  Osaka University
  ,
- Toshimitsu Masuzawa
  Osaka University
WRAS '10: Proceedings of the Third International Workshop on Reliability, Availability, and Security•July 2010, Article No.: 8, pp 1-6• https://doi.org/10.1145/1953563.1953570

We consider the exploration problem with a single agent in undirected graphs. Starting from an arbitrary node, the agent has to explore all the nodes and edges in the graph and return to the starting node. Our goal is to minimize both the number of ...
7Citation
72
Downloads
Metrics
Total Citations7
Total Downloads72
Last 12 Months1
Export Citations
Save to Binder
Get Access

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. How do authors access ACM Author-Izer?
A. See How to Use

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

Yuichi Sudo

Yuichi Sudo

Applied Filters

People

Colleagues

Publication

Journal/Magazine Names

Proceedings/Book Names

All Publications

Content Type

Media Formats

Publisher

Publication Date

Self-stabilizing 2-minimal dominating set algorithms based on loop composition

A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States

Atomic cross-chain swaps with improved space, time and local time complexities

Loosely-stabilizing maximal independent set algorithms with unreliable communications

Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles

Almost uniform deployment of mobile agents in dynamic rings

Partial Gathering of Mobile Agents in Dynamic Rings

Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights

Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications

Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols

Efficient Dispersion of Mobile Agents without Global Knowledge

Uniform Deployment of Mobile Agents in Dynamic Rings

The Power of Global Knowledge on Self-stabilizing Population Protocols

Loosely-stabilizing leader election with polylogarithmic convergence time

Logarithmic Expected-Time Leader Election in Population Protocol Model

A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault

Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings

A Self-Stabilizing Minimal k-Grouping Algorithm

Loosely-stabilizing leader election in a population protocol model

An agent exploration in unknown undirected graphs with whiteboards