Kunihiko Sadakane

Applied Filters

Kunihiko Sadakane
AuthorRemove filter

Clear all

People

Colleagues

Kunihiko Sadakane (96)
Wing Kin Sung (18)
Jesper Jansson (16)
Hirotaka Ono (12)
Masafumi Yamashita (12)
Wing Kai Hon (11)
Takeshi Tokuyama (9)
Srinivasa Rao Satti (8)
Sankardeep Chakraborty (7)
Tak Wah Lam (7)
G. Navarro (6)
Roberto Grossi (4)
Siuming Yiu (4)
Daisuke Okanohara (3)
Diego Arroyuelo (3)
Stefan Dobrev (3)
Suguru Kawashimo (3)
Tetsuo Shibuya (3)
Gad M Landau (2)
Takumi Okazaki (2)

Roles

Editor

Publication

Journal/Magazine Names

Algorithmica (10)
Theoretical Computer Science (7)
ACM Transactions on Algorithms (2)
Discrete Applied Mathematics (2)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (2)
Journal of Computer and System Sciences (2)
SIAM Journal on Computing (2)
IEICE - Transactions on Information and Systems (1)
Information and Computation (1)
Information Sciences: an International Journal (1)
Journal of Algorithms (1)
Journal of Discrete Algorithms (1)
Proceedings of the VLDB Endowment (1)
Theory of Computing Systems (1)

Proceedings/Book Names

DCC '98: Proceedings of the Conference on Data Compression (2)
DNA'06: Proceedings of the 12th international conference on DNA Computing (2)
Algorithms and Computation (1)
Combinatorial Algorithms (1)
Combinatorial Optimization and Applications (1)
Computing and Combinatorics (1)
ESA '08: Proceedings of the 16th annual European symposium on Algorithms (1)
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (1)
InfoScale '06: Proceedings of the 1st international conference on Scalable information systems (1)
ISAAC '01: Proceedings of the 12th International Symposium on Algorithms and Computation (1)
ISAAC '08: Proceedings of the 19th International Symposium on Algorithms and Computation (1)
KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (1)
Language and Automata Theory and Applications (1)
SCG '98: Proceedings of the fourteenth annual symposium on Computational geometry (1)
SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (1)
SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (1)
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (1)
SPIRE '09: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (1)
TAMC '09: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (1)
WONS '05: Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services (1)

All Publications

Proceedings (61)
Other periodicals (29)
Journals (5)
Books (1)

Publisher

Springer-Verlag (52)
IEEE Computer Society (10)
Society for Industrial and Applied Mathematics (10)
Elsevier Science Publishers Ltd. (7)
Association for Computing Machinery (5)
Academic Press, Inc. (4)
Elsevier Science Publishers B. V. (3)
IEEE Computer Society Press (2)
Elsevier Science Inc. (1)
Oxford University Press, Inc. (1)
VLDB Endowment (1)

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

96 Results for: Author: Kunihiko SadakaneEdit 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 - 20of96 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
Succinct data structures for bounded clique-width graphs
- Sankardeep Chakraborty
  University of Tokyo, Japan
  ,
- Seungbum Jo
  Chungnam National University, Republic of Korea
  ,
- Kunihiko Sadakane
  University of Tokyo, Japan
  ,
- Srinivasa Rao Satti
  Norwegian University of Science and Technology, Norway
Discrete Applied Mathematics, Volume 352, Issue C•Jul 2024, pp 55-68 • https://doi.org/10.1016/j.dam.2024.03.016
Abstract
Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic traceability, and in this paper, we study the class of bounded clique-width graphs through the lens of succinct data structures. A data structure is said ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Succinct data structure for path graphs
- Girish Balakrishnan
  Indian Institute of Technology Madras, Chennai, India
  ,
- Sankardeep Chakraborty
  University of Tokyo Tokyo, Japan
  ,
- N.S. Narayanaswamy
  Indian Institute of Technology Madras, Chennai, India
  ,
- Kunihiko Sadakane
  University of Tokyo Tokyo, Japan
Information and Computation, Volume 296, Issue C•Jan 2024 • https://doi.org/10.1016/j.ic.2023.105124
Abstract
We consider the problem of designing a succinct data structure for path graphs, that generalizes interval graphs, on n vertices while efficiently supporting degree, adjacency, and neighbourhood queries. We provide the following two solutions for ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Jesper Jansson
  Department of Computer Science and Communication Engineering, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka 819-0395, Japan
  ,
- Kunihiko Sadakane
  Department of Computer Science and Communication Engineering, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka 819-0395, Japan
  ,
