David P. Williamson

Author’s Email
Author’s Website

Applied Filters

David P. Williamson
AuthorRemove filter

Clear all

People

Colleagues

Michel X. Goemans (18)
Anke van Zuylen (9)
David Bernard Shmoys (7)
Chandrashekhar Nagarajan (6)
Madhu Sudan (6)
Samuel C Gutekunst (6)
Frans Schalekamp (5)
Billy Jin (4)
Fabián Ariel Chudak (4)
Joel Martin Wein (4)
Jon Michael Kleinberg (4)
Kamal Jain (4)
Matthias Poloczek (4)
Monika Rauch Henzinger (4)
É Tardos (3)
Huseyin Topaloglu (3)
Luca Trevisan (3)
Vijay V Vazirani (3)
Yogeshwer Sharma (3)

Roles

Advisor
Editor

Publication

Journal/Magazine Names

SIAM Journal on Computing (8)
Algorithmica (7)
Mathematical Programming: Series A and B (5)
Mathematics of Operations Research (5)
Operations Research Letters (4)
ACM Journal of Experimental Algorithmics (3)
SIAM Journal on Discrete Mathematics (3)
Information Processing Letters (2)
Journal of Algorithms (2)
Journal of Computer and System Sciences (2)
Journal of the ACM (2)
Discrete Applied Mathematics (1)
INFORMS Journal on Computing (1)
Journal of Combinatorial Theory Series B (1)
Management Science (1)
Networks (1)

Proceedings/Book Names

SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (2)
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (2)
SODA '94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms (2)
SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms (2)
STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing (2)
EC '06: Proceedings of the 7th ACM conference on Electronic commerce (1)
EC '07: Proceedings of the 8th ACM conference on Electronic commerce (1)
Integer Programming and Combinatorial Optimization (1)
Integer Programming and Combinatorial Optimization (1)
Integer Programming and Combinatorial Optimization (1)
SFCS '91: Proceedings of the 32nd annual symposium on Foundations of computer science (1)
SIGCSE 2023: Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 1 (1)
SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (1)
SODA '92: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1)
STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing (1)
STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing (1)
STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing (1)
STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (1)
Web and Internet Economics (1)
WWW '03: Proceedings of the 12th international conference on World Wide Web (1)

All Publications

Other periodicals (45)
Proceedings (42)
Journals (5)
Books (3)
Doctoral Theses (2)
Reports (2)

Content Type

Research Article (16)
Rapid Communication (1)

Publisher

Springer-Verlag (28)
Society for Industrial and Applied Mathematics (27)
Association for Computing Machinery (15)
INFORMS (7)
Academic Press, Inc. (5)
Elsevier Science Publishers B. V. (5)
Massachusetts Institute of Technology (3)
Elsevier North-Holland, Inc. (2)
IEEE Computer Society (2)
Cambridge University Press (1)
Cornell University (1)
Elsevier Science Publishers Ltd. (1)
PWS Publishing Co. (1)
Wiley-Interscience (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

99 Results for: Author: David P. WilliamsonEdit 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,785,942 records)|Limit your search to The ACM Full-Text Collection (766,206 records)

Results

Showing 1 - 20of99 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

Article
A Lower Bound for the Max Entropy Algorithm for TSP
- Billy Jin
  https://ror.org/05bnh6r87Cornell University, Ithaca, NY, USA
  ,
- Nathan Klein
  https://ror.org/00f809463Institute for Advanced Study, Princeton, NJ, USA
  ,
- David P. Williamson
  https://ror.org/05bnh6r87Cornell University, Ithaca, NY, USA
Integer Programming and Combinatorial Optimization•July 2024, pp 238-251• https://doi.org/10.1007/978-3-031-59835-7_18
Abstract
One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the subtour LP relaxation of the TSP is equal to $\frac{4}{3}$ . For 40 years, the best known upper bound was 1.5, due to ... $^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”
- Alice Paul
  Biostatistics, Brown University, Providence, Rhode Island 02912;
  ,