- Wing-Kin Sung
  Department of Computer Science, National University of Singapore, 3 Science Drive 2, 117543 Singapore, Genome Institute of Singapore, 60 Biopolis Street, Genome 138672, Singapore
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science•December 2007, pp 424-435• https://doi.org/10.1007/978-3-540-77050-3_35
Abstract
The dynamic trie is a fundamental data structure which finds applications in many areas. This paper proposes a compressed version of the dynamic trie data structure. Our data-structure is not only space efficient, it also allows pattern searching ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Succinct representation for (non)deterministic finite automata
- Sankardeep Chakraborty
  The University of Tokyo, Japan
  ,
- Roberto Grossi
  University of Pisa, Italy
  ,
- Kunihiko Sadakane
  The University of Tokyo, Japan
  ,
- Srinivasa Rao Satti
  Norwegian University of Science and Technology, Norway
Journal of Computer and System Sciences, Volume 131, Issue C•Feb 2023, pp 1-12 • https://doi.org/10.1016/j.jcss.2022.07.002
Abstract
(Non)-Deterministic finite automata are one of the simplest models of computation studied in automata theory. Here we study them through the lens of succinct data structures. Towards this goal, we design a data structure for any ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Succinct navigational oracles for families of intersection graphs on a circle
- Hüseyin Acan
  Drexel University, United States
  ,
- Sankardeep Chakraborty
  The University of Tokyo, Japan
  ,
- Seungbum Jo
  Chungnam National University, South Korea
  ,
- Kei Nakashima
  The University of Tokyo, Japan
  ,
- Kunihiko Sadakane
  The University of Tokyo, Japan
  ,
- Srinivasa Rao Satti
  Norwegian University of Science and Technology, Norway
Theoretical Computer Science, Volume 928, Issue C•Sep 2022, pp 151-166 • https://doi.org/10.1016/j.tcs.2022.06.022
Abstract
We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency and neighborhood efficiently for intersection graphs on a circle, which ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Approximating Dynamic Weighted Vertex Cover with Soft Capacities
- Hao-Ting Wei
  Department of Industrial Engineering and Engineering Management, National Tsing Hua University, 30013, Hsinchu, Taiwan
  ,
- Wing-Kai Hon
  Department of Computer Science, National Tsing Hua University, 30013, Hsinchu, Taiwan
  ,
- Paul Horn
  Department of Mathematics, University of Denver, Denver, USA
  ,
- Chung-Shou Liao
  Department of Industrial Engineering and Engineering Management, National Tsing Hua University, 30013, Hsinchu, Taiwan
  ,
- Kunihiko Sadakane
  Department of Mathematical Informatics, The University of Tokyo, Tokyo, Japan
Algorithmica, Volume 84, Issue 1•Jan 2022, pp 124-149 • https://doi.org/10.1007/s00453-021-00886-9
Abstract
This study considers the soft capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intensively studied in recent years. Given a dynamically changing vertex-...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs
- Sankardeep Chakraborty
  The University of Tokyo, Tokyo, Japan
  ,
- Seungbum Jo
  Chungnam National University, Daejeon, South Korea
  ,
- Kunihiko Sadakane
  The University of Tokyo, Tokyo, Japan
  ,
- Srinivasa Rao Satti
  Norwegian University of Science and Technology, Trondheim, Norway
Combinatorial Optimization and Applications•December 2021, pp 416-430• https://doi.org/10.1007/978-3-030-92681-6_33
Abstract
We design succinct encodings of series-parallel, block-cactus and 3-leaf power graphs while supporting the basic navigational queries such as degree, adjacency and neighborhood optimally in the RAM model with logarithmic word size. One salient ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Approximating the Canadian Traveller Problem with Online Randomization
- Erik D. Demaine
  Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA
  ,
- Yamming Huang
  Department of Industrial Engineering and Engineering Management, National Tsing Hua University, 30013, Hsinchu, Taiwan
  ,
- Chung-Shou Liao
  Department of Industrial Engineering and Engineering Management, National Tsing Hua University, 30013, Hsinchu, Taiwan
  ,
- Kunihiko Sadakane
  Department of Mathematical Informatics, the University of Tokyo, Tokyo, Japan
Algorithmica, Volume 83, Issue 5•May 2021, pp 1524-1543 • https://doi.org/10.1007/s00453-020-00792-6
Abstract
In this paper, we study online algorithms for the Canadian Traveller Problem defined by Papadimitriou and Yannakakis in 1991. This problem involves a traveller who knows the entire road network in advance, and wishes to travel as quickly as ... $\frac{\sqrt{}}{} \sqrt{}$
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
Article
Succinct Representations for (Non)Deterministic Finite Automata
- Sankardeep Chakraborty
  National Institute of Informatics, Tokyo, Japan
  ,
- Roberto Grossi
  Università di Pisa, Pisa, Italy
  ,
- Kunihiko Sadakane
  The University of Tokyo, Tokyo, Japan
  ,
- Srinivasa Rao Satti
  Seoul National University, Seoul, South Korea