- Daniel Freund
  Operations Management, MIT Sloan School of Management, Cambridge, Massachusetts 02142;
  ,
- Aaron Ferber
  Center for Artificial Intelligence in Society, University of Southern California, Los Angeles, California 90089;
  ,
- David B. Shmoys
  School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14850
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14850
Mathematics of Operations Research, Volume 48, Issue 4•November 2023, pp 2304-2307 • https://doi.org/10.1287/moor.2022.1340
There is an error in our paper [Paul A, Freund D, Ferber A, Shmoys DB, Williamson DP (2020) Budgeted prize-collecting traveling salesman and minimum spanning tree problems. Math. Oper. Res. 45(2):576–590]. In that paper, we consider constrained versions ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut
- Renee Mirka
  Cornell University, USA
  ,
- David P. Williamson
  Cornell University, USA
ACM Journal of Experimental Algorithmics, Volume 28•December 2023, Article No.: 2.1, pp 1-18 • https://doi.org/10.1145/3609426
We experimentally evaluate the performance of several Max Cut approximation algorithms. In particular, we compare the results of the Goemans and Williamson algorithm using semidefinite programming with Trevisan’s algorithm using spectral partitioning. The ...
0Citation
225
Downloads
Metrics
Total Citations0
Total Downloads225
Last 12 Months168
Last 6 weeks14
Export Citations
Save to Binder
Get Access
research-article
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
- Monika Henzinger
  https://ror.org/03gnh5541Institute of Science and Technology Austria, Klosterneuburg, Austria
  ,
- Billy Jin
  https://ror.org/05bnh6r87School of Operations Research and Information Engineering, Cornell University, Ithaca, USA
  ,
- Richard Peng
  https://ror.org/01aff2v68Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada
  ,
- David P. Williamson
  https://ror.org/05bnh6r87School of Operations Research and Information Engineering, Cornell University, Ithaca, USA
Algorithmica, Volume 85, Issue 12•Dec 2023, pp 3680-3716 • https://doi.org/10.1007/s00453-023-01154-8
Abstract
Over the last two decades, a significant line of work in theoretical algorithms has made progress in solving linear systems of the form $L x = b$ , where $L$ is the Laplacian matrix of a weighted graph with weights $w (i, j) > 0$ on the edges. The solution $x$ of ... $^{}$ $\overset{}{}^{}$ $^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Fluid Approximations for Revenue Management Under High-Variance Demand
- Yicheng Bai
  School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853;
  ,
- Omar El Housni
  School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853;
  ,
- Billy Jin
  School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853;
  ,
- Paat Rusmevichientong
  Marshall School of Business, University of Southern California, Los Angeles, California 90089
  ,
- Huseyin Topaloglu
  School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853;
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853;
Management Science, Volume 69, Issue 7•July 2023, pp 4016-4026 • https://doi.org/10.1287/mnsc.2023.4769
One of the most prevalent demand models in the revenue management literature is based on dividing the selling horizon into a number of time periods such that there is at most one customer arrival at each time period. This demand model is equivalent to ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP
- Billy Jin
  Cornell University, Ithaca, USA
  ,
- Nathan Klein
  University of Washington, Seattle, USA
  ,
- David P. Williamson
  Cornell University, Ithaca, USA
Integer Programming and Combinatorial Optimization•June 2023, pp 217-230• https://doi.org/10.1007/978-3-031-32726-1_16
Abstract
A long-standing conjecture for the traveling salesman problem (TSP) states that the integrality gap of the standard linear programming relaxation of the TSP (sometimes called the Subtour LP or the Held-Karp bound) is at most 4/3 for symmetric ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
GILP: An Interactive Tool for Visualizing the Simplex Algorithm
- Henry W. Robbins
  Cornell University, Ithaca, NY, USA
  ,
- Samuel C. Gutekunst
  Bucknell University, Lewisburg, PA, USA
  ,
- David B. Shmoys
  Cornell University, Ithaca, NY, USA
  ,
- David P. Williamson
  Cornell University, Ithaca, NY, USA
SIGCSE 2023: Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 1•March 2023, pp 108-114• https://doi.org/10.1145/3545945.3569815

The Simplex algorithm for solving linear programs---one of Computing in Science & Engineering's top 10 most influential algorithms of the 20th century---is an important topic in many algorithms courses. While the algorithm relies on intuitive geometric ...
2Citation
218
Downloads
Metrics
Total Citations2
Total Downloads218
Last 12 Months88
Last 6 weeks17
Export Citations
Save to Binder
Get Access
research-article
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP
- Samuel C. Gutekunst
  Departments of Computer Science and of Mathematics, Bucknell University, Lewisburg, Pennsylvania 17837;
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14850
Mathematics of Operations Research, Volume 48, Issue 1•February 2023, pp 393-418 • https://doi.org/10.1287/moor.2022.1265
Facet-defining inequalities of the symmetric traveling salesman problem (TSP) polytope play a prominent role in both polyhedral TSP research and state-of-the-art TSP solvers. In this paper, we introduce a new class of facet-defining inequalities, the ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
The Two-Stripe Symmetric Circulant TSP is in P
- Samuel C. Gutekunst
  Departments of Computer Science and Mathematics, Bucknell University, Lewisburg, PA, USA
  ,
- Billy Jin
  School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, USA
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, USA
Integer Programming and Combinatorial Optimization•June 2022, pp 319-332• https://doi.org/10.1007/978-3-031-06901-7_24
Abstract
The symmetric circulant TSP is a special case of the traveling salesman problem in which edge costs are symmetric and obey circulant symmetry. Despite the substantial symmetry of the input, remarkably little is known about the symmetric circulant ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
- Samuel C. Gutekunst
  Department of Computer Science and Department of Mathematics, Bucknell University, Lewisburg, Pennsylvania 17837
  ,
- David P. Williamson
  Department of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853
Mathematics of Operations Research, Volume 47, Issue 1•February 2022, pp 1-28 • https://doi.org/10.1287/moor.2020.1100
The traveling salesman problem (TSP) is a fundamental problem in combinatorial optimization. Several semidefinite programming relaxations have been proposed recently that exploit a variety of mathematical structures including, for example, algebraic ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching in the Random Order Model
- Billy Jin
  School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, USA
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, USA
Web and Internet Economics•December 2021, pp 207-225• https://doi.org/10.1007/978-3-030-94676-0_12
Abstract
In this paper, we consider the online vertex-weighted bipartite matching problem in the random arrival model. We consider the generalization of the RANKING algorithm for this problem introduced by Huang, Tang, Wu, and Zhang [9], who show that ...
4Citation
Metrics
Total Citations4
Export Citations
Save to Binder
rapid-communication
Easy capacitated facility location problems, with connections to lot-sizing
- Alice Paul
  Olin College, 1000 Olin Way, Needham, MA 02492, United States of America
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, NY 14853, United States of America
Operations Research Letters, Volume 48, Issue 2•Mar 2020, pp 109-114 • https://doi.org/10.1016/j.orl.2019.12.006
Abstract
In this note, we consider the capacitated facility location problem when the transportation costs of the instance satisfy the Monge property. We show that a straightforward dynamic program finds the optimal solution when the demands ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem
- Samuel C. Gutekunst,
- David P. Williamson
SIAM Journal on Discrete Mathematics, Volume 33, Issue 4•2019, pp 2452-2478 • https://doi.org/10.1137/19M1245840

We consider the integrality gap of the subtour linear program (LP) relaxation of the traveling salesman problem (TSP) restricted to circulant instances. De Klerk and Dobre [Discrete Appl. Math., 159 (2011), pp. 1815--1826] conjectured that the value of ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
article
Online Constrained Forest and Prize-Collecting Network Design
- Jiawei Qian
  JW Capital, Beijing, China
  ,