Language and Automata Theory and Applications•March 2021, pp 55-67• https://doi.org/10.1007/978-3-030-68195-1_5
Abstract
Deterministic finite automata are one of the simplest and most practical models of computation studied in automata theory. Their extension is the non-deterministic finite automata which also have plenty of applications. In this article, we study ... $^{}$ $^{}$ $^{}$
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Article
Optimal In-place Algorithms for Basic Graph Problems
- Sankardeep Chakraborty
  National Institute of Informatics, Tokyo, Japan
  ,
- Kunihiko Sadakane
  The University of Tokyo, Tokyo, Japan
  ,
- Srinivasa Rao Satti
  Seoul National University, Seoul, South Korea
Combinatorial Algorithms•June 2020, pp 126-139• https://doi.org/10.1007/978-3-030-48966-3_10
Abstract
We present linear time in-place algorithms for several fundamental graph problems including the well-known graph search methods (like depth-first search, breadth-first search, maximum cardinality search), connectivity problems (like biconnectivity,...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Node Similarity with q -Grams for Real-World Labeled Networks
- Alessio Conte
  National Institute of Informatics, Tokyo, Japan
  ,
- Gaspare Ferraro
  University of Pisa, Pisa, Italy
  ,
- Roberto Grossi
  University of Pisa, Pisa, Italy
  ,
- Andrea Marino
  University of Pisa, Pisa, Italy
  ,
- Kunihiko Sadakane
  University of Tokyo, Tokyo, Japan
  ,
- Takeaki Uno
  National Institute of Informatics, Tokyo, Japan
KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining•July 2018, pp 1282-1291• https://doi.org/10.1145/3219819.3220085

We study node similarity in labeled networks, using the label sequences found in paths of bounded length q leading to the nodes. (This recalls the q-grams employed in document resemblance, based on the Jaccard distance.) When applied to networks, the ...
8Citation
756
Downloads
Metrics
Total Citations8
Total Downloads756
Last 12 Months18
Last 6 weeks4
1
Supplementary Material
conte_similarity_q_grams_networks.mp4
Export Citations
Save to Binder
Get Access
Article
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time
- Paniz Abedin
  Department of Computer Science, University of Central Florida, Orlando, USA
  ,
- Arnab Ganguly
  Department of Computer Science, University of Wisconsin - Whitewater, Whitewater, USA
  ,
- Wing-Kai Hon
  Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan
  ,
- Yakov Nekrich
  Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada
  ,
- Kunihiko Sadakane
  Department of Computer Science, The University of Tokyo, Tokyo, Japan
  ,
- Rahul Shah
  Department of Computer Science, Louisiana State University, Baton Rouge, USA
  National Science Foundation (NSF), Alexandria, USA
  ,
- Sharma V. Thankachan
  Department of Computer Science, University of Central Florida, Orlando, USA
Computing and Combinatorics•July 2018, pp 615-625• https://doi.org/10.1007/978-3-319-94776-1_51
Abstract
Let be a text of length n and be the suffix starting at position i. Also, for any two strings X and Y, let denote their longest common prefix. The range-LCP of w.r.t. a range , where is
[graphic not available: see fulltext]
Amir et al. [ISAAC 2011] ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
article
Lempel---Ziv Factorization Powered by Space Efficient Suffix Trees
- Johannes Fischer
  Department of Computer Science, TU Dortmund, Dortmund, Germany
  ,
- Tomohiro I
  Department of Artificial Intelligence, Kyushu Institute of Technology, Fukuoka, Japan
  ,
- Dominik Köppl
  Department of Computer Science, TU Dortmund, Dortmund, Germany
  ,
- Kunihiko Sadakane
  Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
Algorithmica, Volume 80, Issue 7•July 2018, pp 2048-2081 • https://doi.org/10.1007/s00453-017-0333-1

We show that both the Lempel---Ziv-77 and the Lempel---Ziv-78 factorization of a text of length n on an integer alphabet of size $$\sigma $$ź can be computed in $$\mathop {}\mathopen {}\mathcal {O}\mathopen {}\left( n\right) $$On time with either $$\...
7Citation
Metrics
Total Citations7
Export Citations
Save to Binder
Article
Engineering Hybrid DenseZDDs
- Taito Lee
  Department of Creative Informatics, Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan
  ,
- Shuhei Denzumi
  Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan
  ,
- Kunihiko Sadakane
  Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan
SEA 2016: Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685•June 2016, pp 201-216• https://doi.org/10.1007/978-3-319-38851-9_14

ZDDs Zero-suppressed Binary Decision Diagrams [Minato 93] have been proposed to store set families compactly. Though more compact than other representations, they still use large amount of memory to support dynamic operations such as taking union and ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
article
Space---Time Trade-offs for Stack-Based Algorithms
- Luis Barba
  School of Computer Science, Carleton University, Ottawa, Canada
  ,
- Matias Korman
  National Institute of Informatics, Tokyo, Japan
  ,
- Stefan Langerman
  Département d'Informatique, Université Libre de Bruxelles, Brussels, Belgium
  ,
- Kunihiko Sadakane
  Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
  ,
- Rodrigo I. Silveira
  Dept. de Matemática, Universidade de Aveiro, Aveiro, Portugal
Algorithmica, Volume 72, Issue 4•August 2015, pp 1097-1129 • https://doi.org/10.1007/s00453-014-9893-5

In memory-constrained algorithms, access to the input is restricted to be read-only, and the number of extra variables that the algorithm can use is bounded. In this paper we introduce the compressed stack technique, a method that allows to transform ...
7Citation
Metrics
Total Citations7
Export Citations
Save to Binder
research-article
An O(m log m)-time algorithm for detecting superbubbles
- Wing-Kin Sung
  National University of Singapore, Singapore, and Genome Institute of Singapore, Singapore
  ,
- Kunihiko Sadakane
  University of Tokyo, Tokyo, Japan
  ,
- Tetsuo Shibuya
  University of Tokyo, Tokyo, Japan
  ,
- Abha Belorkar
  National University of Singapore, Singapore
  ,
- Iana Pyrogova
  National University of Singapore, Singapore
IEEE/ACM Transactions on Computational Biology and Bioinformatics, Volume 12, Issue 4•July/August 2015, pp 770-777 • https://doi.org/10.1109/TCBB.2014.2385696

In genome assembly graphs, motifs such as tips, bubbles, and cross links are studied in order to find sequencing errors and to understand the nature of the genome. Superbubble, a complex generalization of bubbles, was recently proposed as an important ...
4Citation
80
Downloads
Metrics
Total Citations4
Total Downloads80
Last 12 Months3
Export Citations
Save to Binder
Get Access
Article
Variable-Order de Bruijn Graphs
DCC '15: Proceedings of the 2015 Data Compression Conference•April 2015, pp 383-392• https://doi.org/10.1109/DCC.2015.70

The de Bruijn graph GK of a set of strings Sis a key data structure in genome assembly that represents overlaps between all the K-length substrings of S. Construction and navigation of the graph is a space and time bottleneck in practice and the main ...
4Citation
Metrics
Total Citations4
Export Citations
Save to Binder
article
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Jesper Jansson
  Laboratory of Mathematical Bioinformatics (Akutsu Laboratory), Institute for Chemical Research, Kyoto University, Uji, Kyoto, Japan 611-0011
  ,
- Kunihiko Sadakane
  National Institute of Informatics (NII), Chiyoda-ku, Tokyo, Japan 101-8430
  ,
- Wing-Kin Sung
  School of Computing, National University of Singapore, Singapore, Singapore 117417 and Genome Institute of Singapore, Singapore, Singapore 138672
Algorithmica, Volume 71, Issue 4•April 2015, pp 969-988 • https://doi.org/10.1007/s00453-013-9836-6

The dynamic trie is a fundamental data structure with applications in many areas of computer science. This paper proposes a new technique for maintaining a dynamic trie T of size at most 2^w nodes under the unit-cost RAM model with a fixed word ...
8Citation
Metrics
Total Citations8
Export Citations
Save to Binder
research-article
Random Access to Grammar-Compressed Strings and Trees
SIAM Journal on Computing, Volume 44, Issue 3, pp 513-539 • https://doi.org/10.1137/130936889

Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures (sometimes with slight reduction in efficiency) many of the popular compression schemes, ...
14Citation
Metrics
Total Citations14
Export Citations
Save to Binder
Article
DenseZDD: A Compact and Fast Index for Families of Sets
- Shuhei Denzumi
  Graduate School of IST, Hokkaido University, Japan
  ,
- Jun Kawahara
  Nara Institute of Science and Technology (NAIST), Japan
  ,
- Koji Tsuda
  National Institute of Advanced Industrial Science and Technology (AIST), Japan and ERATO MINATO Discrete Structure Manipulation System Project, JST, Japan
  ,
- Hiroki Arimura
  Graduate School of IST, Hokkaido University, Japan
  ,
- Shin-Ichi Minato
  Graduate School of IST, Hokkaido University, Japan and ERATO MINATO Discrete Structure Manipulation System Project, JST, Japan
  ,
- Kunihiko Sadakane
  National Institute of Informatics (NII), Japan
Proceedings of the 13th International Symposium on Experimental Algorithms - Volume 8504•June 2014, pp 187-198• https://doi.org/10.1007/978-3-319-07959-2_16

In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set families is one of the important fundamental techniques for web information retrieval, integration, and mining. For this purpose, a ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder

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

Kunihiko Sadakane