- Seeun William Umboh
  Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, Netherlands 5600 MB
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, USA 14853
Algorithmica, Volume 80, Issue 11•November 2018, pp 3335-3364 • https://doi.org/10.1007/s00453-017-0391-4

In this paper, we study a very general type of online network design problem, and generalize two different previous algorithms, one for an online network design problem due to Berman and Coulston (Proceedings of the 29th annual ACM symposium on theory ...
3Citation
Metrics
Total Citations3
Export Citations
Save to Binder
article
Simple Approximation Algorithms for Balanced MAX 2SAT
- Alice Paul
  School of Operations Research and Information Engineering, Cornell University, Ithaca, USA 14850
  ,
- Matthias Poloczek
  School of Operations Research and Information Engineering, Cornell University, Ithaca, USA 14850
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, USA 14850
Algorithmica, Volume 80, Issue 3•March 2018, pp 995-1012 • https://doi.org/10.1007/s00453-017-0312-6

We study simple algorithms for the balanced MAX 2SAT problem, where we are given weighted clauses of length one and two with the property that for each variable x the total weight of clauses that x appears in equals the total weight of clauses for $$\...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem
- Samuel C. Gutekunst,
- David P. Williamson
SIAM Journal on Optimization, Volume 28, Issue 3, pp 2073-2096 • https://doi.org/10.1137/17M1154722

We study a semidefinite programming relaxation of the traveling salesman problem introduced by de Klerk, Pasechnik, and Sotirov [SIAM J. Optim., 19 (2008), pp. 1559--1573] and show that their relaxation has an unbounded integrality gap. In particular, we ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Public Access
Published By ACM
Published By ACM
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- Matthias Poloczek
  Cornell University, NY, USA
  ,
- David P. Williamson
  Cornell University, NY, USA
ACM Journal of Experimental Algorithmics, Volume 22•2017, Article No.: 1.6, pp 1-18 • https://doi.org/10.1145/3064174

We evaluate the performance of fast approximation algorithms for MAX SAT on the comprehensive benchmark sets from the SAT and MAX SAT contests. Our examination of a broad range of algorithmic techniques reveals that greedy algorithms offer particularly ...
1Citation
433
Downloads
Metrics
Total Citations1
Total Downloads433
Last 12 Months64
Last 6 weeks14
Export Citations
Save to Binder
View online with eReader
PDF
article
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem
- Kyle Genova
  Department of Computer Science, Princeton University, Princeton, USA 08540
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, USA 14853
Algorithmica, Volume 78, Issue 4•August 2017, pp 1109-1130 • https://doi.org/10.1007/s00453-017-0293-5

Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant of the well-known Christofides' algorithm for the TSP, called the Best-of-Many Christofides' algorithm. The algorithm involves sampling a ...
4Citation
Metrics
Total Citations4
Export Citations
Save to Binder
article
Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint
- James M. Davis
  Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Champaign, Illinois 61801
  ,
- Huseyin Topaloglu
  School of Operations Research and Information Engineering, Cornell Tech, New York, New York 10011
  ,
- David P. Williamson
  School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853
INFORMS Journal on Computing, Volume 29, Issue 1•February 2017, pp 54-76 • https://doi.org/10.1287/ijoc.2016.0714

We consider pricing problems when customers choose among the products according to the nested logit model and there is a quality consistency constraint on the prices charged for the products. We consider two types of quality consistency constraint. In ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
research-article
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
SIAM Journal on Computing, Volume 46, Issue 3, pp 1029-1061 • https://doi.org/10.1137/15M1053369

We give a simple, randomized greedy algorithm for the maximum satisfiability problem (MAX SAT) that obtains a $\frac{3}{4}$-approximation in expectation. In contrast to previously known $\frac{3}{4}$-approximation algorithms, our algorithm does not use flows ...
5Citation
Metrics
Total Citations5
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